Aarhus University Seal / Aarhus Universitets segl

A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem

Research output: Working paperResearch

Standard

A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem. / Letchford, Adam N.; Lysgaard, Jens; Eglese, Richard W.

Aarhus : Aarhus School of Business, Department of Business Studies, 2006.

Research output: Working paperResearch

Harvard

Letchford, AN, Lysgaard, J & Eglese, RW 2006 'A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem' Aarhus School of Business, Department of Business Studies, Aarhus.

APA

Letchford, A. N., Lysgaard, J., & Eglese, R. W. (2006). A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem. Aarhus School of Business, Department of Business Studies.

CBE

Letchford AN, Lysgaard J, Eglese RW. 2006. A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem. Aarhus: Aarhus School of Business, Department of Business Studies.

MLA

Letchford, Adam N., Jens Lysgaard and Richard W. Eglese A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem. Aarhus: Aarhus School of Business, Department of Business Studies. 2006., 24 p.

Vancouver

Letchford AN, Lysgaard J, Eglese RW. A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem. Aarhus: Aarhus School of Business, Department of Business Studies. 2006.

Author

Letchford, Adam N. ; Lysgaard, Jens ; Eglese, Richard W. / A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem. Aarhus : Aarhus School of Business, Department of Business Studies, 2006.

Bibtex

@techreport{9501df00df4b11dab43c000ea68e967b,
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, {Adam N.} and Jens Lysgaard and Eglese, {Richard W.}",
year = "2006",
language = "English",
publisher = "Aarhus School of Business, Department of Business Studies",
type = "WorkingPaper",
institution = "Aarhus School of Business, Department of Business Studies",

}

RIS

TY - UNPB

T1 - A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem

AU - Letchford, Adam N.

AU - Lysgaard, Jens

AU - Eglese, Richard W.

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, branch-and-cut, separation

M3 - Working paper

BT - A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem

PB - Aarhus School of Business, Department of Business Studies

CY - Aarhus

ER -