{"id":"https://openalex.org/W7167896361","doi":"https://doi.org/10.1145/3795095.3805133","title":"On the Use of Bi-Objective Evolutionary Algorithms for the Stochastic Multiple Knapsack Problem under Dynamic Constraints","display_name":"On the Use of Bi-Objective Evolutionary Algorithms for the Stochastic Multiple Knapsack Problem under Dynamic Constraints","publication_year":2026,"publication_date":"2026-07-10","ids":{"openalex":"https://openalex.org/W7167896361","doi":"https://doi.org/10.1145/3795095.3805133"},"language":null,"primary_location":{"id":"doi:10.1145/3795095.3805133","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3795095.3805133","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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","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":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1145/3795095.3805133","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":["School of Computer Science and Information Technology, Adelaide University, Adelaide, SA, Australia"],"raw_orcid":"https://orcid.org/0000-0002-8043-994X","affiliations":[{"raw_affiliation_string":"School of Computer Science and Information Technology, Adelaide University, Adelaide, SA, 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":["School of Computer Science and Information Technology, Adelaide University, Adelaide, SA, Australia"],"raw_orcid":"https://orcid.org/0000-0002-0036-4782","affiliations":[{"raw_affiliation_string":"School of Computer Science and Information Technology, Adelaide University, Adelaide, SA, 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":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"428","last_page":"437"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.6906999945640564,"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.6906999945640564,"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.13600000739097595,"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.04170000180602074,"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.9484000205993652},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.6693999767303467},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6376000046730042},{"id":"https://openalex.org/keywords/profit-maximization","display_name":"Profit maximization","score":0.45840001106262207},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.44429999589920044},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43779999017715454},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.43140000104904175},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4205999970436096},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.38830000162124634}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9484000205993652},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7290999889373779},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6693999767303467},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6376000046730042},{"id":"https://openalex.org/C2777780509","wikidata":"https://www.wikidata.org/wiki/Q1377422","display_name":"Profit maximization","level":3,"score":0.45840001106262207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4537999927997589},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.44429999589920044},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43779999017715454},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.43140000104904175},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4205999970436096},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4106999933719635},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.38830000162124634},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.38420000672340393},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3441999852657318},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.3296999931335449},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.3093999922275543},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.3021000027656555},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.30140000581741333},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.29600000381469727},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.2782000005245209},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.27079999446868896},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.26820001006126404},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.25929999351501465},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.25459998846054077},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2533000111579895}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3795095.3805133","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3795095.3805133","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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","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":{"id":"doi:10.1145/3795095.3805133","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3795095.3805133","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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W2000444555","https://openalex.org/W2006371937","https://openalex.org/W2022485595","https://openalex.org/W2024626675","https://openalex.org/W2043893476","https://openalex.org/W2049000915","https://openalex.org/W2094913290","https://openalex.org/W2102694748","https://openalex.org/W2109554766","https://openalex.org/W2114487145","https://openalex.org/W2126105956","https://openalex.org/W2137130066","https://openalex.org/W2140170679","https://openalex.org/W2143381319","https://openalex.org/W2152118235","https://openalex.org/W2285736397","https://openalex.org/W2399440847","https://openalex.org/W2555395830","https://openalex.org/W2898872836","https://openalex.org/W2966328247","https://openalex.org/W3040314049","https://openalex.org/W3089700631","https://openalex.org/W3091447387","https://openalex.org/W3120855898","https://openalex.org/W3166625191","https://openalex.org/W3177186913","https://openalex.org/W3193427507","https://openalex.org/W4210457632","https://openalex.org/W4220716260","https://openalex.org/W4221135157","https://openalex.org/W4280569079","https://openalex.org/W4285604467","https://openalex.org/W4384024043","https://openalex.org/W4384024352","https://openalex.org/W4386002120","https://openalex.org/W4387006174","https://openalex.org/W4399373626","https://openalex.org/W4400410560","https://openalex.org/W4400412161","https://openalex.org/W4400414506","https://openalex.org/W4400414672","https://openalex.org/W4400487341","https://openalex.org/W4402289326","https://openalex.org/W4402794862","https://openalex.org/W4409884008"],"related_works":[],"abstract_inverted_index":{"The":[0,135,149],"multiple":[1,14],"knapsack":[2,8,86],"problem":[3,9,96],"(MKP)":[4],"generalizes":[5],"the":[6,74,90,95,155],"classical":[7],"by":[10],"assigning":[11],"items":[12],"to":[13,17,23],"knapsacks":[15],"subject":[16],"capacity":[18,108],"constraints.":[19,167],"It":[20],"is":[21],"used":[22,123],"model":[24],"many":[25],"real-world":[26],"resource":[27],"allocation":[28],"and":[29,40,55,65,85,106,131,145,159],"scheduling":[30],"problems.":[31],"In":[32,58],"practice,":[33],"these":[34],"optimization":[35,91,100],"problems":[36,52],"often":[37],"involve":[38],"stochastic":[39,64,163],"dynamic":[41,56,66,146,166],"components.":[42],"Evolutionary":[43],"algorithms":[44,126,136],"provide":[45,151],"a":[46,63,98,111],"flexible":[47],"framework":[48],"for":[49,162],"addressing":[50],"such":[51],"under":[53,139,165],"uncertainty":[54,141],"changes.":[57],"this":[59],"paper,":[60],"we":[61],"investigate":[62],"variant":[67],"of":[68,120,157],"MKP":[69,164],"with":[70],"chance":[71],"constraints,":[72],"where":[73],"item":[75],"weights":[76],"are":[77,137],"modeled":[78],"as":[79,97],"independent":[80],"normally":[81],"distributed":[82],"random":[83],"variables":[84],"capacities":[87],"change":[88,147],"during":[89],"process.":[92],"We":[93,115],"formulate":[94],"bi-objective":[99],"formulation":[101],"that":[102],"balances":[103],"profit":[104],"maximization":[105],"probabilistic":[107],"satisfaction":[109],"at":[110],"given":[112],"confidence":[113,143],"level.":[114],"conduct":[116],"an":[117],"empirical":[118],"comparison":[119],"four":[121],"widely":[122],"multi-objective":[124],"evolutionary":[125],"(MOEAs),":[127],"representing":[128],"both":[129],"decomposition-":[130],"dominance-based":[132,160],"search":[133],"paradigms.":[134],"evaluated":[138],"varying":[140],"levels,":[142],"thresholds,":[144],"settings.":[148],"results":[150],"comparative":[152],"insights":[153],"into":[154],"behavior":[156],"decomposition-based":[158],"MOEAs":[161]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-07-11T00:00:00"}