{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T22:06:10Z","timestamp":1749247570959},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T00:00:00Z","timestamp":1291161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artif Life Robotics"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10015-010-0866-8","type":"journal-article","created":{"date-parts":[[2011,1,6]],"date-time":"2011-01-06T03:07:02Z","timestamp":1294283222000},"page":"547-550","source":"Crossref","is-referenced-by-count":3,"title":["Development of a novel crossover of hybrid genetic algorithms for large-scale traveling salesman problems"],"prefix":"10.1007","volume":"15","author":[{"given":"Masafumi","family":"Kuroda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunihito","family":"Yamamori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaharu","family":"Munetomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moritoshi","family":"Yasunaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ikuo","family":"Yoshihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,1,1]]},"reference":[{"issue":"2","key":"866_CR1","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin S, Kernighan B (1973) An effective heuristic algorithm for the traveling salesman problem. Operations Res 21(2):498\u2013516","journal-title":"Operations Res"},{"key":"866_CR2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-8191(88)90098-1","volume":"7","author":"H. M\u00fchlenbein","year":"1988","unstructured":"M\u00fchlenbein H, Gorges-Schleuter M, Kr\u00e4mer O (1988) Evolution algorithms in combinatorial optimization. Parallel Comput 7:65\u201385","journal-title":"Parallel Comput"},{"key":"866_CR3","unstructured":"Sengoku H, Yoshihara I (1998) A fast TSP solver using GA on JAVA. Proceedings of the 3rd International Symposium on Artificial Life and Robotics (AROB-3), pp 283\u2013288"},{"key":"866_CR4","unstructured":"Whitley D, Starkweather T, Fuquay D (1989) Scheduling problems and traveling salesman: the genetic edge recombination operator. Proceedings of the 3rd ICGA, pp 133\u2013140"},{"key":"866_CR5","unstructured":"Nguyen HD (2004) Hybrid genetic algorithms for combinatorial optimization problems. PhD dissertation, University of Miyazaki"},{"key":"866_CR6","unstructured":"Nguyen HD, Yoshihara I, Yamamori K, et al (2002) Greedy genetic algorithms for symmetric and asymmetric TSPs. IPSJ Tech Rep SIG-MPS 43(SIG10), pp 165\u2013175"},{"key":"866_CR7","unstructured":"Nguyen HD, Yoshihara I, Yasunaga M (2000) Modified edge recombination operators of genetic algorithms for the traveling salesman problem. Proceedings of the 3rd Asia-Pacific Conference on Simulation, Evolution, and Learning. SEAL 2000, pp 2815\u20132820"},{"key":"866_CR8","unstructured":"National TSPs, http:\/\/www.tsp.gatech.edu\/world\/countries.html (Accessed: 10 Jan. 2010)"},{"issue":"1","key":"866_CR9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D. Applegate","year":"2003","unstructured":"Applegate D, Cook W, Rohe A (2003) Chained Lin-Kernighan for large traveling salesman problems. INFORMS J Comput 15(1):82\u201392","journal-title":"INFORMS J Comput"},{"issue":"6","key":"866_CR10","first-page":"613","volume":"5","author":"R. Baraglia","year":"2001","unstructured":"Baraglia R, Hidalgo JI, Perego R (2001) A hybrid heuristic for the traveling salesman problems. IEEE Trans EC 5(6):613\u2013622","journal-title":"IEEE Trans EC"},{"issue":"1","key":"866_CR11","first-page":"92","volume":"37","author":"H.D. Nguyen","year":"2007","unstructured":"Nguyen HD, Yoshihara I, Yamamori K, et al (2007) Implementation of an effective hybrid GA for large-scale traveling salesman problems. IEEE Trans SMC 37(1):92\u201399","journal-title":"IEEE Trans SMC"},{"key":"866_CR12","unstructured":"Concorde TSP Solver, http:\/\/www.tsp.gatech.edu\/concorde\/"}],"container-title":["Artificial Life and Robotics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10015-010-0866-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10015-010-0866-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10015-010-0866-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:36:07Z","timestamp":1559133367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10015-010-0866-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["866"],"URL":"https:\/\/doi.org\/10.1007\/s10015-010-0866-8","relation":{},"ISSN":["1433-5298","1614-7456"],"issn-type":[{"value":"1433-5298","type":"print"},{"value":"1614-7456","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}