Recent progress of local search in handling the time window constraints of the vehicle routing problem
Recent progress of local search in handling the time window constraints of the vehicle routing problem
复制标题
DOI：
10.1007/s10479-012-1264-5
复制
发表时间：
2013-01
影响因子：
4.8
通讯作者：
H. Hashimoto;M. Yagiura;S. Imahori;T. Ibaraki
中科院分区：
文献类型：
--
作者：
H. Hashimoto;M. Yagiura;S. Imahori;T. Ibaraki
车辆路径与调度问题有着广泛的应用，在过去的半个世纪中得到了广泛的研究。强制每辆车在客户指定的时间段内开始服务于每个客户的条件称为时间窗口约束。本文回顾了最近的成果，如何处理硬和软时间窗约束，把重点放在不同的定义和算法。有了这些不同的时间窗口，问题变得适用于广泛的现实世界的问题。
Vehicle routing and scheduling problems have a wide range of applications and have been intensively studied in the past half century. The condition that enforces each vehicle to start service at each customer in the period specified by the customer is called the time window constraint. This paper reviews recent results on how to handle hard and soft time window constraints, putting emphasis on its different definitions and algorithms. With these diverse time windows, the problem becomes applicable to a wide range of real-world problems.