{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T14:47:09Z","timestamp":1748616429136},"publisher-location":"Berlin, Heidelberg","reference-count":64,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425670"},{"type":"electronic","value":"9783540448112"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44811-x_2","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T14:18:30Z","timestamp":1178201910000},"page":"11-22","source":"Crossref","is-referenced-by-count":13,"title":["Ant Algorithms Solve Difficult Optimization Problems"],"prefix":"10.1007","author":[{"given":"Marco","family":"Dorigo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,30]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"1445","DOI":"10.1109\/CEC.1999.782653","volume-title":"Proceedings of the 1999 Congress on Evolutionary Computation (CEC\u201999)","author":"A. Bauer","year":"1999","unstructured":"A. Bauer, B. Bullnheimer, R. F. Hartl, and C. Strauss. An ant colony optimization approach for the single machine total tardiness problem. In Proceedings of the 1999 Congress on Evolutionary Computation (CEC\u201999), pages 1445\u20131450. IEEE Press, Piscataway, NJ, 1999."},{"key":"2_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195131581.001.0001","volume-title":"Swarm Intelligence: From Natural to Artificial Systems","author":"E. Bonabeau","year":"1999","unstructured":"E. Bonabeau, M. Dorigo, and G. Theraulaz. Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York, NJ, 1999."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1038\/35017500","volume":"406","author":"E. Bonabeau","year":"2000","unstructured":"E. Bonabeau, M. Dorigo, and G. Theraulaz. Inspiration for optimization from social insect behavior. Nature, 406:39\u201342, 2000.","journal-title":"Nature"},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1038\/scientificamerican0300-72","volume":"282","author":"E. Bonabeau","year":"2000","unstructured":"E. Bonabeau and G. Theraulaz. Swarm smarts. Scientific American, 282(3):54\u201361, 2000.","journal-title":"Scientific American"},{"issue":"5","key":"2_CR5","first-page":"188","volume":"12","author":"E. Bonabeau","year":"1997","unstructured":"E. Bonabeau, G. Theraulaz, J.-L. Deneubourg, S. Aron, and S. Camazine. Self-organization in social insects. Tree, 12(5):188\u2013193, 1997.","journal-title":"Tree"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-1-4615-5775-3_20","volume-title":"M eta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"B. Bullnheimer","year":"1999","unstructured":"B. Bullnheimer, R. F. Hartl, and C. Strauss. Applying the Ant System to the vehicle routing problem. In S. Vo\u00df, S. Martello, I. H. Osman, and C. Roucairol, editors, M eta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 285\u2013296. Kluwer Academic Publishers, Dordrecht, 1999."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018940026670","volume":"89","author":"B. Bullnheimer","year":"1999","unstructured":"B. Bullnheimer, R. F. Hartl, and C. Strauss. An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research, 89:319\u2013328, 1999.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2_CR8","first-page":"25","volume":"7","author":"B. Bullnheimer","year":"1999","unstructured":"B. Bullnheimer, R. F. Hartl, and C. Strauss. A new rank-based version of the Ant System: A computational study. Central European Journal for Operations Research and Economics, 7(1):25\u201338, 1999.","journal-title":"Central European Journal for Operations Research and Economics"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1177\/105971230000800201","volume":"8","author":"M. Campos","year":"2000","unstructured":"M. Campos, E. Bonabeau, G. Theraulaz, and J.-L. Deneubourg. Dynamic scheduling and division of labor in social insects. Adaptive Behavior, 8(3):83\u201396, 2000.","journal-title":"Adaptive Behavior"},{"issue":"1","key":"2_CR10","first-page":"39","volume":"34","author":"A. Colorni","year":"1994","unstructured":"A. Colorni, M. Dorigo, V. Maniezzo, and M. Trubian. Ant System for job-shop scheduling. JORBEL-Belgian Journal of Operations Research, Statistics and Computer Science, 34(1):39\u201353, 1994.","journal-title":"JORBEL-Belgian Journal of Operations Research, Statistics and Computer Science"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","volume":"48","author":"D. Costa","year":"1997","unstructured":"D. Costa and A. Hertz. Ants can colour graphs. Journal of the Operational Research Society, 48:295\u2013305, 1997.","journal-title":"Journal of the Operational Research Society"},{"key":"2_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/3-540-45356-3_60","volume-title":"Proceedings of PPSN-VI, Sixth International Conference on Parallel Problem Solving from Nature","author":"M. L. Besten den","year":"2000","unstructured":"M. L. den Besten, T. St\u00fctzle, and M. Dorigo. Ant colony optimization for the total weighted tardiness problem. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, and H.-S. Schwefel, editors, Proceedings of PPSN-VI, Sixth International Conference on Parallel Problem Solving from Nature, volume 1917 of Lecture Notes in Computer Science, pages 611\u2013620. Springer Verlag, Berlin, Germany, 2000."},{"key":"2_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/3-540-45365-2_46","volume-title":"Proceedings of EvoStim\u201901","author":"M. L. Besten den","year":"2001","unstructured":"M. L. den Besten, T. St\u00fctzle, and M. Dorigo. Design of iterated local search algorithms: An example application to the single machine total weighted tardiness problem. In E. J. W. Boers, J. Gottlieb, P. L. Lanzi, R. E. Smith, S. Cagnoni, E. Hart, G. R. Raidl, and H. Tijink, editors, Proceedings of EvoStim\u201901, Lecture Notes in Computer Science, pages 441\u2013452. Springer Verlag, Berlin, Germany, 2001."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF01417909","volume":"3","author":"J.-L. Deneubourg","year":"1990","unstructured":"J.-L. Deneubourg, S. Aron, S. Goss, and J.-M. Pasteels. The self-organizing exploratory pattern of the Argentine ant. Journal of Insect Behavior, 3:159\u2013168, 1990.","journal-title":"Journal of Insect Behavior"},{"key":"2_CR15","first-page":"356","volume-title":"Proceedings of the First International Conference on Simulation of Adaptive Behavior: From Animals to Animats","author":"J.-L. Deneubourg","year":"1991","unstructured":"J.-L. Deneubourg, S. Goss, N. Franks, A. Sendova-Franks, C. Detrain, and L. Chr\u00e9tien. The dynamics of collective sorting: Robot-like ants and ant-like robots. In J.-A. Meyer and S. W. Wilson, editors, Proceedings of the First International Conference on Simulation of Adaptive Behavior: From Animals to Animats, pages 356\u2013363. MIT Press, Cambridge, MA, 1991."},{"key":"2_CR16","series-title":"IRIDIA","volume-title":"Technical Report IRIDIA\/97-12","author":"G. Caro Di","year":"1997","unstructured":"G. Di Caro and M. Dorigo. AntNet: A mobile agents approach to adaptive routing. Technical Report IRIDIA\/97-12, IRIDIA, Universit\u00e9 Libre de Bruxelles, Belgium, 1997."},{"key":"2_CR17","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1613\/jair.530","volume":"9","author":"G. Caro Di","year":"1998","unstructured":"G. Di Caro and M. Dorigo. AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research, 9:317\u2013365, 1998.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2_CR18","unstructured":"G. Di Caro and M. Dorigo. Extending AntNet for best-effort Quality-of-Service routing. Unpublished presentation at ANTS\u201998-From Ant Colonies to Artificial Ants: First International Workshop on Ant Colony Optimization http:\/\/iridia.ulb.ac.be\/ants98\/ants98.html , October 15\u201316 1998."},{"key":"2_CR19","first-page":"541","volume-title":"Proceedings of the Tenth IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS\u201998)","author":"G. Caro Di","year":"1998","unstructured":"G. Di Caro and M. Dorigo. Two ant colony algorithms for best-effort routing in datagram networks. In Y. Pan, S. G. Akl, and K. Li, editors, Proceedings of the Tenth IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS\u201998), pages 541\u2013546. IASTED\/ACTA Press, Anheim, 1998."},{"key":"2_CR20","series-title":"PhD thesis","volume-title":"Optimization, Learning and Natural Algorithms","author":"M. Dorigo","year":"1992","unstructured":"M. Dorigo. Optimization, Learning and Natural Algorithms (in Italian). PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1992. 140 pages."},{"issue":"8","key":"2_CR21","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/S0167-739X(00)00042-X","volume":"16","author":"M. Dorigo","year":"2000","unstructured":"M. Dorigo, E. Bonabeau, and G. Theraulaz. Ant algorithms and stigmergy. Future Generation Computer Systems, 16(8):851\u2013871, 2000.","journal-title":"Future Generation Computer Systems"},{"key":"2_CR22","first-page":"11","volume-title":"New Ideas in Optimization","author":"M. Dorigo","year":"1999","unstructured":"M. Dorigo and G. Di Caro. The Ant Colony Optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 11\u201332. McGraw Hill, London, UK, 1999."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"M. Dorigo, G. Di Caro, and T. St\u00fctzle (Editors). Special issue on \u201cAnt Algorithms\u201d. Future Generation Computer Systems, 16(8), 2000. 104 pages.","DOI":"10.1016\/S0167-739X(00)00041-8"},{"issue":"2","key":"2_CR24","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"M. Dorigo, G. Di Caro, and L. M. Gambardella. Ant algorithms for discrete optimization. Artificial Life, 5(2):137\u2013172, 1999.","journal-title":"Artificial Life"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M. Dorigo","year":"1997","unstructured":"M. Dorigo and L. M. Gambardella. Ant colonies for the traveling salesman problem. BioSystems, 43:73\u201381, 1997.","journal-title":"BioSystems"},{"issue":"1","key":"2_CR26","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"M. Dorigo and L. M. Gambardella. Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53\u201366, 1997.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"2_CR27","unstructured":"M. Dorigo, L. M. Gambardella, M. Middendorf, and T. St\u00fctzle (Editors). Special issue on \u201cAnt Algorithms and Swarm Intelligence\u201d. IEEE Transactions on Evolutionary Computation, 2002."},{"key":"2_CR28","volume-title":"Technical Report 91-016","author":"M. Dorigo","year":"1991","unstructured":"M. Dorigo, V. Maniezzo, and A. Colorni. Positive feedback as a search strategy. Technical Report 91-016, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1991."},{"issue":"1","key":"2_CR29","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"M. Dorigo, V. Maniezzo, and A. Colorni. The Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26(1):29\u201341, 1996.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B"},{"key":"2_CR30","first-page":"252","volume-title":"Proceedings of the Twelfth International Conference on Machine Learning (ML-95)","author":"L. M. Gambardella","year":"1995","unstructured":"L. M. Gambardella and M. Dorigo. Ant-Q: A reinforcement learning approach to the traveling salesman problem. In A. Prieditis and S. Russell, editors, Proceedings of the Twelfth International Conference on Machine Learning (ML-95), pages 252\u2013260. Morgan Kaufmann Publishers, Palo Alto, CA, 1995."},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1109\/ICEC.1996.542672","volume-title":"Proceedings of the 1996 IEEE International Conference on Evolutionary Computation (ICEC\u201996)","author":"L. M. Gambardella","year":"1996","unstructured":"L. M. Gambardella and M. Dorigo. Solving symmetric and asymmetric TSPs by ant colonies. In Proceedings of the 1996 IEEE International Conference on Evolutionary Computation (ICEC\u201996), pages 622\u2013627. IEEE Press, Piscataway, NJ, 1996."},{"key":"2_CR32","volume-title":"Technical Report IDSIA-11-97","author":"L. M. Gambardella","year":"1997","unstructured":"L. M. Gambardella and M. Dorigo. HAS-SOP: An hybrid Ant System for the sequential ordering problem. Technical Report IDSIA-11-97, IDSIA, Lugano, Switzerland, 1997."},{"issue":"3","key":"2_CR33","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1287\/ijoc.12.3.237.12636","volume":"12","author":"L. M. Gambardella","year":"2000","unstructured":"L. M. Gambardella and M. Dorigo. Ant Colony System hybridized with a new local search for the sequential ordering problem. INFORMS Journal on Computing, 12(3):237\u2013255, 2000.","journal-title":"INFORMS Journal on Computing"},{"key":"2_CR34","first-page":"63","volume-title":"New Ideas in Optimization","author":"L. M. Gambardella","year":"1999","unstructured":"L. M. Gambardella, \u00c8. D. Taillard, and G. Agazzi. MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 63\u201376. McGraw Hill, London, UK, 1999."},{"issue":"2","key":"2_CR35","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"L. M. Gambardella","year":"1999","unstructured":"L. M. Gambardella, \u00c8. D. Taillard, and M. Dorigo. Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society, 50(2):167\u2013176, 1999.","journal-title":"Journal of the Operational Research Society"},{"key":"2_CR36","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF00462870","volume":"76","author":"S. Goss","year":"1989","unstructured":"S. Goss, S. Aron, J. L. Deneubourg, and J. M. Pasteels. Self-organized shortcuts in the Argentine ant. Naturwissenschaften, 76:579\u2013581, 1989.","journal-title":"Naturwissenschaften"},{"issue":"8","key":"2_CR37","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","volume":"16","author":"W. J. Gutjahr","year":"2000","unstructured":"W. J. Gutjahr. A graph-based Ant System and its convergence. Future Generation Computer Systems, 16(8):873\u2013888, 2000.","journal-title":"Future Generation Computer Systems"},{"key":"2_CR38","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0921-8890(99)00065-2","volume":"30","author":"M. J. B. Krieger","year":"2000","unstructured":"M. J. B. Krieger and J.-B. Billeter. The call of duty: Self-organised task allocation in a population of up to twelve mobile robots. Robotics and Autonomous Systems, 30:65\u201384, 2000.","journal-title":"Robotics and Autonomous Systems"},{"key":"2_CR39","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1023\/A:1009665701840","volume":"5","author":"P. Kuntz","year":"1999","unstructured":"P. Kuntz, D. Snyers, and P. Layzell. A stochastic heuristic for visualizing graph clusters in a bi-dimensional space prior to partitioning. Journal of Heuristics, 5:327\u2013351, 1999.","journal-title":"Journal of Heuristics"},{"key":"2_CR40","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1126\/science.280.5360.98","volume":"280","author":"S. Lawrence","year":"1998","unstructured":"S. Lawrence and C. L. Giles. Searching the world wide web. Science, 280:98\u2013100, 1998.","journal-title":"Science"},{"key":"2_CR41","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1109\/CEC.1999.782655","volume-title":"Proceedings of the 1999 Congress on Evolutionary Computation (CEC\u201999)","author":"G. Leguizam\u00f3n","year":"1999","unstructured":"G. Leguizam\u00f3n and Z. Michalewicz. A new version of Ant System for subset problems. In Proceedings of the 1999 Congress on Evolutionary Computation (CEC\u201999), pages 1459\u20131464. IEEE Press, Piscataway, NJ, 1999."},{"key":"2_CR42","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1109\/CEC.1999.782658","volume-title":"Proceedings of the 1999 Congress on Evolutionary Computation","author":"Y.-C. Liang","year":"1999","unstructured":"Y.-C. Liang and A. E. Smith. An Ant System approach to redundancy allocation. In Proceedings of the 1999 Congress on Evolutionary Computation, pages 1478\u20131484. IEEE Press, Piscataway, NJ, 1999."},{"key":"2_CR43","first-page":"501","volume-title":"Proceedings of the Third International Conference on Simulation of Adaptive Behavior: From Animals to Animats 3","author":"E. Lumer","year":"1994","unstructured":"E. Lumer and B. Faieta. Diversity and adaptation in populations of clustering ants. In J.-A. Meyer and S. W. Wilson, editors, Proceedings of the Third International Conference on Simulation of Adaptive Behavior: From Animals to Animats 3, pages 501\u2013508. MIT Press, Cambridge, MA, 1994."},{"issue":"4","key":"2_CR44","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1287\/ijoc.11.4.358","volume":"11","author":"V. Maniezzo","year":"1999","unstructured":"V. Maniezzo. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS Journal on Computing, 11(4):358\u2013369, 1999.","journal-title":"INFORMS Journal on Computing"},{"issue":"8","key":"2_CR45","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/S0167-739X(00)00046-7","volume":"16","author":"V. Maniezzo","year":"2000","unstructured":"V. Maniezzo and A. Carbonaro. An ANTS heuristic for the frequency assignment problem. Future Generation Computer Systems, 16(8):927\u2013935, 2000.","journal-title":"Future Generation Computer Systems"},{"issue":"5","key":"2_CR46","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/69.806935","volume":"11","author":"V. Maniezzo","year":"1999","unstructured":"V. Maniezzo and A. Colorni. The Ant System applied to the quadratic assignment problem. IEEE Transactions on Data and Knowledge Engineering, 11(5):769\u2013778, 1999.","journal-title":"IEEE Transactions on Data and Knowledge Engineering"},{"key":"2_CR47","series-title":"IRIDIA","volume-title":"Technical Report IRIDIA\/94-28","author":"V. Maniezzo","year":"1994","unstructured":"V. Maniezzo, A. Colorni, and M. Dorigo. The Ant System applied to the quadratic assignment problem. Technical Report IRIDIA\/94-28, IRIDIA, Universit\u00e9 Libre de Bruxelles, Belgium, 1994."},{"key":"2_CR48","unstructured":"D. Merkle, M. Middendorf, and H. Schmeck. Ant colony optimization for resource-constrained project scheduling. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), pages 893\u2013900. Morgan Kaufmann Publishers, San Francisco, CA, 2000."},{"key":"2_CR49","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/BFb0056911","volume-title":"Proceedings of PPSN-V, Fifth International Conference on Parallel Problem Solving from Nature","author":"R. Michel","year":"1998","unstructured":"R. Michel and M. Middendorf. An island model based Ant System with lookahead for the shortest supersequence problem. In A. E. Eiben, T. B\u00e4ck, M. Schoenauer, and H.-P. Schwefel, editors, Proceedings of PPSN-V, Fifth International Conference on Parallel Problem Solving from Nature, volume 1498 of Lecture Notes in Computer Science, pages 692\u2013701. Springer Verlag, Berlin, Germany, 1998."},{"key":"2_CR50","first-page":"51","volume-title":"New Ideas in Optimization","author":"R. Michel","year":"1999","unstructured":"R. Michel and M. Middendorf. An ACO algorithm for the shortest supersequence problem. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 51\u201361. McGraw Hill, London, UK, 1999."},{"key":"2_CR51","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1109\/CEC.1999.785494","volume-title":"Proceedings of the 1999 Congress on Evolutionary Computation (CEC\u201999)","author":"G. N. Varela","year":"1999","unstructured":"G. Navarro Varela and M. C. Sinclair. Ant colony optimisation for virtual-wavelength-path routing and wavelength allocation. In Proceedings of the 1999 Congress on Evolutionary Computation (CEC\u201999), pages 1809\u20131816. IEEE Press, Piscataway, NJ, 1999."},{"key":"2_CR52","volume-title":"Technical Report Technical Report Economic Working Papers Series No.304","author":"H. R. Louren\u00e7o","year":"1998","unstructured":"H. Ramalhinho Louren\u00e7o and D. Serra. Adaptive approach heuristics for the generalized assignment problem. Technical Report Technical Report Economic Working Papers Series No.304, Universitat Pompeu Fabra, Dept. of Economics and Management, Barcelona, Spain, 1998."},{"key":"2_CR53","doi-asserted-by":"crossref","unstructured":"R. Schoonderwoerd, O. Holland, and J. Bruten. Ant-like agents for load balancing in telecommunications networks. In Proceedings of the First International Conference on Autonomous Agents, pages 209\u2013216. ACM Press, 1997.","DOI":"10.1145\/267658.267718"},{"issue":"2","key":"2_CR54","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1177\/105971239700500203","volume":"5","author":"R. Schoonderwoerd","year":"1996","unstructured":"R. Schoonderwoerd, O. Holland, J. Bruten, and L. Rothkrantz. Ant-based load balancing in telecommunications networks. Adaptive Behavior, 5(2):169\u2013207, 1996.","journal-title":"Adaptive Behavior"},{"key":"2_CR55","first-page":"118","volume-title":"Proceedings of the 14th European Conference on Artificial Intelligence","author":"C. Solnon","year":"2000","unstructured":"C. Solnon. Solving permutation constraint satisfaction problems with artificial ants. In W. Horn, editor, Proceedings of the 14th European Conference on Artificial Intelligence, pages 118\u2013122. IOS Press, Amsterdam, The Netherlands, 2000."},{"key":"2_CR56","volume-title":"Technical Report AIDA-97-4","author":"T. St\u00fctzle","year":"1997","unstructured":"T. St\u00fctzle. $$ \\mathcal{M}\\mathcal{A}\\mathcal{X} - \\mathcal{M}\\mathcal{I}\\mathcal{N} $$ Ant System for the quadratic assignment problem. Technical Report AIDA-97-4, FG Intellektik, FB Informatik, TU Darmstadt, July 1997."},{"key":"2_CR57","first-page":"1560","volume-title":"Proceedings of the 6th European Congress on Intelligent Techniques & Soft Computing (EUFIT\u201998)","author":"T. St\u00fctzle","year":"1998","unstructured":"T. St\u00fctzle. An ant approach to the flow shop problem. In Proceedings of the 6th European Congress on Intelligent Techniques & Soft Computing (EUFIT\u201998), volume 3, pages 1560\u20131564. Verlag Mainz, Wissenschaftsverlag, Aachen, 1998."},{"key":"2_CR58","volume-title":"Local Search Algorithms for Combinatorial Problems: Analysis, Improvements, and New Applications","author":"T. St\u00fctzle","year":"1999","unstructured":"T. St\u00fctzle. Local Search Algorithms for Combinatorial Problems: Analysis, Improvements, and New Applications. Infix, Sankt Augustin, Germany, 1999."},{"key":"2_CR59","series-title":"IRIDIA","volume-title":"Technical Report IRIDIA\/2000-35","author":"T. St\u00fctzle","year":"2000","unstructured":"T. St\u00fctzle and M. Dorigo. A short convergence proof for a class of aco algorithms. Technical Report IRIDIA\/2000-35, IRIDIA, Universit\u00e9 Libre de Bruxelles, Belgium, 2000."},{"key":"2_CR60","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1109\/ICEC.1997.592327","volume-title":"Proceedings of the 1997 IEEE International Conference on Evolutionary Computation (ICEC\u201997)","author":"T. St\u00fctzle","year":"1997","unstructured":"T. St\u00fctzle and H. H. Hoos. The $$ \\mathcal{M}\\mathcal{A}\\mathcal{X} - \\mathcal{M}\\mathcal{I}\\mathcal{N} $$ Ant System and local search for the traveling salesman problem. In T. B\u00e4ck, Z. Michalewicz, and X. Yao, editors, Proceedings of the 1997 IEEE International Conference on Evolutionary Computation (ICEC\u201997), pages 309\u2013314. IEEE Press, Piscataway, NJ, 1997."},{"issue":"8","key":"2_CR61","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"T. St\u00fctzle and H. H. Hoos. $$ \\mathcal{M}\\mathcal{A}\\mathcal{X} - \\mathcal{M}\\mathcal{I}\\mathcal{N} $$ Ant System. Future Generation Computer Systems, 16(8):889\u2013914, 2000.","journal-title":"Future Generation Computer Systems"},{"key":"2_CR62","unstructured":"I. A. Wagner, M. Lindenbaum, and A. M. Bruckstein. Smell as a computational resource-a lesson we can learn from the ant. In Proceedings of the Fourth Israeli Symposium on Theory of Computing and Systems (ISTCS-99), pages 219\u2013230, 1996."},{"key":"2_CR63","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1018957401093","volume":"24","author":"I. A. Wagner","year":"1998","unstructured":"I. A. Wagner, M. Lindenbaum, and A. M. Bruckstein. Efficient graph search by a smell-oriented vertex process. Annals of Mathematics and Artificial Intelligence, 24:211\u2013223, 1998.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"8","key":"2_CR64","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1016\/S0167-739X(00)00045-5","volume":"16","author":"I. A. Wagner","year":"2000","unstructured":"I. A. Wagner, M. Lindenbaum, and A. M. Bruckstein. ANTS: Agents, networks, trees and subgraphs. Future Generation Computer Systems, 16(8):915\u2013926, 2000.","journal-title":"Future Generation Computer Systems"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Life"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44811-X_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T23:10:40Z","timestamp":1628809840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44811-X_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425670","9783540448112"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/3-540-44811-x_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}