Skip to main content
SpringerLink
Log in

Traveling Salesman Problem in a Geographic Information Management System

  • Conference paper
  • First Online:
Progress in Industrial Mathematics: Success Stories

Part of the book series: SEMA SIMAI Springer Series ((ICIAM2019SSSS,volume 5))

Abstract

This work results from the consortium formed by the company Smartgeo, in the role of leading developer, and by the University of Coimbra. The main goal was the development of a totally innovative Geographic Information System application, which operates on a Web platform, allowing to integrate, manage and manipulate geographic information at a lower cost and simpler utilisation than other solutions on the market. In addition, the developed application incorporates two new functionalities—the capacity to manipulate and display large volumes of information (“Big Data”) and the ability to optimise, according to multiple criteria, the routes of mobile agents in a network. This work focuses on the routes optimisation (second functionality) and not in the first one (Big Data). Two versions were analysed depending if a single or multiple agents were considered. The first case was modelled using the multi-objective travelling salesman problem and the proposed algorithm depends on a parameter which allows controlling the number of Pareto optimal solutions and, consequently, its performance. The second case is dedicated to the route optimisation for several mobile agents using a multiple travelling salesman model. Several heuristics were considered to find balanced routes for all the agents with the minimum cost.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Agarwala, R., Applegate, D.L., Maglott, D., Schuler, G.D., Schäffer, A.A.: A fast and scalable radiation hybrid map construction and integration strategy. Genome Res. 10, 350–364 (2000)

    Article  Google Scholar 

  2. Angel, R., Caudle, W., Noonan, R., Whinston, A.: Computer-assisted school bus scheduling. Manag. Sci. 18(6), B-279–B-288 (1972)

    Google Scholar 

  3. Ascheuer, N., Grötschel, M., Abdel-Hamid, A.A.A.: Order picking in an automatic warehouse: solving online asymmetric tsps. Math. Methods Oper. Res. 49(3), 501–515 (1999)

    Article  MathSciNet  Google Scholar 

  4. Bailey, C.A., McLain, T.W., Beard, R.W.: Fuel saving strategies for separated spacecraft interferometry. In: AIAA Guidance, Navigation, and Control Conference (2000)

    Google Scholar 

  5. Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209–219 (2006)

    Article  Google Scholar 

  6. Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM 9(1), 61–63 (1962)

    Article  MathSciNet  Google Scholar 

  7. Bellmore, M., Hong, S.: Transformation of multisalesman problem to the standard traveling salesman problem. J. ACM 21(3), 500–504 (1974)

    Article  Google Scholar 

  8. Bellmore, M., Nemhauser, G.: The traveling salesman problem: A survey. Oper. Res. 16(3), 538–558 (1968)

    Article  MathSciNet  Google Scholar 

  9. Bellmore, M., Nemhauser, G.: The traveling salesman problem: A survey. In: Mathematical Models in Marketing, volume 132 of Lecture Notes in Economics and Mathematical Systems (Operations Research), pp. 443–448. Springer, Berlin (1976)

    Google Scholar 

  10. Bland, R.G., Shallcross, D.F.: Large traveling salesman problems arising experiments in x-ray crystollography: a preliminary report on computation. Oper. Res. Lett. 8(3), 125–128 (1989)

    Article  MathSciNet  Google Scholar 

  11. Burkard, R.E.: Travelling salesman and assignment problems: a survey. In: Hammer, P., Johnson, E., Korte, B. (eds.) Discrete Optimization I, volume 4 of Annals of Discrete Mathematics, pp. 193–215. Elsevier, New York (1979)

    Google Scholar 

  12. Calvo, R.W., Cordone, R.: A heuristic approach to the overnight security service problem. Comput. Oper. Res. 30(9), 269–1287 (2003)

    MATH  Google Scholar 

  13. Chang, T.S., Yen, H.M.: City-courier routing and scheduling problems. Eur. J. Oper. Res. 223(2), 489–498 (2012)

    Article  MathSciNet  Google Scholar 

  14. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, (1976)

    Google Scholar 

  15. Dantzig, G., Fulkerson, R., Johnson., S.: Solution of a large-scale traveling-salesman problem. Oper. Res. 2, 393–410 (1954)

    Google Scholar 

  16. Ein alter Commis-voyageur. Der Handlungsreisende wie er sein soll und was er zu thun hat, um Aufträge zu erhalten und eines glücklichen Erfolgs in seinen Geschäften gewiß zu sein von einem alten Commis-Voyageur. B.Fr. Voigt Ilmenau (1832) (Reprinted: Verlag Bernd Schramm, Kiel, 1981)

    Google Scholar 

  17. Exnar, F., Machač, O.: The travelling salesman problem and its application in logistic practice. WSEAS Trans. Bus. Econ. 8(4), 163–173 (2011)

    Google Scholar 

  18. Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing prob- lems. SIAM J. Comput. 7(2), 178–193 (1978)

    Article  MathSciNet  Google Scholar 

  19. Frieze, A.: Worst-case analysis of algorithms for travelling salesman problems. Methods Oper. Res. 32, 92 (1979)

    MathSciNet  MATH  Google Scholar 

  20. Garey, M.R., Johnson, D.S.: Computers and Intractability. In: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)

    Google Scholar 

  21. Garey, M., Graham, R., Johnson, D.S.: Some NP-complete geometric problems. In: Proceedings of the 8th Annual ACM Symposium on Theory of Computing (STOC), pp. 10–22. ACM, Hershey (1976)

    Google Scholar 

  22. Gilbert, K.C., Hofstra, R.B.: A new multiperiod multiple traveling salesman problem with heuristic and application to a scheduling problem. Decis. Sci. 23(1), 250–259 (1992)

    Article  Google Scholar 

  23. Gunantara, N.: A review of multi-objective optimization: methods and its applications. Cogent Eng. 5(1), 1502242 (2018)

    Article  Google Scholar 

  24. GuoXing, Y.: Transformation of multidepot multisalesmen problem to the standard travelling sales- man problem. Eur. J. Oper. Res. 81(3), 557–560 (1995)

    Article  Google Scholar 

  25. Hansen, P.: Bicriterion path problems. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making Theory and Application, volume 177 of Lecture Notes in Economics and Mathematical Systems, pp. 109–127. Springer, Berlin (1980)

    Chapter  Google Scholar 

  26. Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10, 196–210 (1962)

    Article  MathSciNet  Google Scholar 

  27. Hubert, L.J., Baker, F.B.: Applications of combinatorial programming to data analysis: the traveling salesman and related problems. Psychometrika 43(1), 81–91 (1978)

    Article  MathSciNet  Google Scholar 

  28. Ilavarasi, K., Joseph, K.S.: Variants of travelling salesman problem: A survey. In: Proceedings of the International Conference on Information Communication and Embedded Systems (ICICES2014). IEEE, Piscataway (2015)

    Google Scholar 

  29. Johnson, O., Liu, J.: A traveling salesman approach for predicting protein functions. Source Code Biol. Med. 1(3), 1–7 (2006)

    Google Scholar 

  30. Kang, J.H., Wilkens, J.J., Oelfke, U.: Demonstrationof scan path optimization in proton therapy. Med. Phys. 34(9), 3457–3464 (2007)

    Article  Google Scholar 

  31. Kara, I., Bektas, T.: Integer linear programming formulations of multiple salesman problems and its variations. Eur. J. Oper. Res. 174(3), 1449–1458 (2006)

    Article  MathSciNet  Google Scholar 

  32. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum (1972)

    Google Scholar 

  33. Korte, B., Vygen, J.: The traveling salesman problem. In: Combinatorial Optimization. Theory and Algorithms, volume 21 of Algorithms and Combinatorics, pp. 473–505. Springer, Berlin (2000)

    Google Scholar 

  34. Laporte, G.: The traveling salesman problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2), 231–247 (1992)

    Article  Google Scholar 

  35. Laporte, G., Nobert, Y.: A cutting planes algorithm for the m-salesmen problem. J. Oper. Res. Soc. 31(11), 1017–1023 (1980)

    Article  MathSciNet  Google Scholar 

  36. Laporte, G., Nobert, Y., Taillefer, S.: Solving a family of multi-depot vehicle routing and location – routing problems. Transp. Sci. 22(3), 161–172 (1988)

    Article  MathSciNet  Google Scholar 

  37. Lust, T., Teghem, J.: The multiobjective traveling salesman problem: a survey and a new ap- proach. In: Coello Coello, C.A., Dhaenens, C., Jourdan, L. (eds.) Advances in Multi-Objective Nature Inspired Computing, pp. 119–141. Springer, Berlin (2010)

    Chapter  Google Scholar 

  38. Matai, R., Singh, S.P., Lal Mittal, M.: Traveling salesman problem: an overview of applications, formulations, and solution approaches. In: Davendra, D. (ed.) Traveling Salesman Problem, Theory and Applications, chapter 1, pp. 1–24. InTech, Rijeka (2010)

    Google Scholar 

  39. Menger, K.: Das botenproblem. Ergebnisse eines Mathematischen Kolloquiums 2, 11–12 (1932)

    Google Scholar 

  40. Miller, C., Tucker, A., Zemlin, R.: Integer programming formulations and traveling salesman problems. J. Assoc. Comput. Mach. 7, 326–329 (1960)

    Article  MathSciNet  Google Scholar 

  41. Oliveira, A.: Extensões do Problema do Caixeiro Viajante. Dissertation to obtain the Master Degree in Mathematics, specialization area: Statistics, Optimization and Financial Mathematics (in Portuguese). Master’s thesis, University of Coimbra (2015)

    Google Scholar 

  42. Oliveira, A.: O Problema do Caixeiro Viajante. Seminário em Estatística, Otimização e Matemática Financeira (in Portuguese). University of Coimbra (2015)

    Google Scholar 

  43. Orman, A.J., Williams, H.P.: A survey of different integer programming formulations of the travelling salesman problem. In: Kontoghiorghes, E.J., Gatu, C. (eds.) Optimisation, Econometric and Financial Analysis, volume 9 of Advances in Computational Management Science, pp. 93–108. Springer, Berlin (2006)

    Google Scholar 

  44. Papadimitriou, C.H.: The euclidean travelling salesman problem is np-complete. Theor. Comput. Sci. 4, 237–244 (1977)

    Article  Google Scholar 

  45. Prabakaran, S., Kumar, T.S., Ramana, J., Reddy, K.C.: A survey on approaches to solve travelling salesman problem. Eurasian J. Anal. Chem. 13(SP), 292–299 (2018)

    Google Scholar 

  46. Rao, M.R.: Technical note a note on the multiple traveling salesmen problem. Oper. Res. 28(3-part-i), 628–632 (1980)

    Google Scholar 

  47. Reinelt, G.: Tsplib - library of sample instances for the tsp (and related problems). http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/ (2015)

  48. Rosenkrantz, D.J., Stearns, R.E., Lewis II, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563–581 (1977)

    Article  MathSciNet  Google Scholar 

  49. Ryan, J.L., Bailey, T.G., Moore, W.B., Carlton, J.T.: Reactive tabu search in unmanned aerial reconnaissance simulations. In: 1998 Winter Simulation Conference. Proceedings (Cat. No. 98CH36274), vol. 1, pp. 873–879 (1998)

    Google Scholar 

  50. Saharidis, G.K.D.: Review of solution approaches for the symmetric traveling salesman problem. Int. J. Inf. Syst. Supply Chain Manag. 7(1), 73–87 (2014)

    Article  Google Scholar 

  51. Saleh, H.A., Chelouah, R.: The design of the global navigation satellite system surveying networks using genetic algorithms. Eng. Appl. Artif. Intell. 17(1), 111–122 (2004)

    Article  Google Scholar 

  52. Schrijver, A.: On the history of combinatorial optimization (till 1960). In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Discrete Optimization, volume 12 of Handbooks in Operations Research and Management Science, pp. 1–68. Elsevier, New York (2005)

    Google Scholar 

  53. Shim, V.A., Tan, K.C., Tan, K.K.: A hybrid estimation of distribution algorithm for solving the multi-objective multiple traveling salesman problem. In: 2012 IEEE Congress on Evolutionary Computation, pp. 1–8 (2012)

    Google Scholar 

  54. The Puzzle Museum. The icosian game. https://www.puzzlemuseum.com/month/picm02/200207icosian.html. Accessed 08 Nov 2019

  55. The Worlds of David Darling - Encyclopedia of Science. Icosian game. http://www.daviddarling.info/encyclopedia/I/IcosianGame.html. Accessed 08 Nov 2019

