{"id":"https://openalex.org/W4400414672","doi":"https://doi.org/10.1145/3638529.3654067","title":"Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem","display_name":"Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem","publication_year":2024,"publication_date":"2024-07-08","ids":{"openalex":"https://openalex.org/W4400414672","doi":"https://doi.org/10.1145/3638529.3654067"},"language":"en","primary_location":{"id":"doi:10.1145/3638529.3654067","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3638529.3654067","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","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 Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"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/A5095335145","display_name":"Ishara Hewa Pathiranage","orcid":"https://orcid.org/0000-0002-8043-994X"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ishara Hewa Pathiranage","raw_affiliation_strings":["Optimisation and Logistics,School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia"],"raw_orcid":"https://orcid.org/0000-0002-8043-994X","affiliations":[{"raw_affiliation_string":"Optimisation and Logistics,School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","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":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Optimisation and Logistics,School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia"],"raw_orcid":"https://orcid.org/0000-0002-2721-3618","affiliations":[{"raw_affiliation_string":"Optimisation and Logistics,School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082239479","display_name":"Denis Antipov","orcid":"https://orcid.org/0000-0001-7906-096X"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Denis Antipov","raw_affiliation_strings":["Optimisation and Logistics,School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia"],"raw_orcid":"https://orcid.org/0000-0001-7906-096X","affiliations":[{"raw_affiliation_string":"Optimisation and Logistics,School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001757263","display_name":"Aneta Neumann","orcid":"https://orcid.org/0000-0002-0036-4782"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Aneta Neumann","raw_affiliation_strings":["Optimisation and Logistics,School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia"],"raw_orcid":"https://orcid.org/0000-0002-0036-4782","affiliations":[{"raw_affiliation_string":"Optimisation and Logistics,School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I5681781"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"520","last_page":"528"},"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.9991999864578247,"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.9991999864578247,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9979000091552734,"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/knapsack-problem","display_name":"Knapsack problem","score":0.9516265392303467},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.6344163417816162},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5863223075866699},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5728023648262024},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.559939444065094},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.49558961391448975},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.44463449716567993},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41137897968292236},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33927392959594727}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9516265392303467},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6344163417816162},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5863223075866699},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5728023648262024},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.559939444065094},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.49558961391448975},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.44463449716567993},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41137897968292236},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33927392959594727}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3638529.3654067","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3638529.3654067","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","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 Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W397102730","https://openalex.org/W1494649436","https://openalex.org/W1552383524","https://openalex.org/W1982141993","https://openalex.org/W2011565421","https://openalex.org/W2074197819","https://openalex.org/W2137130066","https://openalex.org/W2143381319","https://openalex.org/W2150046657","https://openalex.org/W2157321006","https://openalex.org/W2165220807","https://openalex.org/W2302257968","https://openalex.org/W2555395830","https://openalex.org/W2888641532","https://openalex.org/W2892050420","https://openalex.org/W2945278523","https://openalex.org/W2953507825","https://openalex.org/W2962827889","https://openalex.org/W3040314049","https://openalex.org/W3091447387","https://openalex.org/W3155779429","https://openalex.org/W3161287041","https://openalex.org/W3173282450","https://openalex.org/W3173417360","https://openalex.org/W3182778669","https://openalex.org/W3200825350","https://openalex.org/W4280569079","https://openalex.org/W4285604467","https://openalex.org/W4291270599","https://openalex.org/W4384024043","https://openalex.org/W4384024352","https://openalex.org/W4400410560","https://openalex.org/W4400412047","https://openalex.org/W4400412161","https://openalex.org/W4400414506","https://openalex.org/W4400414672","https://openalex.org/W4401415061"],"related_works":["https://openalex.org/W4288642040","https://openalex.org/W2908214350","https://openalex.org/W3169691842","https://openalex.org/W3166857172","https://openalex.org/W1701984136","https://openalex.org/W2122137596","https://openalex.org/W2060645964","https://openalex.org/W1984121220","https://openalex.org/W1601835603","https://openalex.org/W1556368910"],"abstract_inverted_index":{"Real-world":[0],"optimization":[1],"problems":[2],"often":[3,28],"involve":[4],"stochastic":[5,66,86],"and":[6,24,30,67,87,94,142],"dynamic":[7,31,55,88,171],"components.":[8],"Evolutionary":[9],"algorithms":[10,47,132],"are":[11,33,65],"particularly":[12],"effective":[13],"in":[14,35,168],"these":[15],"scenarios,":[16],"as":[17],"they":[18],"can":[19],"easily":[20],"adapt":[21],"to":[22,82,111,118],"uncertain":[23],"changing":[25],"environments":[26],"but":[27],"uncertainty":[29],"changes":[32,71],"studied":[34],"isolation.":[36],"In":[37,57],"this":[38],"paper,":[39],"we":[40],"explore":[41],"the":[42,49,60,63,68,85,91,98,103,112,125,135,143,158,161,165,170],"use":[43],"of":[44,62,97,160],"3-objective":[45,77,162],"evolutionary":[46,131,138,145],"for":[48,102],"chance":[50,172],"constrained":[51,173],"knapsack":[52,174],"problem":[53],"with":[54,84],"constraints.":[56],"our":[58],"setting,":[59],"weights":[61],"items":[64],"knapsack's":[69],"capacity":[70],"over":[72,164],"time.":[73],"We":[74,123],"introduce":[75],"a":[76,119],"formulation":[78,114,163,167],"that":[79],"is":[80,95,108,116],"able":[81],"deal":[83],"components":[89],"at":[90],"same":[92],"time":[93],"independent":[96],"confidence":[99,121],"level":[100],"required":[101],"constraint.":[104],"This":[105],"new":[106],"approach":[107,126],"then":[109],"compared":[110],"2-objective":[113,166],"which":[115],"limited":[117],"single":[120],"level.":[122],"evaluate":[124],"using":[127],"two":[128],"different":[129],"multi-objective":[130,139,144],"(MOEAs),":[133],"namely":[134],"global":[136],"simple":[137],"optimizer":[140],"(GSEMO)":[141],"algorithm":[146],"based":[147],"on":[148],"decomposition":[149],"(MOEA/D),":[150],"across":[151],"various":[152],"benchmark":[153],"scenarios.":[154],"Our":[155],"analysis":[156],"highlights":[157],"advantages":[159],"addressing":[169],"problem.":[175]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":7}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}