Lower and upper bounds for the two-echelon capacitated location-routing problem

Claudio Contardo, Vera Hemmelmayr, Teodor Gabriel Crainic

Publikation: Wissenschaftliche FachzeitschriftOriginalbeitrag in FachzeitschriftBegutachtung

35 Downloads (Pure)

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.
OriginalspracheEnglisch
Seiten (von - bis)3185 - 3199
FachzeitschriftComputers and Operations Research
Jahrgang39
DOIs
PublikationsstatusVeröffentlicht - 2012

Zitat