{"id":"https://openalex.org/W4400414506","doi":"https://doi.org/10.1145/3638529.3654066","title":"Effective 2- and 3-Objective MOEA/D Approaches for the Chance Constrained Knapsack Problem","display_name":"Effective 2- and 3-Objective MOEA/D Approaches for the Chance Constrained Knapsack Problem","publication_year":2024,"publication_date":"2024-07-08","ids":{"openalex":"https://openalex.org/W4400414506","doi":"https://doi.org/10.1145/3638529.3654066"},"language":"en","primary_location":{"id":"doi:10.1145/3638529.3654066","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3638529.3654066","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":11,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"187","last_page":"195"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9991999864578247,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.996399998664856,"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.9962000250816345,"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/knapsack-problem","display_name":"Knapsack problem","score":0.969306230545044},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6904029250144958},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5893736481666565},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.525517463684082},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4289878010749817},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.41104692220687866},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3482261896133423}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.969306230545044},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6904029250144958},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5893736481666565},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.525517463684082},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4289878010749817},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.41104692220687866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3482261896133423}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3638529.3654066","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3638529.3654066","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":[],"awards":[{"id":"https://openalex.org/G1057128212","display_name":"Evolutionary diversity optimisation","funder_award_id":"DP190103894","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G3128856113","display_name":"Bio-inspired Computing for Problems with Chance Constraints","funder_award_id":"FT200100536","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":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W29472711","https://openalex.org/W397102730","https://openalex.org/W1552383524","https://openalex.org/W1982141993","https://openalex.org/W2011565421","https://openalex.org/W2017373162","https://openalex.org/W2027353299","https://openalex.org/W2066124178","https://openalex.org/W2074197819","https://openalex.org/W2126105956","https://openalex.org/W2143381319","https://openalex.org/W2150046657","https://openalex.org/W2157321006","https://openalex.org/W2165220807","https://openalex.org/W2399440847","https://openalex.org/W2405534122","https://openalex.org/W2473675251","https://openalex.org/W2555395830","https://openalex.org/W2559655401","https://openalex.org/W2962827889","https://openalex.org/W2999905431","https://openalex.org/W3040314049","https://openalex.org/W3091447387","https://openalex.org/W3166625191","https://openalex.org/W3173417360","https://openalex.org/W3177186913","https://openalex.org/W3182778669","https://openalex.org/W4285604467","https://openalex.org/W4291270599","https://openalex.org/W4300815771","https://openalex.org/W4384024043","https://openalex.org/W4384024352","https://openalex.org/W4387006174","https://openalex.org/W4400410560","https://openalex.org/W4400412047","https://openalex.org/W4400412161","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":{"Optimizing":[0],"real-world":[1],"problems":[2,48,110,118],"often":[3],"involves":[4],"decision-making":[5],"under":[6],"uncertainty":[7],"due":[8],"to":[9,19,44,49,83],"the":[10,21,29,64,78,85,88,102,107,130,133,143,149,175],"presence":[11],"of":[12,54,66,87,101,115,132,142,151],"unknown":[13],"or":[14],"uncontrollable":[15],"variables.":[16],"Chance-constraints":[17],"allow":[18],"model":[20],"optimization":[22,47,109,117],"problem":[23],"with":[24,34,160,180],"stochastic":[25],"components":[26],"by":[27],"ensuring":[28],"probabilistic":[30],"constraint":[31],"is":[32,99],"satisfied":[33],"high":[35],"probability.":[36],"Multi-objective":[37],"evolutionary":[38,93,163],"algorithms":[39,56,74],"(MOEAs)":[40],"are":[41,57,75,154],"successfully":[42],"applied":[43],"chance":[45,144],"constrained":[46,145],"achieve":[50],"high-quality":[51,178],"results.":[52],"Most":[53],"these":[55,122],"based":[58,76,95],"on":[59,77,96],"Pareto":[60],"dominance":[61],"for":[62],"measuring":[63],"quality":[65],"solutions":[67,179],"during":[68],"their":[69],"search.":[70],"A":[71],"very":[72],"few":[73],"decomposition":[79,97],"approach":[80],"which":[81,105],"tries":[82],"optimize":[84],"aggregations":[86],"objectives.":[89],"Among":[90],"them,":[91],"multi-objective":[92,108,164],"algorithm":[94,135],"(MOEA/D)":[98],"one":[100],"efficient":[103],"MOEAs":[104],"decomposes":[106],"(MOPs)":[111],"into":[112],"a":[113],"number":[114],"scalar":[116],"and":[119,139],"then":[120],"optimizes":[121],"sub-problems":[123],"simultaneously.":[124],"In":[125],"this":[126],"paper,":[127],"we":[128,172],"investigate":[129],"effectiveness":[131],"MOEA/D":[134,176],"when":[136],"solving":[137],"2-":[138],"3-objective":[140],"formulations":[141],"knapsack":[146],"problem,":[147],"where":[148],"weights":[150],"each":[152],"item":[153],"stochastic.":[155],"We":[156],"compare":[157],"its":[158],"performance":[159],"global":[161],"simple":[162],"optimizer":[165],"(GSEMO)":[166],"across":[167],"various":[168],"benchmark":[169],"scenarios.":[170],"Overall,":[171],"demonstrate":[173],"that":[174],"achieved":[177],"lower":[181],"computational":[182],"complexity.":[183]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":7}],"updated_date":"2026-07-21T08:15:58.654021","created_date":"2025-10-10T00:00:00"}