{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:06:05Z","timestamp":1777539965983,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1007\/s10732-005-0713-6","type":"journal-article","created":{"date-parts":[[2005,6,28]],"date-time":"2005-06-28T16:37:05Z","timestamp":1119976625000},"page":"135-146","source":"Crossref","is-referenced-by-count":9,"title":["A Note on Single Alternating Cycle Neighborhoods for the TSP"],"prefix":"10.1007","volume":"11","author":[{"given":"Birger","family":"Funke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tore","family":"Gr\u00fcnert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Irnich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"713_CR1","volume-title":"Local Search in Combinatorial Aptimization","author":"E. Aarts","year":"1997","unstructured":"Aarts, E. and J. Lenstra. (1997). Local Search in Combinatorial Aptimization. Wiley, Chichester."},{"issue":"1\u20132","key":"713_CR2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-003-0440-4","volume":"97","author":"D. Applegate","year":"2003a","unstructured":"Applegate, D., R. Bixby, V. Chvatal, and W. Cook. (2003a). \u201cImplementing the Dantzig-Fulkerson-Johnson Algorithm for Large Traveling Salesman Problems.\u201d Mathematical Programming, Series B 97(1\u20132), 91\u2013153.","journal-title":"Mathematical Programming, Series B"},{"issue":"1","key":"713_CR3","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D. Applegate","year":"2003b","unstructured":"Applegate, D., W. Cook, and A. Rohe. (2003b). \u201cChained Lin-Kernighan for Large Traveling Salesman Problems.\u201d INFORMS Journal on Computing 15(1), 82\u201392.","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"713_CR4","first-page":"387","volume":"4","author":"J. Bentley","year":"1992","unstructured":"Bentley, J. (1992). \u201cFast Algorithms for Geometric Traveling Salesman Problems.\u201d Operations Research Society of America 4(4), 387\u2013411.","journal-title":"Operations Research Society of America"},{"key":"713_CR5","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1006\/jagm.1995.1018","volume":"18","author":"M. Fredman","year":"1995","unstructured":"Fredman, M., D. Johnson, L. McGeoch, and G. Ostheimer. (1995). \u201cData Structures for Traveling Salesman.\u201d Journal of Algorithms 18, 432\u2013479.","journal-title":"Journal of Algorithms"},{"key":"713_CR6","unstructured":"Glover, F. (1991). \u201cMultilevel Tabu Search and Embedded Search Neighborhoods for the Travling Salesman Problem.\u201d Technical report, US West Chair in Systems Science, University of Colorado, Boulder, School of Business, Campus Box 419, Boulder, CO, 80309."},{"key":"713_CR7","doi-asserted-by":"crossref","unstructured":"Glover, F. (1992). \u201cNew Ejection Chain and Alternating Path Methods for Traveling Salesman Problems.\u201d In O. Balci, R. Sharda, and S. Zenios (eds.), Computer Science and Operations Research\u2014New Developments in Their Interfaces. Pergamon Press, pp. 491\u2013508.","DOI":"10.1016\/B978-0-08-040806-4.50037-X"},{"key":"713_CR8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F. Glover","year":"1996","unstructured":"Glover, F. (1996). \u201cEjection Chains, Reference Structures and Alternating Path Structures for Traveling Salesman Problems.\u201d Discrete Applied Mathematics 65, 223\u2013253.","journal-title":"Discrete Applied Mathematics"},{"key":"713_CR9","volume-title":"The Traveling Salesman Problem and Its Variations, volume 12 of Combinatorial Optimization","year":"2002","unstructured":"Gutin, G. and A. Punnen (eds.). (2002). The Traveling Salesman Problem and Its Variations, volume 12 of Combinatorial Optimization. Kluwer, Dordrecht."},{"key":"713_CR10","first-page":"215","volume-title":"Local Search in Combinatorial Optimization, chapter 8","author":"D. Johnson","year":"1997","unstructured":"Johnson, D. and L. McGeoch. (1997). \u201cThe Traveling Salesman Problem: A Case Study in Local Optimization.\u201d In E. Aarts and J. Lenstra (eds.), Local Search in Combinatorial Optimization, chapter 8. Wiley, Chichester, pp. 215\u2013310."},{"key":"713_CR11","volume-title":"The Traveling Salesman Problem and Its Variations, volume 12 of Combinatorial Optimization","author":"D. Johnson","year":"2002","unstructured":"Johnson, D. and L. McGeoch. (2002). \u201cExperimental Analysis of Heuristics for the stsp.\u201d In G. Gutin and A. Punnen (eds.), The Traveling Salesman Problem and Its Variations, volume 12 of Combinatorial Optimization. Kluwer, Dordrecht."},{"key":"713_CR12","volume-title":"The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization","year":"1985","unstructured":"Lawler, E., J. Lenstra, A. Rinnooy Kan, and D. Shmoys. (eds.). (1985). The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics. Wiley, Chichester."},{"key":"713_CR13","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S. and B. Kernighan. (1973). \u201cAn Effective Heuristic Algorithm for the Traveling-Salesman Problem.\u201d Operations Research 21, 498\u2013516.","journal-title":"Operations Research"},{"key":"713_CR14","volume-title":"Traveling Salesman-Type Problems and their Relation to the Logistics of Regional Blood Banking","author":"I. Or","year":"1976","unstructured":"Or, I. (1976). \u201cTraveling Salesman-Type Problems and their Relation to the Logistics of Regional Blood Banking.\u201d PhD thesis, Department of Industrial Engineering and Management Sciences. Northwestern University, Evanston, IL."},{"key":"713_CR15","first-page":"309","volume-title":"The Traveling Salesman Problem and Its Variations, volume 12 of Combinatorial Optimization, chapter 8","author":"C. Rego","year":"2002","unstructured":"Rego, C. and F. Glover. (2002). \u201cLocal Search and Metaheuristics.\u201d In G. Gutin and A. Punnen (eds.), The Traveling Salesman Problem and Its Variations, volume 12 of Combinatorial Optimization, chapter 8. Kluwer, Dordrecht, pp. 309\u2013368."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-0713-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-005-0713-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-0713-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:26Z","timestamp":1559242466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-005-0713-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["713"],"URL":"https:\/\/doi.org\/10.1007\/s10732-005-0713-6","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}