{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:44:26Z","timestamp":1760647466702,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":63,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,26]]},"DOI":"10.1145\/3449639.3459350","type":"proceedings-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T17:51:58Z","timestamp":1624297918000},"page":"4-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["A rigorous runtime analysis of the 2-MMAS\n            <sub>ib<\/sub>\n            on jump functions"],"prefix":"10.1145","author":[{"given":"Riade","family":"Benbaki","sequence":"first","affiliation":[{"name":"Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyad","family":"Benomar","sequence":"additional","affiliation":[{"name":"Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[{"name":"Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459377"},{"key":"e_1_3_2_1_2_1","volume-title":"PPSN","author":"Antipov Denis","year":"2020","unstructured":"Denis Antipov and Benjamin Doerr . 2020 . Runtime analysis of a heavy-tailed (1 + (\u03bb, \u03bb)) genetic algorithm on jump functions. In Parallel Problem Solving From Nature , PPSN 2020, Part II. Springer, 545--559. Denis Antipov and Benjamin Doerr. 2020. Runtime analysis of a heavy-tailed (1 + (\u03bb, \u03bb)) genetic algorithm on jump functions. In Parallel Problem Solving From Nature, PPSN 2020, Part II. Springer, 545--559."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390148"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Anne Auger and Benjamin Doerr (Eds.). 2011. Theory of Randomized Search Heuristics. World Scientific Publishing.  Anne Auger and Benjamin Doerr (Eds.). 2011. Theory of Randomized Search Heuristics. World Scientific Publishing.","DOI":"10.1142\/7438"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459367"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-008-9098-4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3079194"},{"key":"e_1_3_2_1_8_1","volume-title":"PPSN","author":"Corus Dogan","year":"2018","unstructured":"Dogan Corus , Pietro S. Oliveto , and Donya Yazdani . 2018 . Fast artificial immune systems. In Parallel Problem Solving from Nature , PPSN 2018, Part II. Springer, 67--78. Dogan Corus, Pietro S. Oliveto, and Donya Yazdani. 2018. Fast artificial immune systems. In Parallel Problem Solving from Nature, PPSN 2018, Part II. Springer, 67--78."},{"key":"e_1_3_2_1_9_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Dang Duc-Cuong","year":"2016","unstructured":"Duc-Cuong Dang , Tobias Friedrich , Timo K\u00f6tzing , Martin S. Krejca , Per Kristian Lehre , Pietro S. Oliveto , Dirk Sudholt , and Andrew M. Sutton . 2016. Escaping local optima with diversity mechanisms and crossover . In Genetic and Evolutionary Computation Conference, GECCO 2016 . ACM, 645--652. Duc-Cuong Dang, Tobias Friedrich, Timo K\u00f6tzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, and Andrew M. Sutton. 2016. Escaping local optima with diversity mechanisms and crossover. In Genetic and Evolutionary Computation Conference, GECCO 2016. ACM, 645--652."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2724201"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321747"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389823"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0341-1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0477-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.10.035"},{"key":"e_1_3_2_1_16_1","volume-title":"Krejca","author":"Doerr Benjamin","year":"2020","unstructured":"Benjamin Doerr and Martin S . Krejca . 2020 . The univariate marginal distribution algorithm copes well with deception and epistasis. In Evolutionary Computation in Combinatorial Optimization, EvoCOP 2020. Springer , 51--66. Benjamin Doerr and Martin S. Krejca. 2020. The univariate marginal distribution algorithm copes well with deception and epistasis. In Evolutionary Computation in Combinatorial Optimization, EvoCOP 2020. Springer, 51--66."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Benjamin Doerr and Frank Neumann (Eds.). 2020. Theory of Evolutionary Computation---Recent Developments in Discrete Optimization. Springer. Also available at https:\/\/cs.adelaide.edu.au\/~frank\/papers\/TheoryBook2019-selfarchived.pdf.  Benjamin Doerr and Frank Neumann (Eds.). 2020. Theory of Evolutionary Computation---Recent Developments in Discrete Optimization. Springer. Also available at https:\/\/cs.adelaide.edu.au\/~frank\/papers\/TheoryBook2019-selfarchived.pdf.","DOI":"10.1007\/978-3-030-29414-4"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.12.030"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.2987361"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449726.3462719"},{"volume-title":"Ant colony optimization","author":"Dorigo Marco","key":"e_1_3_2_1_22_1","unstructured":"Marco Dorigo and Thomas St\u00fctzle . 2004. Ant colony optimization . MIT Press . Marco Dorigo and Thomas St\u00fctzle. 2004. Ant colony optimization. MIT Press."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v20-3496"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460246"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908884"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00178"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11009-006-7291-4"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.12.017"},{"volume-title":"Theory of Randomized Search Heuristics: Foundations and Recent Developments, Anne Auger and Benjamin Doerr (Eds.).","author":"Gutjahr Walter J.","key":"e_1_3_2_1_30_1","unstructured":"Walter J. Gutjahr . 2011. Ant colony optimization: recent developments in theoretical analysis . In Theory of Randomized Search Heuristics: Foundations and Recent Developments, Anne Auger and Benjamin Doerr (Eds.). Vol. 1 . World Scientific , 225--254. Walter J. Gutjahr. 2011. Ant colony optimization: recent developments in theoretical analysis. In Theory of Randomized Search Heuristics: Foundations and Recent Developments, Anne Auger and Benjamin Doerr (Eds.). Vol. 1. World Scientific, 225--254."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11009-007-9047-1"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205608"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCI.2007.372143"},{"volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"Jansen Thomas","key":"e_1_3_2_1_34_1","unstructured":"Thomas Jansen . 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective . Springer . Thomas Jansen. 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725507"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0940-2"},{"key":"e_1_3_2_1_37_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"K\u00f6tzing Timo","year":"2010","unstructured":"Timo K\u00f6tzing , Per Kristian Lehre , Frank Neumann , and Pietro S. Oliveto . 2010. Ant colony optimization and the minimum cut problem . In Genetic and Evolutionary Computation Conference, GECCO 2010 . ACM, 1393--1400. Timo K\u00f6tzing, Per Kristian Lehre, Frank Neumann, and Pietro S. Oliveto. 2010. Ant colony optimization and the minimum cut problem. In Genetic and Evolutionary Computation Conference, GECCO 2010. ACM, 1393--1400."},{"key":"e_1_3_2_1_38_1","volume-title":"PPSN","author":"K\u00f6tzing Timo","year":"2012","unstructured":"Timo K\u00f6tzing and Hendrik Molter . 2012 . ACO beats EA on a dynamic pseudo-Boolean function. In Parallel Problem Solving from Nature , PPSN 2012, Part I. Springer, 113--122. Timo K\u00f6tzing and Hendrik Molter. 2012. ACO beats EA on a dynamic pseudo-Boolean function. In Parallel Problem Solving from Nature, PPSN 2012, Part I. Springer, 113--122."},{"key":"e_1_3_2_1_39_1","volume-title":"ANTS","author":"K\u00f6tzing Timo","year":"2010","unstructured":"Timo K\u00f6tzing , Frank Neumann , Heiko R\u00f6glin , and Carsten Witt . 2010 . Theoretical properties of two ACO approaches for the traveling salesman problem. In Swarm Intelligence , ANTS 2010. Springer, 324--335. Timo K\u00f6tzing, Frank Neumann, Heiko R\u00f6glin, and Carsten Witt. 2010. Theoretical properties of two ACO approaches for the traveling salesman problem. In Swarm Intelligence, ANTS 2010. Springer, 324--335."},{"volume-title":"Metaheuristics for Dynamic Optimization","author":"Leguizam\u00f3n Guillermo","key":"e_1_3_2_1_40_1","unstructured":"Guillermo Leguizam\u00f3n and Enrique Alba . 2013. Ant colony based algorithms for dynamic optimization problems . In Metaheuristics for Dynamic Optimization . Springer , 189--210. Guillermo Leguizam\u00f3n and Enrique Alba. 2013. Ant colony based algorithms for dynamic optimization problems. In Metaheuristics for Dynamic Optimization. Springer, 189--210."},{"key":"e_1_3_2_1_41_1","volume-title":"PPSN","author":"Lehre Per Kristian","year":"2010","unstructured":"Per Kristian Lehre . 2010 . Negative drift in populations. In Parallel Problem Solving from Nature , PPSN 2010. Springer, 244--253. Per Kristian Lehre. 2010. Negative drift in populations. In Parallel Problem Solving from Nature, PPSN 2010. Springer, 244--253."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340316"},{"key":"e_1_3_2_1_43_1","volume-title":"General drift analysis with tail bounds. CoRR abs\/1307.2559","author":"Lehre Per Kristian","year":"2013","unstructured":"Per Kristian Lehre and Carsten Witt . 2013. General drift analysis with tail bounds. CoRR abs\/1307.2559 ( 2013 ). Per Kristian Lehre and Carsten Witt. 2013. General drift analysis with tail bounds. CoRR abs\/1307.2559 (2013)."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13075-0_54"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012322"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-9975-z"},{"volume-title":"Handbook of Heuristics, Rafael Mart\u00ed, Panos M","author":"L\u00f3pez-Ib\u00e1\u00f1ez Manuel","key":"e_1_3_2_1_47_1","unstructured":"Manuel L\u00f3pez-Ib\u00e1\u00f1ez , Thomas St\u00fctzle , and Marco Dorigo . 2018. Ant colony optimization: a component-wise overview . In Handbook of Heuristics, Rafael Mart\u00ed, Panos M . Pardalos, and Mauricio G. C. Resende (Eds.). Springer International Publishing , Cham , 371--407. Manuel L\u00f3pez-Ib\u00e1\u00f1ez, Thomas St\u00fctzle, and Marco Dorigo. 2018. Ant colony optimization: a component-wise overview. In Handbook of Heuristics, Rafael Mart\u00ed, Panos M. Pardalos, and Mauricio G. C. Resende (Eds.). Springer International Publishing, Cham, 371--407."},{"key":"e_1_3_2_1_48_1","volume-title":"ANTS","author":"Neumann Frank","year":"2008","unstructured":"Frank Neumann , Dirk Sudholt , and Carsten Witt . 2008 . Rigorous analyses for the combination of ant colony optimization and local search. In Ant Colony Optimization and Swarm Intelligence , ANTS 2008. Springer, 132--143. Frank Neumann, Dirk Sudholt, and Carsten Witt. 2008. Rigorous analyses for the combination of ant colony optimization and local search. In Ant Colony Optimization and Swarm Intelligence, ANTS 2008. Springer, 132--143."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830493"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9134-2"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.02.012"},{"volume-title":"Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity","author":"Neumann Frank","key":"e_1_3_2_1_52_1","unstructured":"Frank Neumann and Carsten Witt . 2010. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity . Springer . Frank Neumann and Carsten Witt. 2010. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0369-2"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0212-1"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389833"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459336"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72904-2_10"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340305"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.5555\/348599.348603"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9606-2"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0480-z"},{"key":"e_1_3_2_1_62_1","volume-title":"PPSN","author":"Whitley Darrell","year":"2018","unstructured":"Darrell Whitley , Swetha Varadarajan , Rachel Hirsch , and Anirban Mukhopadhyay . 2018 . Exploration and exploitation without mutation: solving the jump function in &Theta;(n) time. In Parallel Problem Solving from Nature , PPSN 2018, Part II. Springer, 55--66. Darrell Whitley, Swetha Varadarajan, Rachel Hirsch, and Anirban Mukhopadhyay. 2018. Exploration and exploitation without mutation: solving the jump function in &Theta;(n) time. In Parallel Problem Solving from Nature, PPSN 2018, Part II. Springer, 55--66."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2016570"}],"event":{"name":"GECCO '21: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lille France","acronym":"GECCO '21"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459350","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3449639.3459350","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:09Z","timestamp":1750195689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459350"}},"subtitle":["ant colony optimizers can cope well with local optima"],"short-title":[],"issued":{"date-parts":[[2021,6,26]]},"references-count":63,"alternative-id":["10.1145\/3449639.3459350","10.1145\/3449639"],"URL":"https:\/\/doi.org\/10.1145\/3449639.3459350","relation":{},"subject":[],"published":{"date-parts":[[2021,6,26]]},"assertion":[{"value":"2021-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}