{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:13:30Z","timestamp":1742912010625,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319914459"},{"type":"electronic","value":"9783319914466"}],"license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"unspecified","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":[[2019]]},"DOI":"10.1007\/978-3-319-91446-6_33","type":"book-chapter","created":{"date-parts":[[2018,5,26]],"date-time":"2018-05-26T00:54:03Z","timestamp":1527296043000},"page":"348-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Effective Algorithm of Simulated Annealing for the Symmetric Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Mariusz","family":"Makuchowski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"33_CR1","volume-title":"In Pursuit of the Traveling Salesman Mathematics at the Limits of Computation","author":"W Cook","year":"2014","unstructured":"Cook, W.: In Pursuit of the Traveling Salesman Mathematics at the Limits of Computation. Princeton University Press, Princeton (2014)"},{"key":"33_CR2","unstructured":"Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications, Lectures Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg (1994)"},{"key":"33_CR3","volume-title":"The Traveling Salesman Problem","author":"EL Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem. Wiley, New York (1985)"},{"issue":"2","key":"33_CR4","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR6","first-page":"127","volume":"13","author":"K Mak","year":"1992","unstructured":"Mak, K., Morton, A.: A modified Lin-Kernighan traveling salesman heuristic. ORSA J. Comput. 13, 127\u2013132 (1992)","journal-title":"ORSA J. Comput."},{"issue":"2","key":"33_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/scj.4690230209","volume":"23","author":"Y Matsuyama","year":"1992","unstructured":"Matsuyama, Y.: Self-organization neural networks and various Euclidean traveling salesman problems. Syst. Comput. Japan 23(2), 101\u2013112 (1992)","journal-title":"Syst. Comput. Japan"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1111\/j.1475-3995.1999.tb00175.x","volume":"6","author":"A Modares","year":"1999","unstructured":"Modares, A., Somhom, S., Enkawa, T.: A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems. Int. Trans. Oper. Res. 6, 591\u2013606 (1999)","journal-title":"Int. Trans. Oper. Res."},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/0377-2217(95)00077-1","volume":"93","author":"S Chatterjee","year":"1996","unstructured":"Chatterjee, S., Carrera, C., Lynch, L.: Genetic algorithms and traveling salesman problems. Eur. J. Oper. Res. 93, 490\u2013510 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR10","unstructured":"Grefenstette, J.J., Gopal, R., Rosmaita, B., Van Gucht, D.: Genetic algorithms for the traveling salesman problem. In: Grefenstette, J.J. (ed.) Proceedings of an International Conference on Genetic Algorithms and Their Applications, pp. 160\u2013168. Carnegie-Mellon University (1985)"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0377-2217(96)00334-7","volume":"104","author":"S Tsubakitani","year":"1998","unstructured":"Tsubakitani, S., Evans, J.R.: An empirical study of a new metaheuristic for the traveling salesman problem. Eur. J. Oper. Res. 104, 113\u2013128 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02022093","volume":"21","author":"M Malek","year":"1989","unstructured":"Malek, M., Guruswamy, M., Pandya, M., Owens, H.: Serial and Parallel simulated annealing and Tabu search algorithms for the traveling salesman problem. Annal. Oper. Res. 21, 59\u201384 (1989)","journal-title":"Annal. Oper. Res."},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimisation by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"issue":"9","key":"33_CR14","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"33_CR15","unstructured":"Reinhelt, G.: Set of TSP instances: TSPLIB. \nhttp:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/tsp\/"},{"key":"33_CR16","unstructured":"Bosch, R., Lisa, M.: TSP Challenge, February 2009. \nhttp:\/\/www.math.uwaterloo.ca\/tsp\/data\/ml\/monalisa.html"},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M Padberg","year":"1991","unstructured":"Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the solution of large-scale traveling salesman problems. SIAM Rev. 33, 60\u2013100 (1991)","journal-title":"SIAM Rev."},{"key":"33_CR18","unstructured":"DePuy, G.W., Whitehouse, G.E., Moraga, R.J.: Using the meta-raps approach to solve combinatorial problems. In: Proceedings of the 2002 Industrial Engineering Research Conference, Orlando, 19\u201321 May 2002"},{"key":"33_CR19","series-title":"Princeton Series in Applied Mathematics","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"D Applegate","year":"2006","unstructured":"Applegate, D., Bixby, R., Chvatal, V., Cook, W.: The Traveling Salesman Problem: A Computational Study. Princeton Series in Applied Mathematics. Princeton University Press, Princeton (2006)"},{"key":"33_CR20","unstructured":"Tamaki, H.: Alternating cycle contribution: A tour-merging strategy for the travelling salesman problem, Max-Planck Institute Research Report, MPI-I-2003-1-007, Saarbucken, Germany (2003)"}],"container-title":["Advances in Intelligent Systems and Computing","Contemporary Complex Systems and Their Dependability"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91446-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,26]],"date-time":"2018-06-26T06:30:44Z","timestamp":1529994644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91446-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"ISBN":["9783319914459","9783319914466"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91446-6_33","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2018,5,27]]}}}