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 条

[21] An ant colony optimization based on local search for the vehicle routing problem with simultaneous pickup-delivery and time window
Wu, Hongguang
Gao, Yuelin
[J]. APPLIED SOFT COMPUTING, 2023, 139
[22] A PARALLEL IMPLEMENTATION OF THE TABU SEARCH HEURISTIC FOR VEHICLE-ROUTING PROBLEMS WITH TIME WINDOW CONSTRAINTS
GARCIA, BL
POTVIN, JY
ROUSSEAU, JM
[J]. COMPUTERS & OPERATIONS RESEARCH, 1994, 21 (09) : 1025 - 1033
[23] THE VEHICLE-ROUTING PROBLEM WITH TIME CONSTRAINTS
IKEGAMI, A
NIWA, A
[J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1995, 38 (01) : 107 - 123
[24] Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
Michallet, Julien
Prins, Christian
Amodeo, Lionel
Yalaoui, Farouk
Vitry, Gregoire
[J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 196 - 207
[25] A vehicle routing problem with backhauls and time windows: a guided local search solution
Zhong, YJ
Cole, MH
[J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2005, 41 (02) : 131 - 144
[26] The Robust Vehicle Routing Problem with Time Window Assignments
Hoogeboom, Maaike
Adulyasak, Yossiri
Dullaert, Wout
Jaillet, Patrick
[J]. TRANSPORTATION SCIENCE, 2021, 55 (02) : 395 - 413
[27] The discrete time window assignment vehicle routing problem
Spliet, Remy
Desaulniers, Guy
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 244 (02) : 379 - 391
[28] A container vehicle routing problem with soft time window
Zhou, Pengfei
Song, Xiangqun
Guo, Zijian
[J]. IECON 2007: 33RD ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY, VOLS 1-3, CONFERENCE PROCEEDINGS, 2007, : 750 - 755
[29] A Dynamic Vehicle Routing Problem with Backhaul and Time Window
Wang, Xuping
Cao, Haiyan
[J]. IEEE/SOLI'2008: PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS, VOLS 1 AND 2, 2008, : 1256 - 1261
[30] Robust optimisation of the vehicle routing and scheduling problem with time window constraints using Taguchi methods
Sörensen, K
[J]. SIMULATION AND MODELLING: ENABLERS FOR A BETTER QUALITY OF LIFE, 2000, : 423 - 427

← 1 2 3 4 5 →