Tabu Search heuristics for the Vehicle Routing Problem with Time Windows |
| |
Authors: | Olli Bräysy Michel Gendreau |
| |
Institution: | (1) Department of Optimization, SINTEF Applied Mathematics, P.O. Box 124 Blindern, N-0314 Oslo, Norway;(2) Centre de Recherche sur les Transports, Université de Montréal, Case postale 6128, Succursale “Centre-ville”, H3C 3J7 Montréal, Canada |
| |
Abstract: | This paper surveys the research on the Tabu Search heuristics for the Vehicle Routing Problem with Time Windows (VRPTW). The
VRPTW can be described as the problem of designing least cost routes for a fleet of vehicles from one 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. In addition to describing basic features of each method, experimental results
for Solomon’s benchmark test problems are presented and analyzed.
This work was partially supported by the Emil Aaltonen Foundation, Liikesivistysrahasto Foundation, the Canadian Natural Science
and Engineering Research Council and the TOP program funded by the Research Council of Norway. This support is gratefully
acknowledged. |
| |
Keywords: | Metaheuristics tabu search vehicle routing time windows |
本文献已被 SpringerLink 等数据库收录! |
|