Recent advances in vehicle routing exact algorithms

The capacitated vehicle routing problem (CVRP) is the problem in which a set of identical vehicles located at a central depot is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints. This paper provides a review of the most recent developments that ha...

Full description

Saved in:
Bibliographic Details
Published in4OR Vol. 5; no. 4; pp. 269 - 298
Main Authors Baldacci, Roberto, Toth, Paolo, Vigo, Daniele
Format Journal Article
LanguageEnglish
Published Heidelberg Springer Nature B.V 01.12.2007
Subjects
Algorithms
Operations research
Studies
Vehicle routing
Online AccessGet full text

Cover

More Information
Summary:The capacitated vehicle routing problem (CVRP) is the problem in which a set of identical vehicles located at a central depot is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints. This paper provides a review of the most recent developments that had a major impact in the current state-of-the-art of exact algorithms for the CVRP. The most important mathematical formulations for the problem together with various CVRP relaxations are reviewed. The paper also describes the recent exact methods for the CVRP and reports a comparison of their computational performances.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1619-4500
1614-2411
DOI:10.1007/s10288-007-0063-3