Name
Title | ||
|---|---|---|
A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1287/trsc.1110.0399 | Transportation Science |
Keywords | Field | DocType |
routing problem,symmetric two-echelon capacitated vehicle,transportation problem,exact method,branch-and-cut algorithm,edge flow model,satellite location,previous exact algorithm,feasible solution,routing,vehicle routing,vehicle routing problem,branch and cut | Vehicle routing problem,Mathematical optimization,Static routing,Upper and lower bounds,Branch and cut,Algorithm,Destination-Sequenced Distance Vector routing,Transportation theory,Operations management,Mathematics,Branching (version control),Test set | Journal |
Volume | Issue | ISSN |
47 | 1 | 0041-1655 |
Citations | PageRank | References |
28 | 0.86 | 25 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mads Jepsen | 1 | 141 | 5.06 |
| Simon Spoorendonk | 2 | 207 | 9.17 |
| Stefan Ropke | 3 | 1347 | 55.90 |