A Location Routing Model for the Logistic System in the Mining Collection Centers of the Northern Region of Boyacá-Colombia

Authors: Erika Ruíz, Luis Amaya, Diego Carreño

Abstract:

The main objective of this study is to design a mathematical model for the logistics of mining collection centers in the northern region of the department of Boyacá (Colombia), determining the structure that facilitates the flow of products along the supply chain. In order to achieve this, it is necessary to define a suitable design of the distribution network, taking into account the products, customer’s characteristics and the availability of information. Likewise, some other aspects must be defined, such as number and capacity of collection centers to establish, routes that must be taken to deliver products to the customers, among others. This research will use one of the operation research problems, which is used in the design of distribution networks known as Location Routing Problem (LRP).

Keywords: Location routing problem, logistic, mining collection, model.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1315847

References:

[1] S. Chopra and P. Meindl, “Administración de la cadena de suministro”. Mexico D.f: Pearson Prentice Hall, 2013, pp 12-28.
[2] M. Estrada, “Análisis de estrategias eficientes en la logística de distribución de paquetería.,” Universitat Politècnica de Catalunya, Barcelona, 2007.
[3] H. Min, V. Jayaraman, and R. Srivastava, “Combined location – routing problems: A synthesis and future research directions.,” European Journal of Operatinal Research., 1998. pp 1-15.
[4] M. Albareda, J. Diaz, and E. Fernandez, “A compact model and tight bounds for a combined location-routing problem,” Computers and Operations Research, vol. 32, no. 3. pp. 407–428, 2005.
[5] G. Lieberman and F. Hillier, Introducción a la investigación de operaciones, México, McGraw-Hill. Ed 9. 2010.
[6] J. Niño and H. Lamos, “Modelo matemático para determinar la ubicación de Centros de Distribución en un contexto real,” Scientia Et Technica Scientia et Technica Año XIX, vol. 19, no. 4. pp. 385–391, 2014.
[7] A.M Anaya, J Renaud and A. Ruiz. “Relief distribution networks: a systematic review. Annals of Operations” Research. /doi.org/10.1007/s10479-014-1581-y, pp53-79, 2014.
[8] M. G, Bell. H., Fonzone and C. Polyzoni. “Depot location in degradable transport networks. Transportation Research Part B: Methodological” pp, 66, 148–161. Retrieved July 4, 2017 from the World Wide Web: http://doi.org/10.1016/j.trb.2013.11.003, 2014.
[9] G. Nagy and S. Salhi. “Location-routing: Issues, models and methods”. European Journal of Operational Research, Vol 177(2), pp 649–672. Retrieved March 25, 2017 from the World Wide Web http://doi.org/10.1016/j.ejor.2006.04.004, 2007.
[10] C. Prodhon and C. Prins, C. “A survey of recent research on location-routing problems”. European Journal of Operational Research, Vol 238(1), pp 1–17. Retrieved September 11, 2017 from the World Wide Web http://doi.org/10.1016/j.ejor.2014.01.005, 2014.
[11] D. Ambrosino, A. Sciomachen, and M. G. Scutellà, “A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem,” Computers & Operations Research., vol. 36, no. 2, pp. 442–460, 2009.
[12] J. M. Belenguer, E. Benavent, C. Prins, C. Prodhon, and R. Wolfler Calvo, “A Branch-and-Cut method for the Capacitated Location-Routing Problem,” Computers & Operations Research., Vol 38, pp 931-941, 2011.
[13] C. Rodhon, and C. Prins, C. “A Memetic Algorithm with Population Management (MA | PM) for the Periodic Location-Routing Problem”. In Lecture Notes in Computer Science, pp. 43–57, 2008.
[14] R. Burness and A. White, “The Traveling Salesman Location Problem.pdf,” Transportation Science, Vol 10, pp 348-360, 1976.
[15] A.W, Chan, D.W, Hearn “A rectilinear distance roundtrip location problem f,” Transportation Science., Vol 11, pp 107-123, 1977.
[16] S. Barreto, C. Ferreria, C. Paixao and B. Santos. “Using Clustering analysis in a capacitated location routing problem”. European Journal of Operational Research, Vol 179 No 3 pp 968-977, 2005.
[17] M. Drexel and M. Scheneider. “A survey of variants and extensions of the location – routing Problem” European of Journal of Operation Research. Vol 241 No.2 pp 283-308, 2015.
[18] C. Duhamel, P. Lacomme, C, Prins and C. Prodhon. “Aproach for the capacited location routing problem”, Computers and operation research. Vol 37 No. 11 pp 1912-1923, 2010.
[19] C. Prodhon, “A hybrid evolutionary algorithm for the periodic location-routing problem” European Journal of Operational Research, Vol. 210(2), pp 204–212. Retrieved July 4, 2017 from the World Wide Web http://doi.org/10.1016/j.ejor.2010.09.021, 2011.
[20] C. Prins, C Prodhon, C Wolfler and Calvo, R.. “A Memetic Algorithm with Population Management (MA | PM) for the Capacitated Location-Routing Problem”. EvoCOP, 183–194. Retrieved March 27, 2017 from the World Wide Web http://doi.org/10.1007/978-3-540-88439-2_4, 2006.
[21] J. Kennedy and R. Eberhart. “Particle Swarm optimizacion” Procedding of the IEEE International Conference on Neural Networks, pp 1942-1948. 1995.
[22] S. Geetha. P. Ganesan. P. T Vanathi. “A hybrid particle swarm optimization with genetic operators for vehicle routing problem”. Journal of advances in Information Technolgy. Vol 1 No. 4 pp 181-188. 2010.