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

Roberto Baldacci; Aristide Mingozzi; Roberto Roberti

doi:10.1016/j.ejor.2011.07.037

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

Roberto Baldacci, Aristide Mingozzi^*, Roberto Roberti

^*Corresponding author for this work

University of Bologna

Research output: Contribution to journal › Article › peer-review

372 Citations (Scopus)

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 language	English
Pages (from-to)	1-6
Number of pages	6
Journal	European Journal of Operational Research
Volume	218
Issue number	1
DOIs	https://doi.org/10.1016/j.ejor.2011.07.037
Publication status	Published - 1 Apr 2012
Externally published	Yes

Keywords

Exact algorithms
Survey
Vehicle routing

Access to Document

10.1016/j.ejor.2011.07.037

Cite this

@article{7724d1d06b5b48eb8560708b15c32131,

title = "Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints",

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 = "Exact algorithms, Survey, Vehicle routing",

author = "Roberto Baldacci and Aristide Mingozzi and Roberto Roberti",

year = "2012",

month = apr,

day = "1",

doi = "10.1016/j.ejor.2011.07.037",

language = "English",

volume = "218",

pages = "1--6",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

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

AU - Baldacci, Roberto

AU - Mingozzi, Aristide

AU - Roberti, Roberto

PY - 2012/4/1

Y1 - 2012/4/1

N2 - 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.

AB - 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.

KW - Exact algorithms

KW - Survey

KW - Vehicle routing

UR - http://www.scopus.com/inward/record.url?scp=83955162912&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2011.07.037

DO - 10.1016/j.ejor.2011.07.037

M3 - Article

AN - SCOPUS:83955162912

SN - 0377-2217

VL - 218

SP - 1

EP - 6

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 1

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this