{"id":"https://openalex.org/W4401331468","doi":"https://doi.org/10.1162/evco_a_00355","title":"Runtime Analysis of Single- and Multiobjective Evolutionary Algorithms for Chance-Constrained Optimization Problems with Normally Distributed Random Variables*","display_name":"Runtime Analysis of Single- and Multiobjective Evolutionary Algorithms for Chance-Constrained Optimization Problems with Normally Distributed Random Variables*","publication_year":2024,"publication_date":"2024-08-05","ids":{"openalex":"https://openalex.org/W4401331468","doi":"https://doi.org/10.1162/evco_a_00355","pmid":"https://pubmed.ncbi.nlm.nih.gov/39101892"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00355","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00355","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/I5681781","display_name":"University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Optimisation and Logistics, The University of Adelaide, Adelaide, Australia frank.neumann@adelaide.edu.au"],"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, The University of Adelaide, Adelaide, Australia frank.neumann@adelaide.edu.au","institution_ids":["https://openalex.org/I5681781"]}]},{"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, Denmark cawi@dtu.dk"],"affiliations":[{"raw_affiliation_string":"DTU Compute, Technical University of Denmark, Kgs. Lyngby, Denmark cawi@dtu.dk","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089531887"],"corresponding_institution_ids":["https://openalex.org/I5681781"],"apc_list":null,"apc_paid":null,"fwci":0.759,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73764961,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"33","issue":"2","first_page":"191","last_page":"214"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998999834060669,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9922000169754028,"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/T11798","display_name":"Optimal Experimental Design Methods","score":0.9873999953269958,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7543354034423828},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5992357730865479},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5596346259117126},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5571668148040771},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5137351751327515},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.5033547282218933},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.450795441865921},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43604880571365356},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.41968420147895813}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7543354034423828},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5992357730865479},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5596346259117126},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5571668148040771},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5137351751327515},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.5033547282218933},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.450795441865921},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43604880571365356},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.41968420147895813},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D013269","descriptor_name":"Stochastic Processes","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D013269","descriptor_name":"Stochastic Processes","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D016011","descriptor_name":"Normal Distribution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D016011","descriptor_name":"Normal Distribution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false}],"locations_count":2,"locations":[{"id":"doi:10.1162/evco_a_00355","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00355","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:39101892","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/39101892","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W1552383524","https://openalex.org/W1843453084","https://openalex.org/W1982141993","https://openalex.org/W2011565421","https://openalex.org/W2049606892","https://openalex.org/W2061751517","https://openalex.org/W2066124178","https://openalex.org/W2074197819","https://openalex.org/W2088415500","https://openalex.org/W2100137329","https://openalex.org/W2110786553","https://openalex.org/W2151612665","https://openalex.org/W2152688255","https://openalex.org/W2173883661","https://openalex.org/W2187602868","https://openalex.org/W2294347342","https://openalex.org/W2499441210","https://openalex.org/W2585305412","https://openalex.org/W2740307401","https://openalex.org/W2784961280","https://openalex.org/W2945042120","https://openalex.org/W2962827889","https://openalex.org/W2969604833","https://openalex.org/W2997872002","https://openalex.org/W3089700631","https://openalex.org/W3091447387","https://openalex.org/W3122779104","https://openalex.org/W3127900374","https://openalex.org/W3173282450","https://openalex.org/W3177186913","https://openalex.org/W3200825350","https://openalex.org/W4240139199","https://openalex.org/W4251616545","https://openalex.org/W4286978212","https://openalex.org/W4291270599","https://openalex.org/W6633040315","https://openalex.org/W6685695876","https://openalex.org/W6687060249","https://openalex.org/W6697195335","https://openalex.org/W6742099052","https://openalex.org/W6770554308","https://openalex.org/W6773799392","https://openalex.org/W6775578479","https://openalex.org/W6840153701"],"related_works":["https://openalex.org/W2751605210","https://openalex.org/W2977596624","https://openalex.org/W2145877535","https://openalex.org/W2744730182","https://openalex.org/W3151104768","https://openalex.org/W2419109832","https://openalex.org/W2068949283","https://openalex.org/W2891428731","https://openalex.org/W1967262321","https://openalex.org/W2022485595"],"abstract_inverted_index":{"Chance-constrained":[0],"optimization":[1,89],"problems":[2,7],"allow":[3],"us":[4],"to":[5,26,31,40,79,152,168],"model":[6],"where":[8],"constraints":[9],"involving":[10],"stochastic":[11,55,194],"components":[12,56],"should":[13],"be":[14,150],"violated":[15],"only":[16],"with":[17,170],"a":[18,94,124,154],"small":[19],"probability.":[20],"Evolutionary":[21],"algorithms":[22,46,114],"have":[23],"been":[24],"applied":[25],"this":[27,36,120,146],"scenario":[28,53],"and":[29,60,86,106,122,181,206],"shown":[30],"achieve":[32],"high-quality":[33],"results.":[34],"With":[35],"paper,":[37],"we":[38,69,143,179],"contribute":[39],"the":[41,52,64,98,103,140,160,176,192,201,204,207],"theoretical":[42],"understanding":[43],"of":[44,54,97,126,156,191,203],"evolutionary":[45,113],"for":[47,82,133,159],"chance-constrained":[48,161],"optimization.":[49],"We":[50,91,109],"study":[51],"that":[57,71,111,128,145],"are":[58,115],"independent":[59],"normally":[61],"distributed.":[62],"Considering":[63],"simple":[65],"single-objective":[66],"(1+1)":[67],"EA,":[68],"show":[70,110],"imposing":[72],"an":[73,87,130],"additional":[74],"uniform":[75],"constraint":[76],"already":[77],"leads":[78],"local":[80],"optima":[81],"very":[83],"restricted":[84],"scenarios":[85],"exponential":[88],"time.":[90],"therefore":[92],"introduce":[93],"multiobjective":[95,112,177,185,205,210],"formulation":[96,121],"problem":[99,199],"which":[100],"trades":[101],"off":[102],"expected":[104],"cost":[105],"its":[107],"variance.":[108],"highly":[116],"effective":[117],"when":[118],"using":[119],"obtain":[123],"set":[125,155,198],"solutions":[127,158],"contains":[129],"optimal":[131,157],"solution":[132],"any":[134],"possible":[135],"confidence":[136],"level":[137],"imposed":[138],"on":[139,189],"constraint.":[141],"Furthermore,":[142],"prove":[144],"approach":[147,211],"can":[148],"also":[149],"used":[151],"compute":[153],"minimum":[162,195],"spanning":[163],"tree":[164],"problem.":[165],"In":[166],"order":[167],"deal":[169],"potentially":[171],"exponentially":[172],"many":[173],"trade-offs":[174],"in":[175,212],"formulation,":[178],"propose":[180],"analyze":[182],"improved":[183,208],"convex":[184,209],"approaches.":[186],"Experimental":[187],"investigations":[188],"instances":[190],"NP-hard":[193],"weight":[196],"dominating":[197],"confirm":[200],"benefit":[202],"practice.":[213]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}