{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:15:09Z","timestamp":1778249709545,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540650782","type":"print"},{"value":"9783540496724","type":"electronic"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056923","type":"book-chapter","created":{"date-parts":[[2006,7,31]],"date-time":"2006-07-31T00:49:17Z","timestamp":1154306957000},"page":"813-822","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Repair and brood selection in the traveling salesman problem"],"prefix":"10.1007","author":[{"given":"Tim","family":"Walters","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,3]]},"reference":[{"key":"80_CR1","unstructured":"Altenberg, L. The Evolution of Evolvability in Genetic Programming. In Kinnear, K. E., Jr.(ed.):Advances in Genetic Programming. MIT Press(1994) 47\u201374"},{"key":"80_CR2","first-page":"91","volume-title":"Experiments on Traveling Salesman Heuristics","author":"J. L. Bentley","year":"1990","unstructured":"Bentley, J. L.: Experiments on Traveling Salesman Heuristics. In: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '90), San Francisco, CA, USA. SIAM (1990) 91\u201399"},{"key":"80_CR3","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-58484-6_251","volume-title":"Parallel Problem Solving From Nature \u2014 PPSN III","author":"J. Dzubera","year":"1994","unstructured":"Dzubera, J., and Whitley, D.: Advanced Correlation Analysis of Operators for the Traveling Salesman Problem. In: Parallel Problem Solving From Nature \u2014 PPSN III, Jerusalem (October, 1994). Springer Verlag (1994) 68\u201377"},{"key":"80_CR4","first-page":"890","volume-title":"Parallel Problem Solving From Nature \u2014 PPSN IV, Berlin, Germany","author":"B. Freisleben","year":"1996","unstructured":"Freisleben, B., and Merz, P.: New Genetic Local Search Operators for the Traveling Salesman Problem. In: Parallel Problem Solving From Nature \u2014 PPSN IV, Berlin, Germany (September 22\u201326, 1996). Springer-Verlag, Heidelberg (1996) 890\u2013899"},{"key":"80_CR5","first-page":"171","volume-title":"Asparagos96 and the Traveling Salesman Problem","author":"M. Gorges-Schleuter","year":"1997","unstructured":"Gorges-Schleuter, M.: Asparagos96 and the Traveling Salesman Problem. In: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, Indianapolis, Indiana (April 13\u201316, 1997). IEEE Press (1997) 171\u2013174"},{"key":"80_CR6","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/BFb0032050","volume-title":"Automata, Languages and Programming","author":"D. S. Johnson","year":"1990","unstructured":"Johnson, D. S.: Local Optimization and the Traveling Salesman Problem. In: Automata, Languages and Programming, 17th International Colloquium, Warwick University, England. Springer-Verlag, Berlin (1990) 446\u2013461"},{"key":"80_CR7","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., and Kernighan, B. W.: An Effective Heuristic Algorithm for the Traveling-Salesman Problem. Operations Research, 21 (1973) 498\u2013516","journal-title":"Operations Research"},{"key":"80_CR8","first-page":"159","volume-title":"Genetic Local Search for the TSP: New Results","author":"P. Merz","year":"1997","unstructured":"Merz, P., and Freisleben, B.: Genetic Local Search for the TSP: New Results. In: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, Indianapolis, Indiana (April 13\u201316, 1997). IEEE Press (1997) 159\u2013164"},{"key":"80_CR9","unstructured":"Michalewicz, Z. Repair Algorithms. In B\u00e4ck, T., Fogel, D. B. and Michalewicz, Z.(eds.): Handbook of Evolutionary Computation. Institute of Physics Publishing and Oxford University Press(1997) C5.4:1\u20135"},{"key":"80_CR10","first-page":"450","volume-title":"Edge Assembly Crossover: A High-power Genetic Algorithm for the Traveling Salesman Problem","author":"Y. Nagata","year":"1997","unstructured":"Nagata, Y., and Kobayashi, S.: Edge Assembly Crossover: A High-power Genetic Algorithm for the Traveling Salesman Problem. In: Proceedings of the Seventh International Conference on Genetic Algorithms, East Lansing, Michigan (July 19\u201323, 1997). Morgan Kaufmann, San Francisco (1997) 450\u2013457"},{"key":"80_CR11","first-page":"650","volume-title":"Genetic Algorithms, Combinatorial Optimization, and Feasibility Constraints","author":"D. Orvosh","year":"1993","unstructured":"Orvosh, D., and Davis, L.: Shall We Repair? Genetic Algorithms, Combinatorial Optimization, and Feasibility Constraints. In: Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA'93), San Mateo, California. Morgan Kaufmann, San Mateo (1993) 650"},{"issue":"4","key":"80_CR12","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB-A Traveling Salesman Problem Library. ORSA Journal on Computing, 3 (4) (1991) 376\u2013384","journal-title":"ORSA Journal on Computing"},{"key":"80_CR13","volume-title":"Lecture Notes in Computer Science, Vol. 840","author":"G. Reinelt","year":"1994","unstructured":"Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Lecture Notes in Computer Science, Vol. 840. Springer-Verlag, Heidelberg (1994)"},{"key":"80_CR14","first-page":"271","volume-title":"Foundations of Genetic Algorithms 3, Estes Park, Colorado","author":"W. A. Tackett","year":"1994","unstructured":"Tackett, W. A.: Greedy Recombination and Genetic Search on the Space of Computer Programs. In: Foundations of Genetic Algorithms 3, Estes Park, Colorado. Morgan Kaufmann, San Francisco (1994) 271\u2013297"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN V"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056923","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:40:37Z","timestamp":1778247637000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0056923"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650782","9783540496724"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0056923","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"3 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}