{"id":"https://openalex.org/W7128918581","doi":"https://doi.org/10.1016/j.artint.2026.104501","title":"Mathematical runtime analysis of a multi-Valued estimation of distribution algorithm","display_name":"Mathematical runtime analysis of a multi-Valued estimation of distribution algorithm","publication_year":2026,"publication_date":"2026-02-14","ids":{"openalex":"https://openalex.org/W7128918581","doi":"https://doi.org/10.1016/j.artint.2026.104501"},"language":"en","primary_location":{"id":"doi:10.1016/j.artint.2026.104501","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.artint.2026.104501","pdf_url":null,"source":{"id":"https://openalex.org/S196139623","display_name":"Artificial Intelligence","issn_l":"0004-3702","issn":["0004-3702","1872-7921"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.artint.2026.104501","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054828780","display_name":"Sumit Adak","orcid":"https://orcid.org/0000-0002-1814-7612"},"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":true,"raw_author_name":"Sumit Adak","raw_affiliation_strings":["DTU Compute, Technical University of Denmark, Kgs. Lyngby, 2800, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-1814-7612","affiliations":[{"raw_affiliation_string":"DTU Compute, Technical University of Denmark, Kgs. Lyngby, 2800, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"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, Kgs. Lyngby, 2800, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-6105-7700","affiliations":[{"raw_affiliation_string":"DTU Compute, Technical University of Denmark, Kgs. Lyngby, 2800, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054828780"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":{"value":3670,"currency":"USD","value_usd":3670},"apc_paid":{"value":3670,"currency":"USD","value_usd":3670},"fwci":12.1051,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.96843237,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"353","issue":null,"first_page":"104501","last_page":"104501"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.4018000066280365,"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.4018000066280365,"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.13680000603199005,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.056299999356269836,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/edas","display_name":"EDAS","score":0.9401999711990356},{"id":"https://openalex.org/keywords/estimation-of-distribution-algorithm","display_name":"Estimation of distribution algorithm","score":0.8701000213623047},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7088000178337097},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.708299994468689},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.48989999294281006},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.44940000772476196},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.44119998812675476},{"id":"https://openalex.org/keywords/ideal","display_name":"Ideal (ethics)","score":0.4212000072002411}],"concepts":[{"id":"https://openalex.org/C49284225","wikidata":"https://www.wikidata.org/wiki/Q5322829","display_name":"EDAS","level":3,"score":0.9401999711990356},{"id":"https://openalex.org/C162500139","wikidata":"https://www.wikidata.org/wiki/Q2835887","display_name":"Estimation of distribution algorithm","level":2,"score":0.8701000213623047},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7088000178337097},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.708299994468689},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5235000252723694},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.48989999294281006},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.44940000772476196},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.44119998812675476},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42969998717308044},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42239999771118164},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.4212000072002411},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.4099999964237213},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37049999833106995},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.3619999885559082},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.3522999882698059},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33379998803138733},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3294000029563904},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2847999930381775},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.2711000144481659},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C96250715","wikidata":"https://www.wikidata.org/wiki/Q965330","display_name":"Estimation","level":2,"score":0.25949999690055847},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.25609999895095825},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.artint.2026.104501","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.artint.2026.104501","pdf_url":null,"source":{"id":"https://openalex.org/S196139623","display_name":"Artificial Intelligence","issn_l":"0004-3702","issn":["0004-3702","1872-7921"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.artint.2026.104501","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.artint.2026.104501","pdf_url":null,"source":{"id":"https://openalex.org/S196139623","display_name":"Artificial Intelligence","issn_l":"0004-3702","issn":["0004-3702","1872-7921"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6050517559051514,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1933565355","https://openalex.org/W1986400449","https://openalex.org/W1990799344","https://openalex.org/W2013279402","https://openalex.org/W2035885798","https://openalex.org/W2050215344","https://openalex.org/W2148379945","https://openalex.org/W2165220807","https://openalex.org/W2172081677","https://openalex.org/W2752672873","https://openalex.org/W2783263582","https://openalex.org/W2788305970","https://openalex.org/W2806225900","https://openalex.org/W2807837759","https://openalex.org/W2885992409","https://openalex.org/W2969086206","https://openalex.org/W2982373721","https://openalex.org/W2990265388","https://openalex.org/W3095083526","https://openalex.org/W3105390427","https://openalex.org/W3110996796","https://openalex.org/W4226515502","https://openalex.org/W4382202807","https://openalex.org/W4384701617","https://openalex.org/W4386955176","https://openalex.org/W4393157330","https://openalex.org/W4396856167","https://openalex.org/W4403020079","https://openalex.org/W4409361653"],"related_works":[],"abstract_inverted_index":{"Estimation":[0],"of":[1,60,76,130,140,153,160],"distribution":[2],"algorithms":[3],"(EDAs)":[4],"are":[5],"powerful":[6],"optimization":[7],"techniques":[8],"that":[9],"iteratively":[10],"build":[11],"probabilistic":[12],"models":[13],"based":[14],"on":[15,85,104],"the":[16,22,57,77,86,96,101,105,116,131,138,147,151,157,161],"best":[17],"performing":[18],"solutions,":[19],"thereby":[20],"guiding":[21],"search":[23],"process":[24],"in":[25,156],"complex":[26],"solution":[27],"landscapes.":[28],"Classical":[29],"EDAs":[30,42],"handle":[31],"only":[32],"binary":[33],"decision":[34],"variables,":[35],"but":[36],"recent":[37],"developments":[38],"have":[39],"introduced":[40],"multi-valued":[41,61,78,141],"to":[43],"tackle":[44],"problems":[45],"with":[46,111],"variables":[47],"taking":[48],"more":[49],"than":[50],"two":[51],"values.":[52],"Despite":[53],"their":[54],"growing":[55],"importance,":[56],"theoretical":[58,74,128],"understanding":[59],"EDAs,":[62],"especially":[63],"regarding":[64],"runtime":[65,98,114,158],"behavior,":[66],"remains":[67],"limited.":[68],"In":[69,143],"this":[70],"work,":[71],"we":[72,145],"provide":[73],"analyses":[75,129],"compact":[79],"genetic":[80],"algorithm":[81],"(":[82],"r":[83,102,106,117,132,162],"\u2011cGA)":[84],"generalized":[87],"(multi-valued)":[88],"LeadingOnes":[89,108],"and":[90,125],"OneMax":[91,119],"benchmark":[92],"problems.":[93],"We":[94],"derive":[95],"first":[97,148],"bound":[99],"for":[100,115,146],"\u2011cGA":[103],"-valued":[107,118],"function,":[109],"together":[110],"an":[112],"improved":[113],"function.":[120],"These":[121],"results":[122],"also":[123],"improve":[124],"refine":[126],"previous":[127],"\u2011cGA,":[133],"providing":[134],"new":[135],"insights":[136],"into":[137],"performance":[139],"EDAs.":[142],"addition,":[144],"time":[149],"include":[150],"case":[152],"frequency":[154],"borders":[155],"analysis":[159],"\u2011cGA.":[163]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-02-20T06:14:18.993340","created_date":"2026-02-15T00:00:00"}