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.

RIS

@ARTICLE{Contardo2012,
title = {Lower and upper bounds for the two-echelon capacitated location-routing problem},
author = {Claudio Contardo and Vera Hemmelmayr and Teodor Gabriel Crainic},
year = {2012},
doi = {http://dx.doi.org/10.1016/j.cor.2012.04.003},
url = {http://www.sciencedirect.com/science/article/pii/S0305054812000834},
volume = {39},
language = {EN},
pages = {3185-3199},
journal = {Computers and Operations Research},
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.},
}