ISSN-L: 0798-1015 • eISSN: 2739-0071 (En línea) – Revista Espacios – Vol. 42, Nº 16, Año 2021
GATICA, Gustavo et al. «Heuristic algorithm based on Ant Colony Optimization for the Capacitated Location-
Routing problem with Homogeneous Fleet»
Dorigo M., Stützle T. (2019) Ant Colony Optimization: Overview and Recent Advances. In: Gendreau M., Potvin
JY. (eds) Handbook of Metaheuristics. International Series in Operations Research & Management Science,
vol 272. Springer, Cham. https://doi.org/10.1007/978-3-319-91086-4_10.
Duhamel, C., Lacomme, P., Prins, C., & Prodhon, C. (2010). A GRASP× ELS approach for the capacitated location-
routing problem. Computers & Operations Research, 37(11), 1912-1923.
Escobar, J. W., & Linfati, R. (2012). Un algoritmo metaheurístico basado en recocido simulado con espacio de
búsqueda granular para el problema de localización y ruteo con restricciones de capacidad. Revista
Ingenierías Universidad de Medellín, 11(21), 139-150. Available in
https://revistas.udem.edu.co/index.php/ingenierias/article/view/604/545
Escobar, J. W., Linfati, R., & Toth, P. (2013). A two-phase hybrid heuristic algorithm for the capacitated location-
routing problem. Computers & Operations Research, 40(1), 70-79.
Escobar, J. W., Linfati, R., & Adarme-Jaimes, W. (2015). A hybrid metaheuristic algorithm for the capacitated
location routing problem. Dyna, 82(189), 243-251.
Farkavcova, V. G., Rieckhof, R., & Guenther, E. (2018). Expanding knowledge on environmental impacts of
transport processes for more sustainable supply chain decisions: A case study using life cycle
assessment. Transportation Research Part D: Transport and Environment, 61, 68-83.
García, L. A. M. (2016). GESTION LOGISTICA INTEGRAL: las mejores practicas en la cadena de abastecimiento .
Ecoe Ediciones. Retrieved from: https://www.ecoeediciones.com/wp-content/uploads/2016/12/Gestion-
logistica-integral-2da-Edici%C3%B3n.pdf
Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness.
WH Freeman & Co. New York, NY, USA.
Harks, T., König, F. G., & Matuschke, J. (2013). Approximation algorithms for capacitated location
routing. Transportation Science, 47(1), 3-22.
Helsgaun, K. (2000). An effective implementation of the Lin–Kernighan traveling salesman heuristic. European
Journal of Operational Research, 126(1), 106-130.
i Cos, J. P., & De Navascués, R. (1998). Manual de logística integral. Ediciones Díaz de Santos. Retrieved from:
http://www.diazdesantos.com.co/libros/pau-i-cos-jordi-manual-de-logistica-integral-L03003450303.html
Laporte, G., Louveaux, F., & Mercure, H. (1989). Models and exact solutions for a class of stochastic location-
routing problems. European Journal of Operational Research, 39(1), 71-78.
Linfati, R., Escobar, J. W., & Gatica, G. (2014). A metaheuristic algorithm for the location routing problem with
heterogeneous fleet. Ingeniería y Ciencia, 10(19), 55-76.
Luna López, L. C. (2015). Localización de paradas y diseño óptimo de rutas para transporte de personal
(Doctoral dissertation, Universidad Autónoma de Nuevo León). Retrieved from:
http://eprints.uanl.mx/9541/1/1080214944.pdf
Mehrjerdi, Y. Z., & Nadizadeh, A. (2013). Using greedy clustering method to solve capacitated location-routing
problem with fuzzy demands. European Journal of Operational Research, 229(1), 75-84.