Journal
TRANSPORTATION SCIENCE
Volume 49, Issue 2, Pages 355-368Publisher
INFORMS
DOI: 10.1287/trsc.2013.0500
Keywords
vehicle routing; two-echelon systems; column generation; cutting planes; branch-and-cut-and-price algorithms
Categories
Funding
- FAPEMIG-Fundacao de Amparo a Pesquisa do Estado de Minas Gerais
- CNPq-Conselho Nacional de Desenvolvimento Cientifico e Tecnologico
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available