{"id":"https://openalex.org/W4414182254","doi":"https://doi.org/10.3390/sym17091538","title":"A Hybrid Symmetry Strategy Improved Binary Planet Optimization Algorithm with Theoretical Interpretability for the 0-1 Knapsack Problem","display_name":"A Hybrid Symmetry Strategy Improved Binary Planet Optimization Algorithm with Theoretical Interpretability for the 0-1 Knapsack Problem","publication_year":2025,"publication_date":"2025-09-15","ids":{"openalex":"https://openalex.org/W4414182254","doi":"https://doi.org/10.3390/sym17091538"},"language":"en","primary_location":{"id":"doi:10.3390/sym17091538","is_oa":true,"landing_page_url":"https://doi.org/10.3390/sym17091538","pdf_url":"https://www.mdpi.com/2073-8994/17/9/1538/pdf?version=1757924060","source":{"id":"https://openalex.org/S190787756","display_name":"Symmetry","issn_l":"2073-8994","issn":["2073-8994"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Symmetry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/2073-8994/17/9/1538/pdf?version=1757924060","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006796886","display_name":"Yang Yang","orcid":"https://orcid.org/0000-0001-6967-6250"},"institutions":[{"id":"https://openalex.org/I191208505","display_name":"Xiamen University","ror":"https://ror.org/00mcjh785","country_code":"CN","type":"education","lineage":["https://openalex.org/I191208505"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yang Yang","raw_affiliation_strings":["School of Mathematical Sciences, Xiamen University, Xiamen 361005, China"],"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Xiamen University, Xiamen 361005, China","institution_ids":["https://openalex.org/I191208505"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006796886"],"corresponding_institution_ids":["https://openalex.org/I191208505"],"apc_list":{"value":2000,"currency":"CHF","value_usd":2165},"apc_paid":{"value":2000,"currency":"CHF","value_usd":2165},"fwci":2.4716,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.90891606,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"17","issue":"9","first_page":"1538","last_page":"1538"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9994999766349792,"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.9994999766349792,"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.9986000061035156,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9962000250816345,"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.8363000154495239},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6182000041007996},{"id":"https://openalex.org/keywords/interpretability","display_name":"Interpretability","score":0.5813000202178955},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4569999873638153},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.45579999685287476},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4124000072479248},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.38519999384880066},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3831000030040741}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8363000154495239},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6182000041007996},{"id":"https://openalex.org/C2781067378","wikidata":"https://www.wikidata.org/wiki/Q17027399","display_name":"Interpretability","level":2,"score":0.5813000202178955},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5651999711990356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5364999771118164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5045999884605408},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4569999873638153},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.45579999685287476},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4124000072479248},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.38519999384880066},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3831000030040741},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3792000114917755},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3718999922275543},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.3718000054359436},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3700999915599823},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3625999987125397},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3601999878883362},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.3596000075340271},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.34549999237060547},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2578999996185303},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.25609999895095825},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3390/sym17091538","is_oa":true,"landing_page_url":"https://doi.org/10.3390/sym17091538","pdf_url":"https://www.mdpi.com/2073-8994/17/9/1538/pdf?version=1757924060","source":{"id":"https://openalex.org/S190787756","display_name":"Symmetry","issn_l":"2073-8994","issn":["2073-8994"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Symmetry","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.3390/sym17091538","is_oa":true,"landing_page_url":"https://doi.org/10.3390/sym17091538","pdf_url":"https://www.mdpi.com/2073-8994/17/9/1538/pdf?version=1757924060","source":{"id":"https://openalex.org/S190787756","display_name":"Symmetry","issn_l":"2073-8994","issn":["2073-8994"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Symmetry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414182254.pdf","grobid_xml":"https://content.openalex.org/works/W4414182254.grobid-xml"},"referenced_works_count":48,"referenced_works":["https://openalex.org/W883434633","https://openalex.org/W1120240326","https://openalex.org/W1563501581","https://openalex.org/W1982424492","https://openalex.org/W2000621750","https://openalex.org/W2015709857","https://openalex.org/W2060322444","https://openalex.org/W2061438946","https://openalex.org/W2064477811","https://openalex.org/W2066356146","https://openalex.org/W2084421075","https://openalex.org/W2094859983","https://openalex.org/W2110368321","https://openalex.org/W2158392724","https://openalex.org/W2213987030","https://openalex.org/W2232317135","https://openalex.org/W2252127210","https://openalex.org/W2265854548","https://openalex.org/W2301939927","https://openalex.org/W2303166133","https://openalex.org/W2541899315","https://openalex.org/W2566904163","https://openalex.org/W2573137292","https://openalex.org/W2751383815","https://openalex.org/W2949584349","https://openalex.org/W3003586727","https://openalex.org/W3006962907","https://openalex.org/W3023946741","https://openalex.org/W3035755223","https://openalex.org/W3043381356","https://openalex.org/W3043752008","https://openalex.org/W3101499842","https://openalex.org/W3123143393","https://openalex.org/W3171811698","https://openalex.org/W3195184299","https://openalex.org/W3214474818","https://openalex.org/W4200292510","https://openalex.org/W4230073927","https://openalex.org/W4236127247","https://openalex.org/W4240374930","https://openalex.org/W4280596026","https://openalex.org/W4282582544","https://openalex.org/W4306786755","https://openalex.org/W4321368851","https://openalex.org/W4327599136","https://openalex.org/W4362724099","https://openalex.org/W4385335961","https://openalex.org/W4400519795"],"related_works":[],"abstract_inverted_index":{"The":[0,139],"Planet":[1,40],"Optimization":[2,41],"Algorithm":[3,42],"(POA)":[4],"is":[5,97,180],"a":[6,29,60,67,127],"meta-heuristic":[7],"inspired":[8],"by":[9,187],"celestial":[10],"mechanics,":[11],"drawing":[12],"on":[13,115,205],"Newtonian":[14],"gravitational":[15],"principles":[16],"to":[17,45],"simulate":[18],"planetary":[19],"dynamics":[20],"in":[21,32,130,183],"optimization":[22],"search":[23,89,191],"spaces.":[24],"While":[25],"the":[26,46,55,57,76,88,101,104,109,119,123,147,151,171,188,195,203],"POA":[27],"demonstrates":[28],"strong":[30],"performance":[31,129],"continuous":[33],"domains,":[34],"we":[35],"propose":[36],"an":[37,208],"Improved":[38],"Binary":[39],"(IBPOA)":[43],"tailored":[44],"classical":[47],"0-1":[48,124],"knapsack":[49],"problem":[50],"(0-1":[51],"KP).":[52],"Building":[53],"upon":[54],"POA,":[56],"IBPOA":[58,148,172,196],"introduces":[59],"novel":[61],"improved":[62],"transfer":[63],"function":[64],"(ITF)":[65],"and":[66,84,136,214],"greedy":[68],"repair":[69],"operator":[70],"(GRO).":[71],"Unlike":[72],"general":[73],"binarization":[74],"methods,":[75],"ITF":[77],"integrates":[78],"theoretical":[79],"foundations":[80],"from":[81,141],"branch-and-bound":[82],"(B&B)":[83],"reduction":[85],"algorithms,":[86],"reducing":[87],"space":[90],"while":[91],"guaranteeing":[92],"optimal":[93,152,209],"solutions.":[94],"This":[95],"improvement":[96],"strengthened":[98],"further":[99],"through":[100],"incorporation":[102],"of":[103],"GRO,":[105],"which":[106],"significantly":[107,173],"improves":[108],"searching":[110],"capability.":[111],"Extensive":[112],"computational":[113,215],"experiments":[114],"large-scale":[116],"instances":[117],"demonstrate":[118],"IBPOA\u2019s":[120],"effectiveness":[121],"for":[122],"KP,":[125],"showing":[126],"superior":[128],"its":[131,184],"convergence":[132],"rate,":[133],"population":[134],"diversity,":[135],"exploration\u2013exploitation":[137],"balance.":[138],"results":[140],"30":[142],"independent":[143],"runs":[144],"confirm":[145],"that":[146,170],"consistently":[149],"obtains":[150],"solutions":[153,198],"across":[154],"all":[155,175],"15":[156],"benchmark":[157],"instances,":[158],"spanning":[159],"three":[160],"categories.":[161],"Wilcoxon\u2019s":[162],"rank-sum":[163],"tests":[164],"against":[165],"seven":[166],"state-of-the-art":[167],"algorithms":[168],"reveal":[169],"outperforms":[174],"competitors":[176],"(p<0.05),":[177],"though":[178],"it":[179],"occasionally":[181],"matched":[182],"solution":[185,212],"quality":[186,213],"binary":[189],"reptile":[190],"algorithm":[192],"(BinRSA).":[193],"Crucially,":[194],"achieves":[197],"4.16":[199],"times":[200],"faster":[201],"than":[202],"BinRSA":[204],"average,":[206],"establishing":[207],"balance":[210],"between":[211],"efficiency.":[216]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-31T07:56:22.981413","created_date":"2025-10-10T00:00:00"}