{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:25:00Z","timestamp":1743053100908,"version":"3.40.3"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030618438"},{"type":"electronic","value":"9783030618445"}],"license":[{"start":{"date-parts":[[2020,12,21]],"date-time":"2020-12-21T00:00:00Z","timestamp":1608508800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,12,21]],"date-time":"2020-12-21T00:00:00Z","timestamp":1608508800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-61844-5_8","type":"book-chapter","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T11:41:20Z","timestamp":1616154080000},"page":"131-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Traveling Salesman Problem in a Geographic Information Management System"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2727-6774","authenticated-orcid":false,"given":"Jos\u00e9 Luis","family":"Santos","sequence":"first","affiliation":[]},{"given":"Andr\u00e9","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,21]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1101\/gr.10.3.350","volume":"10","author":"R Agarwala","year":"2000","unstructured":"Agarwala, R., Applegate, D.L., Maglott, D., Schuler, G.D., Sch\u00e4ffer, A.A.: A fast and scalable radiation hybrid map construction and integration strategy. Genome Res. 10, 350\u2013364 (2000)","journal-title":"Genome Res."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Angel, R., Caudle, W., Noonan, R., Whinston, A.: Computer-assisted school bus scheduling. Manag. Sci. 18(6), B-279\u2013B-288 (1972)","DOI":"10.1287\/mnsc.18.6.B279"},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s001860050064","volume":"49","author":"N Ascheuer","year":"1999","unstructured":"Ascheuer, N., Gr\u00f6tschel, M., Abdel-Hamid, A.A.A.: Order picking in an automatic warehouse: solving online asymmetric tsps. Math. Methods Oper. Res. 49(3), 501\u2013515 (1999)","journal-title":"Math. Methods Oper. Res."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Bailey, C.A., McLain, T.W., Beard, R.W.: Fuel saving strategies for separated spacecraft interferometry. In: AIAA Guidance, Navigation, and Control Conference (2000)","DOI":"10.2514\/6.2000-4441"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209\u2013219 (2006)","journal-title":"Omega"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM 9(1), 61\u201363 (1962)","journal-title":"J. ACM"},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1145\/321832.321847","volume":"21","author":"M Bellmore","year":"1974","unstructured":"Bellmore, M., Hong, S.: Transformation of multisalesman problem to the standard traveling salesman problem. J. ACM 21(3), 500\u2013504 (1974)","journal-title":"J. ACM"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M Bellmore","year":"1968","unstructured":"Bellmore, M., Nemhauser, G.: The traveling salesman problem: A survey. Oper. Res. 16(3), 538\u2013558 (1968)","journal-title":"Oper. Res."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013448. Springer, Berlin (1976)","DOI":"10.1007\/978-3-642-51565-1_136"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0167-6377(89)90037-0","volume":"8","author":"RG Bland","year":"1989","unstructured":"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\u2013128 (1989)","journal-title":"Oper. Res. Lett."},{"key":"8_CR11","first-page":"193","volume-title":"Discrete Optimization I, volume 4 of Annals of Discrete Mathematics","author":"RE Burkard","year":"1979","unstructured":"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\u2013215. Elsevier, New York (1979)"},{"issue":"9","key":"8_CR12","first-page":"269","volume":"30","author":"RW Calvo","year":"2003","unstructured":"Calvo, R.W., Cordone, R.: A heuristic approach to the overnight security service problem. Comput. Oper. Res. 30(9), 269\u20131287 (2003)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.ejor.2012.06.007","volume":"223","author":"TS Chang","year":"2012","unstructured":"Chang, T.S., Yen, H.M.: City-courier routing and scheduling problems. Eur. J. Oper. Res. 223(2), 489\u2013498 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR14","unstructured":"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)"},{"key":"8_CR15","unstructured":"Dantzig, G., Fulkerson, R., Johnson., S.: Solution of a large-scale traveling-salesman problem. Oper. Res. 2, 393\u2013410 (1954)"},{"key":"8_CR16","unstructured":"Ein alter Commis-voyageur. Der Handlungsreisende wie er sein soll und was er zu thun hat, um Auftr\u00e4ge zu erhalten und eines gl\u00fccklichen Erfolgs in seinen Gesch\u00e4ften gewi\u00df zu sein von einem alten Commis-Voyageur. B.Fr. Voigt Ilmenau (1832) (Reprinted: Verlag Bernd Schramm, Kiel, 1981)"},{"issue":"4","key":"8_CR17","first-page":"163","volume":"8","author":"F Exnar","year":"2011","unstructured":"Exnar, F., Macha\u010d, O.: The travelling salesman problem and its application in logistic practice. WSEAS Trans. Bus. Econ. 8(4), 163\u2013173 (2011)","journal-title":"WSEAS Trans. Bus. Econ."},{"issue":"2","key":"8_CR18","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"GN Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing prob- lems. SIAM J. Comput. 7(2), 178\u2013193 (1978)","journal-title":"SIAM J. Comput."},{"key":"8_CR19","first-page":"92","volume":"32","author":"A Frieze","year":"1979","unstructured":"Frieze, A.: Worst-case analysis of algorithms for travelling salesman problems. Methods Oper. Res. 32, 92 (1979)","journal-title":"Methods Oper. Res."},{"key":"8_CR20","volume-title":"Computers and Intractability","author":"MR Garey","year":"1990","unstructured":"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)"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"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\u201322. ACM, Hershey (1976)","DOI":"10.1145\/800113.803626"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1111\/j.1540-5915.1992.tb00387.x","volume":"23","author":"KC Gilbert","year":"1992","unstructured":"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\u2013259 (1992)","journal-title":"Decis. Sci."},{"issue":"1","key":"8_CR23","doi-asserted-by":"publisher","first-page":"1502242","DOI":"10.1080\/23311916.2018.1502242","volume":"5","author":"N Gunantara","year":"2018","unstructured":"Gunantara, N.: A review of multi-objective optimization: methods and its applications. Cogent Eng. 5(1), 1502242 (2018)","journal-title":"Cogent Eng."},{"issue":"3","key":"8_CR24","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/0377-2217(94)00011-Z","volume":"81","author":"Y GuoXing","year":"1995","unstructured":"GuoXing, Y.: Transformation of multidepot multisalesmen problem to the standard travelling sales- man problem. Eur. J. Oper. Res. 81(3), 557\u2013560 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-48782-8_9","volume-title":"Multiple Criteria Decision Making Theory and Application, volume 177 of Lecture Notes in Economics and Mathematical Systems","author":"P Hansen","year":"1980","unstructured":"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\u2013127. Springer, Berlin (1980)"},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10, 196\u2013210 (1962)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1","key":"8_CR27","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02294091","volume":"43","author":"LJ Hubert","year":"1978","unstructured":"Hubert, L.J., Baker, F.B.: Applications of combinatorial programming to data analysis: the traveling salesman and related problems. Psychometrika 43(1), 81\u201391 (1978)","journal-title":"Psychometrika"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/ICICES.2014.7033850"},{"issue":"3","key":"8_CR29","first-page":"1","volume":"1","author":"O Johnson","year":"2006","unstructured":"Johnson, O., Liu, J.: A traveling salesman approach for predicting protein functions. Source Code Biol. Med. 1(3), 1\u20137 (2006)","journal-title":"Source Code Biol. Med."},{"issue":"9","key":"8_CR30","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1118\/1.2760025","volume":"34","author":"JH Kang","year":"2007","unstructured":"Kang, J.H., Wilkens, J.J., Oelfke, U.: Demonstrationof scan path optimization in proton therapy. Med. Phys. 34(9), 3457\u20133464 (2007)","journal-title":"Med. Phys."},{"issue":"3","key":"8_CR31","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1016\/j.ejor.2005.03.008","volume":"174","author":"I Kara","year":"2006","unstructured":"Kara, I., Bektas, T.: Integer linear programming formulations of multiple salesman problems and its variations. Eur. J. Oper. Res. 174(3), 1449\u20131458 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Korte, B., Vygen, J.: The traveling salesman problem. In: Combinatorial Optimization. Theory and Algorithms, volume 21 of Algorithms and Combinatorics, pp. 473\u2013505. Springer, Berlin (2000)","DOI":"10.1007\/978-3-662-21708-5_21"},{"issue":"2","key":"8_CR34","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The traveling salesman problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2), 231\u2013247 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"8_CR35","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1057\/jors.1980.188","volume":"31","author":"G Laporte","year":"1980","unstructured":"Laporte, G., Nobert, Y.: A cutting planes algorithm for the m-salesmen problem. J. Oper. Res. Soc. 31(11), 1017\u20131023 (1980)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"8_CR36","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1287\/trsc.22.3.161","volume":"22","author":"G Laporte","year":"1988","unstructured":"Laporte, G., Nobert, Y., Taillefer, S.: Solving a family of multi-depot vehicle routing and location \u2013 routing problems. Transp. Sci. 22(3), 161\u2013172 (1988)","journal-title":"Transp. Sci."},{"key":"8_CR37","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-11218-8_6","volume-title":"Advances in Multi-Objective Nature Inspired Computing","author":"T Lust","year":"2010","unstructured":"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\u2013141. Springer, Berlin (2010)"},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"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\u201324. InTech, Rijeka (2010)","DOI":"10.5772\/12909"},{"key":"8_CR39","first-page":"11","volume":"2","author":"K Menger","year":"1932","unstructured":"Menger, K.: Das botenproblem. Ergebnisse eines Mathematischen Kolloquiums 2, 11\u201312 (1932)","journal-title":"Ergebnisse eines Mathematischen Kolloquiums"},{"key":"8_CR40","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C Miller","year":"1960","unstructured":"Miller, C., Tucker, A., Zemlin, R.: Integer programming formulations and traveling salesman problems. J. Assoc. Comput. Mach. 7, 326\u2013329 (1960)","journal-title":"J. Assoc. Comput. Mach."},{"key":"8_CR41","unstructured":"Oliveira, A.: Extens\u00f5es do Problema do Caixeiro Viajante. Dissertation to obtain the Master Degree in Mathematics, specialization area: Statistics, Optimization and Financial Mathematics (in Portuguese). Master\u2019s thesis, University of Coimbra (2015)"},{"key":"8_CR42","unstructured":"Oliveira, A.: O Problema do Caixeiro Viajante. Semin\u00e1rio em Estat\u00edstica, Otimiza\u00e7\u00e3o e Matem\u00e1tica Financeira (in Portuguese). University of Coimbra (2015)"},{"key":"8_CR43","first-page":"93","volume-title":"Optimisation, Econometric and Financial Analysis, volume 9 of Advances in Computational Management Science","author":"AJ Orman","year":"2006","unstructured":"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\u2013108. Springer, Berlin (2006)"},{"key":"8_CR44","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"CH Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.H.: The euclidean travelling salesman problem is np-complete. Theor. Comput. Sci. 4, 237\u2013244 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR45","unstructured":"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\u2013299 (2018)"},{"key":"8_CR46","doi-asserted-by":"crossref","unstructured":"Rao, M.R.: Technical note a note on the multiple traveling salesmen problem. Oper. Res. 28(3-part-i), 628\u2013632 (1980)","DOI":"10.1287\/opre.28.3.628"},{"key":"8_CR47","unstructured":"Reinelt, G.: Tsplib - library of sample instances for the tsp (and related problems). http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/ (2015)"},{"issue":"3","key":"8_CR48","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkrantz","year":"1977","unstructured":"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\u2013581 (1977)","journal-title":"SIAM J. Comput."},{"key":"8_CR49","doi-asserted-by":"crossref","unstructured":"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\u2013879 (1998)","DOI":"10.1109\/WSC.1998.745084"},{"issue":"1","key":"8_CR50","doi-asserted-by":"publisher","first-page":"73","DOI":"10.4018\/ijisscm.2014010105","volume":"7","author":"GKD Saharidis","year":"2014","unstructured":"Saharidis, G.K.D.: Review of solution approaches for the symmetric traveling salesman problem. Int. J. Inf. Syst. Supply Chain Manag. 7(1), 73\u201387 (2014)","journal-title":"Int. J. Inf. Syst. Supply Chain Manag."},{"issue":"1","key":"8_CR51","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.engappai.2003.11.001","volume":"17","author":"HA Saleh","year":"2004","unstructured":"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\u2013122 (2004)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"8_CR52","first-page":"1","volume-title":"Discrete Optimization, volume 12 of Handbooks in Operations Research and Management Science","author":"A Schrijver","year":"2005","unstructured":"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\u201368. Elsevier, New York (2005)"},{"key":"8_CR53","doi-asserted-by":"crossref","unstructured":"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\u20138 (2012)","DOI":"10.1109\/CEC.2012.6256438"},{"key":"8_CR54","unstructured":"The Puzzle Museum. The icosian game. https:\/\/www.puzzlemuseum.com\/month\/picm02\/200207icosian.html. Accessed 08 Nov 2019"},{"key":"8_CR55","unstructured":"The Worlds of David Darling - Encyclopedia of Science. Icosian game. http:\/\/www.daviddarling.info\/encyclopedia\/I\/IcosianGame.html. Accessed 08 Nov 2019"}],"container-title":["SEMA SIMAI Springer Series","Progress in Industrial Mathematics: Success Stories"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61844-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T10:40:52Z","timestamp":1724668852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61844-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,21]]},"ISBN":["9783030618438","9783030618445"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61844-5_8","relation":{},"ISSN":["2199-3041","2199-305X"],"issn-type":[{"type":"print","value":"2199-3041"},{"type":"electronic","value":"2199-305X"}],"subject":[],"published":{"date-parts":[[2020,12,21]]},"assertion":[{"value":"21 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}