{"id":"https://openalex.org/W1979634879","doi":"https://doi.org/10.1145/1830483.1830493","title":"A few ants are enough","display_name":"A few ants are enough","publication_year":2010,"publication_date":"2010-07-07","ids":{"openalex":"https://openalex.org/W1979634879","doi":"https://doi.org/10.1145/1830483.1830493","mag":"1979634879"},"language":"en","primary_location":{"id":"doi:10.1145/1830483.1830493","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1830483.1830493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018789989","display_name":"Dirk Sudholt","orcid":"https://orcid.org/0000-0001-6020-1646"},"institutions":[{"id":"https://openalex.org/I1297971548","display_name":"International Computer Science Institute","ror":"https://ror.org/01ewh7m12","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1297971548"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dirk Sudholt","raw_affiliation_strings":["International Computer Science Institute, Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"International Computer Science Institute, Berkeley, CA, USA","institution_ids":["https://openalex.org/I1297971548"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038689623","display_name":"Carsten Witt","orcid":"https://orcid.org/0000-0002-6105-7700"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Carsten Witt","raw_affiliation_strings":["Technical University of Denmark, Kongens Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Kongens Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089531887"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":7.6678,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.97130439,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"63","last_page":"70"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6346525549888611},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5684412717819214},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.49991464614868164},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4900425672531128},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47776830196380615},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.45681464672088623},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4269428253173828},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4024164378643036},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3513595461845398}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6346525549888611},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5684412717819214},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.49991464614868164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4900425672531128},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47776830196380615},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.45681464672088623},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4269428253173828},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4024164378643036},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3513595461845398},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1830483.1830493","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1830483.1830493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/65688","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/65688","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1145/1830483.1830493","raw_type":"Conference paper"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/ecf82cba-8600-44cd-bce5-17cdc608e432","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/ecf82cba-8600-44cd-bce5-17cdc608e432","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Neumann, F, Sudholt, D, Witt, C, Pelikan, M & Branke, J 2010, 'A Few Ants Are Enough: ACO With Iteration-Best Update', Paper presented at Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (GECCO '10), New York, United States, 11/07/10 pp. 63-70. https://doi.org/10.1145/1830483.1830493","raw_type":"conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W203078010","https://openalex.org/W1553838525","https://openalex.org/W1573676079","https://openalex.org/W1635549461","https://openalex.org/W1970101133","https://openalex.org/W1990799344","https://openalex.org/W1993561093","https://openalex.org/W2005317641","https://openalex.org/W2011904305","https://openalex.org/W2039865013","https://openalex.org/W2052176278","https://openalex.org/W2052328625","https://openalex.org/W2093094460","https://openalex.org/W2097097696","https://openalex.org/W2144643443","https://openalex.org/W2146239736","https://openalex.org/W2156622046","https://openalex.org/W2165220807"],"related_works":["https://openalex.org/W2182624400","https://openalex.org/W2767428579","https://openalex.org/W1585007175","https://openalex.org/W2365800168","https://openalex.org/W2382521049","https://openalex.org/W1992807692","https://openalex.org/W2144385241","https://openalex.org/W2078492738","https://openalex.org/W3014549013","https://openalex.org/W4301114481"],"abstract_inverted_index":{"Ant":[0],"colony":[1],"optimization":[2],"(ACO)":[3],"has":[4],"found":[5],"many":[6,109],"applications":[7],"in":[8,29,41,112],"different":[9],"problem":[10,65],"domains.":[11],"We":[12,44,123],"carry":[13],"out":[14],"a":[15,138],"first":[16],"rigorous":[17],"runtime":[18],"analysis":[19],"of":[20,60,90,108,121,143],"ACO":[21,46,79,131],"with":[22,132],"iteration-best":[23,133],"update,":[24],"where":[25],"the":[26,30,64,86,98,105,113,118,141,146],"best":[27],"solution":[28],"each":[31],"iteration":[32],"is":[33,36,53,67,80,102],"reinforced.":[34],"This":[35],"similar":[37],"to":[38,47,69],"comma":[39],"selection":[40],"evolutionary":[42,48],"algorithms.":[43],"compare":[45],"algorithms":[49],"for":[50,85,117,130],"which":[51],"it":[52],"well":[54],"known":[55],"that":[56,135],"an":[57,126],"offspring":[58],"size":[59],"\u03a9(log":[61],"n),":[62],"n":[63],"dimension,":[66],"necessary":[68],"optimize":[70],"even":[71,84],"simple":[72],"functions":[73],"like":[74],"ONEMAX.":[75],"In":[76],"sharp":[77],"contrast,":[78],"efficient":[81],"on":[82,137],"ONEMAX":[83],"smallest":[87],"possible":[88],"number":[89,120,142],"two":[91],"ants.":[92,122],"Remarkably,":[93],"this":[94],"only":[95],"holds":[96],"if":[97],"pheromone":[99],"evaporation":[100,147],"rate":[101],"small":[103,119],"enough;":[104],"collective":[106],"memory":[107],"ants":[110,144],"stored":[111],"pheromones":[114],"makes":[115],"up":[116],"further":[124],"prove":[125],"exponential":[127],"lower":[128],"bound":[129],"update":[134],"depends":[136],"trade-off":[139],"between":[140],"and":[145],"rate.":[148]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}