Contardo, Claudio and Hemmelmayr, Vera and Crainic, Teodor Gabriel. 2012. Lower and upper bounds for the two-echelon capacitated location-routing problem. Computers and Operations Research 39, 3185-3199.
BibTeX
Abstract
In this paper, we introduce two algorithms to address the two-echelon capacitated location-routing problem (2E-CLRP). We introduce a branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities. We also propose an adaptive large-neighbourhood search (ALNS) meta-heuristic with the objective of finding good-quality solutions quickly. The computational results on a large set of instances from the literature show that the ALNS outperforms existing heuristics. Furthermore, the branch-and-cut method provides tight lower bounds and is able to solve small- and medium-size instances to optimality within reasonable computing times.
Tags
Press 'enter' for creating the tagPublication's profile
Status of publication | Published |
---|---|
Affiliation | WU |
Type of publication | Journal article |
Journal | Computers and Operations Research |
Citation Index | SCI |
WU Journalrating 2009 | A |
WU-Journal-Rating new | FIN-A, INF-A, STRAT-B, WH-B |
Language | English |
Title | Lower and upper bounds for the two-echelon capacitated location-routing problem |
Volume | 39 |
Year | 2012 |
Page from | 3185 |
Page to | 3199 |
Reviewed? | Y |
URL | http://www.sciencedirect.com/science/article/pii/S0305054812000834 |
DOI | http://dx.doi.org/10.1016/j.cor.2012.04.003 |
Associations
- People
- Hemmelmayr, Vera (Details)
- External
- Contardo, Claudio (Canada)
- Crainic, Teodor Gabriel (Canada)
- Organization
- Institute for Transport and Logistics Management (Details)