{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:27Z","timestamp":1725566667404},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163876"},{"type":"electronic","value":"9783642163883"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16388-3_12","type":"book-chapter","created":{"date-parts":[[2010,9,27]],"date-time":"2010-09-27T07:49:05Z","timestamp":1285573745000},"page":"108-116","source":"Crossref","is-referenced-by-count":5,"title":["An Efficient Genetic Algorithm for the Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Guangfu","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengjun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiacheng","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanpeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/S0305-0548(02)00050-3","volume":"30","author":"I.-C. Choi","year":"2003","unstructured":"Choi, I.-C., Kim, S.-I., Kim, H.-S.: A genetic algorithm with a mixed region search for the asymmetric traveling saleaman problem. Computers & Operations Research\u00a030, 773\u2013786 (2003)","journal-title":"Computers & Operations Research"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/S0377-2217(97)00288-9","volume":"106","author":"C. Rego","year":"1998","unstructured":"Rego, C.: Relaxed tours and path ejections for the traveling saleaman problem. European Journal of Operational Research\u00a0106, 552\u2013568 (1998)","journal-title":"European Journal of Operational Research"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G. Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. European Journal of Operational Reasearch\u00a059, 345\u2013358 (1992)","journal-title":"European Journal of Operational Reasearch"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1080\/00207548908942657","volume":"27","author":"D. Chan","year":"1989","unstructured":"Chan, D., Mercier, D.: IC insertion: an application of the traveling salesman problem. International Journal of Production Research\u00a027, 1837\u20131841 (1989)","journal-title":"International Journal of Production Research"},{"key":"12_CR5","unstructured":"Litke, J.: An improved solution to the traveling saleaman problem with thousands of nodes. Communications of the optimization (1985)"},{"key":"12_CR6","first-page":"823","volume":"28","author":"C. Zhi-Hua","year":"2005","unstructured":"Zhi-Hua, C., Jin_Guo, P., Wei, G.: An Improved Envolutionary Algorithm for the Traveling Salesman Problem. Chinese Journal of Computers\u00a028, 823\u2013828 (2005)","journal-title":"Chinese Journal of Computers"},{"key":"12_CR7","volume-title":"Evolutionary Computation","author":"P. Zheng-Jun","year":"1988","unstructured":"Zheng-Jun, P., Li-Shan, K., Yu-Ping, C.: Evolutionary Computation. Tsinghua University Press,Guangxi Science and Technology Press, Beijing, Nanning (1988)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/BFb0056922","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"G. Tao","year":"1998","unstructured":"Tao, G., Michalewicz, Z.: Inver\u2014over operator for the TSP. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 803\u2013812. Springer, Heidelberg (1998)"}],"container-title":["Communications in Computer and Information Science","Computational Intelligence and Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16388-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T05:44:32Z","timestamp":1553147072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16388-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163876","9783642163883"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16388-3_12","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2010]]}}}