TY - JOUR
T1 - Lower and upper bounds for the two-echelon capacitated location-routing problem
AU - Contardo, Claudio
AU - Hemmelmayr, Vera
AU - Crainic, Teodor Gabriel
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - http://www.sciencedirect.com/science/article/pii/S0305054812000834
U2 - 10.1016/j.cor.2012.04.003
DO - 10.1016/j.cor.2012.04.003
M3 - Journal article
SN - 0305-0548
VL - 39
SP - 3185
EP - 3199
JO - Computers and Operations Research
JF - Computers and Operations Research
ER -