Abstract
This paper surveys the research on evolutionary algorithms for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from a single depot to a set of geographically scattered points. The routes must be designed in such a way that each point is visited only once by exactly one vehicle within a given time interval. All routes start and end at the depot, and the total demands of all points on one particular route must not exceed the capacity of the vehicle. The main types of evolutionary algorithms for the VRPTW are genetic algorithms and evolution strategies. In addition to describing the basic features of each method, experimental results for the benchmark test problems of Solomon (1987) and Gehring and Homberger (1999) are presented and analyzed.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Bräysy, O., Dullaert, W. & Gendreau, M. Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows. J Heuristics 10, 587–611 (2004). https://doi.org/10.1007/s10732-005-5431-6
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10732-005-5431-6