{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:10:40Z","timestamp":1760706640020},"reference-count":29,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0167-739x(00)00045-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:42:44Z","timestamp":1027651364000},"page":"915-926","source":"Crossref","is-referenced-by-count":22,"title":["ANTS: Agents on Networks, Trees, and Subgraphs"],"prefix":"10.1016","volume":"16","author":[{"given":"Israel A.","family":"Wagner","sequence":"first","affiliation":[]},{"given":"Michael","family":"Lindenbaum","sequence":"additional","affiliation":[]},{"given":"Alfred M.","family":"Bruckstein","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0167-739X(00)00045-5_BIB1","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1086\/285418","article-title":"Information collection and spread by networks of patrolling ants","volume":"140","author":"Adler","year":"1992","journal-title":"The Am. Naturalist"},{"key":"10.1016\/S0167-739X(00)00045-5_BIB2","doi-asserted-by":"crossref","unstructured":"R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovasz, C. Rakoff, Random walks, universal traversal sequences, and the complexity of maze problems, Proc. FOCS \u201979 (1979) 218\u2013223.","DOI":"10.1109\/SFCS.1979.34"},{"issue":"1","key":"10.1016\/S0167-739X(00)00045-5_BIB3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/S0895480194264988","article-title":"Short random walks on graphs","volume":"9","author":"Barnes","year":"1996","journal-title":"SIAM J. Disc. Math."},{"key":"10.1016\/S0167-739X(00)00045-5_BIB4","doi-asserted-by":"crossref","unstructured":"E. Bonabeau, M. Dorigo, G. Theraulaz, Swarm Intelligence: From Natural to Artificial Systems, Oxford University Press, Oxford, 1999.","DOI":"10.1093\/oso\/9780195131581.001.0001"},{"issue":"2","key":"10.1016\/S0167-739X(00)00045-5_BIB5","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/S0097539790190144","article-title":"Trading space for time in undirected s\u2212t connectivity","volume":"23","author":"Broder","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-739X(00)00045-5_BIB6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","article-title":"Ants can colour graphs","volume":"48","author":"Costa","year":"1997","journal-title":"J. Operat. Res. Soc."},{"key":"10.1016\/S0167-739X(00)00045-5_BIB7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1613\/jair.530","article-title":"AntNet: distributed stigmergetic control for communications networks","volume":"9","author":"Di Caro","year":"1998","journal-title":"J. Artificial Intelligence Res. (JAIR)"},{"key":"10.1016\/S0167-739X(00)00045-5_BIB8","doi-asserted-by":"crossref","unstructured":"M. Dorigo, G. Di Caro, The ant colony optimization meta-heuristic, in: D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw-Hill, New York, 1999, pp. 11\u201332.","DOI":"10.1109\/CEC.1999.782657"},{"issue":"2","key":"10.1016\/S0167-739X(00)00045-5_BIB9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","article-title":"Ant algorithms for discrete optimization","volume":"5","author":"Dorigo","year":"1999","journal-title":"Artificial Life"},{"key":"10.1016\/S0167-739X(00)00045-5_BIB10","unstructured":"M. Dorigo (Ed.), The ant colony optimization WWW page. An introduction and compendium of examples, publications and events. Maintained at IRIDIA, Universit\u00e9 Libre de Bruxelles, Belgium. http:\/\/iridia.ulb.ac.be\/\u00a0\u0303mdorigo\/ACO\/ACO.html"},{"key":"10.1016\/S0167-739X(00)00045-5_BIB11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"The ant system: optimization by a Colony of cooperating agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Trans. Syst. Man Cybernetics Part B"},{"key":"10.1016\/S0167-739X(00)00045-5_BIB12","unstructured":"S. Even, Graph Algorithms, Computer Science Press, Rockville, Maryland, 1979."},{"key":"10.1016\/S0167-739X(00)00045-5_BIB13","doi-asserted-by":"crossref","unstructured":"A.S. Fraenkel, Economic traversal of labyrinths, Math. Mag. 43 (1970) 125\u2013130, and a correction in 44 (1971) 12.","DOI":"10.2307\/2688386"},{"key":"10.1016\/S0167-739X(00)00045-5_BIB14","unstructured":"M. Frauenfelder, The Future of Search Engines, The Industry Standard, 25 September 1998. http:\/\/www.thestandard.com\/articles\/article_print\/0,1454,1826,00.html"},{"key":"10.1016\/S0167-739X(00)00045-5_BIB15","doi-asserted-by":"crossref","unstructured":"S. Gal, E.J. Anderson, Search in a maze, in: Probability in the Engineering and Informational Sciences, Vol. 4, Cambridge University Press, Cambridge, 1990, pp. 311\u2013318.","DOI":"10.1017\/S0269964800001625"},{"key":"10.1016\/S0167-739X(00)00045-5_BIB16","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1016\/0003-3472(95)80100-6","article-title":"The expandable network of ant exploration","volume":"50","author":"M. Gordon","year":"1995","journal-title":"Animal Behaviour"},{"issue":"6","key":"10.1016\/S0167-739X(00)00045-5_BIB17","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","article-title":"Efficient algorithms for graph manipulation (Algorithm 447)","volume":"16","author":"Hopcroft","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/S0167-739X(00)00045-5_BIB18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","article-title":"Real-time heuristic search","volume":"42","author":"Korf","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0167-739X(00)00045-5_BIB19","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/238061.238065","article-title":"Graph learning with a nearest neighbor approach","volume":"\u201996","author":"Koenig","year":"1996","journal-title":"Proc. COLT"},{"issue":"5360","key":"10.1016\/S0167-739X(00)00045-5_BIB20","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1126\/science.280.5360.98","article-title":"Searching the World Wide Web","volume":"280","author":"Lawrence","year":"1998","journal-title":"Science"},{"issue":"2","key":"10.1016\/S0167-739X(00)00045-5_BIB21","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1177\/105971239700500203","article-title":"Ant-based load balancing in telecommunications networks","volume":"5","author":"Schoonderwoerd","year":"1997","journal-title":"Adaptive Behav."},{"key":"10.1016\/S0167-739X(00)00045-5_BIB22","unstructured":"T. St\u00fctzle, M. Dorigo, ACO algorithms for the quadratic assignment problem, in: D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw-Hill, New York, 1999, pp. 33\u201350."},{"issue":"2","key":"10.1016\/S0167-739X(00)00045-5_BIB23","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-739X(00)00045-5_BIB24","first-page":"187","article-title":"Le probleme des labyrinths","volume":"14","author":"Tarry","year":"1895","journal-title":"Nouvelles Annales de Mathematiques"},{"key":"10.1016\/S0167-739X(00)00045-5_BIB25","unstructured":"S. Thrun, The role of exploration in learning control, in: Handbook for Intelligent Control: Neural, Fuzzy and Adaptive Approaches, Van Nostrand Reinhold, Florence, Kentucky, 1992."},{"key":"10.1016\/S0167-739X(00)00045-5_BIB26","unstructured":"S. Thrun, Efficient Exploration in Reinforcement Learning, Carnegie-Mellon University, Pittsburgh, Pennsylvania, Tech. Rep. CMU-CS-92-102."},{"key":"10.1016\/S0167-739X(00)00045-5_BIB27","unstructured":"I.A. Wagner, M. Lindenbaum, A.M. Bruckstein, Smell as a computational resource \u2014 a lesson we can learn from the ant, Proc. ISTCS \u201996 219\u2013230. http:\/\/www.cs.technion.ac.il\/\u00a0\u0303 wagner"},{"issue":"5","key":"10.1016\/S0167-739X(00)00045-5_BIB28","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1109\/70.795795","article-title":"Distributed covering by ant-robots using evaporating traces","volume":"15","author":"Wagner","year":"1999","journal-title":"IEEE Trans. Robotics Automation"},{"key":"10.1016\/S0167-739X(00)00045-5_BIB29","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1018957401093","article-title":"Efficient graph search by a smell-oriented vertex process","volume":"24","author":"Wagner","year":"1998","journal-title":"Ann. Math. Artificial Intelligence"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X00000455?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X00000455?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T13:20:02Z","timestamp":1620998402000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X00000455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":29,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0167739X00000455"],"URL":"https:\/\/doi.org\/10.1016\/s0167-739x(00)00045-5","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}