{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:46:43Z","timestamp":1773798403463,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319992525","type":"print"},{"value":"9783319992532","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-99253-2_8","type":"book-chapter","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T06:14:41Z","timestamp":1534832081000},"page":"95-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Efficient Recombination in the Lin-Kernighan-Helsgaun Traveling Salesman Heuristic"],"prefix":"10.1007","author":[{"given":"Renato","family":"Tin\u00f3s","sequence":"first","affiliation":[]},{"given":"Keld","family":"Helsgaun","sequence":"additional","affiliation":[]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,22]]},"reference":[{"key":"8_CR1","unstructured":"Cook, W.: TSP test data (2009). http:\/\/www.math.uwaterloo.ca\/tsp\/data\/index.html"},{"key":"8_CR2","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation","author":"W Cook","year":"2011","unstructured":"Cook, W.: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton (2011)"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1057\/jors.2010.116","volume":"62","author":"D Hains","year":"2011","unstructured":"Hains, D., Whitley, D., Howe, A.: Revisiting the big valley search space structure in the TSP. J. Oper. Res. Soc. 62(2), 305\u2013312 (2011)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"8_CR4","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."},{"issue":"2\u20133","key":"8_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"Helsgaun, K.: General k-opt submoves for the Lin-Kernighan TSP heuristic. Math. Program. Comput. 1(2\u20133), 119\u2013163 (2009)","journal-title":"Math. Program. Comput."},{"key":"8_CR6","unstructured":"Helsgaun, K.: An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems. Roskilde University, Technical report (2017)"},{"key":"8_CR7","unstructured":"Helsgaun, K.: LKH (2018). http:\/\/www.akira.ruc.dk\/~keld\/research\/LKH\/"},{"key":"8_CR8","unstructured":"Johnson, D., McGeoch, L., Glover, F., Rego, C.: 8th DIMACS implementation challenge: the traveling salesman problem (2013). http:\/\/dimacs.rutgers.edu\/Challenges\/TSP\/"},{"issue":"2","key":"8_CR9","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.W.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"issue":"4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"4667","DOI":"10.1103\/PhysRevE.59.4667","volume":"59","author":"A M\u00f6bius","year":"1999","unstructured":"M\u00f6bius, A., Freisleben, B., Merz, P., Schreiber, M.: Combinatorial optimization by iterative partial transcription. Phys. Rev. E 59(4), 4667\u20134674 (1999)","journal-title":"Phys. Rev. E"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-31471-6_1","volume-title":"Artificial Evolution","author":"G Ochoa","year":"2016","unstructured":"Ochoa, G., Veerapen, N., Whitley, D., Burke, E.K.: The multi-funnel structure of TSP fitness landscapes: a visual exploration. In: Bonnevay, S., Legrand, P., Monmarch\u00e9, N., Lutton, E., Schoenauer, M. (eds.) EA 2015. LNCS, vol. 9554, pp. 1\u201313. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31471-6_1"},{"key":"8_CR12","first-page":"51","volume-title":"Foundations of Genetic Algorithms","author":"N Radcliffe","year":"1995","unstructured":"Radcliffe, N., Surry, P.: Fitness variance of formae and performance predictions. In: Whitley, D., Vose, M. (eds.) Foundations of Genetic Algorithms, vol. 3, pp. 51\u201372. Morgan Kaufmann, Burlington (1995)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Tin\u00f3s, R., Whitley, D., Chicano, F.: Partition crossover for pseudo-Boolean optimization. In: Proceedings of FOGA XIII, pp. 137\u2013149 (2015)","DOI":"10.1145\/2725494.2725497"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Tin\u00f3s, R., Whitley, D., Ochoa, G.: A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Submitted to Evolutionary Computation (2018)","DOI":"10.1162\/evco_a_00254"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Tin\u00f3s, R., Zhao, L., Chicano, F., Whitley, D.: NK hybrid genetic algorithm for clustering. IEEE Trans. Evol. Comput., 13 p. (2018). https:\/\/doi.org\/10.1109\/TEVC.2018.2828643","DOI":"10.1109\/TEVC.2018.2828643"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1007\/978-3-319-45823-6_93","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"N Veerapen","year":"2016","unstructured":"Veerapen, N., Ochoa, G., Tin\u00f3s, R., Whitley, D.: Tunnelling crossover networks for the asymmetric TSP. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 994\u20131003. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_93"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Whitley, D., Hains, D., Howe, A.: Tunneling between optima: partition crossover for the TSP. In: Proceedings of GECCO 2009, pp. 915\u2013922 (2009)","DOI":"10.1145\/1569901.1570026"},{"key":"8_CR18","unstructured":"Whitley, D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesmen: the genetic edge recombination operator. In: Proceedings of ICGA 1989, pp. 133\u2013140 (1989)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99253-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T13:30:13Z","timestamp":1571751013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99253-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319992525","9783319992532"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99253-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}