{"id":"https://openalex.org/W4401166730","doi":"https://doi.org/10.1007/s00500-024-09948-w","title":"A biased random-key genetic algorithm for the knapsack problem with forfeit sets","display_name":"A biased random-key genetic algorithm for the knapsack problem with forfeit sets","publication_year":2024,"publication_date":"2024-07-31","ids":{"openalex":"https://openalex.org/W4401166730","doi":"https://doi.org/10.1007/s00500-024-09948-w"},"language":"en","primary_location":{"id":"doi:10.1007/s00500-024-09948-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00500-024-09948-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00500-024-09948-w.pdf","source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00500-024-09948-w.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034899414","display_name":"Raffaele Cerulli","orcid":"https://orcid.org/0000-0002-3277-6802"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Raffaele Cerulli","raw_affiliation_strings":["Department of Mathematics, University of Salerno, Via Giovanni Paolo II 132, 84084, Fisciano, SA, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Salerno, Via Giovanni Paolo II 132, 84084, Fisciano, SA, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025118836","display_name":"Ciriaco D\u2019Ambrosio","orcid":"https://orcid.org/0000-0003-1274-6144"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Ciriaco D\u2019Ambrosio","raw_affiliation_strings":["Department of Mathematics, University of Salerno, Via Giovanni Paolo II 132, 84084, Fisciano, SA, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Salerno, Via Giovanni Paolo II 132, 84084, Fisciano, SA, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010736650","display_name":"Andrea Raiconi","orcid":"https://orcid.org/0000-0002-7188-8794"},"institutions":[{"id":"https://openalex.org/I4210106125","display_name":"Istituto per le Applicazioni del Calcolo Mauro Picone","ror":"https://ror.org/00ygy3d85","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210106125","https://openalex.org/I4210155236"]},{"id":"https://openalex.org/I4210129308","display_name":"Institute of Protein Biochemistry","ror":"https://ror.org/03eqeqg74","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210129308","https://openalex.org/I4210155236"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Andrea Raiconi","raw_affiliation_strings":["CNR-IAC, Institute for Applied Mathematics \u201cMauro Picone\u201d, Via Pietro Castellino 111, 80131, Naples, Italy","CNR-IAC, Institute for Applied Mathematics \"Mauro Picone\", Via Pietro Castellino 111, 80131, Naples, Italy"],"affiliations":[{"raw_affiliation_string":"CNR-IAC, Institute for Applied Mathematics \u201cMauro Picone\u201d, Via Pietro Castellino 111, 80131, Naples, Italy","institution_ids":["https://openalex.org/I4210129308"]},{"raw_affiliation_string":"CNR-IAC, Institute for Applied Mathematics \"Mauro Picone\", Via Pietro Castellino 111, 80131, Naples, Italy","institution_ids":["https://openalex.org/I4210106125"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5010736650"],"corresponding_institution_ids":["https://openalex.org/I4210106125","https://openalex.org/I4210129308"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":1.0828,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.79632462,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"28","issue":"20","first_page":"12021","last_page":"12041"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"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.9998000264167786,"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.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9428616166114807},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.759501576423645},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.7234987616539001},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6179569363594055},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4908760190010071},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44129443168640137},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42712903022766113},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3581785559654236},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.0695372223854065}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9428616166114807},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.759501576423645},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.7234987616539001},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6179569363594055},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4908760190010071},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44129443168640137},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42712903022766113},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3581785559654236},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0695372223854065}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00500-024-09948-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00500-024-09948-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00500-024-09948-w.pdf","source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00500-024-09948-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00500-024-09948-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00500-024-09948-w.pdf","source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6200000047683716,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4401166730.pdf","grobid_xml":"https://content.openalex.org/works/W4401166730.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1973108067","https://openalex.org/W1987602810","https://openalex.org/W1988173185","https://openalex.org/W2021757872","https://openalex.org/W2026884285","https://openalex.org/W2038382324","https://openalex.org/W2057959765","https://openalex.org/W2140043891","https://openalex.org/W2153386665","https://openalex.org/W2153459888","https://openalex.org/W2410078569","https://openalex.org/W2567449761","https://openalex.org/W2586575729","https://openalex.org/W2604863078","https://openalex.org/W2620796999","https://openalex.org/W2774060613","https://openalex.org/W2957148222","https://openalex.org/W3044201904","https://openalex.org/W3045117486","https://openalex.org/W3092560364","https://openalex.org/W3112292673","https://openalex.org/W3128148487","https://openalex.org/W3205712728","https://openalex.org/W3209142418","https://openalex.org/W4229640061","https://openalex.org/W4247995644","https://openalex.org/W4309825491","https://openalex.org/W4366420580","https://openalex.org/W4376641432","https://openalex.org/W4391756104"],"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/W2141701778","https://openalex.org/W3169691842"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"work":[2],"addresses":[3],"the":[4,15,35,40,59,63,93,102],"Knapsack":[5,17],"Problem":[6,18],"with":[7,24],"Forfeit":[8],"Sets,":[9],"a":[10,44,48,75,97],"recently":[11],"introduced":[12,99],"variant":[13],"of":[14,21,37],"0/1":[16],"considering":[19],"subsets":[20],"items":[22,38],"associated":[23],"contrasting":[25],"choices.":[26],"Some":[27],"penalty":[28],"costs":[29],"need":[30],"to":[31,43,57,78],"be":[32],"paid":[33],"whenever":[34],"number":[36],"in":[39],"solution":[41,77],"belonging":[42],"forfeit":[45],"set":[46],"exceeds":[47],"predefined":[49],"allowance":[50],"threshold.":[51],"We":[52,89],"propose":[53],"an":[54],"effective":[55],"metaheuristic":[56,100],"solve":[58],"problem,":[60],"based":[61],"on":[62],"Biased":[64],"Random-Key":[65],"Genetic":[66],"Algorithm":[67],"paradigm.":[68],"An":[69],"appropriately":[70],"designed":[71],"decoder":[72],"function":[73],"assigns":[74],"feasible":[76],"each":[79],"chromosome,":[80],"and":[81],"improves":[82],"it":[83],"using":[84],"some":[85],"additional":[86],"heuristic":[87],"procedures.":[88],"show":[90],"experimentally":[91],"that":[92],"algorithm":[94],"outperforms":[95],"significantly":[96],"previously":[98],"for":[101],"problem.":[103]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}