{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T09:35:12Z","timestamp":1771666512601,"version":"3.50.1"},"publisher-location":"Cham","reference-count":134,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319071237","type":"print"},{"value":"9783319071244","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-07124-4_21","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T19:09:59Z","timestamp":1534187399000},"page":"371-407","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Ant Colony Optimization: A Component-Wise Overview"],"prefix":"10.1007","author":[{"given":"Manuel","family":"L\u00f3pez-Ib\u00e1\u00f1ez","sequence":"first","affiliation":[]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Dorigo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"21_CR1","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-540-28646-2_7","volume-title":"4th international workshop on Ant colony optimization and swarm intelligence (ANTS 2004)","author":"A Acan","year":"2004","unstructured":"Acan A (2004) An external memory implementation in ant colony optimization. In: Dorigo M et al (eds) 4th international workshop on Ant colony optimization and swarm intelligence (ANTS 2004). Lecture notes in computer science, vol 3172. Springer, Heidelberg, pp 73\u201384"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1109\/ICTAI.2007.108","volume-title":"19th IEEE international conference on tools with artificial intelligence (ICTAI 2007)","author":"I Alaya","year":"2007","unstructured":"Alaya I, Solnon C, Gh\u00e9dira K (2007) Ant colony optimization for multi-objective optimization problems. In: 19th IEEE international conference on tools with artificial intelligence (ICTAI 2007), vol 1. IEEE Computer Society Press, Los Alamitos, pp 450\u2013457"},{"key":"21_CR3","first-page":"10","volume-title":"Proceedings of the genetic and evolutionary computation conference (GECCO 2007)","author":"E Alba","year":"2007","unstructured":"Alba E, Chicano F (2007) ACOhg: dealing with huge graphs. In: Thierens D et al (eds) Proceedings of the genetic and evolutionary computation conference (GECCO 2007). ACM Press, New York, pp 10\u201317"},{"key":"21_CR4","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/978-3-540-76931-6_21","volume-title":"Progress in artificial life (ACAL)","author":"D Angus","year":"2007","unstructured":"Angus D (2007) Population-based ant colony optimisation for multi-objective function optimisation. In: Randall M, Abbass HA, Wiles J (eds) Progress in artificial life (ACAL). Lecture notes in computer science, vol 4828. Springer, Heidelberg, pp 232\u2013244"},{"issue":"1","key":"21_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s11721-008-0022-4","volume":"3","author":"D Angus","year":"2009","unstructured":"Angus D, Woodward C (2009) Multiple objective ant colony optimisation. Swarm Intell 3(1):69\u201385","journal-title":"Swarm Intell"},{"key":"21_CR6","first-page":"71","volume-title":"Proceedings of the 35th winter simulation conference: driving innovation","author":"J April","year":"2003","unstructured":"April J, Glover F, Kelly JP, Laguna M (2003) Simulation-based optimization: practical introduction to simulation optimization. In: Chick SE, Sanchez PJ, Ferrin DM, Morrice DJ (eds) Proceedings of the 35th winter simulation conference: driving innovation, vol 1. ACM Press, New York, pp 71\u201378"},{"issue":"3","key":"21_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s11721-009-0031-y","volume":"3","author":"P Balaprakash","year":"2009","unstructured":"Balaprakash P, Birattari M, St\u00fctzle T, Yuan Z, Dorigo M (2009) Estimation-based ant colony optimization algorithms for the probabilistic travelling salesman problem. Swarm Intell 3(3):223\u2013242","journal-title":"Swarm Intell"},{"issue":"11","key":"21_CR8","doi-asserted-by":"crossref","first-page":"1939","DOI":"10.1016\/j.cor.2009.12.005","volume":"37","author":"P Balaprakash","year":"2010","unstructured":"Balaprakash P, Birattari M, St\u00fctzle T, Dorigo M (2010) Estimation-based metaheuristics for the probabilistic travelling salesman problem. Comput Oper Res 37(11):1939\u20131951","journal-title":"Comput Oper Res"},{"issue":"2","key":"21_CR9","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10589-014-9719-z","volume":"61","author":"P Balaprakash","year":"2015","unstructured":"Balaprakash P, Birattari M, St\u00fctzle T, Dorigo M (2015) Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers. Comput Optim Appl 61(2):463\u2013487","journal-title":"Comput Optim Appl"},{"key":"21_CR10","first-page":"97","volume-title":"A multiobjective ant colony system for vehicle routing problem with time windows","author":"B Bar\u00e1n","year":"2003","unstructured":"Bar\u00e1n B, Schaerer M (2003) A multiobjective ant colony system for vehicle routing problem with time windows. In: Proceedings of the twenty-first IASTED international conference on applied informatics, Insbruck, pp 97\u2013102"},{"key":"21_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1007\/3-540-45712-7_85","volume-title":"Parallel problem solving from nature, PPSN VII","author":"L Bianchi","year":"2002","unstructured":"Bianchi L, Gambardella LM, Dorigo M (2002) An ant colony optimization approach to the probabilistic traveling salesman problem. In: Merelo JJ et al (eds) Parallel problem solving from nature, PPSN VII. Lecture notes in computer science, vol 2439. Springer, Heidelberg, pp 883\u2013892"},{"issue":"1","key":"21_CR12","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10852-005-9033-y","volume":"5","author":"L Bianchi","year":"2006","unstructured":"Bianchi L, Birattari M, Manfrin M, Mastrolilli M, Paquete L, Rossi-Doria O, Schiavinotto T (2006) Hybrid metaheuristics for the vehicle routing problem with stochastic demands. J Math Modell Algorithms 5(1):91\u2013110","journal-title":"J Math Modell Algorithms"},{"issue":"2","key":"21_CR13","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s11047-008-9098-4","volume":"8","author":"L Bianchi","year":"2009","unstructured":"Bianchi L, Dorigo M, Gambardella LM, Gutjahr WJ (2009) A survey on metaheuristics for stochastic combinatorial optimization. Nat Comput 8(2):239\u2013287","journal-title":"Nat Comput"},{"key":"21_CR14","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-60469-3_22","volume-title":"Evolutionary computing, AISB Workshop","author":"G Bilchev","year":"1995","unstructured":"Bilchev G, Parmee IC (1995) The ant colony metaphor for searching continuous design spaces. In: Fogarty TC (ed) Evolutionary computing, AISB Workshop. Lecture notes in computer science, vol 993. Springer, Heidelberg, pp 25\u201339"},{"key":"21_CR15","series-title":"Operations research\/computer science interfaces series","first-page":"189","volume-title":"Metaheuristics \u2013 progress in complex systems optimization","author":"M Birattari","year":"2006","unstructured":"Birattari M, Balaprakash P, Dorigo M (2006) The ACO\/F-RACE algorithm for combinatorial optimization under uncertainty. In: Doerner KF, Gendreau M, Greistorfer P, Gutjahr WJ, Hartl RF, Reimann M (eds) Metaheuristics \u2013 progress in complex systems optimization. Operations research\/computer science interfaces series, vol 39. Springer, New York, pp 189\u2013203"},{"issue":"6","key":"21_CR16","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C Blum","year":"2005","unstructured":"Blum C (2005) Beam-ACO \u2013 hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput Oper Res 32(6):1565\u20131591","journal-title":"Comput Oper Res"},{"issue":"2","key":"21_CR17","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1109\/TEVC.2004.841688","volume":"9","author":"C Blum","year":"2005","unstructured":"Blum C, Dorigo M (2005) Search bias in ant colony optimization: on the role of competition-balanced systems. IEEE Trans Evol Comput 9(2):159\u2013174","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"21_CR18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10287-006-0008-x","volume":"4","author":"SC Brailsford","year":"2006","unstructured":"Brailsford SC, Gutjahr WJ, Rauner MS, Zeppelzauer W (2006) Combined discrete-event simulation and ant colony optimisation approach for selecting optimal screening policies for diabetic retinopathy. Comput Manag Sci 4(1):59\u201383","journal-title":"Comput Manag Sci"},{"issue":"1","key":"21_CR19","first-page":"25","volume":"7","author":"B Bullnheimer","year":"1999","unstructured":"Bullnheimer B, Hartl RF, Strauss C (1999) A new rank-based version of the ant system: a computational study. Cent Eur J Oper Res Econ 7(1):25\u201338","journal-title":"Cent Eur J Oper Res Econ"},{"key":"21_CR20","first-page":"134","volume-title":"Proceedings of the first European conference on artificial life","author":"A Colorni","year":"1992","unstructured":"Colorni A, Dorigo M, Maniezzo V (1992) Distributed optimization by ant colonies. In: Varela FJ, Bourgine P (eds) Proceedings of the first European conference on artificial life. MIT Press, Cambridge, pp 134\u2013142"},{"key":"21_CR21","first-page":"22","volume-title":"Abstract proceedings of ANTS 2000 \u2013 from ant colonies to artificial ants: second international workshop on ant algorithms","author":"O Cord\u00f3n","year":"2000","unstructured":"Cord\u00f3n O, de Viana IF, Herrera F, Moreno L (2000) A new ACO model integrating evolutionary computation concepts: the best-worst ant system. In: Dorigo M et al (eds) Abstract proceedings of ANTS 2000 \u2013 from ant colonies to artificial ants: second international workshop on ant algorithms. IRIDIA, Universit\u00e9 Libre de Bruxelles, Belgium, pp 22\u201329"},{"issue":"2","key":"21_CR22","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF01417909","volume":"3","author":"JL Deneubourg","year":"1990","unstructured":"Deneubourg JL, Aron S, Goss S, Pasteels JM (1990) The self-organizing exploratory pattern of the Argentine ant. J Insect Behav 3(2):159\u2013168","journal-title":"J Insect Behav"},{"key":"21_CR23","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1613\/jair.530","volume":"9","author":"GA Caro Di","year":"1998","unstructured":"Di Caro GA, Dorigo M (1998) AntNet: distributed stigmergetic control for communications networks. J Artif Intell Res 9:317\u2013365","journal-title":"J Artif Intell Res"},{"issue":"5","key":"21_CR24","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1002\/ett.1062","volume":"16","author":"GA Caro Di","year":"2005","unstructured":"Di Caro GA, Ducatelle F, Gambardella LM (2005) AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks. Eur Trans Telecommun 16(5):443\u2013455","journal-title":"Eur Trans Telecommun"},{"key":"21_CR25","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-319-09952-1_2","volume-title":"Swarm Intelligence, 9th International Conference, ANTS 2014","author":"D D\u00edaz","year":"2014","unstructured":"D\u00edaz D, Valledor P, Areces P, Rodil J, Su\u00e1rez M (2014) An ACO algorithm to solve an extended cutting stock problem for scrap minimization in a bar mill. In: Dorigo M et al (eds) Swarm Intelligence, 9th International Conference, ANTS 2014. Lecture notes in computer science, vol 8667. Springer, Heidelberg, pp 13\u201324"},{"issue":"2","key":"21_CR26","first-page":"115","volume":"11","author":"KF Doerner","year":"2003","unstructured":"Doerner KF, Hartl RF, Reimann M (2003) Are COMPETants more competent for problem solving? The case of a multiple objective transportation problem. Cent Eur J Oper Res Econ 11(2):115\u2013141","journal-title":"Cent Eur J Oper Res Econ"},{"key":"21_CR27","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/B:ANOR.0000039513.99038.c6","volume":"131","author":"KF Doerner","year":"2004","unstructured":"Doerner KF, Gutjahr WJ, Hartl RF, Strauss C, Stummer C (2004) Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection. Ann Oper Res 131:79\u201399","journal-title":"Ann Oper Res"},{"issue":"1","key":"21_CR28","doi-asserted-by":"crossref","first-page":"1629","DOI":"10.1016\/j.tcs.2010.12.030","volume":"412","author":"B Doerr","year":"2011","unstructured":"Doerr B, Neumann F, Sudholt D, Witt C (2011) Runtime analysis of the 1-ANT ant colony optimizer. Theor Comput Sci 412(1):1629\u20131644","journal-title":"Theor Comput Sci"},{"issue":"3","key":"21_CR29","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1016\/j.ejor.2006.06.047","volume":"185","author":"AV Donati","year":"2008","unstructured":"Donati AV, Montemanni R, Casagrande N, Rizzoli AE, Gambardella LM (2008) Time dependent vehicle routing problem with a multi ant colony system. Eur J Oper Res 185(3):1174\u20131191","journal-title":"Eur J Oper Res"},{"key":"21_CR30","unstructured":"Dorigo M (1992) Optimization, learning and natural algorithms. PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy (in Italian)"},{"issue":"3","key":"21_CR31","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.4249\/scholarpedia.1461","volume":"2","author":"M Dorigo","year":"2007","unstructured":"Dorigo M (2007) Ant colony optimization. Scholarpedia 2(3):1461","journal-title":"Scholarpedia"},{"issue":"2\u20133","key":"21_CR32","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344(2\u20133):243\u2013278","journal-title":"Theor Comput Sci"},{"key":"21_CR33","first-page":"11","volume-title":"New ideas in optimization","author":"M Dorigo","year":"1999","unstructured":"Dorigo M, Di Caro GA (1999) The ant colony optimization meta-heuristic. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw Hill, London, pp 11\u201332"},{"issue":"1","key":"21_CR34","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"21_CR35","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant colony optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo M, St\u00fctzle T (2004) Ant colony optimization. MIT Press, Cambridge"},{"key":"21_CR36","unstructured":"Dorigo M, Maniezzo V, Colorni A (1991) The ant system: an autocatalytic optimizing process. Technical Report 91-016 Revised, Dipartimento di Elettronica, Politecnico di Milano, Italy"},{"key":"21_CR37","unstructured":"Dorigo M, Maniezzo V, Colorni A (1991) Positive feedback as a search strategy. Technical Report 91-016, Dipartimento di Elettronica, Politecnico di Milano, Italy"},{"issue":"1","key":"21_CR38","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"issue":"5","key":"21_CR39","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/j.future.2003.07.015","volume":"20","author":"J Dr\u00e9o","year":"2004","unstructured":"Dr\u00e9o J, Siarry P (2004) Continuous interacting ant colony algorithm based on dense heterarchy. Future Gener Comput Syst 20(5):841\u2013856","journal-title":"Future Gener Comput Syst"},{"key":"21_CR40","series-title":"Lecture notes in economics and mathematical systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22199-0","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott M (2000) Multicriteria optimization. Lecture notes in economics and mathematical systems, vol 491. Springer, Berlin"},{"key":"21_CR41","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/3-540-45724-0_8","volume-title":"Ant algorithms. Third international workshop, ANTS 2002","author":"CJ Eyckelhof","year":"2002","unstructured":"Eyckelhof CJ, Snoek M (2002) Ant systems for a dynamic TSP: ants caught in a traffic jam. In: Dorigo M et al (eds) Ant algorithms. Third international workshop, ANTS 2002. Lecture notes in computer science, vol 2463. Springer, Heidelberg, pp 88\u201399"},{"issue":"2","key":"21_CR42","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8(2):67\u201371","journal-title":"Oper Res Lett"},{"key":"21_CR43","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Global Optim 6:109\u2013113","journal-title":"J Global Optim"},{"key":"21_CR44","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/978-3-319-09952-1_13","volume-title":"Swarm Intelligence. 9th International conference, ANTS 2014","author":"S Fern\u00e1ndez","year":"2014","unstructured":"Fern\u00e1ndez S, \u00c1lvarez S, D\u00edaz D, Iglesias M, Ena B (2014) Scheduling a galvanizing line by ant colony optimization. In: Dorigo M et al (eds) Swarm Intelligence. 9th International conference, ANTS 2014. Lecture notes in computer science, vol 8667. Springer, Heidelberg, pp 146\u2013157"},{"key":"21_CR45","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1109\/ICEC.1996.542672","volume-title":"Proceedings of the 1996 IEEE international conference on evolutionary computation (ICEC\u201996)","author":"LM Gambardella","year":"1996","unstructured":"Gambardella LM, Dorigo M (1996) Solving symmetric and asymmetric TSPs by ant colonies. In: B\u00e4ck T, Fukuda T, Michalewicz Z (eds) Proceedings of the 1996 IEEE international conference on evolutionary computation (ICEC\u201996). IEEE Press, Piscataway, pp 622\u2013627"},{"key":"21_CR46","first-page":"63","volume-title":"New ideas in optimization","author":"LM Gambardella","year":"1999","unstructured":"Gambardella LM, Taillard \u00c9D, Agazzi G (1999) MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw Hill, London, pp 63\u201376"},{"issue":"3","key":"21_CR47","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1016\/j.ejor.2012.02.038","volume":"220","author":"LM Gambardella","year":"2012","unstructured":"Gambardella LM, Montemanni R, Weyland D (2012) Coupling ant colony systems with strong local searches. Eur J Oper Res 220(3):831\u2013843","journal-title":"Eur J Oper Res"},{"issue":"1","key":"21_CR48","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.ejor.2006.03.041","volume":"180","author":"C Garc\u00eda-Mart\u00ednez","year":"2007","unstructured":"Garc\u00eda-Mart\u00ednez C, Cord\u00f3n O, Herrera F (2007) A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP. Eur J Oper Res 180(1):116\u2013148","journal-title":"Eur J Oper Res"},{"key":"21_CR49","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman & Co, San Francisco"},{"key":"21_CR50","series-title":"Lecture notes in computer science","first-page":"1","volume-title":"Artificial evolution","author":"F Glover","year":"1998","unstructured":"Glover F (1998) A template for scatter search and path relinking. In: Hao JK, Lutton E, Ronald EMA, Schoenauer M, Snyers D (eds) Artificial evolution. Lecture notes in computer science, vol 1363. Springer, Heidelberg, pp 1\u201351"},{"key":"21_CR51","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Boston"},{"key":"21_CR52","series-title":"Lecture notes in computer science, vol","first-page":"165","volume-title":"Applications of evolutionary computing. Proceedings of EvoWorkshops 2003","author":"M Guntsch","year":"2003","unstructured":"Guntsch M, Branke J (2003) New ideas for applying ant colony optimization to the probabilistic tsp. In: Cagnoni S et al (eds) Applications of evolutionary computing. Proceedings of EvoWorkshops 2003. Lecture notes in computer science, vol 2611. Springer, Heidelberg, pp 165\u2013175"},{"key":"21_CR53","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-45365-2_22","volume-title":"Applications of evolutionary computing. Proceedings of EvoWorkshops 2001","author":"M Guntsch","year":"2001","unstructured":"Guntsch M, Middendorf M (2001) Pheromone modification strategies for ant algorithms applied to dynamic TSP. In: Boers EJW et al (eds) Applications of evolutionary computing. Proceedings of EvoWorkshops 2001. Lecture notes in computer science, vol 2037. Springer, Heidelberg, pp 213\u2013222"},{"key":"21_CR54","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-45724-0_10","volume-title":"Ant algorithms. Third international workshop, ANTS 2002","author":"M Guntsch","year":"2002","unstructured":"Guntsch M, Middendorf M (2002) Applying population based ACO to dynamic optimization problems. In: Dorigo M et al (eds) Ant algorithms. Third international workshop, ANTS 2002. Lecture notes in computer science, vol 2463. Springer, Heidelberg, pp 111\u2013122"},{"key":"21_CR55","series-title":"Lecture notes in computer science, vol","first-page":"71","volume-title":"Applications of evolutionary computing. Proceedings of EvoWorkshops 2002","author":"M Guntsch","year":"2002","unstructured":"Guntsch M, Middendorf M (2002) A population based approach for ACO. In: Cagnoni S et al (eds) Applications of evolutionary computing. Proceedings of EvoWorkshops 2002. Lecture notes in computer science, vol 2279. Springer, Heidelberg, pp 71\u201380"},{"key":"21_CR56","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1007\/3-540-36970-8_33","volume-title":"Evolutionary multi-criterion optimization, EMO 2003","author":"M Guntsch","year":"2003","unstructured":"Guntsch M, Middendorf M (2003) Solving multi-objective permutation problems with population based ACO. In: Fonseca CM, Fleming PJ, Zitzler E, Deb K, Thiele L (eds) Evolutionary multi-criterion optimization, EMO 2003. Lecture notes in computer science, vol 2632. Springer, Heidelberg, pp 464\u2013478"},{"issue":"8","key":"21_CR57","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","volume":"16","author":"WJ Gutjahr","year":"2000","unstructured":"Gutjahr WJ (2000) A Graph-based ant system and its convergence. Future Gener Comput Syst 16(8):873\u2013888","journal-title":"Future Gener Comput Syst"},{"issue":"3","key":"21_CR58","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0020-0190(01)00258-7","volume":"82","author":"WJ Gutjahr","year":"2002","unstructured":"Gutjahr WJ (2002) ACO algorithms with guaranteed convergence to the optimal solution. Inf Process Lett 82(3):145\u2013153","journal-title":"Inf Process Lett"},{"key":"21_CR59","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/978-3-540-28646-2_21","volume-title":"4th international workshop on Ant colony optimization and swarm intelligence (ANTS 2004)","author":"WJ Gutjahr","year":"2004","unstructured":"Gutjahr WJ (2004) S-ACO: An ant-based approach to combinatorial optimization under uncertainty. In: Dorigo M et al (eds) 4th international workshop on Ant colony optimization and swarm intelligence (ANTS 2004). Lecture notes in computer science, vol 3172. Springer, Heidelberg, pp 238\u2013249"},{"issue":"1","key":"21_CR60","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s11009-006-7291-4","volume":"8","author":"WJ Gutjahr","year":"2006","unstructured":"Gutjahr WJ (2006) On the finite-time dynamics of ant colony optimization. Method Comput Appl Probab 8(1):105\u2013133","journal-title":"Method Comput Appl Probab"},{"issue":"1","key":"21_CR61","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s11721-007-0001-1","volume":"1","author":"WJ Gutjahr","year":"2007","unstructured":"Gutjahr WJ (2007) Mathematical runtime analysis of ACO algorithms: survey on an emerging issue. Swarm Intell 1(1):59\u201379","journal-title":"Swarm Intell"},{"issue":"9","key":"21_CR62","doi-asserted-by":"crossref","first-page":"2711","DOI":"10.1016\/j.cor.2006.12.017","volume":"35","author":"WJ Gutjahr","year":"2008","unstructured":"Gutjahr WJ (2008) First steps to the runtime complexity analysis of ant colony optimization. Comput Oper Res 35(9):2711\u20132727","journal-title":"Comput Oper Res"},{"issue":"3","key":"21_CR63","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.cor.2005.03.018","volume":"34","author":"WJ Gutjahr","year":"2007","unstructured":"Gutjahr WJ, Rauner MS (2007) An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria. Comput Oper Res 34(3):642\u2013666","journal-title":"Comput Oper Res"},{"issue":"3","key":"21_CR64","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"JP Hart","year":"1987","unstructured":"Hart JP, Shogan AW (1987) Semi-greedy heuristics: an empirical study. Oper Res Lett 6(3):107\u2013114","journal-title":"Oper Res Lett"},{"issue":"2","key":"21_CR65","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/2076450.2076469","volume":"55","author":"HH Hoos","year":"2012","unstructured":"Hoos HH (2012) Programming by optimization. Commun ACM 55(2):70\u201380","journal-title":"Commun ACM"},{"issue":"4","key":"21_CR66","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s11721-012-0074-3","volume":"6","author":"C Iacopino","year":"2012","unstructured":"Iacopino C, Palmer P (2012) The dynamics of ant colony optimization algorithms applied to binary chains. Swarm Intell 6(4):343\u2013377","journal-title":"Swarm Intell"},{"key":"21_CR67","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/3-540-44719-9_25","volume-title":"Evolutionary Multi-criterion Optimization, EMO 2001","author":"S Iredi","year":"2001","unstructured":"Iredi S, Merkle D, Middendorf M (2001) Bi-criterion optimization with multi colony ant algorithms. In: Zitzler E, Deb K, Thiele L, Coello Coello CA, Corne D (eds) Evolutionary Multi-criterion Optimization, EMO 2001. Lecture notes in computer science, vol 1993. Springer, Heidelberg, pp 359\u2013372"},{"issue":"4","key":"21_CR68","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"DR Jones","year":"1998","unstructured":"Jones DR, Schonlau M, Welch WJ (1998) Efficient global optimization of expensive black-box functions. J Global Optim 13(4):455\u2013492","journal-title":"J Global Optim"},{"key":"21_CR69","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-3-642-11169-3_9","volume-title":"Learning and intelligent optimization. Third international conference, LION 3","author":"M Khichane","year":"2009","unstructured":"Khichane M, Albert P, Solnon C (2009) An ACO-based reactive framework for ant colony optimization: first experiments on constraint satisfaction problems. In: St\u00fctzle T (ed) Learning and intelligent optimization. Third international conference, LION 3. Lecture notes in computer science, vol 5851. Springer, Heidelberg, pp 119\u2013133"},{"issue":"2","key":"21_CR70","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s11721-007-0006-9","volume":"1","author":"O Korb","year":"2007","unstructured":"Korb O, St\u00fctzle T, Exner TE (2007) An ant colony optimization approach to flexible protein\u2013ligand docking. Swarm Intell 1(2):115\u2013134","journal-title":"Swarm Intell"},{"issue":"1","key":"21_CR71","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11721-011-0059-7","volume":"6","author":"T K\u00f6tzing","year":"2012","unstructured":"K\u00f6tzing T, Neumann F, R\u00f6glin H, Witt C (2012) Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intell 6(1):1\u201321","journal-title":"Swarm Intell"},{"key":"21_CR72","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/978-3-540-87536-9_45","volume-title":"ICANN\u201908: Proceedings of the 18th international conference on artificial neural networks, Part I","author":"O Kov\u00e1\u0159\u00edk","year":"2008","unstructured":"Kov\u00e1\u0159\u00edk O, Skrbek M (2008) Ant colony optimization with castes. In: Kurkova-Pohlova V, Koutnik J (eds) ICANN\u201908: Proceedings of the 18th international conference on artificial neural networks, Part I. Lecture notes in computer science, vol 5163. Springer, Heidelberg, pp 435\u2013442"},{"key":"21_CR73","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-642-30665-5_9","volume-title":"Metaheuristics for dynamic optimization, studies in computational intelligence","author":"G Leguizam\u00f3n","year":"2013","unstructured":"Leguizam\u00f3n G, Alba E (2013) Ant colony based algorithms for dynamic optimization problems. In: Alba E, Nakib A, Siarry P (eds) Metaheuristics for dynamic optimization, studies in computational intelligence, vol 433. Springer, Berlin\/Heidelberg, pp 189\u2013210"},{"key":"21_CR74","first-page":"125","volume-title":"Proceedings of the genetic and evolutionary computation conference, GECCO 2011","author":"T Liao","year":"2011","unstructured":"Liao T, Montes de Oca MA, Ayd\u0131n D, St\u00fctzle T, Dorigo M (2011) An incremental ant colony algorithm with local search for continuous optimization. In: Krasnogor N, Lanzi PL (eds) Proceedings of the genetic and evolutionary computation conference, GECCO 2011. ACM Press, New York, pp 125\u2013132"},{"issue":"4","key":"21_CR75","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TEVC.2013.2281531","volume":"18","author":"T Liao","year":"2014","unstructured":"Liao T, Socha K, Montes de Oca MA, St\u00fctzle T, Dorigo M (2014) Ant colony optimization for mixed-variable optimization problems. IEEE Trans Evol Comput 18(4):503\u2013518","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"21_CR76","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.ejor.2013.10.024","volume":"234","author":"T Liao","year":"2014","unstructured":"Liao T, St\u00fctzle T, Montes de Oca MA, Dorigo M (2014) A unified ant colony optimization algorithm for continuous optimization. Eur J Oper Res 234(3):597\u2013609","journal-title":"Eur J Oper Res"},{"key":"21_CR77","doi-asserted-by":"crossref","unstructured":"Lissovoi A, Witt C (2015) Runtime analysis of ant colony optimization on dynamic shortest path problems. Theor Comput Sci 61(Part A):73\u201385","DOI":"10.1016\/j.tcs.2014.06.035"},{"issue":"9","key":"21_CR78","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1016\/j.cor.2009.11.015","volume":"37","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2010","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, Blum C (2010) Beam-ACO for the travelling salesman problem with time windows. Comput Oper Res 37(9):1570\u20131583","journal-title":"Comput Oper Res"},{"issue":"6","key":"21_CR79","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1109\/TEVC.2011.2182651","volume":"16","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2012","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, St\u00fctzle T (2012) The automatic design of multi-objective ant colony optimization algorithms. IEEE Trans Evol Comput 16(6):861\u2013875","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"21_CR80","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s11721-012-0070-7","volume":"6","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2012","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, St\u00fctzle T (2012) An experimental analysis of design choices of multi-objective ant colony optimization algorithms. Swarm Intell 6(3):207\u2013232","journal-title":"Swarm Intell"},{"issue":"3","key":"21_CR81","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1016\/j.ejor.2013.10.043","volume":"235","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2014","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, St\u00fctzle T (2014) Automatically improving the anytime behaviour of optimisation algorithms. Eur J Oper Res 235(3):569\u2013582","journal-title":"Eur J Oper Res"},{"issue":"1","key":"21_CR82","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10852-005-9034-x","volume":"5","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2006","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, Paquete L, St\u00fctzle T (2006) Hybrid population-based algorithms for the bi-objective quadratic assignment problem. J Math Modell Algorithms 5(1):111\u2013137","journal-title":"J Math Modell Algorithms"},{"key":"21_CR83","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, Dubois-Lacoste J, P\u00e9rez C\u00e1ceres L, St\u00fctzle T, Birattari M (2016) The irace package: iterated racing for automatic algorithm configuration. Oper Res Perspect 3:43\u201358","journal-title":"Oper Res Perspect"},{"issue":"4","key":"21_CR84","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/ijoc.11.4.358","volume":"11","author":"V Maniezzo","year":"1999","unstructured":"Maniezzo V (1999) Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS J Comput 11(4):358\u2013369","journal-title":"INFORMS J Comput"},{"issue":"8","key":"21_CR85","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/S0167-739X(00)00046-7","volume":"16","author":"V Maniezzo","year":"2000","unstructured":"Maniezzo V, Carbonaro A (2000) An ANTS heuristic for the frequency assignment problem. Futur Gener Comput Syst 16(8):927\u2013935","journal-title":"Futur Gener Comput Syst"},{"key":"21_CR86","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with constraints","author":"K Marriott","year":"1998","unstructured":"Marriott K, Stuckey P (1998) Programming with constraints. MIT Press, Cambridge"},{"issue":"5","key":"21_CR87","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1109\/TEVC.2006.890229","volume":"11","author":"D Martens","year":"2007","unstructured":"Martens D, Backer MD, Haesen R, Vanthienen J, Snoeck M, Baesens B (2007) Classification with ant colony optimization. IEEE Trans Evol Comput 11(5):651\u2013665","journal-title":"IEEE Trans Evol Comput"},{"key":"21_CR88","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/978-3-642-29828-8_17","volume-title":"Integration of AI and OR techniques in contraint programming for combinatorial optimization problems","author":"F Massen","year":"2012","unstructured":"Massen F, Deville Y, van Hentenryck P (2012) Pheromone-based heuristic column generation for vehicle routing problems with black box feasibility. In: Beldiceanu N, Jussien N, Pinson E (eds) Integration of AI and OR techniques in contraint programming for combinatorial optimization problems. Lecture notes in computer science, vol 7298. Springer, Heidelberg, pp 260\u2013274"},{"key":"21_CR89","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/978-3-642-38516-2_8","volume-title":"Hybrid metaheuristics","author":"F Massen","year":"2013","unstructured":"Massen F, L\u00f3pez-Ib\u00e1\u00f1ez M, St\u00fctzle T, Deville Y (2013) Experimental analysis of pheromone-based heuristic column generation using irace. In: Blesa MJ, Blum C, Festa P, Roli A, Sampels M (eds) Hybrid metaheuristics. Lecture notes in computer science, vol 7919. Springer, Heidelberg, pp 92\u2013106"},{"key":"21_CR90","unstructured":"Merkle D, Middendorf M (2001) Prospects for dynamic algorithm control: Lessons from the phase structure of ant scheduling algorithms. In: Heckendorn RB (ed) Proceedings of the 2001 genetic and evolutionary computation conference \u2013 workshop program. Workshop \u201cThe Next Ten Years of Scheduling Research\u201d. Morgan Kaufmann Publishers, San Francisco, pp 121\u2013126"},{"issue":"3","key":"21_CR91","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1162\/106365602760234090","volume":"10","author":"D Merkle","year":"2002","unstructured":"Merkle D, Middendorf M (2002) Modeling the dynamics of ant colony optimization. Evol Comput 10(3):235\u2013262","journal-title":"Evol Comput"},{"issue":"1","key":"21_CR92","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1020999407672","volume":"18","author":"D Merkle","year":"2003","unstructured":"Merkle D, Middendorf M (2003) Ant colony optimization with global pheromone evaluation for scheduling a single machine. Appl Intell 18(1):105\u2013111","journal-title":"Appl Intell"},{"issue":"4","key":"21_CR93","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/TEVC.2002.802450","volume":"6","author":"D Merkle","year":"2002","unstructured":"Merkle D, Middendorf M, Schmeck H (2002) Ant colony optimization for resource-constrained project scheduling. IEEE Trans Evol Comput 6(4):333\u2013346","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"21_CR94","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1162\/106454602320184202","volume":"8","author":"N Meuleau","year":"2002","unstructured":"Meuleau N, Dorigo M (2002) Ant colony optimization and stochastic gradient descent. Artif Life 8(2):103\u2013121","journal-title":"Artif Life"},{"key":"21_CR95","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-3-540-28646-2_15","volume-title":"Ant colony optimization and swarm intelligence. 4th international workshop, ANTS 2004","author":"B Meyer","year":"2004","unstructured":"Meyer B, Ernst AT (2004) Integrating ACO and constraint propagation. In: Dorigo M et al (eds) Ant colony optimization and swarm intelligence. 4th international workshop, ANTS 2004. Lecture notes in computer science, vol 3172. Springer, Heidelberg, pp 166\u2013177"},{"key":"21_CR96","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1007\/BFb0056911","volume-title":"Parallel problem solving from nature, PPSN V","author":"R Michel","year":"1998","unstructured":"Michel R, Middendorf M (1998) An island model based ant system with lookahead for the shortest supersequence problem. In: Eiben AE, B\u00e4ck T, Schoenauer M, Schwefel HP (eds) Parallel problem solving from nature, PPSN V. Lecture notes in computer science, vol 1498. Springer, Heidelberg, pp 692\u2013701"},{"issue":"8","key":"21_CR97","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/S0167-739X(00)00047-9","volume":"16","author":"N Monmarch\u00e9","year":"2000","unstructured":"Monmarch\u00e9 N, Venturini G, Slimane M (2000) On how pachycondyla apicalis ants suggest a new search algorithm. Futur Gener Comput Syst 16(8):937\u2013946","journal-title":"Futur Gener Comput Syst"},{"key":"21_CR98","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","volume":"10","author":"R Montemanni","year":"2005","unstructured":"Montemanni R, Gambardella LM, Rizzoli AE, Donati AV (2005) Ant colony system for a dynamic vehicle routing problem. J Comb Optim 10:327\u2013343","journal-title":"J Comb Optim"},{"issue":"9","key":"21_CR99","doi-asserted-by":"crossref","first-page":"2728","DOI":"10.1016\/j.cor.2006.12.014","volume":"35","author":"J Montgomery","year":"2008","unstructured":"Montgomery J, Randall M, Hendtlass T (2008) Solution bias in ant colony optimisation: lessons for selecting pheromone models. Comput Oper Res 35(9):2728\u20132749","journal-title":"Comput Oper Res"},{"key":"21_CR100","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/978-3-642-20364-0_13","volume-title":"Proceedings of EvoCOP 2011 \u2013 11th European conference on evolutionary computation in combinatorial optimization","author":"A Moraglio","year":"2011","unstructured":"Moraglio A, Kattan A (2011) Geometric generalisation of surrogate model based optimization to combinatorial spaces. In: Merz P, Hao JK (eds) Proceedings of EvoCOP 2011 \u2013 11th European conference on evolutionary computation in combinatorial optimization. Lecture notes in computer science, vol 6622. Springer, Heidelberg, pp 142\u2013154"},{"issue":"3","key":"21_CR101","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1016\/j.ejor.2008.03.033","volume":"197","author":"S Morin","year":"2009","unstructured":"Morin S, Gagn\u00e9 C, Gravel M (2009) Ant colony optimization with a specialized pheromone trail for the car-sequencing problem. Eur J Oper Res 197(3):1185\u20131191","journal-title":"Eur J Oper Res"},{"key":"21_CR102","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/978-3-319-10762-2_10","volume-title":"PPSN 2014","author":"S Nallaperuma","year":"2014","unstructured":"Nallaperuma S, Wagner M, Neumann F (2014) Parameter prediction based on features of evolved instances for ant colony optimization and the traveling salesperson problem. In: Bartz-Beielstein T, Branke J, Filipi\u010d B, Smith J (eds) PPSN 2014. Lecture notes in computer science, vol 8672. Springer, Heidelberg, pp 100\u2013109"},{"key":"21_CR103","doi-asserted-by":"crossref","unstructured":"Neumann F, Witt C (2006) Runtime analysis of a simple ant colony optimization algorithm. Electronic Colloquium on Computational Complexity (ECCC) 13(084)","DOI":"10.1007\/11940128_62"},{"issue":"1","key":"21_CR104","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s11721-008-0023-3","volume":"3","author":"F Neumann","year":"2009","unstructured":"Neumann F, Sudholt D, Witt C (2009) Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intell 3(1):35\u201368","journal-title":"Swarm Intell"},{"key":"21_CR105","first-page":"297","volume":"26","author":"PS Ow","year":"1988","unstructured":"Ow PS, Morton TE (1988) Filtered beam search in scheduling. Int J Prod Res 26:297\u2013307","journal-title":"Int J Prod Res"},{"key":"21_CR106","volume-title":"Combinatorial optimization \u2013 algorithms and complexity","author":"CH Papadimitriou","year":"1982","unstructured":"Papadimitriou CH, Steiglitz K (1982) Combinatorial optimization \u2013 algorithms and complexity. Prentice Hall, Englewood Cliffs"},{"issue":"8","key":"21_CR107","doi-asserted-by":"crossref","first-page":"5181","DOI":"10.1016\/j.asoc.2011.05.042","volume":"11","author":"M Pedemonte","year":"2011","unstructured":"Pedemonte M, Nesmachnow S, Cancela H (2011) A survey on parallel ant colony optimization. Appl Soft Comput 11(8):5181\u20135197","journal-title":"Appl Soft Comput"},{"issue":"1","key":"21_CR108","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s11721-011-0061-0","volume":"6","author":"P Pellegrini","year":"2012","unstructured":"Pellegrini P, Birattari M, St\u00fctzle T (2012) A critical analysis of parameter adaptation in ant colony optimization. Swarm Intell 6(1):23\u201348","journal-title":"Swarm Intell"},{"issue":"2-3","key":"21_CR109","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s11721-015-0106-x","volume":"9","author":"L P\u00e9rez C\u00e1ceres","year":"2015","unstructured":"P\u00e9rez C\u00e1ceres L, L\u00f3pez-Ib\u00e1\u00f1ez M, St\u00fctzle T (2015) Ant colony optimization on a limited budget of evaluations. Swarm Intell 9(2-3):103\u2013124","journal-title":"Swarm Intell"},{"key":"21_CR110","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/978-3-540-28646-2_37","volume-title":"4th international workshop on Ant colony optimization and swarm intelligence (ANTS 2004)","author":"M Randall","year":"2004","unstructured":"Randall M (2004) Near parameter free ant colony optimisation. In: Dorigo M et al (eds) 4th international workshop on Ant colony optimization and swarm intelligence (ANTS 2004). Lecture notes in computer science, vol 3172. Springer, Heidelberg, pp 374\u2013381"},{"key":"21_CR111","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/3-540-45724-0_22","volume-title":"3rd international workshop on Ant algorithms (ANTS 2002)","author":"M Randall","year":"2002","unstructured":"Randall M, Montgomery J (2002) Candidate set strategies for ant colony optimisation. In: Dorigo M et al (eds) 3rd international workshop on Ant algorithms (ANTS 2002). Lecture notes in computer science, vol 2463. Springer, Heidelberg, pp 243\u2013249"},{"issue":"3","key":"21_CR112","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz R, St\u00fctzle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177(3):2033\u20132049","journal-title":"Eur J Oper Res"},{"issue":"3","key":"21_CR113","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s11721-009-0029-5","volume":"3","author":"M Schilde","year":"2009","unstructured":"Schilde M, Doerner KF, Hartl RF, Kiechle G (2009) Metaheuristics for the bi-objective orienteering problem. Swarm Intell 3(3):179\u2013201","journal-title":"Swarm Intell"},{"key":"21_CR114","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-540-28646-2_3","volume-title":"4th international workshop on Ant colony optimization and swarm intelligence (ANTS 2004)","author":"K Socha","year":"2004","unstructured":"Socha K (2004) ACO for continuous and mixed-variable optimization. In: Dorigo M et al (eds) 4th international workshop on Ant colony optimization and swarm intelligence (ANTS 2004). Lecture notes in computer science, vol 3172. Springer, Heidelberg, pp 25\u201336"},{"key":"21_CR115","unstructured":"Socha K, Dorigo M (2007) Ant colony optimization for mixed-variable optimization problems. Technical Report TR\/IRIDIA\/2007-019, IRIDIA, Universit\u00e9 Libre de Bruxelles"},{"issue":"3","key":"21_CR116","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1016\/j.ejor.2006.06.046","volume":"185","author":"K Socha","year":"2008","unstructured":"Socha K, Dorigo M (2008) Ant colony optimization for continuous domains. Eur J Oper Res 185(3):1155\u20131173","journal-title":"Eur J Oper Res"},{"key":"21_CR117","volume-title":"Multiple criteria optimization: theory, computation and application. Wiley series in probability and mathematical statistics","author":"RE Steuer","year":"1986","unstructured":"Steuer RE (1986) Multiple criteria optimization: theory, computation and application. Wiley series in probability and mathematical statistics. John Wiley & Sons, New York"},{"key":"21_CR118","unstructured":"St\u00fctzle T (1998) Local search algorithms for combinatorial problems \u2013 analysis, improvements, and new applications. PhD thesis, FB Informatik, TU Darmstadt"},{"key":"21_CR119","unstructured":"St\u00fctzle T (2002) ACOTSP: a software package of various ant colony optimization algorithms applied to the symmetric traveling salesman problem. http:\/\/www.aco-metaheuristic.org\/aco-code\/"},{"key":"21_CR120","first-page":"33","volume-title":"New ideas in optimization","author":"T St\u00fctzle","year":"1999","unstructured":"St\u00fctzle T, Dorigo M (1999) ACO algorithms for the quadratic assignment problem. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw Hill, London, pp 33\u201350"},{"issue":"4","key":"21_CR121","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1109\/TEVC.2002.802444","volume":"6","author":"T St\u00fctzle","year":"2002","unstructured":"St\u00fctzle T, Dorigo M (2002) A short convergence proof for a class of ACO algorithms. IEEE Trans Evol Comput 6(4):358\u2013365","journal-title":"IEEE Trans Evol Comput"},{"key":"21_CR122","unstructured":"St\u00fctzle T, Hoos HH (1996) Improving the ant system: a detailed report on the MAX\u2013MIN ant system. Technical Report AIDA\u201396\u201312, FG Intellektik, FB Informatik, TU Darmstadt"},{"key":"21_CR123","doi-asserted-by":"crossref","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":"St\u00fctzle T, Hoos HH (1997) The MAX\u2013MIN ant system and local search for the traveling salesman problem. In: B\u00e4ck T, Michalewicz Z, Yao X (eds) Proceedings of the 1997 IEEE international conference on evolutionary computation (ICEC\u201997). IEEE Press, Piscataway, pp 309\u2013314"},{"key":"21_CR124","first-page":"137","volume-title":"Meta-heuristics: advances and trends in local search paradigms for optimization","author":"T St\u00fctzle","year":"1999","unstructured":"St\u00fctzle T, Hoos HH (1999) MAX\u2013MIN ant system and local search for combinatorial optimization problems. In: Vo\u00df S, Martello S, Osman IH, Roucairol C (eds) Meta-heuristics: advances and trends in local search paradigms for optimization. Kluwer Academic, Dordrecht, pp 137\u2013154"},{"issue":"8","key":"21_CR125","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH (2000) MAX\u2013MIN ant system. Future Gener Comput Syst 16(8):889\u2013914","journal-title":"Future Gener Comput Syst"},{"key":"21_CR126","doi-asserted-by":"crossref","unstructured":"St\u00fctzle T, L\u00f3pez-Ib\u00e1\u00f1ez M, Dorigo M (2011) A concise overview of applications of ant colony optimization. In: Cochran JJ (ed) Wiley encyclopedia of operations research and management science, vol 2. John Wiley & Sons, pp 896\u2013911","DOI":"10.1002\/9780470400531.eorms0001"},{"key":"21_CR127","first-page":"191","volume-title":"Autonomous search","author":"T St\u00fctzle","year":"2012","unstructured":"St\u00fctzle T, L\u00f3pez-Ib\u00e1\u00f1ez M, Pellegrini P, Maur M, Montes de Oca MA, Birattari M, Dorigo M (2012) Parameter adaptation in ant colony optimization. In: Hamadi Y, Monfroy E, Saubion F (eds) Autonomous search. Springer, Berlin, pp 191\u2013215"},{"issue":"4-5","key":"21_CR128","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"\u00c9D Taillard","year":"1991","unstructured":"Taillard \u00c9D (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17(4-5):443\u2013455","journal-title":"Parallel Comput"},{"issue":"3","key":"21_CR129","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1080\/0305215X.2011.639370","volume":"44","author":"C Teixeira","year":"2012","unstructured":"Teixeira C, Covas J, St\u00fctzle T, Gaspar-Cunha A (2012) Multi-objective ant colony optimization for solving the twin-screw extrusion configuration problem. Eng Optim 44(3):351\u2013371","journal-title":"Eng Optim"},{"issue":"3","key":"21_CR130","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s11721-010-0043-7","volume":"4","author":"CE Torres","year":"2010","unstructured":"Torres CE, Rossi LF, Keffer J, Li K, Shen CC (2010) Modeling, analysis and simulation of ant-based network routing protocols. Swarm Intell 4(3):221\u2013244","journal-title":"Swarm Intell"},{"key":"21_CR131","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/11839088_6","volume-title":"5th international workshop on Ant colony optimization and swarm intelligence (ANTS 2006)","author":"S Tsutsui","year":"2006","unstructured":"Tsutsui S (2006) An enhanced aggregation pheromone system for real-parameter optimization in the ACO metaphor. In: Dorigo M et al (eds) 5th international workshop on Ant colony optimization and swarm intelligence (ANTS 2006). Lecture notes in computer science, vol 4150. Springer, Heidelberg, pp 60\u201371"},{"key":"21_CR132","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1527\/tjsai.22.29","volume":"22","author":"S Tsutsui","year":"2007","unstructured":"Tsutsui S (2007) Ant colony optimization with cunning ants. Trans Jpn Soc Artifi Intell 22:29\u201336","journal-title":"Trans Jpn Soc Artifi Intell"},{"key":"21_CR133","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/11839088_16","volume-title":"5th international workshop on Ant colony optimization and swarm intelligence (ANTS 2006)","author":"W Wiesemann","year":"2006","unstructured":"Wiesemann W, St\u00fctzle T (2006) Iterated ants: an experimental study for the quadratic assignment problem. In: Dorigo M et al (eds) 5th international workshop on Ant colony optimization and swarm intelligence (ANTS 2006). Lecture notes in computer science, vol 4150. Springer, Heidelberg, pp 179\u2013190"},{"key":"21_CR134","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1145\/2576768.2598282","volume-title":"Proceedings of the genetic and evolutionary computation conference, GECCO 2014","author":"M Zaefferer","year":"2014","unstructured":"Zaefferer M, Stork J, Friese M, Fischbach A, Naujoks B, Bartz-Beielstein T (2014) Efficient global optimization for combinatorial problems. In: Igel C, Arnold DV (eds) Proceedings of the genetic and evolutionary computation conference, GECCO 2014. ACM Press, New York, pp 871\u2013878"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T04:58:59Z","timestamp":1661749139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":134,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_21","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}