Evolutionary algorithms for the Vehicle Routing Problem with Time Windows

Olli Bräysy*, Wout Dullaert, Michel Gendreau

*Corresponding author for this work

Research output: Contribution to JournalReview articleAcademicpeer-review

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.

Original languageEnglish
Pages (from-to)587-611
Number of pages25
JournalJournal of Heuristics
Volume10
Issue number6
DOIs
Publication statusPublished - Dec 2004

Keywords

  • Evolutionary algorithms
  • Genetic algorithms
  • Transportation
  • Vehicle routing

Fingerprint Dive into the research topics of 'Evolutionary algorithms for the Vehicle Routing Problem with Time Windows'. Together they form a unique fingerprint.

Cite this