## A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem

Publication: Research - peer-review › Journal article – Annual report year: 2013

### Standard

**A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem.** / Jepsen, Mads Kehlet; Spoorendonk, Simon; Røpke, Stefan.

Publication: Research - peer-review › Journal article – Annual report year: 2013

### Harvard

*Transportation Science*, vol 47, pp. 23-37. DOI: 10.1287/trsc.1110.0399

### APA

*A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem*.

*Transportation Science*,

*47*, 23-37. DOI: 10.1287/trsc.1110.0399

### CBE

### MLA

*Transportation Science*. 2013, 47. 23-37. Available: 10.1287/trsc.1110.0399

### Vancouver

### Author

### Bibtex

}

### RIS

TY - JOUR

T1 - A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem

AU - Jepsen,Mads Kehlet

AU - Spoorendonk,Simon

AU - Røpke,Stefan

PY - 2013/2

Y1 - 2013/2

N2 - This paper presents an exact method for solving the symmetric two-echelon capacitated vehicle routing problem, a transportation problem concerned with the distribution of goods from a depot to a set of customers through a set of satellite locations. The presented method is based on an edge flow model that is a relaxation and provides a valid lower bound. A specialized branching scheme is employed to obtain feasible solutions. Out of a test set of 93 instances the algorithm is able to solve 47 to optimality surpassing previous exact algorithms.

AB - This paper presents an exact method for solving the symmetric two-echelon capacitated vehicle routing problem, a transportation problem concerned with the distribution of goods from a depot to a set of customers through a set of satellite locations. The presented method is based on an edge flow model that is a relaxation and provides a valid lower bound. A specialized branching scheme is employed to obtain feasible solutions. Out of a test set of 93 instances the algorithm is able to solve 47 to optimality surpassing previous exact algorithms.

KW - Vehicle routing

KW - Two-echelon systems

KW - Branch-and-cut

U2 - 10.1287/trsc.1110.0399

DO - 10.1287/trsc.1110.0399

M3 - Journal article

VL - 47

SP - 23

EP - 37

JO - Transportation Science

T2 - Transportation Science

JF - Transportation Science

SN - 0041-1655

ER -