A hybrid metaheuristic algorithm for the capacitated location routing problem

Escobar, John Willmer; Linfati, Rodrigo; Adarme-Jaimes, Wilson

doi:10.15446/dyna.v82n189.48552

Cited by 14 publications

(9 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Furthermore, other methodologies to solve lineal stochastic programing problems might be considered. Finally, decisions on transportation mode, type of vehicles and routes to be performed together, might be included in the mathematical model such as considered in [30][31][32][33].…”

Section: Discussionmentioning

confidence: 99%

Supply chain optimization with variable demand by considering financial criteria and scenarios

Escobar

2017

Rev. Fac. Ing.

Self Cite

View full text Add to dashboard Cite

This paper contemplates the supply chain design problem of a large-scale company by considering the maximization of the Net Present Value. In particular, the variability of the demand for each type of product at each customer zone has been estimated. As starting point, this paper considers an established supply chain for which the main problem is to determine the decisions regarding expansion of distribution centers. The problem is solved by using a mixed-integer linear programming model, which optimizes the different demand scenarios. The proposed methodology uses a scheme of optimization based on the generation of multiple demand scenarios of the supply network. The model is based on a real case taken from a multinational food company, which supplies to the Colombian and some international markets. The obtained results were compared with the equivalent present costs minimization scheme of the supply network, and showed the importance and efficiency of the proposed approach as an alternative for the supply chain design with stochastic parameters.

show abstract

Section: Discussionmentioning

confidence: 99%

Supply chain optimization with variable demand by considering financial criteria and scenarios

Escobar

2017

Rev. Fac. Ing.

Self Cite

View full text Add to dashboard Cite

show abstract

“…En [42], se presenta una búsqueda tabú granular híbrida. Los trabajos citados anteriormente, se componen de dos fases: inicialización, y mejora.…”

Section: F Algoritmos Combinadosunclassified

Problema de Localización y Ruteo con Restricciones de Capacidad: Revisión de la Literatura

2015

Self Cite

View full text Add to dashboard Cite

ResumenEn este artículo se hace una revisión exhaustiva del estado del arte de las metodologías de solución existentes para el problema combinado de localización y ruteo con restricciones de capacidad (CLRP). El problema de CLRP tiene una gran cantidad de aplicaciones prácticas en temas relacionados con transporte. Se ha propuesto el siguiente esquema de clasificación de acuerdo al método de solución: (1) Algoritmos Heurísticos Constructivos, (2) Algoritmos Heurísticos Basados en Clústeres, (3) Algoritmos Heurísticos Basados en Trayectoria, (4) Algoritmos Heurísticos Basados en Población, (5) Algoritmos Heurísticos Combinados, (6) Métodos Exactos. Se hace especial énfasis en fortalezas y debilidades de cada metodología publicada, identificando oportunidades de investigación y desarrollo en el área, en el contexto de la aplicación práctica de la problemática.Palabras claves: Problemas de localización y ruteo, Revisión Literatura, Algoritmos Metaheurísticos, Métodos Exactos. AbstractIn this paper, we review the state of the art of the published solution methods for combined problems of location and routing with capacity constraints (CLRP). The CLRP has several practical application in topics related to transportation. We have proposed the following classification scheme based on the solution method: (1) Constructive

show abstract

“…Aplicaciones exitosas de la metodología de búsqueda granular para solucionar problemas de ruteo de vehiculos junto con decisiones de localización pueden ser consultadas en [18][19][20].…”

Section: Búsqueda Granularunclassified

Un algoritmo basado en búsqueda tabú granular para la solución de un problema de ruteo de vehículos considerando flota heterogénea

Puenayán¹,

Londoño²,

Escobar

et al. 2014

rev.ing.univ.Medellin

Self Cite

View full text Add to dashboard Cite

A hybrid metaheuristic algorithm for the capacitated location routing problem

Cited by 14 publications

References 24 publications

Supply chain optimization with variable demand by considering financial criteria and scenarios

Supply chain optimization with variable demand by considering financial criteria and scenarios

Problema de Localización y Ruteo con Restricciones de Capacidad: Revisión de la Literatura

Un algoritmo basado en búsqueda tabú granular para la solución de un problema de ruteo de vehículos considerando flota heterogénea

Contact Info

Product

Resources

About