{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:12:05Z","timestamp":1761894725420},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540789864"},{"type":"electronic","value":"9783540789871"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-78987-1_19","type":"book-chapter","created":{"date-parts":[[2008,6,2]],"date-time":"2008-06-02T19:46:28Z","timestamp":1212435988000},"page":"199-210","source":"Crossref","is-referenced-by-count":10,"title":["Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Gregory","family":"Gutin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Karapetyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natalio","family":"Krasnogor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1_1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2000","unstructured":"Bang-Jensen J, Gutin G (2000) Digraphs: Theory, Algorithms and Applications. Springer, London"},{"key":"19_CR2_1","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) ORSA J Computing 6:154\u2013160","journal-title":"ORSA J Computing"},{"key":"19_CR3_1","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/S0167-6377(03)00031-2","volume":"31","author":"D Ben-Arieh","year":"2003","unstructured":"Ben-Arieh D, Gutin G, Penn M, Yeo A, Zverovitch A (2003) Operations Research Letters 31:357\u2013365","journal-title":"Operations Research Letters"},{"key":"19_CR4_1","unstructured":"Bruckschlegel T (2005) Microbenchmarking C++, C#, and Java, Dr. Dobbs, \n                  www.ddj.com\/ 184401976\n                  \n                \/ 184401976"},{"key":"19_CR5_1","volume-title":"The Traveling Salesman Problem and its Variations","author":"M Fischetti","year":"2002","unstructured":"Fischetti M, Salazar-Gonz\u00e1lez JJ, Toth P (2002) The generalized traveling salesman and orientering problems. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht"},{"key":"19_CR6_1","unstructured":"Fischetti M, Salazar-Gonz\u00e1lez JJ, Toth P (2003) In: Gross J, Yellen J (eds) Handbook of Graph Theory. CRC Press"},{"key":"19_CR7_1","unstructured":"Gutin G (2003) Traveling Salesman Problems. In: Gross J, Yellen J (eds) Handbook of Graph Theory. CRC Press"},{"key":"19_CR8_1","first-page":"149","volume":"27","author":"G Gutin","year":"2003","unstructured":"Gutin G, Yeo A (2003) Ausralasian J Combinatorics 27:149\u2013154","journal-title":"Ausralasian J Combinatorics"},{"volume-title":"Traveling Salesman Problem and its Variations","year":"2002","key":"19_CR9_1","unstructured":"Gutin G, Punnen AP (eds) (2002) Traveling Salesman Problem and its Variations. Kluwer, Dordrecht"},{"key":"19_CR10_1","volume-title":"The Traveling Salesman Problem and its Variations","author":"DS Johnson","year":"2002","unstructured":"Johnson DS, Gutin G, McGeoch L, Yeo A, Zhang X, Zverovitch A (2002) Experimental Analysis of Heuristics for ATSP. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht"},{"key":"19_CR11_1","volume-title":"The Traveling Salesman Problem and its Variations","author":"DS Johnson","year":"2002","unstructured":"Johnson DS, McGeoch L (2002) Experimental Analysis of Heuristics for STSP. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht"},{"key":"19_CR12_1","volume-title":"Intern Genetic and Evolut Comput Conf (GECCO2001)","author":"N Krasnogor","year":"2001","unstructured":"Krasnogor N, Smith JE (2001) Emergence of profitable search strategies based on a simple inheritanc mechanism. In: Spector L et al (eds) Intern Genetic and Evolut Comput Conf (GECCO2001). Morgan Kauffman, San Francisco"},{"key":"19_CR13_1","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TEVC.2005.850260","volume":"9","author":"N Krasnogor","year":"2005","unstructured":"Krasnogor N, Smith JE (2005) IEEE Trans Evolut Comput 9:474\u2013488","journal-title":"IEEE Trans Evolut Comput"},{"key":"19_CR14_1","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1057\/jors.1996.190","volume":"47","author":"G Laporte","year":"1996","unstructured":"Laporte G, Asef-Vaziri A, Sriskandarajah C (1996) J Operational Research Society 47: 1461\u20131467","journal-title":"J Operational Research Society"},{"volume-title":"Travelling Salesman Problem: a Guided Tour of Combinatorial Optimization","year":"1985","key":"19_CR15_1","unstructured":"Lawler EL, Lenstra JK, Rinooy Kan AHG, Shmoys DB (eds) (1985) Travelling Salesman Problem: a Guided Tour of Combinatorial Optimization. Wiley, Chichester"},{"key":"19_CR16_1","unstructured":"Moscato P, Memetic algorithms: A short introduction. In: Corne D, Glover F, Dorigo M (eds) (1999) New Ideas in Optimization. McGraw-Hill"},{"key":"19_CR17_1","unstructured":"Motta L, Ochi LS, Martinhon C (2001) Grasp metaheuristics for the generalized covering tour problem. In: MIC2001-4th Metaheuristics Int Conf. Porto, Portugal"},{"key":"19_CR18_1","first-page":"141","volume":"36","author":"YS Ong","year":"2006","unstructured":"Ong YS, Lim MH, Zhu N, Wong W (2006) IEEE Trans Systems Man Cybern Part B 36:141\u2013152","journal-title":"IEEE Trans Systems Man Cybern Part B"},{"key":"19_CR19_1","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) ORSA J Computing 3:376\u2013384","journal-title":"ORSA J Computing"},{"key":"19_CR20_1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1504\/IJOR.2007.011443","volume":"2","author":"F Samanlioglu","year":"2006","unstructured":"Samanlioglu F, Kurz MB, Ferrell WG, Tangudu S (2006) Intern J Operational Res 2:47\u201363","journal-title":"Intern J Operational Res"},{"key":"19_CR21_1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ejor.2004.09.057","volume":"174","author":"LV Snyder","year":"2006","unstructured":"Snyder LV, Daskin MS (2006) Europ J Operational Research 174:38\u201353","journal-title":"Europ J Operational Research"},{"key":"19_CR22_1","unstructured":"Spears WM, De Jong KA (1991) On the virtues of parameterized uniform crossover. In: Proc 4th Int Conf Genetic Algorithms"},{"key":"19_CR23_1","first-page":"1718","volume":"34","author":"H-K Tsai","year":"2004","unstructured":"Tsai H-K, Yang J-M, Tsai Y-F, Kao C-Y (2004) IEEE Transactions on SMC-part B 34:1718\u20131729","journal-title":"IEEE Transactions on SMC-part B"},{"key":"19_CR24_1","unstructured":"Zverovitch A (2002) GTSP instances. \n                  www.cs.rhul.ac.uk\/home\/zvero\/GTSPLIB\n                  \n                \/"}],"container-title":["Studies in Computational Intelligence","Nature Inspired Cooperative Strategies for Optimization (NICSO 2007)"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78987-1_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:06:33Z","timestamp":1619507193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78987-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540789864","9783540789871"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78987-1_19","relation":{},"ISSN":["1860-949X"],"issn-type":[{"type":"print","value":"1860-949X"}],"subject":[],"published":{"date-parts":[[2008]]}}}