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

被引：10
|
作者：
Hashimoto, Hideki [1 ]
Yagiura, Mutsunori [2 ]
Imahori, Shinji [3 ]
Ibaraki, Toshihide [4 ]
机构：
[1] Nagoya Univ, Dept Comp Sci & Math Informat, Grad Sch Informat Sci, Chikusa Ku, Nagoya, Aichi 4648603, Japan
[2] Nagoya Univ, Dept Comp Sci & Math Informat, Grad Sch Informat Sci, Chikusa Ku, Nagoya, Aichi 4648601, Japan
[3] Nagoya Univ, Grad Sch Engn, Dept Computat Sci & Engn, Chikusa Ku, Nagoya, Aichi 4648603, Japan
[4] Kyoto Coll Grad Studies Informat, Sakyo Ku, Kyoto 6068225, Japan
来源：
ANNALS OF OPERATIONS RESEARCH | 2013年 / 204卷 / 01期
关键词：
Vehicle routing; Time windows; Scheduling; Survey; TARDINESS SCHEDULING PROBLEM; TRAVELING SALESMAN PROBLEM; NEIGHBORHOOD SEARCH; COMPLETION COSTS; ROUTEING PROBLEM; ALGORITHMS; EARLINESS; OPTIMIZATION; HEURISTICS; PATH;
D O I：
10.1007/s10479-012-1264-5
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
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.
引用
收藏
页码：171 / 187
页数：17
相关论文
共 50 条
  • [31] A library of local search heuristics for the vehicle routing problem
    Groër C.
    Golden B.
    Wasil E.
    [J]. Mathematical Programming Computation, 2010, 2 (2) : 79 - 101
  • [32] Effective local search algorithms for routing and scheduling problems with general time-window constraints
    Ibaraki, T
    Imahori, S
    Kubo, M
    Masuda, T
    Uno, T
    Yagiura, M
    [J]. TRANSPORTATION SCIENCE, 2005, 39 (02) : 206 - 232
  • [33] Hybrid Variable Neighborhood Tabu Search Algorithm for Vehicle Routing Problem with Hard Time Window
    He, Qi
    Guan, Lihe
    Cui, Huanhuan
    [J]. Computer Engineering and Applications, 2023, 59 (13) : 82 - 91
  • [34] Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
    Cordeau, JF
    Laporte, G
    Mercier, A
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (05) : 542 - 546
  • [35] An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
    Hashimoto, Hideki
    Yagiura, Mutsunori
    Ibaraki, Toshihide
    [J]. DISCRETE OPTIMIZATION, 2008, 5 (02) : 434 - 456
  • [36] A multi-start local search algorithm for the vehicle routing problem with time windows
    Bräysy, O
    Hasle, G
    Dullaert, W
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 159 (03) : 586 - 605
  • [37] An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
    Ibaraki, Toshihide
    Imahori, Shinji
    Nonobe, Koji
    Sobue, Kensuke
    Uno, Takeaki
    Yagiura, Mutsunori
    [J]. DISCRETE APPLIED MATHEMATICS, 2008, 156 (11) : 2050 - 2069
  • [38] A two-stage hybrid local search for the vehicle routing problem with time windows
    Bent, R
    Van Hentenryck, P
    [J]. TRANSPORTATION SCIENCE, 2004, 38 (04) : 515 - 530
  • [39] Sustainable maritime inventory routing problem with time window constraints
    De, Arijit
    Kumar, Krishna
    Gunasekaran, Angappa
    Tiwari, Manoj Kumar
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2017, 61 : 77 - 95
  • [40] An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints
    Dondo, R
    Méndez, CA
    Cerdá, J
    [J]. LATIN AMERICAN APPLIED RESEARCH, 2003, 33 (02) : 129 - 134
12345