Aarhus University Seal / Aarhus Universitets segl

A branch-and-cut algorithm for the capacitated open vehicle routing problem

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Standard

A branch-and-cut algorithm for the capacitated open vehicle routing problem. / Letchford, A.N.; Lysgaard, Jens; Eglese, R.W.

In: Journal of the Operational Research Society, Vol. 58, No. 12, dec, 2007, p. 1642-1651.

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Harvard

Letchford, AN, Lysgaard, J & Eglese, RW 2007, 'A branch-and-cut algorithm for the capacitated open vehicle routing problem', Journal of the Operational Research Society, vol. 58, no. 12, dec, pp. 1642-1651. https://doi.org/10.1057/palgrave.jors.2602345

APA

Letchford, A. N., Lysgaard, J., & Eglese, R. W. (2007). A branch-and-cut algorithm for the capacitated open vehicle routing problem. Journal of the Operational Research Society, 58(12, dec), 1642-1651. https://doi.org/10.1057/palgrave.jors.2602345

CBE

Letchford AN, Lysgaard J, Eglese RW. 2007. A branch-and-cut algorithm for the capacitated open vehicle routing problem. Journal of the Operational Research Society. 58(12, dec):1642-1651. https://doi.org/10.1057/palgrave.jors.2602345

MLA

Letchford, A.N., Jens Lysgaard and R.W. Eglese. "A branch-and-cut algorithm for the capacitated open vehicle routing problem". Journal of the Operational Research Society. 2007, 58(12, dec). 1642-1651. https://doi.org/10.1057/palgrave.jors.2602345

Vancouver

Letchford AN, Lysgaard J, Eglese RW. A branch-and-cut algorithm for the capacitated open vehicle routing problem. Journal of the Operational Research Society. 2007;58(12, dec):1642-1651. https://doi.org/10.1057/palgrave.jors.2602345

Author

Letchford, A.N. ; Lysgaard, Jens ; Eglese, R.W. / A branch-and-cut algorithm for the capacitated open vehicle routing problem. In: Journal of the Operational Research Society. 2007 ; Vol. 58, No. 12, dec. pp. 1642-1651.

Bibtex

@article{1fe77ae0c7df11db85b6000ea68e967b,
title = "A branch-and-cut algorithm for the capacitated open vehicle routing problem",
abstract = "In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open version of the well-known capacitated vehicle routing problem (CVRP). The algorithm is based on branch-and-cut. We show that, even though the open CVRP initially looks like a minor variation of the standard CVRP, the integer programming formulation and cutting planes need to be modified in subtle ways. Computational results are given for several standard test instances, which enables us for the first time to assess the quality of existing heuristic methods, and to compare the relative difficulty of open and closed versions of the same problem.",
keywords = "vehicle routing, branch-and-cut, separation",
author = "A.N. Letchford and Jens Lysgaard and R.W. Eglese",
year = "2007",
doi = "10.1057/palgrave.jors.2602345",
language = "English",
volume = "58",
pages = "1642--1651",
journal = "Journal of the Operational Research Society",
issn = "0160-5682",
publisher = "Palgrave Macmillan Ltd.",
number = "12, dec",

}

RIS

TY - JOUR

T1 - A branch-and-cut algorithm for the capacitated open vehicle routing problem

AU - Letchford, A.N.

AU - Lysgaard, Jens

AU - Eglese, R.W.

PY - 2007

Y1 - 2007

N2 - In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open version of the well-known capacitated vehicle routing problem (CVRP). The algorithm is based on branch-and-cut. We show that, even though the open CVRP initially looks like a minor variation of the standard CVRP, the integer programming formulation and cutting planes need to be modified in subtle ways. Computational results are given for several standard test instances, which enables us for the first time to assess the quality of existing heuristic methods, and to compare the relative difficulty of open and closed versions of the same problem.

AB - In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open version of the well-known capacitated vehicle routing problem (CVRP). The algorithm is based on branch-and-cut. We show that, even though the open CVRP initially looks like a minor variation of the standard CVRP, the integer programming formulation and cutting planes need to be modified in subtle ways. Computational results are given for several standard test instances, which enables us for the first time to assess the quality of existing heuristic methods, and to compare the relative difficulty of open and closed versions of the same problem.

KW - vehicle routing

KW - branch-and-cut

KW - separation

U2 - 10.1057/palgrave.jors.2602345

DO - 10.1057/palgrave.jors.2602345

M3 - Journal article

VL - 58

SP - 1642

EP - 1651

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

SN - 0160-5682

IS - 12, dec

ER -