{"id":"https://openalex.org/W4400410560","doi":"https://doi.org/10.1145/3638529.3654081","title":"Multi-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem","display_name":"Multi-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem","publication_year":2024,"publication_date":"2024-07-08","ids":{"openalex":"https://openalex.org/W4400410560","doi":"https://doi.org/10.1145/3638529.3654081"},"language":"en","primary_location":{"id":"doi:10.1145/3638529.3654081","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3638529.3654081","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3638529.3654081?download=true","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","license_id":"https://openalex.org/licenses/cc-by","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://dl.acm.org/doi/pdf/10.1145/3638529.3654081?download=true","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010187710","display_name":"Kokila Kasuni Perera","orcid":"https://orcid.org/0000-0002-0748-0815"},"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":"Kokila Kasuni Perera","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-0748-0815","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":"223","last_page":"231"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9987000226974487,"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.9987000226974487,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9983000159263611,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9979000091552734,"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.9490616321563721},{"id":"https://openalex.org/keywords/sliding-window-protocol","display_name":"Sliding window protocol","score":0.6457056999206543},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6248322129249573},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.593123733997345},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5869346857070923},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.55680912733078},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.4875718951225281},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.4395006597042084},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.4338875412940979},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43198662996292114},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33457672595977783},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28398168087005615}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9490616321563721},{"id":"https://openalex.org/C102392041","wikidata":"https://www.wikidata.org/wiki/Q592860","display_name":"Sliding window protocol","level":3,"score":0.6457056999206543},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6248322129249573},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.593123733997345},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5869346857070923},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.55680912733078},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4875718951225281},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.4395006597042084},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4338875412940979},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43198662996292114},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33457672595977783},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28398168087005615},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3638529.3654081","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3638529.3654081","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3638529.3654081?download=true","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","license_id":"https://openalex.org/licenses/cc-by","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/3638529.3654081","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3638529.3654081","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3638529.3654081?download=true","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","license_id":"https://openalex.org/licenses/cc-by","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":[{"id":"https://metadata.un.org/sdg/10","score":0.44999998807907104,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4400410560.pdf"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W397102730","https://openalex.org/W1987789460","https://openalex.org/W2014328192","https://openalex.org/W2074197819","https://openalex.org/W2127172809","https://openalex.org/W2128563800","https://openalex.org/W2137130066","https://openalex.org/W2167322292","https://openalex.org/W2405619617","https://openalex.org/W2499811908","https://openalex.org/W3166625191","https://openalex.org/W3173417360","https://openalex.org/W3200825350","https://openalex.org/W3205750728","https://openalex.org/W4280569079","https://openalex.org/W4285604467","https://openalex.org/W4291418325","https://openalex.org/W4299665420","https://openalex.org/W4378945454","https://openalex.org/W4384024352","https://openalex.org/W4400412047","https://openalex.org/W4400412161","https://openalex.org/W4400414506","https://openalex.org/W4400414672"],"related_works":["https://openalex.org/W246960280","https://openalex.org/W2087209118","https://openalex.org/W2168163332","https://openalex.org/W2005493932","https://openalex.org/W179363847","https://openalex.org/W2381035939","https://openalex.org/W2145407993","https://openalex.org/W2378557713","https://openalex.org/W3103982436","https://openalex.org/W2888641532"],"abstract_inverted_index":{"Evolutionary":[0],"algorithms":[1,116],"are":[2],"particularly":[3],"effective":[4],"for":[5,18,117],"optimisation":[6],"problems":[7,138],"with":[8,22,97],"dynamic":[9,28,119],"and":[10,27,43,61,99,115,144,158],"stochastic":[11,23,41],"components.":[12],"We":[13,52,78,92,132],"propose":[14],"multi-objective":[15],"evolutionary":[16],"approaches":[17,151,153],"the":[19,40,49,67,76,85,94,107,118,140],"knapsack":[20],"problem":[21,33,68,120,142],"profits":[24,42],"under":[25],"static":[26],"weight":[29,86],"constraints.":[30],"The":[31],"chance-constrained":[32],"model":[34],"allows":[35,65],"us":[36],"to":[37,48,105,122,127,129],"effectively":[38],"capture":[39],"associate":[44],"a":[45,54,71,80,100],"confidence":[46,73],"level":[47,74],"solutions'":[50],"profits.":[51],"consider":[53,93],"bi-objective":[55,156],"formulation":[56,82],"that":[57,149,154],"maximises":[58],"expected":[59],"profit":[60],"minimises":[62],"variance,":[63],"which":[64],"optimising":[66],"independent":[69],"of":[70],"specific":[72],"on":[75,136],"profit.":[77],"derive":[79],"three-objective":[81,150],"by":[83],"relaxing":[84],"constraint":[87],"into":[88],"an":[89],"additional":[90],"objective.":[91],"GSEMO":[95,163],"algorithm":[96],"standard":[98],"sliding":[101,165],"window-based":[102],"parent":[103],"selection":[104],"evaluate":[106],"objective":[108],"formulations.":[109],"Moreover,":[110],"we":[111],"modify":[112],"fitness":[113],"formulations":[114,143],"variant":[121],"store":[123],"some":[124],"infeasible":[125],"solutions":[126],"cater":[128],"future":[130],"changes.":[131],"conduct":[133],"experimental":[134],"investigations":[135],"both":[137],"using":[139],"proposed":[141],"algorithms.":[145],"Our":[146],"results":[147],"show":[148],"outperform":[152],"use":[155],"formulations,":[157],"they":[159],"further":[160],"improve":[161],"when":[162],"uses":[164],"window":[166],"selection.":[167]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":7}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}