{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T15:56:05Z","timestamp":1770998165473,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441465","type":"print"},{"value":"9783540457244","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45724-0_18","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T11:47:26Z","timestamp":1187264846000},"page":"216-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":63,"title":["A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions"],"prefix":"10.1007","author":[{"given":"Johann","family":"Dr\u00e9o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Siarry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,23]]},"reference":[{"key":"18_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-60469-3_22","volume-title":"The Ant Colony Metaphor for Searching Continuous Design Spaces","author":"G. Bilchev","year":"1995","unstructured":"G. Bilchev and I.C. Parmee. The Ant Colony Metaphor for Searching Continuous Design Spaces. Lecture Notes in Computer Science, 993:25\u201339, 1995."},{"key":"18_CR2","unstructured":"E. Bonabeau, A. Sobkowski, G. Theraulaz, and J.-L. Deneubourg. Adaptive Task Allocation Inspired by a Model of Division of Labor in Social Insects. BCEC, pages 36\u201345, 1997."},{"key":"18_CR3","unstructured":"S. Camazine, J.L. Deneubourg, N. Franks, J. Sneyd, G. Theraulaz, and E. Bonabeau. Self-Organization in Biological Systems. 2000."},{"key":"18_CR4","unstructured":"A. Colorni, M. Dorigo, and V. Maniezzo. Distributed Optimization by Ant Colonies. In Elsevier Publishing, editor, Proceedings of ECAL\u201991-European Conference on Arti.cial Life, pages 134\u2013142, 1991."},{"key":"18_CR5","unstructured":"J. Dr\u00e9o. Mod\u00e9lisation de la mobilisation chez les fourmis. M\u00e9moire de dea, Universit\u00e9 Paris7 & Universit\u00e9 Libre de Bruxelles, 2001."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Glover F. and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"B. H\u00f6lldobler and E.O. Wilson. The Ants. Springer Verlag, 1990.","DOI":"10.1007\/978-3-662-10306-7"},{"key":"18_CR8","first-page":"1942","volume":"IV","author":"J. Kennedy","year":"1995","unstructured":"J. Kennedy and R. C. Eberhart. Particle swarm optimization. In Proc. IEEE Int. Conf. on Neural Networks, volume IV, pages 1942\u20131948, Piscataway, NJ: IEEE Service Center, 1995.","journal-title":"Particle swarm optimization"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/S0167-739X(00)00047-9","volume":"16","author":"N. Monmarch\u00e9","year":"2000","unstructured":"N. Monmarch\u00e9, G. Venturini, and M. Slimane. On how Pachycondyla apicalis ants suggest a new search algorithm. Future Generation Computer Systems, 16:937\u2013946, 2000.","journal-title":"Future Generation Computer Systems"},{"key":"18_CR10","unstructured":"E.D. Taillard, L. Gambardella, M. Gendreau, and J-Y. Potvin. Adaptive Memory Programming: A Unified View of Metaheuristics. In EURO XVI Conference Tutorial and Research Reviews booklet, Brussels, 1998. EURO."},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0169-5347(88)90018-3","volume":"3","author":"E.O. Wilson","year":"1988","unstructured":"E.O. Wilson and B. H\u00f6lldobler. Dense Heterarchy and mass communication as the basis of organization in ant colonies. Trend in Ecology and Evolution, 3:65\u201368, 1988.","journal-title":"Trend in Ecology and Evolution"}],"container-title":["Lecture Notes in Computer Science","Ant Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45724-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T03:40:27Z","timestamp":1718250027000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45724-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441465","9783540457244"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45724-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"23 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}