拖延
迭代局部搜索
车辆路径问题
数学优化
计算机科学
调度(生产过程)
水准点(测量)
作业车间调度
人口
布线(电子设计自动化)
局部搜索(优化)
算法
数学
社会学
人口学
地理
计算机网络
大地测量学
作者
Benjamin Shelbourne,Maria Battarra,Chris N. Potts
标识
DOI:10.1287/ijoc.2017.0756
摘要
A novel extension of the classical vehicle routing and scheduling problems is introduced that integrates aspects of machine scheduling into vehicle routing. Associated with each customer order is a release date that defines the earliest time that the order is available to leave the depot for delivery and a due date that indicates the time by which the order should ideally be delivered to the customer. The objective is to minimize a convex combination of the operational costs and customer service level, represented by the total distance traveled and the total weighted tardiness of delivery, respectively. A path-relinking algorithm (PRA) is proposed to address the problem, and a variety of benchmark instances are generated to evaluate its performance. The PRA exploits the efficiency and aggressive improvement of neighborhood search but relies on a new path-relinking procedure and advanced population management strategies to navigate the search space effectively. To provide a comparator algorithm to the PRA, we embed the neighborhood search into a standard iterated local search algorithm (ILS). Extensive computational experiments on the benchmark instances show that the newly defined features have a significant and varied impact on the problem, and the performance of the PRA dominates that of the ILS algorithm. The online supplement is available at https://doi.org/10.1287/ijoc.2017.0756 .
科研通智能强力驱动
Strongly Powered by AbleSci AI