Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints

Roberto Baldacci, Aristide Mingozzi and Roberto Roberti

European Journal of Operational Research, 2012, vol. 218, issue 1, 1-6

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.

Keywords: Vehicle routing; Exact algorithms; Survey (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (83)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221711006692
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:218:y:2012:i:1:p:1-6

DOI: 10.1016/j.ejor.2011.07.037

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().