Cargando…
Lower and upper bounds for the two-echelon capacitated location-routing problem
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...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Pergamon Press
2012
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3916792/ https://www.ncbi.nlm.nih.gov/pubmed/24511176 http://dx.doi.org/10.1016/j.cor.2012.04.003 |
_version_ | 1782302760426799104 |
---|---|
author | Contardo, Claudio Hemmelmayr, Vera Crainic, Teodor Gabriel |
author_facet | Contardo, Claudio Hemmelmayr, Vera Crainic, Teodor Gabriel |
author_sort | Contardo, Claudio |
collection | PubMed |
description | 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. |
format | Online Article Text |
id | pubmed-3916792 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2012 |
publisher | Pergamon Press |
record_format | MEDLINE/PubMed |
spelling | pubmed-39167922014-02-07 Lower and upper bounds for the two-echelon capacitated location-routing problem Contardo, Claudio Hemmelmayr, Vera Crainic, Teodor Gabriel Comput Oper Res Article 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. Pergamon Press 2012-12 /pmc/articles/PMC3916792/ /pubmed/24511176 http://dx.doi.org/10.1016/j.cor.2012.04.003 Text en © 2012 Elsevier Ltd. https://creativecommons.org/licenses/by-nc-nd/3.0/ Open Access under CC BY-NC-ND 3.0 (https://creativecommons.org/licenses/by-nc-nd/3.0/) license |
spellingShingle | Article Contardo, Claudio Hemmelmayr, Vera Crainic, Teodor Gabriel Lower and upper bounds for the two-echelon capacitated location-routing problem |
title | Lower and upper bounds for the two-echelon capacitated location-routing problem |
title_full | Lower and upper bounds for the two-echelon capacitated location-routing problem |
title_fullStr | Lower and upper bounds for the two-echelon capacitated location-routing problem |
title_full_unstemmed | Lower and upper bounds for the two-echelon capacitated location-routing problem |
title_short | Lower and upper bounds for the two-echelon capacitated location-routing problem |
title_sort | lower and upper bounds for the two-echelon capacitated location-routing problem |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3916792/ https://www.ncbi.nlm.nih.gov/pubmed/24511176 http://dx.doi.org/10.1016/j.cor.2012.04.003 |
work_keys_str_mv | AT contardoclaudio lowerandupperboundsforthetwoecheloncapacitatedlocationroutingproblem AT hemmelmayrvera lowerandupperboundsforthetwoecheloncapacitatedlocationroutingproblem AT crainicteodorgabriel lowerandupperboundsforthetwoecheloncapacitatedlocationroutingproblem |