An application of Graph Theory to improve the planning of work routes for a company in the vending sector

Authors

  • Vanesa Puchades Cortés Semacaf Máquinas de Café S.L
  • Josefa Mula Bru Centro de Investigación de Gestión e Ingeniería de Producción Universidad Politécnica de Valencia
  • Alejandro Rodríguez Villalobos Departamento de Organización de Empresas Universidad Politécnica de Valencia

DOI:

https://doi.org/10.46661/revmetodoscuanteconempresa.2112

Keywords:

Teoría de Grafos, planificación de rutas, problema del viajante, sector del vending, Graph Theory, routing planning, travelling salesman problem, vending sector

Abstract

Currently, the routing management is an important aspect in those companies whose activity is mainly based on the transport, since it involves high costs of fuel, manpower, etc. In this paper, the case of the company Semacaf Máquinas de Café S.L. is studied. This company belongs to the sector of automatic distribution and pursues to evaluate the effectiveness of its current policy about planning routes and to compare it with the optimal policy obtained through the software applications, Grafos and Rutas, based on algorithms belonging to Graph Theory.

In this paper, the Traveling Salesman Problem (TSP) is applied, due to the characteristics of the problem and because it accomplishes the objectives of minimizing the previously mentioned costs, as well as evaluating the current policy of routing management of the company.

Downloads

Download data is not yet available.

References

Anderson, D.R., Sweeney, D.J., Williams, T.A. (2004): Métodos Cuantitativos para los Negocios. 8ª edición. Thomson International.

Appel, K., Haken, W. (1977a): Every planar map is four colorable. Part I. Discharging. Illinois Journal of Mathematics 21, 429–490.

Appel, K., Haken, W. (1977b): Every planar map is four colorable. Part II. Reducibility. Illinois Journal of Mathematics 21, 491–567.

Bodin, L., Golden, B. (1981): Classification in vehicle-routing and scheduling. Networks 11 (2), 97–108.

Desrochers, M., Lenstra, J.K., Savelsbergh, M.W.P. (1990): A classification scheme for vehicle-routing and scheduling problems. European Journal of Operational Research 46 (3) 322–332.

Euler, L. (1736): Solutio problematis ad geometriam situs pertinentis. Commentarii Academiae Scientarum Imperialis Petropolitanae 8, 128-140.

Hierholzer, C. (1873): Über die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechnung zu umfahren. Mathematische Annalen 6, 30–32.

Hillier, F.S., Lieberman, G.J. (2006): Introducción a la Investigación de Operaciones. 8ª edición. McGraw-Hill.

Ministerio de Fomento (2001): Estudio socio-económico del sector del transporte por carretera. Consultrans.

Rodríguez-Villalobos, A. (2008): Integración de un SIG con modelos de cálculo y optimización de rutas de vehículos CVRP y software de gestión de flotas. Dirección y Organización 35, 7–14.

Sylvester, J.J. (1878): Chemistry and Algebra. Nature 17, 284.

Taha, H.A. (2004): Investigación de Operaciones. 7ª edición. Prentice Hall, México.

Winston, W.L. (2005): Investigación de Operaciones. Aplicaciones y Algoritmos. Ed. Thomson, México.

Downloads

Published

2016-11-04

How to Cite

Puchades Cortés, V., Mula Bru, J., & Rodríguez Villalobos, A. (2016). An application of Graph Theory to improve the planning of work routes for a company in the vending sector. Journal of Quantitative Methods for Economics and Business Administration, 6, Páginas 7 a 22. https://doi.org/10.46661/revmetodoscuanteconempresa.2112

Issue

Vol. 6 (2008)

Section

Articles

License

Copyright (c) 2008 Revista de Métodos Cuantitativos para la Economía y la Empresa

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Submission of manuscripts implies that the work described has not been published before (except in the form of an abstract or as part of thesis), that it is not under consideration for publication elsewhere and that, in case of acceptance, the authors agree to automatic transfer of the copyright to the Journal for its publication and dissemination. Authors retain the authors' right to use and share the article according to a personal or instutional use or scholarly sharing purposes; in addition, they retain patent, trademark and other intellectual property rights (including research data). 

All the articles are published in the Journal under the Creative Commons license CC-BY-SA (Attribution-ShareAlike). It is allowed a commercial use of the work (always including the author attribution) and other derivative works, which must be released under the same license as the original work.

Up to Volume 21, this Journal has been licensing the articles under the Creative Commons license CC-BY-SA 3.0 ES. Starting from Volume 22, the Creative Commons license CC-BY-SA 4.0 is used.