Paper Info
Title
Recent progress of local search in handling the time window constraints of the vehicle routing problem
Abstract
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.
Year
DOI
Venue
2010
10.1007/s10288-010-0144-6
A Quarterly Journal of Operations Research
Keywords
Field
DocType
vehicle routing problem,vehicle routing,scheduling problem,local search
Vehicle routing problem,Mathematical optimization,Scheduling (computing),Static routing,Local search (optimization),Mathematics
Journal
Volume
Issue
ISSN
8
3
1614-2411
Citations 
PageRank 
References 
19
0.67
43
Authors
4
Name
Order
Citations
PageRank
Hideki Hashimoto1633.17
Mutsunori Yagiura261446.59
Shinji Imahori319015.31
Toshihide Ibaraki42593385.64