Name
Title | ||
|---|---|---|
A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem |
Abstract | ||
|---|---|---|
In this paper, we introduce a branch-and-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. The algorithm relies on a reformulation based on q-routes that combines two important features. First, it overcomes symmetry issues observed in a formulation coming from a previous study of the problem. Second, it is strengthened with several classes of valid inequalities. As a result, the branch-and-cut-and-price implementation compares favorably with previous exact solution approaches for the problem-namely, two branch-and-price algorithms and a branch-and-cut method. Overall, 10 new optimality certificates and 8 new best upper bounds are provided in this study. New best lower bounds are also presented for all instances in the hardest test set from the literature. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1287/trsc.2013.0500 | Transportation Science |
Keywords | Field | DocType |
vehicle routing,column generation,linear programming,routing,optimization | Exact solutions in general relativity,Vehicle routing problem,Column generation,Mathematical optimization,Multipath routing,Branch and cut,Algorithm,Destination-Sequenced Distance Vector routing,Linear programming,Mathematics,Operations management,Test set | Journal |
Volume | Issue | ISSN |
49 | 2 | 0041-1655 |
Citations | PageRank | References |
10 | 0.49 | 28 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fernando Afonso Santos | 1 | 63 | 3.00 |
| Geraldo Robson Mateus | 2 | 413 | 42.30 |
| Alexandre Salles da Cunha | 3 | 242 | 22.32 |
| SantosFernando Afonso | 4 | 27 | 1.10 |
| MateusGeraldo Robson | 5 | 27 | 1.10 |
| da CunhaAlexandre Salles | 6 | 16 | 0.97 |