{"id":"https://openalex.org/W2011904305","doi":"https://doi.org/10.1007/s00453-007-9134-2","title":"Runtime Analysis of a Simple Ant Colony Optimization Algorithm","display_name":"Runtime Analysis of a Simple Ant Colony Optimization Algorithm","publication_year":2007,"publication_date":"2007-11-27","ids":{"openalex":"https://openalex.org/W2011904305","doi":"https://doi.org/10.1007/s00453-007-9134-2","mag":"2011904305"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-007-9134-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-007-9134-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9134-2.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9134-2.pdf","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":["Algorithms and Complexity, Max-Planck-Institut f\u00fcr Informatik, 66123, Saarbr\u00fccken, Germany","Max-Planck-Institut f\u00fcr Informatik, Algorithms and Complexity, 66123, Saarbr\u00fccken, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, Max-Planck-Institut f\u00fcr Informatik, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Algorithms and Complexity, 66123, Saarbr\u00fccken, Germany#TAB#","institution_ids":["https://openalex.org/I4210109712"]}]},{"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/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Carsten Witt","raw_affiliation_strings":["FB Informatik, LS 2, Universit\u00e4t Dortmund, 44221, Dortmund, Germany","Universit\u00e4t Dortmund, FB Informatik, LS 2, 44221 Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FB Informatik, LS 2, Universit\u00e4t Dortmund, 44221, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Universit\u00e4t Dortmund, FB Informatik, LS 2, 44221 Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089531887"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":21.7829,"has_fulltext":true,"cited_by_count":113,"citation_normalized_percentile":{"value":0.99332449,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"54","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":1.0,"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":1.0,"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.9995999932289124,"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.9980999827384949,"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/theory-of-computation","display_name":"Theory of computation","score":0.7087766528129578},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6590107083320618},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6077142953872681},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5934116244316101},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5670897364616394},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5459252595901489},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.53155916929245},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5210901498794556},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5168033838272095},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.4938555359840393},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35532453656196594}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7087766528129578},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6590107083320618},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6077142953872681},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5934116244316101},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5670897364616394},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5459252595901489},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.53155916929245},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5210901498794556},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5168033838272095},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4938555359840393},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35532453656196594},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-007-9134-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-007-9134-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9134-2.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/67357","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/67357","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.1007/s00453-007-9134-2","raw_type":"Journal article"}],"best_oa_location":{"id":"doi:10.1007/s00453-007-9134-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-007-9134-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9134-2.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3171094092","display_name":null,"funder_award_id":"SFB 531","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2011904305.pdf","grobid_xml":"https://content.openalex.org/works/W2011904305.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1510977876","https://openalex.org/W1511368807","https://openalex.org/W1522890465","https://openalex.org/W1573676079","https://openalex.org/W1581232621","https://openalex.org/W1636202028","https://openalex.org/W2004578565","https://openalex.org/W2004759812","https://openalex.org/W2015649422","https://openalex.org/W2020015078","https://openalex.org/W2024281442","https://openalex.org/W2040194491","https://openalex.org/W2081667417","https://openalex.org/W2118573797","https://openalex.org/W2153401898","https://openalex.org/W2165220807","https://openalex.org/W2751862591","https://openalex.org/W4299432846","https://openalex.org/W4299796063","https://openalex.org/W4301441647"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W3143937874","https://openalex.org/W4312926500","https://openalex.org/W2067280619","https://openalex.org/W4251343851","https://openalex.org/W4352977312"],"abstract_inverted_index":{"Ant":[0],"Colony":[1],"Optimization":[2],"(ACO)":[3],"has":[4],"become":[5],"quite":[6],"popular":[7],"in":[8,69,112,115],"recent":[9],"years.":[10],"In":[11],"contrast":[12],"to":[13,35,44,54,89,97,148],"many":[14,84],"successful":[15],"applications,":[16],"the":[17,74,90,103,106,123,133,136],"theoretical":[18],"foundation":[19],"of":[20,78,92,105,125,127,135],"this":[21],"randomized":[22],"search":[23],"heuristic":[24],"is":[25,33],"rather":[26],"weak.":[27],"Building":[28],"up":[29,46],"such":[30],"a":[31,93,109,143],"theory":[32],"demanded":[34],"understand":[36],"how":[37],"these":[38],"heuristics":[39],"work":[40],"as":[41,43],"well":[42],"come":[45],"with":[47,87],"better":[48],"algorithms":[49],"for":[50],"certain":[51],"problems.":[52],"Up":[53],"now,":[55],"only":[56],"convergence":[57],"results":[58,86],"have":[59],"been":[60],"achieved":[61],"showing":[62],"that":[63],"optimal":[64],"solutions":[65],"can":[66],"be":[67],"obtained":[68],"finite":[70],"time.":[71],"We":[72],"present":[73],"first":[75],"runtime":[76,91],"analysis":[77],"an":[79],"ACO":[80,113],"algorithm,":[81],"which":[82],"transfers":[83],"rigorous":[85],"respect":[88],"simple":[94],"evolutionary":[95],"algorithm":[96],"our":[98],"algorithm.":[99],"Moreover,":[100],"we":[101,131],"examine":[102],"choice":[104],"evaporation":[107,137],"factor,":[108],"crucial":[110],"parameter":[111],"algorithms,":[114],"detail.":[116],"By":[117],"deriving":[118],"new":[119],"lower":[120],"bounds":[121],"on":[122],"tails":[124],"sums":[126],"independent":[128],"Poisson":[129],"trials,":[130],"determine":[132],"effect":[134],"factor":[138],"almost":[139],"completely":[140],"and":[141],"prove":[142],"phase":[144],"transition":[145],"from":[146],"exponential":[147],"polynomial":[149],"runtime.":[150]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":8}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}