{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:36:31Z","timestamp":1771698991076,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642329630","type":"print"},{"value":"9783642329647","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32964-7_39","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T18:49:32Z","timestamp":1345920572000},"page":"388-397","source":"Crossref","is-referenced-by-count":9,"title":["Improving Lin-Kernighan-Helsgaun with Crossover on Clustered Instances of the TSP"],"prefix":"10.1007","author":[{"given":"Doug","family":"Hains","sequence":"first","affiliation":[]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[]},{"given":"Adele","family":"Howe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"39_CR1","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D. Applegate","year":"2003","unstructured":"Applegate, D., Cook, W., Rohe, A.: Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing\u00a015(1), 82\u201392 (2003)","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"39_CR2","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. Mathematical Programming Computation\u00a01(2), 119\u2013163 (2009)","journal-title":"Mathematical Programming Computation"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Mcgeoch, L.A.: The traveling salesman problem: A case study in local optimization. In: Local Search in Combinatorial Optimization, pp. 215\u2013310. John Wiley and Sons (1997)","DOI":"10.2307\/j.ctv346t9c.13"},{"issue":"2","key":"39_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.W.: An effective heuristic algorithm for the traveling-salesman problem. Operations Research\u00a021(2), 498\u2013516 (1973), \n                    \n                      http:\/\/dx.doi.org\/10.2307\/169020","journal-title":"Operations Research"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o, H., Martin, O., St\u00fctzle, T.: Iterated local search. In: Handbook of Metaheuristics, pp. 320\u2013353 (2003)","DOI":"10.1007\/0-306-48056-5_11"},{"issue":"4","key":"39_CR6","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. Physical Review E\u00a059(4), 4667 (1999)","journal-title":"Physical Review E"},{"key":"39_CR7","unstructured":"Neto, D.: Efficient cluster compensation for Lin-Kernighan heuristics. Ph.D. thesis, University of Toronto (1999)"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/0221030","volume":"21","author":"C. Papadimitriou","year":"1992","unstructured":"Papadimitriou, C.: The complexity of the Lin-Kernighan heuristic for the traveling salesman problem. SIAM Journal on Computing\u00a021, 450 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Whitley, D., Hains, D., Howe, A.: Tunneling between optima: partition crossover for the traveling salesman problem. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 915\u2013922. ACM (2009)","DOI":"10.1145\/1569901.1570026"},{"key":"39_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-642-15844-5_57","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"D. Whitley","year":"2010","unstructured":"Whitley, D., Hains, D., Howe, A.: A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol.\u00a06238, pp. 566\u2013575. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN XII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32964-7_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:50:23Z","timestamp":1620129023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32964-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329630","9783642329647"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32964-7_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}