Paper Info
Title
Vehicle routing problem with time windows and a limited number of vehicles
Abstract
This paper introduces a variant of the vehicle routing problem with time windows where a limited number of vehicles is given (m-VRPTW). Under this scenario, a feasible solution is one that may contain either unserved customers and/or relaxed time windows.
Year
DOI
Venue
2003
10.1016/S0377-2217(02)00363-6
European Journal of Operational Research
Keywords
Field
DocType
Tabu search,Heuristics,Routing,Combinatorial optimization,Vehicle routing problem with time windows
Mathematical optimization,Vehicle routing problem,Upper and lower bounds,Combinatorial optimization,Heuristics,Operations management,Mathematics,Tabu search
Journal
Volume
Issue
ISSN
148
3
0377-2217
Citations 
PageRank 
References 
72
3.97
15
Authors
3
Name
Order
Citations
PageRank
Hoong Chuin Lau173991.69
Melvyn Sim21909117.68
Kwong Meng Teo31258.52