What you should know about the vehicle routing problem |
| |
| Authors: | Gilbert Laporte |
| |
| Affiliation: | Canada Research Chair in Distribution Management, HEC Montréal 3000, chemin de la C?te‐Sainte‐Catherine, Montréal, Canada H3T 2A7Canada Research Chair in Distribution Management, HEC Montréal 3000, chemin de la C?te‐Sainte‐Catherine, Montréal, Canada H3T 2A7 |
| |
| Abstract: | In the Vehicle Routing Problem (VRP), the aim is to design a set of m minimum cost vehicle routes through n customer locations, so that each route starts and ends at a common location and some side constraints are satisfied. Common applications arise in newspaper and food delivery, and in milk collection. This article summarizes the main known results for the classical VRP in which only vehicle capacity constraints are present. The article is structured around three main headings: exact algorithms, classical heuristics, and metaheuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 |
| |
| Keywords: | vehicle routing problem capacity constraints integer linear programming heuristics metaheuristics |
|
|
