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.
| Identifer | oai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:3857 |
| Date | 12 April 2012 |
| Creators | Contardo, Claudio, Hemmelmayr, Vera, Crainic, Teodor Gabriel |
| Publisher | Elsevier |
| Source Sets | Wirtschaftsuniversität Wien |
| Language | English |
| Detected Language | English |
| Type | Article, PeerReviewed |
| Format | application/pdf |
| Rights | Creative Commons: Attribution-Noncommercial-No Derivative Works 3.0 Austria |
| Relation | http://dx.doi.org/10.1016/j.cor.2012.04.003, http://www.journals.elsevier.com/computers-and-operations-research, https://www.elsevier.com/journals/computers-and-operations-research/0305-0548/open-access-options, http://epub.wu.ac.at/3857/ |
Page generated in 0.0023 seconds