A service provided by the WU Library and the WU IT-Services

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

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 (12). pp. 3185-3199. ISSN 0305-0548

[img]
Preview
PDF
Available under License Creative Commons Attribution Non-commercial No Derivatives Austria.

Download (343Kb) | Preview

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.

Item Type: Article
Additional Information: Open Access funded by Austrian Science Fund (FWF)
Keywords: Two-echelon capacitated location routing problem / Adaptive large neighbourhood search / Branch-and-cut
Divisions: Departments > Welthandel > Transportwirtschaft und Logistik
Version of the Document: Published
Variance from Published Version: None
Depositing User: ePub Administrator
Date Deposited: 17 Apr 2013 11:15
Last Modified: 16 Sep 2017 07:35
Related URLs:
FIDES Link: https://bach.wu.ac.at/d/research/results/58384/
URI: http://epub.wu.ac.at/id/eprint/3857

Actions

View Item