{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:42:24Z","timestamp":1725514944888},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540724575"},{"type":"electronic","value":"9783540724582"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72458-2_32","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T21:15:45Z","timestamp":1182806145000},"page":"260-266","source":"Crossref","is-referenced-by-count":2,"title":["A Memetic-Clustering-Based Evolution Strategy for Traveling Salesman Problems"],"prefix":"10.1007","author":[{"given":"Yuping","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jinhua","family":"Qin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"32_CR1","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1109\/TEVC.2002.804321","volume":"6","author":"S. Jung","year":"2002","unstructured":"Jung, S., Moon, B.R.: Toward minimal restriction of renetic coding and crossovers for the 2-D eunclidean TSP. IEEE Trans. on Evolutionary Computation\u00a06(6), 557\u2013565 (2002)","journal-title":"IEEE Trans. on Evolutionary Computation"},{"issue":"6","key":"32_CR2","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/4235.974843","volume":"5","author":"R. Baraglia","year":"2001","unstructured":"Baraglia, R., Hidalgo, J.I., Perego, R.: A hybrid Hheuristic for the traveling salesman problem. IEEE Trans. on Evolutionary Computation\u00a05(6), 613\u2013622 (2001)","journal-title":"IEEE Trans. on Evolutionary Computation"},{"key":"32_CR3","first-page":"10","volume-title":"Proc. 8th Annu. ACM Symp. Theory of Computing","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete geometric problems. In: Proc. 8th Annu. ACM Symp. Theory of Computing, pp. 10\u201322. ACM Press, New York (1976)"},{"key":"32_CR4","first-page":"3","volume-title":"Proc. 33th IEEE Symp. Foundations of Computer Science","author":"S. Arora","year":"1992","unstructured":"Arora, S., Lund, C., Motwani, R., et al.: Proof verification and intractability of appproximation problems. In: Proc. 33th IEEE Symp. Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, pp. 3\u201322. IEEE Press, Los Alamitos (1992)"},{"key":"32_CR5","first-page":"321","volume-title":"Proc. Genetic and Evolutionary computation Conf.","author":"K. Katayama","year":"1999","unstructured":"Katayama, K., Narihisa, H.: Iterated local search approach using genetic trasformation to the traveling salesman problem. In: Proc. Genetic and Evolutionary computation Conf., New York, USA, pp. 321\u2013328. Morgan Kaufmann, San Francisco (1999)"},{"key":"32_CR6","first-page":"450","volume-title":"Proc. 7th Int. Conf. Genetic Algorithm","author":"Y. Nagata","year":"1997","unstructured":"Nagata, Y., Kobayashi, S.: Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem. In: Proc. 7th Int. Conf. Genetic Algorithm, pp. 450\u2013457. Morgan Kaufmann, San Mateo (1997)"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 446\u2013461. Springer, Heidelberg (1990)"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/3-540-61723-X_1052","volume-title":"Parallel Problem Solving from Nature - PPSN IV","author":"B. Freisleben","year":"1996","unstructured":"Freisleben, B., Merz, P.: New genetic local search operators for the traveling salesman problem. In: Ebeling, W., et al. (eds.) PPSN 1996. LNCS, vol.\u00a01141, pp. 616\u2013621. Springer, Heidelberg (1996)"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1109\/ICEC.1997.592288","volume-title":"Proc. of the 1997 International Conferenece on Evolutionary Computation","author":"P. Merz","year":"1997","unstructured":"Merz, P., Freisleben, B.: Genetic local search for the TSP:New results. In: Proc. of the 1997 International Conferenece on Evolutionary Computation, pp. 159\u2013163. IEEE Press, Piscataway (1997)"},{"issue":"2","key":"32_CR10","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Operations Research\u00a021(2), 495\u2013516 (1973)","journal-title":"Operations Research"},{"issue":"3","key":"32_CR11","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flyn, P.J.: Data clustering: A review. ACM Computing Survey\u00a031(3), 264\u2013323 (1999)","journal-title":"ACM Computing Survey"},{"key":"32_CR12","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionay algorithms in theory and practice","author":"T. B\u00e4ck","year":"1996","unstructured":"B\u00e4ck, T.: Evolutionay algorithms in theory and practice. Oxford Univ. Press, New York (1996)"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Knowledge Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72458-2_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T00:28:58Z","timestamp":1629073738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72458-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540724575","9783540724582"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72458-2_32","relation":{},"subject":[]}}