El problema del viajante de comercioBúsqueda de soluciones y herramientas asequibles

  1. BERNAL GARCÍA, JUAN JESÚS 1
  2. HONTORIA HERNÁNDEZ, ELOY 1
  3. ALEKSOVSKI, DARKO 2
  1. 1 Universidad Politécnica de Cartagena
    info

    Universidad Politécnica de Cartagena

    Cartagena, España

    ROR https://ror.org/02k5kx966

  2. 2 Jožef Stefan Institute
    info

    Jožef Stefan Institute

    Liubliana, Eslovenia

    ROR https://ror.org/05060sz93

Journal:
Rect@: Revista Electrónica de Comunicaciones y Trabajos de ASEPUMA

ISSN: 1575-605X

Year of publication: 2015

Volume: 16

Issue: 2

Pages: 117-133

Type: Article

DIALNET GOOGLE SCHOLAR lock_openDialnet editor

More publications in: Rect@: Revista Electrónica de Comunicaciones y Trabajos de ASEPUMA

Abstract

High levels of global competitiveness have reduced Small and Medium Size Enterprises´ (SMEs) profits´ margins and have forced them to search for new management tools. On the other hand, due to their reduced both human resources and computing structures make for them easy and free applications very wellcome. This research work will search the scientific side of the Travelling Salesman Problem (TSP) for its practical application with both real distances and times to the SMEs environment. The programming development through Solver by Excel will be shown in open source and its robustness to deal with the size of the problem dimension will be analysed.

Bibliographic References

  • J. J. Bernal, E. Hontoria, D. Aleksovski. El problema del enrutamiento de vehículos. Propuestas para la búsqueda del camino más corto. Aplicaciones al entorno docente y Pymes, Rect@Monográfico nº4. (2013) 25-38.
  • G. Dantzig, R. Fulkerson, S. Johnson. Solution of a large-scale traveling-salesman problem. Journal of the operations research society of America, 2(4) (1954) 393–410.
  • G. Laporte, The Travelling Salesman Problem: An overview of exact and approximate algorithms, European Journal of Operational Research 59 (1992) 231–247.
  • H. D. Ratliff, A.S. Rosenthal. Order-picking in a rectangular warehouse: a solvable case for the travelling salesman problem. Operations Research, 31 (1983) 507–552
  • M. Grötschel, M. Jünger & G. Reinelt. Optimal control of plotting and drilling machines: A case study. Mathematical Methods of Operations Research, 35, No. 1, (1991) 61-84.
  • J. K. Lenstra, A.H.G. Rinnooy. Some simple applications of the traveling salesman problem. Operational Research Quarterly, 26 (1975) 717–33.
  • C. Jiang. A Reliable solver of euclidean traveling salesman problems with Microsoft Excel Add-in tools for small-size systems. Journal Of Software, 5 (7) (2010) 761-768.
  • M .C. Patterson, B. Harmel. An algorithm for using Excel Solver for the Traveling Salesman Problems, Journal of Education for Business, 78 (6) (2003) 341-346.
Data source: Dialnet