{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T21:10:21Z","timestamp":1741986621983,"version":"3.38.0"},"publisher-location":"Vienna","reference-count":14,"publisher":"Springer Vienna","isbn-type":[{"type":"print","value":"9783211830871"},{"type":"electronic","value":"9783709164921"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-3-7091-6492-1_53","type":"book-chapter","created":{"date-parts":[[2011,12,4]],"date-time":"2011-12-04T05:33:01Z","timestamp":1322976781000},"page":"241-244","source":"Crossref","is-referenced-by-count":1,"title":["Breeding Perturbed City Coordinates and Fooling Travelling Salesman Heuristic Algorithms"],"prefix":"10.1007","author":[{"given":"R.","family":"Bradwell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. P.","family":"Williams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. L.","family":"Valenzuela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"53_CR1","unstructured":"D.J. Cavicchio. Adaptive search using simulated evolution. Unpublished doctorial dissertation, University of Michigan, Ann Arbor"},{"key":"53_CR2","volume-title":"Global strategies for augmenting the efficiency of TSP heuristics","author":"B Codenotti","year":"1993","unstructured":"B. Codenotti L. Margara, G. Manzini and G Resta. Global strategies for augmenting the efficiency of TSP heuristics, volume 709. Springer-Verlag, Berlin, 1993."},{"issue":"2","key":"53_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1287\/ijoc.8.2.125","volume":"8","author":"B Codenotti","year":"1996","unstructured":"B. Codenotti L. Margara, G. Manzini and G. Resta. Perturbation: an efficient technique for the solution of very large instances of the euclidean TSP. IFORMS Journal on Computing, 8(2):125, Spring 1996.","journal-title":"IFORMS Journal on Computing"},{"key":"53_CR4","doi-asserted-by":"crossref","unstructured":"D.S. Johnson. Local optimization and the traveling salesman problem. In Automata Languages and Programming: 17th International Colloquium Proceedings, 1990.","DOI":"10.1007\/BFb0032050"},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"M. Held and R.M. Karp. The travelling salesman problem and minimum spanning trees. Oper. Res, 18:1138\u20131162.","DOI":"10.1287\/opre.18.6.1138"},{"key":"53_CR6","doi-asserted-by":"crossref","unstructured":"M. Held and R.M. Karp. The travelling salesman problem and minimum spanning trees: part ii. Maths. Programming, 1:6\u201325.","DOI":"10.1007\/BF01584070"},{"key":"53_CR7","unstructured":"J.H Holland. Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor"},{"issue":"3","key":"53_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/moor.2.3.209","volume":"2","author":"RM Karp","year":"1977","unstructured":"R.M. Karp. Probabilistic analysis of partitioning algorithm for the travelling-salesman problem in the plane. Mathematics of Operations Research, 2(3):209\u2013224, August 1977.","journal-title":"Mathematics of Operations Research"},{"key":"53_CR9","unstructured":"L.A. McGeoch D.S. Johnson and E.E. Rothberg. Asymptotic experimental analysis for the Held-Karp traveling salesman bound. In Proceeding 1996 ACM-SIAM symp. on Discrete Algorithms, 1996."},{"key":"53_CR10","unstructured":"G. Syswerda. Uniform crossover in genetic algorithms. In Proceedings of the Third International Conference on Genetic Algorithms, Hillsdale, NJ, 1996. Lawrence Erlbaum Associates."},{"key":"53_CR11","doi-asserted-by":"crossref","unstructured":"C.L. Valenzuela and A.J. Jones. A parallel implementation of evolutionary divide and conquer for the TSP. In Proceedings of the First IEE\/IEEE conference on Genetic ALgorithms in Engineering Systems: Innovations and Applications (GALESIA), pages 499\u2013504, Sheffield, U.K., September 1995.","DOI":"10.1049\/cp:19951098"},{"key":"53_CR12","doi-asserted-by":"crossref","unstructured":"C.L. Valenzuela and A.J. Jones. Estimating the Held-Karp lower bound for the geometric TSP. European Journal of Operational Research, to appear.","DOI":"10.1016\/S0377-2217(96)00214-7"},{"issue":"4","key":"53_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1162\/evco.1993.1.4.313","volume":"1","author":"CL Valenzuela","year":"1995","unstructured":"C.L. Valenzuela and A.J. Jones. Evolutionary divide and conquer (I): a novel genetic approach to the TSP. Evolutionary Computation, 1(4):313\u2013333, 1995.","journal-title":"Evolutionary Computation"},{"key":"53_CR14","doi-asserted-by":"crossref","unstructured":"C.L. Valenzuela. Evolutionary Divide and Conquer: a Novel Genetic approach to the TSP. PhD thesis, University of London, 1995.","DOI":"10.1049\/cp:19951098"}],"container-title":["Artificial Neural Nets and Genetic Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-7091-6492-1_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T20:52:27Z","timestamp":1741985547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-7091-6492-1_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783211830871","9783709164921"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-7091-6492-1_53","relation":{},"subject":[],"published":{"date-parts":[[1998]]}}}