{"id":"https://openalex.org/W4285604467","doi":"https://doi.org/10.24963/ijcai.2022/665","title":"Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables","display_name":"Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables","publication_year":2022,"publication_date":"2022-07-01","ids":{"openalex":"https://openalex.org/W4285604467","doi":"https://doi.org/10.24963/ijcai.2022/665"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2022/665","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2022/665","pdf_url":"https://www.ijcai.org/proceedings/2022/0665.pdf","source":{"id":"https://openalex.org/S4363608755","display_name":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.ijcai.org/proceedings/2022/0665.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/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":["The University of Adelaide","Optimisation and Logistics, University of Adelaide, Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"The University of Adelaide","institution_ids":["https://openalex.org/I5681781"]},{"raw_affiliation_string":"Optimisation and Logistics, University of Adelaide, Adelaide, Australia","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":["Technical University of Denmark","DTU Compute, Technical University of Denmark, Kongens Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Technical University of Denmark","institution_ids":["https://openalex.org/I96673099"]},{"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/A5089531887"],"corresponding_institution_ids":["https://openalex.org/I5681781"],"apc_list":null,"apc_paid":null,"fwci":2.609,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.91435563,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"4800","last_page":"4806"},"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.9998000264167786,"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.9998000264167786,"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.9955000281333923,"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.9901000261306763,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7341599464416504},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6220513582229614},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5667439103126526},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5632104277610779},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5542923212051392},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.5065864324569702},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4807586371898651},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.418995201587677},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3819003105163574},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33048152923583984}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7341599464416504},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6220513582229614},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5667439103126526},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5632104277610779},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5542923212051392},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.5065864324569702},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4807586371898651},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.418995201587677},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3819003105163574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33048152923583984},{"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":[],"locations_count":2,"locations":[{"id":"doi:10.24963/ijcai.2022/665","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2022/665","pdf_url":"https://www.ijcai.org/proceedings/2022/0665.pdf","source":{"id":"https://openalex.org/S4363608755","display_name":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/2e20a82e-e70e-49be-bbe9-4b73c491c221","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/2e20a82e-e70e-49be-bbe9-4b73c491c221","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Neumann , F & Witt , C 2022 , Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables . in L De Raedt & L De Raedt (eds) , Proceedings of the 31 st International Joint Conference on Artificial Intelligence . International Joint Conferences on Artificial Intelligence Organization , pp. 4800-4806 , 31 st International Joint Conference on Artificial Intelligence , Vienna , Austria , 23/07/2022 .","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2022/665","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2022/665","pdf_url":"https://www.ijcai.org/proceedings/2022/0665.pdf","source":{"id":"https://openalex.org/S4363608755","display_name":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3128856113","display_name":null,"funder_award_id":"FT200100536","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G611870384","display_name":null,"funder_award_id":"grant","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"}],"funders":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4285604467.pdf","grobid_xml":"https://content.openalex.org/works/W4285604467.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1552383524","https://openalex.org/W1843453084","https://openalex.org/W1982141993","https://openalex.org/W1995375333","https://openalex.org/W2011565421","https://openalex.org/W2074197819","https://openalex.org/W2090677529","https://openalex.org/W2100137329","https://openalex.org/W2110786553","https://openalex.org/W2152688255","https://openalex.org/W2162189348","https://openalex.org/W2187602868","https://openalex.org/W2294347342","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/W3040314049","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/W4287867531","https://openalex.org/W4291270599"],"related_works":["https://openalex.org/W1978745259","https://openalex.org/W3127438322","https://openalex.org/W4287330080","https://openalex.org/W1990112656","https://openalex.org/W3123416417","https://openalex.org/W2363855676","https://openalex.org/W2377554149","https://openalex.org/W2022485595","https://openalex.org/W2152231846","https://openalex.org/W4387389765"],"abstract_inverted_index":{"Chance":[0],"constrained":[1,50,163],"optimization":[2,90],"problems":[3,7],"allow":[4],"to":[5,26,31,41,80,153],"model":[6],"where":[8],"constraints":[9],"involving":[10],"stochastic":[11,57,175],"components":[12,58],"should":[13],"only":[14],"be":[15,151],"violated":[16],"with":[17],"a":[18,95,125,155],"small":[19],"probability.":[20],"Evolutionary":[21],"algorithms":[22,47,115],"have":[23],"been":[24],"applied":[25],"this":[27,37,121,147],"scenario":[28,55],"and":[29,62,87,107,123],"shown":[30],"achieve":[32],"high":[33],"quality":[34],"results.":[35],"With":[36],"paper,":[38],"we":[39,70,144],"contribute":[40],"the":[42,54,66,99,104,141,161,173,182,185],"theoretical":[43],"understanding":[44],"of":[45,56,98,127,157,172,184],"evolutionary":[46,114],"for":[48,83,134,160],"chance":[49,162],"optimization.":[51],"We":[52,92,110],"study":[53],"that":[59,72,112,129,146],"are":[60,116],"independent":[61],"Normally":[63],"distributed.":[64],"Considering":[65],"simple":[67],"single-objective":[68],"(1+1)~EA,":[69],"show":[71,111],"imposing":[73],"an":[74,88,131],"additional":[75],"uniform":[76],"constraint":[77],"already":[78],"leads":[79],"local":[81],"optima":[82],"very":[84],"restricted":[85],"scenarios":[86],"exponential":[89],"time.":[91],"therefore":[93],"introduce":[94],"multi-objective":[96,113,186],"formulation":[97,122],"problem":[100,180],"which":[101],"trades":[102],"off":[103],"expected":[105],"cost":[106],"its":[108],"variance.":[109],"highly":[117],"effective":[118],"when":[119],"using":[120],"obtain":[124],"set":[126,156,179],"solutions":[128,159],"contains":[130],"optimal":[132,158],"solution":[133],"any":[135],"possible":[136],"confidence":[137],"level":[138],"imposed":[139],"on":[140,170],"constraint.":[142],"Furthermore,":[143],"prove":[145],"approach":[148,187],"can":[149],"also":[150],"used":[152],"compute":[154],"minimum":[164,176],"spanning":[165],"tree":[166],"problem.":[167],"Experimental":[168],"investigations":[169],"instances":[171],"NP-hard":[174],"weight":[177],"dominating":[178],"confirm":[181],"benefit":[183],"in":[188],"practice.":[189]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}