{"id":"https://openalex.org/W3040314049","doi":"https://doi.org/10.1145/3377930.3390162","title":"Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem","display_name":"Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem","publication_year":2020,"publication_date":"2020-06-25","ids":{"openalex":"https://openalex.org/W3040314049","doi":"https://doi.org/10.1145/3377930.3390162","mag":"3040314049"},"language":"en","primary_location":{"id":"doi:10.1145/3377930.3390162","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3377930.3390162","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 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/A5078573149","display_name":"Yue Xie","orcid":"https://orcid.org/0000-0002-7959-4563"},"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":"Yue Xie","raw_affiliation_strings":["University of Adelaide, Adelaide, SA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Adelaide, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","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":["University of Adelaide, Adelaide, SA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Adelaide, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","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":["University of Adelaide, Adelaide, SA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Adelaide, 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":34,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"271","last_page":"279"},"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.9995999932289124,"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.9995999932289124,"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/T12176","display_name":"Optimization and Packing Problems","score":0.995199978351593,"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.9940000176429749,"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.989168643951416},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.7870168685913086},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.7217575311660767},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7158914804458618},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6172204613685608},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5627984404563904},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.5247014760971069},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41831234097480774},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.4161509573459625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40733569860458374},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.338547021150589},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15735459327697754}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.989168643951416},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7870168685913086},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7217575311660767},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7158914804458618},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6172204613685608},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5627984404563904},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.5247014760971069},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41831234097480774},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.4161509573459625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40733569860458374},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.338547021150589},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15735459327697754},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3377930.3390162","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3377930.3390162","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/126990","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/126990","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://dl.acm.org/doi/proceedings/10.1145/3377930","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W622296906","https://openalex.org/W1072890467","https://openalex.org/W1494649436","https://openalex.org/W1522890465","https://openalex.org/W1763200058","https://openalex.org/W1976174751","https://openalex.org/W1983991003","https://openalex.org/W1997600725","https://openalex.org/W2017373162","https://openalex.org/W2027111774","https://openalex.org/W2032499907","https://openalex.org/W2041025394","https://openalex.org/W2045043199","https://openalex.org/W2058409291","https://openalex.org/W2072099061","https://openalex.org/W2074197819","https://openalex.org/W2097571405","https://openalex.org/W2112327267","https://openalex.org/W2126105956","https://openalex.org/W2128563800","https://openalex.org/W2131960077","https://openalex.org/W2139272701","https://openalex.org/W2555395830","https://openalex.org/W2604934189","https://openalex.org/W2731672985","https://openalex.org/W2962827889","https://openalex.org/W2969604833","https://openalex.org/W4205469090","https://openalex.org/W4240139199","https://openalex.org/W4240196045","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1483913682","https://openalex.org/W4249611560","https://openalex.org/W2354313438","https://openalex.org/W2005493932","https://openalex.org/W2138107807","https://openalex.org/W2087209118","https://openalex.org/W2376421450","https://openalex.org/W2889442766","https://openalex.org/W2993365626","https://openalex.org/W2133099979"],"abstract_inverted_index":{"The":[0,24],"chance-constrained":[1,88,120],"knapsack":[2,10,89,121],"problem":[3,11],"is":[4,26],"a":[5,16,21,53,80,113],"variant":[6],"of":[7,20,32,42,56,75,100,107],"the":[8,29,33,37,40,43,48,69,73,87,98,105,119,130,140,155],"classical":[9,108],"where":[12],"each":[13],"item":[14],"has":[15],"weight":[17,41,50],"distribution":[18],"instead":[19],"deterministic":[22],"weight.":[23],"objective":[25],"to":[27,84,104,138,149],"maximize":[28],"total":[30],"profit":[31],"selected":[34,44],"items":[35,45],"under":[36],"condition":[38],"that":[39,146],"only":[46],"exceeds":[47],"given":[49],"bound":[51],"with":[52,86,129],"small":[54],"probability":[55],"\u03b1.":[57],"In":[58],"this":[59,125,147],"paper,":[60],"we":[61,111],"consider":[62],"problem-specific":[63,81,131],"single-objective":[64,94],"and":[65,78,164],"multi-objective":[66,116,135,159],"approaches":[67],"for":[68,93,118],"problem.":[70,90,122,141],"We":[71,123],"examine":[72],"use":[74,106,124],"heavy-tail":[76],"mutations":[77],"introduce":[79,112],"crossover":[82,132],"operator":[83,133],"deal":[85],"Empirical":[91],"results":[92,144],"evolutionary":[95,136,158],"algorithms":[96,137,160],"show":[97,145],"effectiveness":[99],"our":[101],"operators":[102],"compared":[103],"operators.":[109],"Moreover,":[110],"new":[114],"effective":[115],"model":[117,126],"in":[127,134,157],"combination":[128],"solve":[139],"Our":[142],"experimental":[143],"leads":[148],"significant":[150],"performance":[151],"improvements":[152],"when":[153],"using":[154],"approach":[156],"such":[161],"as":[162],"GSEMO":[163],"NSGA-II.":[165]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}