| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 476884 | European Journal of Operational Research | 2012 | 6 Pages |
Abstract
This paper provides a review of the recent developments that had a major impact on the current state-of-the-art exact algorithms for the vehicle routing problem (VRP). The paper reviews mathematical formulations, relaxations and recent exact methods for two of the most important variants of the VRP: the capacitated VRP (CVRP) and the VRP with time windows (VRPTW). The paper also reports a comparison of the computational performances of the different exact algorithms for the CVRP and VRPTW.
► This paper reviews developments on algorithms for the vehicle routing problem (VRP). ► We consider two variants: the capacitated VRP and the VRP with time windows. ► We report a comparison of the computational performances of the exact algorithms.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Roberto Baldacci, Aristide Mingozzi, Roberto Roberti,