{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T03:44:57Z","timestamp":1774928697078,"version":"3.50.1"},"reference-count":56,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T00:00:00Z","timestamp":1757894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The Planet Optimization Algorithm (POA) is a meta-heuristic inspired by celestial mechanics, drawing on Newtonian gravitational principles to simulate planetary dynamics in optimization search spaces. While the POA demonstrates a strong performance in continuous domains, we propose an Improved Binary Planet Optimization Algorithm (IBPOA) tailored to the classical 0-1 knapsack problem (0-1 KP). Building upon the POA, the IBPOA introduces a novel improved transfer function (ITF) and a greedy repair operator (GRO). Unlike general binarization methods, the ITF integrates theoretical foundations from branch-and-bound (B&amp;B) and reduction algorithms, reducing the search space while guaranteeing optimal solutions. This improvement is strengthened further through the incorporation of the GRO, which significantly improves the searching capability. Extensive computational experiments on large-scale instances demonstrate the IBPOA\u2019s effectiveness for the 0-1 KP, showing a superior performance in its convergence rate, population diversity, and exploration\u2013exploitation balance. The results from 30 independent runs confirm that the IBPOA consistently obtains the optimal solutions across all 15 benchmark instances, spanning three categories. Wilcoxon\u2019s rank-sum tests against seven state-of-the-art algorithms reveal that the IBPOA significantly outperforms all competitors (p&lt;0.05), though it is occasionally matched in its solution quality by the binary reptile search algorithm (BinRSA). Crucially, the IBPOA achieves solutions 4.16 times faster than the BinRSA on average, establishing an optimal balance between solution quality and computational efficiency.<\/jats:p>","DOI":"10.3390\/sym17091538","type":"journal-article","created":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T09:43:41Z","timestamp":1757929421000},"page":"1538","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Hybrid Symmetry Strategy Improved Binary Planet Optimization Algorithm with Theoretical Interpretability for the 0-1 Knapsack Problem"],"prefix":"10.3390","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6967-6250","authenticated-orcid":false,"given":"Yang","family":"Yang","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Xiamen University, Xiamen 361005, China"}]}],"member":"1968","published-online":{"date-parts":[[2025,9,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Kellerer, H., Pferschy, U., and Pisinger, D. (2004). Knapsack Problems, Springer.","DOI":"10.1007\/978-3-540-24777-7"},{"key":"ref_2","unstructured":"Cook, S.A. (1971, January 3\u20135). The complexity of theorem-proving procedures. Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (STOC 1971), Shaker Heights, ON, USA."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Miller, R.E., Thatcher, J.W., and Bohlinger, J.D. (1972). Reducibility among Combinatorial Problems. Complexity of Computer Computations, Springer.","DOI":"10.1007\/978-1-4684-2001-2"},{"key":"ref_4","unstructured":"Garey, M.R., and Johnson, D.S. (1979). Computer and Intractablility: A Guide to the Theory of NP-Completeness, Freeman."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Sulaiman, A., Sadiq, M., Mehmood, Y., Akram, M., and Ali, G.A. (2022). Fitness-Based Acceleration Coefficients Binary Particle Swarm Optimization (FACBPSO) to Solve the Discounted Knapsack Problem. Symmetry, 14.","DOI":"10.3390\/sym14061208"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.ejor.2021.11.004","article-title":"Knapsack problems with dependencies through non-additive measures and Choquet integral","volume":"301","author":"Beliakov","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"8432","DOI":"10.1016\/j.eswa.2015.06.057","article-title":"A fuzzy hybrid project portfolio selection method using Data Envelopment Analysis, TOPSIS and Integer Programming","volume":"42","author":"Tavana","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1080\/0305215X.2014.963068","article-title":"Conceptual design optimization of rectilinear building frames: A Knapsack problem approach","volume":"47","author":"Sharafi","year":"2014","journal-title":"Eng. Optimiz."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.cor.2014.11.005","article-title":"A novel passenger recovery approach for the integrated airline recovery problem","volume":"57","author":"Maher","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"5661","DOI":"10.1080\/00207543.2020.1789235","article-title":"The interval min\u2013max regret knapsack packing-delivery problem","volume":"59","author":"Wang","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"ref_11","unstructured":"Bellman, R. (1957). Dynamic Programming, Princeton University Press."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","article-title":"An automatic method of solving discrete programming problem","volume":"28","author":"Land","year":"1960","journal-title":"Econometrica"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02243880","article-title":"Dynamic programming algorithms for the Zero-One Knapsack Problem","volume":"25","author":"Toth","year":"1980","journal-title":"Computing"},{"key":"ref_14","unstructured":"Holland, J.H. (1975). Adaptation in Natural and Artificial Systems, MIT Press."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","article-title":"Grey wolf optimizer","volume":"69","author":"Mirjalili","year":"2014","journal-title":"Adv. Eng. Softw."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2015.07.035","article-title":"Dynamic mentoring and self-regulation based particle swarm optimization algorithm for solving complex real-world optimization problems","volume":"326","author":"Tanweer","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"5945","DOI":"10.1016\/j.eswa.2013.05.002","article-title":"Transit network design by bee colony optimization","volume":"40","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Thanh, S.-T., Minh, H.-L., Magd, A.W., and Thanh, C.-L. (2022). An efficient Planet Optimization Algorithm for solving engineering problems. Sci. Rep., 12.","DOI":"10.1038\/s41598-022-12030-w"},{"key":"ref_19","unstructured":"Yang, Y. (2024). An upper bound of the mutation probability in the genetic algorithm for general 0-1 knapsack problem. arXiv."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"109080","DOI":"10.1016\/j.cie.2023.109080","article-title":"A binary reptile search algorithm based on transfer functions with a new stochastic repair method for 0-1 knapsack problems","volume":"178","author":"Ervural","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"126630","DOI":"10.1016\/j.neucom.2023.126630","article-title":"Nature-inspired algorithms for 0-1 knapsack problem: A survey","volume":"554","author":"Zhou","year":"2023","journal-title":"Neurocomputing"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"5751","DOI":"10.1007\/s10489-021-02717-4","article-title":"A modified hybrid rice optimization algorithm for solving 0-1 knapsack problem","volume":"52","author":"Shu","year":"2022","journal-title":"Appl. Intell."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"8605","DOI":"10.1007\/s11063-023-11171-x","article-title":"A Novel Binary Artificial Jellyfish Search Algorithm for Solving 0-1 Knapsack Problems","volume":"55","author":"Yildizdan","year":"2023","journal-title":"Neural Process Lett."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"106949","DOI":"10.1016\/j.cie.2020.106949","article-title":"New binary marine predators optimization algorithms for 0-1 knapsack problems","volume":"151","author":"Mohamed","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.eswa.2016.01.055","article-title":"Taming the 0\/1 knapsack problem with monogamous pairs genetic algorithm","volume":"54","author":"Lim","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s11063-015-9465-y","article-title":"A Complex-valued Encoding Bat Algorithm for Solving 0-1 Knapsack Problem","volume":"44","author":"Zhou","year":"2016","journal-title":"Neural Process Lett."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1007\/s10489-016-0855-2","article-title":"A complex-valued encoding wind driven optimization for the 0-1 knapsack problem","volume":"46","author":"Zhou","year":"2017","journal-title":"Appl. Intell."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.swevo.2016.02.006","article-title":"Quantum Inspired Social Evolution (QSE) algorithm for 0-1 knapsack problem","volume":"29","author":"Pavithr","year":"2016","journal-title":"Swarm Evol. Comput."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Wang, Y., and Wang, W. (2021). Quantum-Inspired Differential Evolution with Grey Wolf Optimizer for 0-1 Knapsack Problem. Mathematics, 9.","DOI":"10.3390\/math9111233"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.asoc.2014.02.010","article-title":"Shuffled frog leaping algorithm and its application to 01 knapsack problem","volume":"19","author":"Bhattacharjee","year":"2014","journal-title":"Appl. Soft Comput."},{"key":"ref_31","unstructured":"Kennedy, J., and Eberhart, R.C. (December, January 27). Particle swarm optimization. Proceedings of the 1995 IEEE International Conference on Neural Networks (ICNN), Perth, WA, Australia."},{"key":"ref_32","unstructured":"Kennedy, J., and Eberhart, R.C. (1997, January 12\u201315). Discrete binary version of the particle swarm algorithm. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Orlando, FL, USA."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"13187","DOI":"10.1007\/s10462-023-10470-y","article-title":"An exhaustive review of the metaheuristic algorithms for search and optimization: Taxonomy, applications, and open challenges","volume":"56","author":"Rajwar","year":"2023","journal-title":"Artif. Intell. Rev."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1007\/s12559-020-09730-8","article-title":"Comprehensive taxonomies of nature-and bio-inspired optimization: Inspiration versus algorithmic behavior, critical analysis recommendations","volume":"12","author":"Molina","year":"2020","journal-title":"Cogn. Comput."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","article-title":"SCA: A sine cosine algorithm for solving optimization problems","volume":"96","author":"Mirjalili","year":"2016","journal-title":"Knowl.-Based Syst."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"102506","DOI":"10.1016\/j.rineng.2024.102506","article-title":"Continuous-time Hammerstein model identification utilizing hybridization of Augmented Sine Cosine Algorithm and Game-Theoretic approach","volume":"23","author":"Suid","year":"2024","journal-title":"Results Eng."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/j.knosys.2015.07.006","article-title":"Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm","volume":"89","author":"Mirjalili","year":"2015","journal-title":"Knowl.-Based Syst."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","article-title":"S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization","volume":"9","author":"Mirjalili","year":"2013","journal-title":"Swarm Evol. Comput."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"101022","DOI":"10.1016\/j.swevo.2021.101022","article-title":"Novel binary differential evolution algorithm based on Taper-shaped transfer functions for binary optimization problems","volume":"69","author":"He","year":"2022","journal-title":"Swarm Evol. Comput."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/978-981-15-3290-0_19","article-title":"A Novel U-shaped transfer function for binary particle swarm optimisation","volume":"1138","author":"Mirjalili","year":"2020","journal-title":"Adv. Intell. Syst. Comput."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"6502807","DOI":"10.1155\/2020\/6502807","article-title":"Z-Shaped Transfer Functions for Binary Particle Swarm Optimization Algorithm","volume":"2020","author":"Guo","year":"2020","journal-title":"Comput. Intell. Neurosci."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Clerc, M. (2006). Particle Swarm Optimization, ISTE.","DOI":"10.1002\/9780470612163"},{"key":"ref_43","unstructured":"Wang, W.B. (2012). Research on Particle Swarm Optimization Algorithm and Its Application. [Ph.D. Thesis, Southwest Jiaotong University]."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s00500-016-2474-6","article-title":"Particle swarm optimization algorithm: An overview","volume":"22","author":"Wang","year":"2018","journal-title":"Soft Comput."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TSMCC.2006.875410","article-title":"Neighborhood topologies in fully informed and best-of-neighborhood particle swarms","volume":"36","author":"Kennedy","year":"2006","journal-title":"IEEE Trans. Syst. Man Cybern. Part C"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1016\/j.asoc.2017.08.051","article-title":"A novel multi-swarm particle swarm optimization with dynamic learning strategy","volume":"61","author":"Ye","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s10107-022-01895-4","article-title":"Branch-and-bound solves random binary IPs in poly(n)-time","volume":"200","author":"Dey","year":"2023","journal-title":"Math. Program."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","article-title":"Discrete-Variable Extremum Problems","volume":"5","author":"Dantzig","year":"1957","journal-title":"Oper. Res."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.swevo.2011.10.001","article-title":"Constraint-handling in nature-inspired numerical optimization: Past, present and future","volume":"1","year":"2011","journal-title":"Swarm Evol. Comput."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"106143","DOI":"10.1016\/j.asoc.2020.106143","article-title":"Adaptive repair method for constraint handling in multi-objective genetic algorithm based on relationship between constraints and variables","volume":"90","author":"Samanipour","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"ref_51","first-page":"11042","article-title":"A modified binary particle swarm optimization for knapsack problems","volume":"218","author":"Bansal","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1016\/j.neucom.2014.07.030","article-title":"A binary differential evolution algorithm learning from explored solutions","volume":"149","author":"Chen","year":"2015","journal-title":"Neurocomputing"},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Hota, A.R., and Pat, A. (2010, January 15\u201317). An adaptive quantum-inspired differential evolution algorithm for 0-1 knapsack problem. Proceedings of the IEEE 2nd World Congress on Nature and Biologically Inspired Computing (NaBIC 10), Kitakyushu, Japan.","DOI":"10.1109\/NABIC.2010.5716320"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"5732489","DOI":"10.1155\/2016\/5732489","article-title":"Dichotomous binary differential evolution for Knapsack problems","volume":"2016","author":"Peng","year":"2016","journal-title":"Math. Probl. Eng."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ins.2020.07.013","article-title":"Novel binary differential evolution algorithm for knapsack problems","volume":"542","author":"Ali","year":"2021","journal-title":"Inf. Sci."},{"key":"ref_56","unstructured":"L\u00f6fberg, J. (2004, January 2\u20134). YALMIP: A Toolbox for Modeling and Optimization in MATLAB. Proceedings of the CACSD Conference, Taipei, China."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/9\/1538\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:45:36Z","timestamp":1760035536000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/9\/1538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,15]]},"references-count":56,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2025,9]]}},"alternative-id":["sym17091538"],"URL":"https:\/\/doi.org\/10.3390\/sym17091538","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,15]]}}}