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

Management Science

Keywords

vehicle routing, branch-and-cut, separation

Research output: Working paper

Published

Standard

A branch-and-cut algorithm for the capacitated open vehicle routing problem. / Letchford, A N; Lysgaard, J; Eglese, R W.
Lancaster University: The Department of Management Science, 2006. (Management Science Working Paper Series).

Research output: Working paper

Harvard

Letchford, AN, Lysgaard, J & Eglese, RW 2006 'A branch-and-cut algorithm for the capacitated open vehicle routing problem' Management Science Working Paper Series, The Department of Management Science, Lancaster University.

APA

Letchford, A. N., Lysgaard, J., & Eglese, R. W. (2006). A branch-and-cut algorithm for the capacitated open vehicle routing problem. (Management Science Working Paper Series). The Department of Management Science.

Vancouver

Letchford AN, Lysgaard J, Eglese RW. A branch-and-cut algorithm for the capacitated open vehicle routing problem. Lancaster University: The Department of Management Science. 2006. (Management Science Working Paper Series).

Author

Letchford, A N ; Lysgaard, J ; Eglese, R W. / A branch-and-cut algorithm for the capacitated open vehicle routing problem. Lancaster University : The Department of Management Science, 2006. (Management Science Working Paper Series).

Bibtex

@techreport{470c4d3d3b88401db556cd09e48ad9ce,

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 = "Letchford, {A N} and J Lysgaard and Eglese, {R W}",

note = "This was eventually published as: A.N. Letchford, J. Lysgaard & R.W. Eglese (2007) A branch-and-cut algorithm for the capacitated open vehicle routing problem. J. Opl Res. Soc., 58(12), 1642-1651.",

year = "2006",

language = "English",

series = "Management Science Working Paper Series",

publisher = "The Department of Management Science",

type = "WorkingPaper",

institution = "The Department of Management Science",

}

RIS

TY - UNPB

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

AU - Letchford, A N

AU - Lysgaard, J

AU - Eglese, R W

N1 - This was eventually published as: A.N. Letchford, J. Lysgaard & R.W. Eglese (2007) A branch-and-cut algorithm for the capacitated open vehicle routing problem. J. Opl Res. Soc., 58(12), 1642-1651.

PY - 2006

Y1 - 2006

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

M3 - Working paper

T3 - Management Science Working Paper Series

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

PB - The Department of Management Science

CY - Lancaster University

ER -

Research

Keywords