{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:16:25Z","timestamp":1771704985368,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642353796","type":"print"},{"value":"9783642353802","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35380-2_91","type":"book-chapter","created":{"date-parts":[[2012,12,15]],"date-time":"2012-12-15T00:00:04Z","timestamp":1355529604000},"page":"778-784","source":"Crossref","is-referenced-by-count":2,"title":["A Strategy Adaptive Genetic Algorithm for Solving the Travelling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Swahum","family":"Mukherjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinjoy","family":"Ganguly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swagatam","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"91_CR1","unstructured":"Dorigo, M., Stutzle, T.: A Bradford Book. The MIT Press, ISBN 0-262-04219-3"},{"key":"91_CR2","unstructured":"Ahmed, Z.H.: Genetic Algorithm for the Travelling Salesman Problem using sequential constructive crossover. IJBB\u00a03(6) (2010)"},{"key":"91_CR3","unstructured":"Oliver, I., et al.: A study of permutation crossover operators on the travelling salesman problem. In: Proc. of the Second Int. Conf. on Genetic Algorithms, pp. 224\u2013230 (1987)"},{"key":"91_CR4","unstructured":"Davis, L.: Applying Adaptive Algorithms to Epistatic Domains. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 162\u2013164 (1985)"},{"key":"91_CR5","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"},{"key":"91_CR6","doi-asserted-by":"crossref","unstructured":"A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems. IEEE Transactions on Evolutionary Computation\u00a014(2) (April 2010)","DOI":"10.1109\/TEVC.2009.2030331"},{"key":"91_CR7","unstructured":"Solving Travelling Salesman Problem by Using Improved Ant Colony Optimization Algorithm. International Journal of Information and Education Technology\u00a01(5) (December 2011)"},{"key":"91_CR8","doi-asserted-by":"crossref","unstructured":"Ray, S.S., Bandyopadhyay, S., Pal, S.K.: Newoperators of genetic algorithms for traveling salesman problem. In: ICPR 2004, Cambridge, UK, vol.\u00a02, pp. 497\u2013500 (2004)","DOI":"10.1109\/ICPR.2004.1334276"},{"key":"91_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P. Larranaga","year":"1999","unstructured":"Larranaga, P., Kuijpers, C., Murga, R., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artificial Intell. Rev.\u00a013, 129\u2013170 (1999)","journal-title":"Artificial Intell. Rev."}],"container-title":["Lecture Notes in Computer Science","Swarm, Evolutionary, and Memetic Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35380-2_91","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:25:51Z","timestamp":1557447951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35380-2_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353796","9783642353802"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35380-2_91","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}