{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T02:07:07Z","timestamp":1774663627835,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540434320","type":"print"},{"value":"9783540460046","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46004-7_16","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T21:43:59Z","timestamp":1183412639000},"page":"153-162","source":"Crossref","is-referenced-by-count":19,"title":["Evolutionary Computational Approaches to Solving the Multiple Traveling Salesman Problem Using a Neighborhood Attractor Schema"],"prefix":"10.1007","author":[{"given":"Donald","family":"Sofge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Schultz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth","family":"De Jong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R.E. Bellman","year":"1962","unstructured":"Bellman, R.E., "Dynamic programming treatment of the traveling salesman problem", Journal of the ACM, 9:61\u201363 (1962)","journal-title":"Journal of the ACM"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M. Bellmore","year":"1968","unstructured":"Bellmore, M. and G.L. Nemhauser, "The traveling salesman problem: a survey", Operations Res. 16, 538\u2013558 (1968)","journal-title":"Operations Res"},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2.3.209","volume":"2","author":"R.M. Karp","year":"1977","unstructured":"Karp, R.M., "Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane", Math. of Operations Research, 2:209\u2013224 (1977)","journal-title":"Math. of Operations Research"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"C.H. Papadamitriou","year":"1977","unstructured":"Papadamitriou, C.H., "The Euclidean traveling salesman problem is NP-complete", Theoretical Computer Science, 4:237\u2013244 (1977)","journal-title":"Theoretical Computer Science"},{"key":"16_CR5","volume-title":"The traveling salesman problem","author":"E.L. Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G and D.B. Shmoys. The traveling salesman problem. Wiley, New York (1985)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Arora, S., "Nearly linear time approximation schemes for Euclidean TSP and other geometric problems", In 38th Annual Symposium on Foundations of Computer Science, pages 554\u2013563, Miami Beach, Florida, 20\u201322 October (1997)","DOI":"10.1109\/SFCS.1997.646145"},{"key":"16_CR7","first-page":"493","volume":"3","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E., "Messy genetic algorithms: Motivation, Analysis, and First results", Complex Systems, Vol. 3, pp. 493\u2013530 (1989)","journal-title":"Complex Systems"},{"key":"16_CR8","unstructured":"Jog, P., Suh, J.Y., and D. Van Gucht, "The Effects of Population Size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem", Proc. of the 3rd Intl. Conference on Genetic Algorithms, pp. 110\u2013115, Morgan Kaufmann, (1989)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Julstrom, B.A., "Insertion Decoding Algorithms and Initial Tours in a Weight-Coded GA for TSP", Genetic Programming 1998: Proc. of the Third Annual Conference, pp. 528\u2013534, Morgan Kaufmann, 22\u201325 (1998)","DOI":"10.1145\/330560.330830"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/S0031-3203(99)00216-2","volume":"34","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., and N. Mladenovi\u00e6, \u201cJ-Means: A new local search heuristic for minimum sum-of-squares clustering\u201d, Pattern Recognition, Vol. 34 (2) 405\u2013413, 2001.","journal-title":"Pattern Recognition"},{"key":"16_CR11","unstructured":"De Jong, K., Course on Evolutionary Computation, George Mason University, (1998)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Kennedy, J. and R.C. Eberhart, "Particle Swarm Optimization", Proc. IEEE Intl. Conf. on Neural Networks, pp. IV:1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"16_CR13","unstructured":"Eberhart, R.C., and Y. Shi, "Evolving Artificial Neural Networks", Proc. Intl. Conf. on Neural Networks and the Brain-Beijing (1998)"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46004-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T21:55:14Z","timestamp":1556574914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46004-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434320","9783540460046"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46004-7_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}