Keywords
graph
routing
transport
TSP.
How to Cite
Abstract
This paper has as its main objective of use the TSP (Traveling Salesman Problem) with graph theory in order to design routing strategies in a distribution network, looking for an efficient way to be made in regard to distance and time used for attending customer’s requirements. Additionally, the paper develops a case of application of the methodology in a Meat Company located in the city of Medellín. As a result, we find that the use of TSP with graph produces a route with the minimum distance in the distribution network; it was demonstrated in the case of application.References
Albiach, J., Sanchis, J., & Soler, D. (2008). An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation. European Journal of Operational Research, 189(3), 789 - 802.
Anaya Tejero, J. J. (2007). Logística integral: la gestión operativa de la empresa. Madrid: ESIC Editorial.
Armon, A., Avidor, A., & Oded, S. (2010). Cooperative TSP. Theoretical Computer Science, 411(31 - 33), 2847 -2863.
Bahar Çavdar, J. S. (2014). A distribution-free TSP tour length estimation model for random graphs. European Journal of Operational Research, 588–598.
Ballou, R. H. (2004). Business Logistics management. The United States: Prentice Hall.
Bektas, T. (2006). The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega, 209–219.
Bin, Y., Zhong - Zhen, Y., & Baozhen, Y. (2009). An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research, 196(1), 171 - 176.
BoÅzejko, W., & Wodecki, M. (2009). Solving permutational routing problems by population-based metaheurísticos. Computers & Industrial Engineering, 57(1), 269 - 276.
Carvalho Oliveira, R., & Matos, A. C. (2004). An Experimental Study of the Ant Colony System for the period Vehicle Routing Problem. Lecture Notes in Computer Science, 3172, 286 - 293.
Chopra, S. (2001). Designing the distribution network in supply chain. The United States: Kellogg School of Management.
Ducrocq, C. (1991). Concurrence et stratégies dans la distribution. París: Ed. Vuibert Entreprise.
Gómez Montoya, R. A., Zuluaga Mazo, A., & Vélez Uribe, L. D. (2012). Preparación de pedidos eficiente en el Centro de Distribución utilizando VRP. Revista Escuela Colombiana de Ingeniería(88), 55 - 64.
Google Inc. (s.f.). Google Earth. Recuperado el 12 de 10 de 2013, de http://www.google.com/intl/es/earth/index.html
Kallehauge, B. (2008). Formulations and exact algorithms for the vehicle routing problem with time windows. Computers & Operations Research, 35(7), 2307 - 2330.
Miquel Peris, S., Parra Guerrero, F., Lhermie, C., & Miquel Romero, M. J. (2006). Distribución comercial (Vol. 23). Madrid: ESIC Editorial.
Navascués, R. d., & Pau Cos, J. (2000). Manual de logística integral. España: Ediciones Díaz de Santos.
Rizzoli, A., Montemanni, R., Lucibello, E., & Gambardella, L. (2007). Ant colony optimization for real-world vehicle routing problems from theory to applications. Swarm Intell, 1, 135 - 151.
Rodríguez Villalobos, A. (10 de Junio de 2013). Grafos. Obtenido de http://personales.upv.es/arodrigu/grafos
Rodríguez, A., & Ruiz, R. (2012). The effect of the asymmetry of road transportation networks on the traveling salesman problem. Computers & Operations Research, 39, 1566 - 1576.
Tutte, W. T. (2001). Graph Theory. Cambridge: Cambridge University Press.
This journal provides an open access to its content, based on the principle of offering the public free access to research, helping to increase global knowledge exchange. Likewise, the printed version is freely accessible and has no associated costs per publication.