{"id":"https://openalex.org/W7134822388","doi":"https://doi.org/10.48550/arxiv.2603.08209","title":"Multi-Objective Evolutionary Optimization of Chance-Constrained Multiple-Choice Knapsack Problems with Implicit Probability Distributions","display_name":"Multi-Objective Evolutionary Optimization of Chance-Constrained Multiple-Choice Knapsack Problems with Implicit Probability Distributions","publication_year":2026,"publication_date":"2026-03-09","ids":{"openalex":"https://openalex.org/W7134822388","doi":"https://doi.org/10.48550/arxiv.2603.08209"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2603.08209","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128634834","display_name":"Xuanfeng Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Xuanfeng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047453825","display_name":"Shengcai Liu","orcid":"https://orcid.org/0000-0002-4223-2438"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Shengcai","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128640702","display_name":"Wenjie Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Wenjie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128644127","display_name":"Yew-Soon Ong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ong, Yew-Soon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5128671770","display_name":"Ke Tang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tang, Ke","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.32391304,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.36820000410079956,"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.36820000410079956,"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.30379998683929443,"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.09700000286102295,"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.8883000016212463},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5958999991416931},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.5687000155448914},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5343000292778015},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.38339999318122864},{"id":"https://openalex.org/keywords/thompson-sampling","display_name":"Thompson sampling","score":0.3659999966621399},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.36550000309944153},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.36250001192092896}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8883000016212463},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6305999755859375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6064000129699707},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5958999991416931},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.5687000155448914},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5343000292778015},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.38339999318122864},{"id":"https://openalex.org/C73602740","wikidata":"https://www.wikidata.org/wiki/Q7795822","display_name":"Thompson sampling","level":3,"score":0.3659999966621399},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.36550000309944153},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.36250001192092896},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.32989999651908875},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.32519999146461487},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.3163999915122986},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.31520000100135803},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.30730000138282776},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.28870001435279846},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2827000021934509},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26330000162124634},{"id":"https://openalex.org/C162500139","wikidata":"https://www.wikidata.org/wiki/Q2835887","display_name":"Estimation of distribution algorithm","level":2,"score":0.2583000063896179},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2603.08209","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2603.08209","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.08209","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2603.08209","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,33,149],"multiple-choice":[1],"knapsack":[2],"problem":[3,37],"(MCKP)":[4],"is":[5,38],"a":[6,17,107],"classic":[7],"combinatorial":[8],"optimization":[9],"with":[10],"wide":[11],"practical":[12],"applications.":[13],"This":[14,88],"paper":[15],"investigates":[16],"significant":[18],"yet":[19],"underexplored":[20],"extension":[21],"of":[22,35,50,69],"MCKP:":[23],"the":[24,36,42,47,52,66],"multi-objective":[25,142],"chance-constrained":[26],"MCKP":[27],"(MO-CCMCKP)":[28],"under":[29,73],"implicit":[30,74],"probability":[31],"distributions.":[32],"goal":[34],"to":[39,94,120,160],"simultaneously":[40],"minimize":[41],"total":[43],"cost":[44],"and":[45,115,129,147,152],"maximize":[46],"confidence":[48],"level":[49],"satisfying":[51],"capacity":[53],"constraint,":[54],"capturing":[55],"essential":[56],"trade-offs":[57],"in":[58,144,163],"domains":[59],"like":[60],"5G":[61,131],"network":[62,132],"configuration.":[63],"To":[64],"address":[65],"computational":[67],"challenge":[68],"evaluating":[70],"chance":[71],"constraints":[72],"distributions,":[75],"we":[76,104],"first":[77],"propose":[78],"an":[79],"order-preserving":[80],"efficient":[81],"resource":[82],"allocation":[83],"Monte":[84],"Carlo":[85],"(OPERA-MC)":[86],"method.":[87],"approach":[89],"adaptively":[90],"allocates":[91],"sampling":[92],"resources":[93],"preserve":[95],"dominance":[96],"relationships":[97],"while":[98],"reducing":[99],"evaluation":[100],"time":[101],"significantly.":[102],"Further,":[103],"develop":[105],"NHILS,":[106],"hybrid":[108],"evolutionary":[109],"algorithm":[110],"that":[111,136],"integrates":[112],"specialized":[113],"initialization":[114],"local":[116],"search":[117],"into":[118],"NSGA-II":[119],"navigate":[121],"sparse":[122],"feasible":[123],"regions.":[124],"Experiments":[125],"on":[126],"synthetic":[127],"benchmarks":[128,134],"real-world":[130],"configuration":[133],"demonstrate":[135],"NHILS":[137],"consistently":[138],"outperforms":[139],"several":[140],"state-of-the-art":[141],"optimizers":[143],"convergence,":[145],"diversity,":[146],"feasibility.":[148],"benchmark":[150],"instances":[151],"source":[153],"code":[154],"will":[155],"be":[156],"made":[157],"publicly":[158],"available":[159],"facilitate":[161],"research":[162],"this":[164],"area.":[165]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-03-11T00:00:00"}