{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:17:33Z","timestamp":1760059053751,"version":"build-2065373602"},"reference-count":62,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Nature Science Foundation of Fujian Province of P. R. China","award":["2023J01078","KFB23192"],"award-info":[{"award-number":["2023J01078","KFB23192"]}]},{"name":"Special Fund for Scientific and Technological Innovation of Fujian Agriculture and Forestry University of P. R. China","award":["2023J01078","KFB23192"],"award-info":[{"award-number":["2023J01078","KFB23192"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The harmony search (HS) algorithm is a novel metaheuristic which has been widely used to solve both continuous and discrete optimization problems. In order to improve the performance and simplify the implementation of the HS algorithm for solving the 0-1 knapsack problem (0-1KP), this paper proposes a heuristics-guided simplified discrete harmony search (SDHS) algorithm which does not use random search operator and has only one intrinsic parameter, harmony memory size. The SDHS algorithm uses a memory consideration operator to construct a feasible solution, and then the constructed solution is further enhanced by a solution-level pitch adjustment operator. Two heuristics, the profit\u2013weight ratio of an item and the profit of an item, are used to greedily guide the memory consideration operator and the solution-level pitch adjustment operator, respectively. In the memory consideration operator, items are considered in non-ascending order of profit\u2013weight ratio assigned from the harmony memory. In the solution-level pitch adjustment operator, items not in the knapsack are attempted to be selected in non-ascending order of profit. The SDHS algorithm outperforms several state-of-the-art algorithms, with an average improvement of 0.55% in the quality of solutions on large problem instances.<\/jats:p>","DOI":"10.3390\/a18050295","type":"journal-article","created":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:54:26Z","timestamp":1747655666000},"page":"295","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Heuristics-Guided Simplified Discrete Harmony Search Algorithm for Solving 0-1 Knapsack Problem"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-2622-5712","authenticated-orcid":false,"given":"Fuyuan","family":"Zheng","sequence":"first","affiliation":[{"name":"College of Computer and Information Sciences, Fujian Agriculture and Forestry University, Fuzhou 350002, China"},{"name":"Key Laboratory of Smart Agriculture and Forestry, Fujian Province University, Fuzhou 350002, China"}]},{"given":"Kanglong","family":"Cheng","sequence":"additional","affiliation":[{"name":"College of Computer and Information Sciences, Fujian Agriculture and Forestry University, Fuzhou 350002, China"},{"name":"Key Laboratory of Smart Agriculture and Forestry, Fujian Province University, Fuzhou 350002, China"}]},{"given":"Kai","family":"Yang","sequence":"additional","affiliation":[{"name":"College of Computer and Information Sciences, Fujian Agriculture and Forestry University, Fuzhou 350002, China"},{"name":"Key Laboratory of Smart Agriculture and Forestry, Fujian Province University, Fuzhou 350002, China"}]},{"given":"Ning","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer and Information Sciences, Fujian Agriculture and Forestry University, Fuzhou 350002, China"},{"name":"Key Laboratory of Smart Agriculture and Forestry, Fujian Province University, Fuzhou 350002, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1963-4321","authenticated-orcid":false,"given":"Yu","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Computer and Information Sciences, Fujian Agriculture and Forestry University, Fuzhou 350002, China"},{"name":"Key Laboratory of Smart Agriculture and Forestry, Fujian Province University, Fuzhou 350002, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9132-913X","authenticated-orcid":false,"given":"Yiwen","family":"Zhong","sequence":"additional","affiliation":[{"name":"College of Computer and Information Sciences, Fujian Agriculture and Forestry University, Fuzhou 350002, China"},{"name":"Key Laboratory of Smart Agriculture and Forestry, Fujian Province University, Fuzhou 350002, China"}]}],"member":"1968","published-online":{"date-parts":[[2025,5,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1111\/mice.12246","article-title":"Real estate property maintenance optimization based on multiobjective multidimensional knapsack problem","volume":"32","author":"Taillandier","year":"2017","journal-title":"Comput.-Aided Civ. Infrastruct. Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1553","DOI":"10.1007\/s11590-017-1209-7","article-title":"Easy knapsacks and the complexity of energy allocation problems in the smart grid","volume":"12","author":"Karaboghossian","year":"2018","journal-title":"Optim. Lett."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/j.ejor.2018.07.013","article-title":"The air cargo load planning problem\u2014A consolidated problem definition and literature review on related problems","volume":"275","author":"Brandt","year":"2019","journal-title":"Eur. J. Oper. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"59388","DOI":"10.1109\/ACCESS.2019.2913678","article-title":"An improved attack on the basic Merkle\u2013Hellman Knapsack cryptosystem","volume":"7","author":"Liu","year":"2019","journal-title":"IEEE Access"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1016\/j.cie.2011.06.011","article-title":"A constrained binary knapsack approximation for shortest path network interdiction","volume":"61","author":"Yates","year":"2011","journal-title":"Comput. Ind. Eng."},{"key":"ref_6","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_7","first-page":"1","article-title":"Evolutionary Algorithms for Knapsack Problems","volume":"28","author":"Wang","year":"2017","journal-title":"J. Softw."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1504\/IJBIC.2012.048063","article-title":"Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm","volume":"4","author":"Gherboudj","year":"2012","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1080\/18756891.2016.1256577","article-title":"A novel hybrid cuckoo search algorithm with global harmony search for 0-1 knapsack problems","volume":"9","author":"Feng","year":"2016","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/s10489-016-0822-y","article-title":"Modified swarm intelligence based techniques for the knapsack problem","volume":"46","author":"Bhattacharjee","year":"2017","journal-title":"Appl. Intell."},{"key":"ref_11","first-page":"2039","article-title":"A Novel Binary Social Spider Algorithm for 0-1 Knapsack Problem","volume":"13","author":"Nguyen","year":"2017","journal-title":"Int. J. Innov. Comput. Inf. Control"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s13042-014-0272-y","article-title":"Solving 0-1 knapsack problem using cohort intelligence algorithm","volume":"7","author":"Kulkarni","year":"2016","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/j.asoc.2015.10.043","article-title":"An improved monkey algorithm for a 0-1 knapsack problem","volume":"38","author":"Zhou","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"ref_14","first-page":"1660","article-title":"A binary wolf pack algorithm for solving 0-1 knapsack problem","volume":"36","author":"Wu","year":"2014","journal-title":"Syst. Eng. Electron."},{"key":"ref_15","first-page":"11","article-title":"Grey Wolf Optimization Applied to the 0\/1 Knapsack Problem","volume":"169","author":"Yassien","year":"2017","journal-title":"Int. J. Comput. Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"5327056","DOI":"10.1155\/2018\/5327056","article-title":"Quantum-Inspired Wolf Pack Algorithm to Solve the 0-1 Knapsack Problem","volume":"2018","author":"Gao","year":"2018","journal-title":"Math. Probl. Eng."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Erdo\u011fan, F., Karakoyun, M., and G\u00fclc\u00fc, \u015e. (2024). An effective binary dynamic grey wolf optimization algorithm for the 0-1 knapsack problem. Multimed. Tools Appl.","DOI":"10.1007\/s11042-024-20121-1"},{"key":"ref_18","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_19","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s40747-017-0050-z","article-title":"New binary bat algorithm for solving 0-1 knapsack problem","volume":"4","author":"Hassanien","year":"2018","journal-title":"Complex Intell. Syst."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1504\/IJBIC.2011.043624","article-title":"Wisdom of artificial crowds algorithm for solving NP-hard problems","volume":"3","author":"Yampolskiy","year":"2011","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1504\/IJBIC.2018.093334","article-title":"Hybrid symbiotic organisms search algorithm for solving 0-1 knapsack problem","volume":"12","author":"Wu","year":"2018","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1504\/IJBIC.2018.090080","article-title":"An elite opposition-flower pollination algorithm for a 0-1 knapsack problem","volume":"11","author":"Zhou","year":"2018","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1016\/j.asoc.2012.11.048","article-title":"Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem","volume":"13","author":"Truong","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"ref_24","first-page":"2179","article-title":"Solving 0-1 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy","volume":"28","author":"Truong","year":"2015","journal-title":"J. Intell. Fuzzy Syst."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Zhao, J., Huang, T., Pang, F., and Liu, Y. (2009, January 14\u201316). Genetic Algorithm Based on Greedy Strategy in the 0-1 Knapsack Problem. Proceedings of the Third International Conference on Genetic and Evolutionary Computing, Guilin, China.","DOI":"10.1109\/WGEC.2009.43"},{"key":"ref_26","first-page":"34","article-title":"0\/1 knapsack problem using diversity based dual population genetic algorithm","volume":"6","author":"Umbarkar","year":"2014","journal-title":"Int. J. Intell. Syst. Appl."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1007\/s00521-015-2135-1","article-title":"Solving 0-1 knapsack problem by a novel binary monarch butterfly optimization","volume":"28","author":"Feng","year":"2017","journal-title":"Neural Comput. Appl."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/j.compeleceng.2017.12.014","article-title":"Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0-1 knapsack problem","volume":"67","author":"Feng","year":"2018","journal-title":"Comput. Electr. Eng."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s12293-016-0211-4","article-title":"Solving 0-1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation","volume":"10","author":"Feng","year":"2018","journal-title":"Memetic Comput."},{"key":"ref_30","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_31","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s13042-017-0731-3","article-title":"A modified nature inspired meta-heuristic whale optimization algorithm for solving 0-1 knapsack problem","volume":"10","author":"Sangaiah","year":"2019","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"ref_32","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 0\/1 knapsack problem","volume":"19","author":"Bhattacharjee","year":"2014","journal-title":"Appl. Soft Comput."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"148155","DOI":"10.1109\/ACCESS.2024.3424415","article-title":"An improved Shuffled frog-leaping algorithm to solving 0-1 knapsack problem","volume":"12","author":"Zhang","year":"2024","journal-title":"IEEE Access"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"3423","DOI":"10.1007\/s00366-021-01470-z","article-title":"An enhanced binary slime mould algorithm for solving the 0-1 knapsack problem","volume":"38","author":"Abdollahzadeh","year":"2022","journal-title":"Eng. Comput."},{"key":"ref_35","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_36","doi-asserted-by":"crossref","first-page":"102093","DOI":"10.1016\/j.jksuci.2024.102093","article-title":"Binary metaheuristic algorithms for 0-1 knapsack problems: Performance analysis, hybrid variants, and real-world application","volume":"36","author":"Mohamed","year":"2024","journal-title":"J. King Saud Univ. Comput. Inf. Sci."},{"key":"ref_37","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_38","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/j.aej.2023.09.072","article-title":"A novel binary Kepler optimization algorithm for 0-1 knapsack problems: Methods and applications","volume":"82","author":"Mohamed","year":"2023","journal-title":"Alex. Eng. J."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1556","DOI":"10.1016\/j.asoc.2010.07.019","article-title":"Solving 0-1 knapsack problem by a novel global harmony search algorithm","volume":"11","author":"Zou","year":"2011","journal-title":"Appl. Soft Comput."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.cam.2013.04.004","article-title":"A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems","volume":"253","author":"Layeb","year":"2013","journal-title":"J. Comput. Appl. Math."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.ins.2012.12.043","article-title":"An improved adaptive binary Harmony Search algorithm","volume":"232","author":"Wang","year":"2013","journal-title":"Inf. Sci."},{"key":"ref_42","first-page":"1174","article-title":"A binary modified harmony search algorithm for 0-1 knapsack problem","volume":"29","author":"Ouyang","year":"2014","journal-title":"Control Decis."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"637412","DOI":"10.1155\/2014\/637412","article-title":"A novel harmony search algorithm based on teaching-learning strategies for 0-1 knapsack problems","volume":"2014","author":"Tuo","year":"2014","journal-title":"Sci. World J."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"573731","DOI":"10.1155\/2014\/573731","article-title":"A novel discrete global-best harmony search algorithm for solving 0-1 knapsack problems","volume":"2014","author":"Xiang","year":"2014","journal-title":"Discret. Dyn. Nat. Soc."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"5337","DOI":"10.1016\/j.eswa.2015.02.015","article-title":"A simplified binary harmony search algorithm for large scale 0-1 knapsack problems","volume":"42","author":"Kong","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_46","first-page":"8440165","article-title":"A Hybrid Harmony Search Algorithm with Distribution Estimation for Solving the 0-1 Knapsack Problem","volume":"2022","author":"Liu","year":"2022","journal-title":"Math. Probl. Eng."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"54447","DOI":"10.1109\/ACCESS.2018.2872533","article-title":"List-Based Simulated Annealing Algorithm With Hybrid Greedy Repair and Optimization Operator for 0-1 Knapsack Problem","volume":"6","author":"Zhan","year":"2018","journal-title":"IEEE Access"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s12293-019-00288-z","article-title":"Noising methods with hybrid greedy repair operator for 0-1 knapsack problem","volume":"12","author":"Zhan","year":"2020","journal-title":"Memetic Comput."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Wu, L., Lin, K., Lin, X., and Lin, J. (2024). List-based threshold accepting algorithm with improved neighbor operator for 0-1 knapsack problem. Algorithms, 17.","DOI":"10.3390\/a17110478"},{"key":"ref_50","first-page":"970456","article-title":"An improved hybrid encoding cuckoo search algorithm for 0-1 knapsack problems","volume":"2014","author":"Feng","year":"2014","journal-title":"Comput. Intell. Neurosci."},{"key":"ref_51","first-page":"857254","article-title":"An effective hybrid cuckoo search algorithm with improved shuffled frog leaping algorithm for 0-1 knapsack problems","volume":"2014","author":"Feng","year":"2014","journal-title":"Comput. Intell. Neurosci."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","article-title":"A New Heuristic Optimization Algorithm: Harmony Search","volume":"76","author":"Geem","year":"2001","journal-title":"Simulation"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.swevo.2019.03.012","article-title":"Review of harmony search with respect to algorithm structure","volume":"48","author":"Zhang","year":"2019","journal-title":"Swarm Evol. Comput."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"10225","DOI":"10.1007\/s00500-018-3579-x","article-title":"Improved harmony search with general iteration models for engineering design optimization problems","volume":"23","author":"Ouyang","year":"2019","journal-title":"Soft Comput."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1080\/0952813X.2018.1550814","article-title":"Harmony search algorithm for energy system applications: An updated review and analysis","volume":"31","author":"Nazariheris","year":"2019","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.knosys.2019.01.004","article-title":"An on-line variable-fidelity surrogate-assisted harmony search algorithm with mul-ti-level screening strategy for expensive engineering design optimization","volume":"170","author":"Yi","year":"2019","journal-title":"Knowl. Based Syst."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1007\/s12065-020-00419-3","article-title":"Harmony search algorithm for simultaneous minimization of bi-objectives in multi-row parallel machine layout problem","volume":"14","author":"Lenin","year":"2021","journal-title":"Evol. Intell."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"3182","DOI":"10.1080\/00207543.2021.1912432","article-title":"A sequence learning harmony search algorithm for the flexible process planning problem","volume":"60","author":"Luo","year":"2022","journal-title":"Int. J. Prod. Res."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.jmsy.2020.11.014","article-title":"Hybrid algorithm of harmony search for dynamic parallel row ordering problem","volume":"58","author":"Gong","year":"2021","journal-title":"J. Manuf. Syst."},{"key":"ref_60","first-page":"3881","article-title":"Parameter-setting-free harmony search algorithm","volume":"217","author":"Geem","year":"2010","journal-title":"Appl. Math. Comput."},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/j.ins.2019.01.019","article-title":"Enhanced self-adaptive global-best harmony search without any extra statistic and external archive","volume":"482","author":"Luo","year":"2019","journal-title":"Inf. Sci."},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","article-title":"Where are the hard knapsack problems?","volume":"32","author":"Pisinger","year":"2005","journal-title":"Comput. Oper. Res."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/5\/295\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:35:21Z","timestamp":1760031321000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/5\/295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,19]]},"references-count":62,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2025,5]]}},"alternative-id":["a18050295"],"URL":"https:\/\/doi.org\/10.3390\/a18050295","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2025,5,19]]}}}