Download references

Acknowledgements

This work was partially supported by the Centre for Mathematics of the University of Coimbra—UIDB/00324/2020, funded by the Portuguese Government through FCT/MCTES and by the QREN (under the Program More Centre and the European Union through the European Regional Development Fund under the QREN 34164 project—SGP-GIMS, with reference CENTRO 07-0202-FEDER-034164).

Author information

Authors and Affiliations

  1. University of Coimbra, CMUC, Department of Mathematics, Apartado, Coimbra, Portugal

    José Luis Santos

  2. Bitsight, Lisboa, Portugal

    André Oliveira

Authors
  1. José Luis Santos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. André Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to José Luis Santos .

Editor information

Editors and Affiliations

  1. Departamento de Matemática, Instituto Superior de Engenharia do Porto, Porto, Portugal

    Manuel Cruz

  2. Departamento de Análisis Matemático, Estadística e Investigación Operativa y Matemática Aplicada, Universidad de Málaga, Málaga, Spain

    Carlos Parés

  3. ITMATI (Technological Institute for Industrial Mathematics), R&D&i Unit, Santiago de Compostela Spain; Red Española Matemática-Industria (math-in), Santiago de Compostela, Spain

    Peregrina Quintela

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Santos, J.L., Oliveira, A. (2021). Traveling Salesman Problem in a Geographic Information Management System. In: Cruz, M., Parés, C., Quintela, P. (eds) Progress in Industrial Mathematics: Success Stories. SEMA SIMAI Springer Series(), vol 5. Springer, Cham. https://doi.org/10.1007/978-3-030-61844-5_8

Download citation

Publish with us

Policies and ethics

Search

Navigation