{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:21:58Z","timestamp":1743063718532},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584841"},{"type":"electronic","value":"9783540490012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58484-6_262","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:24:23Z","timestamp":1330273463000},"page":"180-188","source":"Crossref","is-referenced-by-count":11,"title":["A modified edge recombination operator for the Travelling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Anthony","family":"Yiu-Cheung Tang","sequence":"first","affiliation":[]},{"given":"Kwong-Sak","family":"Leung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"18_CR1","unstructured":"Baker, J. (1987). Reducing bias and inefficiency in the selection algorithm. Genetic algorithms and their applications: Proceedings of the Second International Conference on Genetic Algorithms. Lawrence Erlbaum Associates, Publishers."},{"key":"18_CR2","unstructured":"Bixby, B., and Reinelt, G. (1990). TSPLIB 1.1."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"De Jong, K. A. (1993). Genetic algorithms are not function optimizers. Foundations of Genetic Algorithms 2. Morgan Kaufmann.","DOI":"10.1016\/B978-0-08-094832-4.50006-4"},{"key":"18_CR4","unstructured":"Grefenstette, J. J. (1987). Incorporating problem specific knowledge into genetic algorithms. Genetic Algorithms and Simulated Annealing. Pitman."},{"key":"18_CR5","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 Kernighan, G. W. (1973). An efficient heuristic algorithm for the traveling salesman problem. Operations Research 21:498\u2013516.","journal-title":"Operations Research"},{"key":"18_CR6","unstructured":"Mathias, K., and Whitley, D. (1992). Genetic operators, the fitness landscape and the traveling salesman problem. Parallel Problem Solving from Nature, 2. Elsevier Science Publishers B.V."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M. Padberg","year":"1991","unstructured":"Padberg, M., and Rinaldi, G. (1991). A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. S1AM Review 33: 60\u2013100.","journal-title":"S1AM Review"},{"key":"18_CR8","unstructured":"Starkweather, T., McDaniel, S., Whitley, D., and Whitley, C. (1991). A comparison of genetic sequencing operators. Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann."},{"key":"18_CR9","volume-title":"The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best","author":"D. Whitley","year":"1989","unstructured":"Whitley, D. (1989). The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN III"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58484-6_262.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:22:11Z","timestamp":1605648131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58484-6_262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584841","9783540490012"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-58484-6_262","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}