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: | Contardo, Claudio, Hemmelmayr, Vera, Crainic, Teodor Gabriel |
---|---|
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 |
Ejemplares similares
-
An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics
por: Hemmelmayr, Vera C., et al.
Publicado: (2012) -
A two-echelon location routing problem considering sustainability and hybrid open and closed routes under uncertainty
por: Hajghani, Masoud, et al.
Publicado: (2023) -
Green two-echelon closed and open location-routing problem: application of NSGA-II and MOGWO metaheuristic approaches
por: Heidari, Ali, et al.
Publicado: (2022) -
A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method
por: Sutrisno, Hendri, et al.
Publicado: (2023) -
A Two-Echelon Cooperated Routing Problem for a Ground Vehicle and Its Carried Unmanned Aerial Vehicle
por: Luo, Zhihao, et al.
Publicado: (2017)