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

Roberto Baldacci, Aristide Mingozzi, Roberto Roberti

Research output: Contribution to journalJournal articleResearchpeer-review

2289 Downloads (Pure)

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.
Original languageEnglish
JournalEuropean Journal of Operational Research
Volume218
Issue number1
Pages (from-to)1-6
Number of pages6
ISSN0377-2217
DOIs
Publication statusPublished - 2012
Externally publishedYes

Keywords

  • Vehicle routing
  • Exact algorithms
  • Survey

Fingerprint Dive into the research topics of 'Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints'. Together they form a unique fingerprint.

Cite this