Evolutionary algorithms for the vehicle routing problem with time windows

Evolutionary algorithms for the vehicle routing problem with time windows

0.00 Avg rating0 Votes
Article ID: iaor20051784
Country: Netherlands
Volume: 10
Issue: 6
Start Page Number: 567
End Page Number: 611
Publication Date: Dec 2004
Journal: Journal of Heuristics
Authors: , ,
Keywords: heuristics
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 and Gehring and Homberger are presented and analyzed.

Reviews

Required fields are marked *. Your email address will not be published.