{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T15:43:12Z","timestamp":1774453392132,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,1,31]],"date-time":"2009-01-31T00:00:00Z","timestamp":1233360000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s11047-009-9111-6","type":"journal-article","created":{"date-parts":[[2009,1,30]],"date-time":"2009-01-30T09:11:24Z","timestamp":1233306684000},"page":"47-60","source":"Crossref","is-referenced-by-count":88,"title":["A memetic algorithm for the generalized traveling salesman problem"],"prefix":"10.1007","volume":"9","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"}]}],"member":"297","published-online":{"date-parts":[[2009,1,31]]},"reference":[{"key":"9111_CR1","unstructured":"Bang-Jensen J, Gutin G (2000) Digraphs: theory, algorithms and applications. Springer-Verlag, London, 754\u00a0pp"},{"key":"9111_CR2","doi-asserted-by":"crossref","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) Transformations of generalized ATSP into ATSP. Oper Res Lett 31:357\u2013365","journal-title":"Oper Res Lett"},{"key":"9111_CR3","unstructured":"Davis L (1985) Applying adaptive algorithms to epistatic domains. In: Proceeding of the international joint conference on artificial intelligence, pp 162\u2013164"},{"issue":"3","key":"9111_CR5","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"Fischetti M, Salazar-Gonz\u00e1lez JJ, Toth P (1997) A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper Res 45 (3):378\u2013394","journal-title":"Oper Res"},{"key":"9111_CR4","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 A (eds) The traveling salesman problem and its variations. Kluwer, Dordrecht"},{"key":"9111_CR6","unstructured":"Gutin G (2003) Traveling salesman problems. In: Gross J, Yellen J (eds) Handbook of Graph theory. CRC Press, Boca Raton"},{"key":"9111_CR8","volume-title":"Traveling salesman problem and its variations","year":"2002","unstructured":"Gutin G, Punnen AP (eds) (2002) Traveling salesman problem and its variations. Kluwer, Dordrecht"},{"key":"9111_CR7","first-page":"149","volume":"27","author":"G Gutin","year":"2003","unstructured":"Gutin G, Yeo A (2003) Assignment problem based algorithms are impractical for the generalized TSP. Ausralas J Combinatorics 27:149\u2013154","journal-title":"Australas J Combinatorics"},{"key":"9111_CR9","volume-title":"Recent advances in memetic algorithms, volume 166 of Studies in Fuzzyness and Soft Computing","year":"2004","unstructured":"Hart WE, Krasnogor N, Smith JE (eds) (2004) Recent advances in memetic algorithms. Studies in fuzzyness and soft computing, vol 166. Springer, Berlin"},{"key":"9111_CR11","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 A (eds) The traveling salesman problem and its variations. Kluwer, Dordrecht"},{"key":"9111_CR10","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 A (eds) The traveling salesman problem and its variations. Kluwer, Dordrecht"},{"key":"9111_CR12","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1109\/TEVC.2005.850260","volume":"9","author":"N Krasnogor","year":"2005","unstructured":"Krasnogor N, Smith J (2005) A tutorial for competent memetic algorithms: model, taxonomy and design issues. IEEE Trans Evol Comput 9:474\u2013488","journal-title":"IEEE Trans Evol Comput"},{"issue":"12","key":"9111_CR13","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) Some applications of the generalized travelling salesman problem. J Oper Res Soc 47(12):1461\u20131467","journal-title":"J Oper Res Soc"},{"key":"9111_CR14","volume-title":"Travelling salesman problem: a guided tour of combinatorial optimization","year":"1985","unstructured":"Lawler EL, Lenstra JK, Rinooy Kan AHG, Shmoys DB (eds) (1985) Travelling salesman problem: a guided tour of combinatorial optimization. Wiley, Chichester"},{"key":"9111_CR15","unstructured":"Moscato P (1999) Memetic algorithms: a short introduction. In: Corne D, Glover F, Dorigo M (eds) New ideas in optimization. McGraw-Hill, New York"},{"key":"9111_CR16","doi-asserted-by":"crossref","unstructured":"Reinelt G (1991) TSPLIB\u2014a traveling salesman problem library. ORSA J Comput 3:376\u2013384. http:\/\/www.crpc.rice.edu\/softlib\/tsplib\/","DOI":"10.1287\/ijoc.3.4.376"},{"key":"9111_CR17","doi-asserted-by":"crossref","unstructured":"Silberholz J, Golden B (2007) The generalized traveling salesman problem: a new genetic algorithm approach. In: Baker et\u00a0al. (eds) Extending the horizons: advances in computing, optimization, and decision technologies, vol 37. Springer, Heidelberg, pp 165\u2013181","DOI":"10.1007\/978-0-387-48793-9_11"},{"key":"9111_CR18","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ejor.2004.09.057","volume":"174","author":"LV Snyder","year":"2006","unstructured":"Snyder LV, Daskin MS (2006) A random-key genetic algorithm for the generalized traveling salesman problem. Eur J Oper Res 174:38\u201353","journal-title":"Eur J Oper Res"},{"key":"9111_CR19","doi-asserted-by":"crossref","unstructured":"Tasgetiren MF, Suganthan PN, Pan Q-K (2007) A discrete particle swarm optimization algorithm for the generalized traveling salesman problem. In: GECCO \u201907: proceedings of the 9th annual conference on genetic and evolutionary computation, pp 158\u2013167","DOI":"10.1145\/1276958.1276980"},{"key":"9111_CR20","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) An evolutionary algorithms for large traveling salesman problems. IEEE Trans SMC B 34:1718\u20131729","journal-title":"IEEE Trans SMC B"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-009-9111-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-009-9111-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-009-9111-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:46:04Z","timestamp":1559360764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-009-9111-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,31]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["9111"],"URL":"https:\/\/doi.org\/10.1007\/s11047-009-9111-6","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,31]]}}}