Advanced Search
MyIDEAS: Login to save this article or follow this journal

Aplicación de la Teoría de Grafos para mejorar la planificación de rutas de trabajo de una empresa del sector de la distribución automática = An application of Graph Theory to improve the planning of work routes for a company in the vending sector

Contents:

Author Info

  • Puchades Cortés, Vanesa

    ()
    (Semacaf Máquinas de Café S.L.)

  • Mula Bru, Josefa

    ()
    (Centro de Investigación de Gestión e Ingeniería de Producción, Universidad Politécnica de Valencia)

  • Rodríguez Villalobos, Alejandro

    ()
    (Departamento de Organización de Empresas, Universidad Politécnica de Valencia)

Registered author(s):

    Abstract

    En la actualidad, la gestión de rutas es un aspecto fundamental en las empresas cuya actividad se basa principalmente en el transporte, ya que supone elevados costes de carburantes, mano de obra, etc. En este artículo, se estudia el caso de la empresa Semacaf Máquinas de Café S.L., perteneciente al sector de la distribución automática, que quiere evaluar la efectividad de su política actual de rutas y compararla con la política óptima obtenida mediante las aplicaciones informáticas Grafos y Rutas, basadas en algoritmos pertenecientes a la Teoría de Grafos. En este trabajo se aplica el algoritmo del Problema del Viajante, que se adapta a las características del problema de la empresa y que cumple los objetivos de minimizar los costes anteriormente mencionados, así como de evaluar la política actual de gestión de rutas de la empresa. = 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.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.upo.es/RevMetCuant/art21.pdf
    Download Restriction: no

    File URL: http://www.upo.es/RevMetCuant/art21.txt
    Download Restriction: no

    Bibliographic Info

    Article provided by Universidad Pablo de Olavide, Department of Quantitative Methods for Economics and Business Administration in its journal Revista de Métodos Cuantitativos para la Economía y la Empresa = Journal of Quantitative Methods for Economics and Business Administration.

    Volume (Year): 6 (2008)
    Issue (Month): 1 (December)
    Pages: 7-22

    as in new window
    Handle: RePEc:pab:rmcpee:v:6:y:2008:i:1:p:7-22

    Contact details of provider:
    Postal: Carretera de Utrera km.1, 41013 Sevilla
    Phone: + 34 954 34 8913
    Fax: + 34 954 34 9339
    Email:
    Web page: http://www.upo.es/economia/metodos/
    More information through EDIRC

    Related research

    Keywords: Teoría de Grafos; planificación de rutas; problema del viajante; sector del vending; graph theory; routing planning; travelling salesman problem; vending sector;

    Find related papers by JEL classification:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:pab:rmcpee:v:6:y:2008:i:1:p:7-22. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Publicación Digital - UPO).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.