{"id":"https://openalex.org/W2885992409","doi":"https://doi.org/10.1007/s00453-018-0480-z","title":"On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization","display_name":"On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization","publication_year":2018,"publication_date":"2018-08-14","ids":{"openalex":"https://openalex.org/W2885992409","doi":"https://doi.org/10.1007/s00453-018-0480-z","mag":"2885992409"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-018-0480-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-018-0480-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-018-0480-z.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","license_id":"https://openalex.org/licenses/cc-by","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-018-0480-z.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018789989","display_name":"Dirk Sudholt","orcid":"https://orcid.org/0000-0001-6020-1646"},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Dirk Sudholt","raw_affiliation_strings":["University of Sheffield, Sheffield, S1 4DP, UK"],"affiliations":[{"raw_affiliation_string":"University of Sheffield, Sheffield, S1 4DP, UK","institution_ids":["https://openalex.org/I91136226"]}]},{"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":["DTU Compute, Technical University of Denmark, Kongens Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"DTU Compute, Technical University of Denmark, Kongens Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018789989"],"corresponding_institution_ids":["https://openalex.org/I91136226"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":3.554,"has_fulltext":true,"cited_by_count":60,"citation_normalized_percentile":{"value":0.94242602,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"81","issue":"4","first_page":"1450","last_page":"1489"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9970999956130981,"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.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.594704806804657},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5630940794944763},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5413365960121155},{"id":"https://openalex.org/keywords/estimation-of-distribution-algorithm","display_name":"Estimation of distribution algorithm","score":0.538234293460846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5119863152503967},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5110408067703247},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.48184335231781006},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.46445202827453613},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3974605202674866},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34467175602912903},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3352902829647064}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.594704806804657},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5630940794944763},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5413365960121155},{"id":"https://openalex.org/C162500139","wikidata":"https://www.wikidata.org/wiki/Q2835887","display_name":"Estimation of distribution algorithm","level":2,"score":0.538234293460846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5119863152503967},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5110408067703247},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.48184335231781006},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.46445202827453613},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3974605202674866},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34467175602912903},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3352902829647064},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00453-018-0480-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-018-0480-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-018-0480-z.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","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:133057","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:pure.atira.dk:publications/a0de8178-40dd-42aa-9fb2-399a4ddd4c5c","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/a0de8178-40dd-42aa-9fb2-399a4ddd4c5c","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sudholt , D &amp; Witt , C 2018 , ' On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization ' , Algorithmica , vol. 81 , no. 4 , pp. 1450\u20131489 . https://doi.org/10.1007/s00453-018-0480-z","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s00453-018-0480-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-018-0480-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-018-0480-z.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","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"No poverty","score":0.550000011920929,"id":"https://metadata.un.org/sdg/1"}],"awards":[{"id":"https://openalex.org/G2371947937","display_name":null,"funder_award_id":"4002-00542","funder_id":"https://openalex.org/F4320322928","funder_display_name":"Danmarks Frie Forskningsfond"},{"id":"https://openalex.org/G3829048491","display_name":null,"funder_award_id":"FP7/2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3981126665","display_name":null,"funder_award_id":"Seventh Framework Programme","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5194412262","display_name":null,"funder_award_id":"618091","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5207668377","display_name":null,"funder_award_id":"618091","funder_id":"https://openalex.org/F4320333065","funder_display_name":"Seventh Framework Programme"},{"id":"https://openalex.org/G5593277320","display_name":null,"funder_award_id":"2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5617541095","display_name":null,"funder_award_id":"CA15140","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5702163051","display_name":null,"funder_award_id":"FP7/2007","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G803393729","display_name":null,"funder_award_id":"CA15140","funder_id":"https://openalex.org/F4320320366","funder_display_name":"European Cooperation in Science and Technology"},{"id":"https://openalex.org/G8051717526","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320366","display_name":"European Cooperation in Science and Technology","ror":"https://ror.org/01bstzn19"},{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"},{"id":"https://openalex.org/F4320333065","display_name":"Seventh Framework Programme","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2885992409.pdf","grobid_xml":"https://content.openalex.org/works/W2885992409.grobid-xml"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W1570731788","https://openalex.org/W1645523878","https://openalex.org/W1653352711","https://openalex.org/W1801849579","https://openalex.org/W1970025632","https://openalex.org/W1979634879","https://openalex.org/W1981303977","https://openalex.org/W1981482533","https://openalex.org/W1990799344","https://openalex.org/W2003289346","https://openalex.org/W2004578565","https://openalex.org/W2006309149","https://openalex.org/W2030435589","https://openalex.org/W2039865013","https://openalex.org/W2050215344","https://openalex.org/W2053360669","https://openalex.org/W2082931571","https://openalex.org/W2083320113","https://openalex.org/W2086951064","https://openalex.org/W2102044362","https://openalex.org/W2148379945","https://openalex.org/W2287495828","https://openalex.org/W2295428206","https://openalex.org/W2296129337","https://openalex.org/W2499149626","https://openalex.org/W2499688774","https://openalex.org/W2501406586","https://openalex.org/W2527291902","https://openalex.org/W2605136245","https://openalex.org/W2724311120","https://openalex.org/W2751862591","https://openalex.org/W2806225900","https://openalex.org/W2807837759","https://openalex.org/W2949186294","https://openalex.org/W3099820049","https://openalex.org/W3101350160","https://openalex.org/W3102042098","https://openalex.org/W4231916799","https://openalex.org/W4292058084","https://openalex.org/W4299432846","https://openalex.org/W4301441647","https://openalex.org/W6815805937"],"related_works":["https://openalex.org/W2727311809","https://openalex.org/W2096498780","https://openalex.org/W2182624400","https://openalex.org/W2392913753","https://openalex.org/W2767428579","https://openalex.org/W2365800168","https://openalex.org/W1982259447","https://openalex.org/W2496664933","https://openalex.org/W1992807692","https://openalex.org/W1503012231"],"abstract_inverted_index":{"Probabilistic":[0],"model-building":[1],"Genetic":[2,62],"Algorithms":[3],"(PMBGAs)":[4],"are":[5],"a":[6,37,45,77,87,110],"class":[7],"of":[8,129,191],"metaheuristics":[9],"that":[10,146],"evolve":[11],"probability":[12],"distributions":[13],"favoring":[14],"optimal":[15],"solutions":[16],"in":[17,48,58,71,174,202],"the":[18,26,42,52,59,66,107,115,126,147,188,199],"underlying":[19],"search":[20],"space":[21],"by":[22],"repeatedly":[23],"sampling":[24],"from":[25],"distribution":[27],"and":[28,65,98,109,136,193],"updating":[29],"it":[30],"according":[31],"to":[32,95,153],"promising":[33],"samples.":[34],"We":[35,102],"provide":[36,184],"rigorous":[38],"runtime":[39,128],"analysis":[40],"concerning":[41],"update":[43,79,148,200],"strength,":[44],"vital":[46],"parameter":[47],"PMBGAs":[49,192],"such":[50],"as":[51],"step":[53],"size":[54],"1":[55],"/":[56],"K":[57],"so-called":[60],"compact":[61],"Algorithm":[63],"(cGA)":[64],"evaporation":[67],"factor":[68],"$$\\rho":[69],"$$":[70],"ant":[72],"colony":[73],"optimizers":[74],"(ACO).":[75],"While":[76],"large":[78],"strength":[80,149,201],"is":[81,86],"desirable":[82],"for":[83,106,197],"exploitation,":[84],"there":[85],"general":[88],"trade-off:":[89],"too":[90],"strong":[91],"updates":[92],"can":[93],"lead":[94],"unstable":[96],"behavior":[97,190],"possibly":[99],"poor":[100],"performance.":[101],"demonstrate":[103],"this":[104],"trade-off":[105],"cGA":[108],"simple":[111],"ACO":[112],"algorithm":[113],"on":[114,125],"well-known":[116],"OneMax":[117,173],"function.":[118],"More":[119],"precisely,":[120],"we":[121],"obtain":[122],"lower":[123],"bounds":[124],"expected":[127,175],"$${\\varOmega":[130,137],"}(K\\sqrt{n}":[131],"+":[132,139],"n":[133,140],"\\log":[134,141,158,179],"n)$$":[135,142,168,180],"}(\\sqrt{n}/\\rho":[138],",":[143],"respectively,":[144],"suggesting":[145],"should":[150],"be":[151],"limited":[152],"$$1/K,":[154,164],"\\rho":[155,165],"=":[156],"O(1/(\\sqrt{n}":[157],"n))$$":[159],".":[160,181],"In":[161],"fact,":[162],"choosing":[163],"\\sim":[166],"1/(\\sqrt{n}\\log":[167],"both":[169],"algorithms":[170],"efficiently":[171],"optimize":[172],"time":[176],"$${\\varTheta":[177],"}(n":[178],"Our":[182],"analyses":[183],"new":[185,195],"insights":[186],"into":[187],"stochastic":[189],"propose":[194],"guidelines":[196],"setting":[198],"global":[203],"optimization.":[204]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}
