• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Informatics in Control, Automation and Robotics >Hybrid algorithm for solving the multi-compartment vehicle routing problem with time windows and profit
【24h】

Hybrid algorithm for solving the multi-compartment vehicle routing problem with time windows and profit

机译：求解带时间窗和利润的多室车辆路径问题的混合算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper presents a new variant of the well-known vehicle routing problem with time windows (VRPTW). More precisely, this paper addresses a multi-compartment vehicle routing problem with time windows and profit (MCVRPTW with profit). The aim of this problem is to serve a set of customers by using a set of vehicles with multiple compartments, under a minimum traveling cost. The vehicles, starting and ending at the depot, have a limited capacity and each compartment is dedicated to one product. A customer is served only within a given time windows and, when it is visited a profit is collected (i.e. a profit not low than a preset profit bound). To solve this problem, an hybrid approach combining the genetic algorithm (GA) and the iterated local search (ILS) is used.
机译：本文提出了带有时间窗（VRPTW）的著名车辆路径问题的新变体。更准确地说，本文解决了具有时间窗和利润（MCVRPTW利润）的多室车辆路径问题。该问题的目的是通过使用具有多个车厢的一组车辆以最小的行驶成本为一组客户服务。在仓库开始和结束的车辆容量有限，每个车厢专用于一种产品。仅在给定的时间范围内为客户提供服务，并且在拜访客户时会收取利润（即，利润不低于预设的利润范围）。为了解决此问题，使用了一种将遗传算法（GA）和迭代局部搜索（ILS）相结合的混合方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号