Recent progress of local search in handling the time window constraints of the vehicle routing problem

被引:0
|
作者
Hideki Hashimoto
Mutsunori Yagiura
Shinji Imahori
Toshihide Ibaraki
机构
[1] Chuo University,Department of Industrial and Systems Engineering
[2] Nagoya University,Department of Computer Science and Mathematical Informatics, Graduate School of Information Science
[3] Nagoya University,Department of Computational Science and Engineering, Graduate School of Engineering
[4] The Kyoto College of Graduate Studies for Informatics,undefined
来源
4OR | 2010年 / 8卷
关键词
Vehicle routing; Time windows; Scheduling; Survey; 90B35; 90C27; 65K05; 90B06; 90-02;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:221 / 238
页数:17
相关论文
共 50 条
  • [1] Recent progress of local search in handling the time window constraints of the vehicle routing problem
    Hideki Hashimoto
    Mutsunori Yagiura
    Shinji Imahori
    Toshihide Ibaraki
    [J]. Annals of Operations Research, 2013, 204 : 171 - 187
  • [2] Recent progress of local search in handling the time window constraints of the vehicle routing problem
    Hashimoto, Hideki
    Yagiura, Mutsunori
    Imahori, Shinji
    Ibaraki, Toshihide
    [J]. ANNALS OF OPERATIONS RESEARCH, 2013, 204 (01) : 171 - 187
  • [3] Recent progress of local search in handling the time window constraints of the vehicle routing problem
    Hashimoto, Hideki
    Yagiura, Mutsunori
    Imahori, Shinji
    Ibaraki, Toshihide
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2010, 8 (03): : 221 - 238
  • [4] Solving Vehicle Routing Problem with Time Window Constraints
    Chen, J. C.
    Chiang, C. S.
    Chen, B. B.
    Chen, C. W.
    [J]. 2007 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1-3, 2007, : 934 - +
  • [5] A parallel algorithm for the vehicle routing problem with time window constraints
    Schulze, J
    Fahle, T
    [J]. ANNALS OF OPERATIONS RESEARCH, 1999, 86 (0) : 585 - 607
  • [6] A parallel algorithm for the vehicle routing problem with time window constraints
    J. Schulze
    T. Fahle
    [J]. Annals of Operations Research, 1999, 86 : 585 - 607
  • [7] Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
    Baldacci, Roberto
    Mingozzi, Aristide
    Roberti, Roberto
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 218 (01) : 1 - 6
  • [8] NSGAII enhanced with a local search for the vehicle routing problem with time windows and synchronization constraints
    Haddadene, S. R. Ait
    Labadie, N.
    Prodhon, C.
    [J]. IFAC PAPERSONLINE, 2016, 49 (12): : 1198 - 1203
  • [9] A messy genetic algorithm for the vehicle routing problem with time window constraints
    Tan, KC
    Lee, TH
    Ou, K
    Lee, LH
    [J]. PROCEEDINGS OF THE 2001 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2001, : 679 - 686
  • [10] Hybrid Tabu Search Algorithm for Vehicle Routing Problem with Time Window
    Chen Jiu-mei
    Zhang Xu-mei
    Qiu Han-guang
    [J]. 2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 6960 - +