{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T05:42:15Z","timestamp":1781329335986,"version":"3.54.1"},"reference-count":42,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T00:00:00Z","timestamp":1729814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Nature Science Foundation of Fujian Province of China","award":["2023J01078"],"award-info":[{"award-number":["2023J01078"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The list-based threshold accepting (LBTA) algorithm is a sophisticated local search method that utilizes a threshold list to streamline the parameter tuning process in the traditional threshold accepting (TA) algorithm. This paper proposes an enhanced local search version of the LBTA algorithm specifically tailored for solving the 0\u20131 knapsack problem (0\u20131 KP). To maintain a dynamic threshold list, a feasible threshold updating strategy is designed to accept adaptive modifications during the search process. In addition, the algorithm incorporates an improved bit-flip operator designed to generate a neighboring solution with a controlled level of disturbance, thereby fostering exploration within the solution space. Each trial solution produced by this operator undergoes a repair phase using a hybrid greedy repair operator that incorporates both density-based and value-based add operator to facilitate optimization. The LBTA algorithm\u2019s performance was evaluated against several state-of-the-art metaheuristic approaches on a series of large-scale instances. The simulation results demonstrate that the LBTA algorithm outperforms or is competitive with other leading metaheuristics in the field.<\/jats:p>","DOI":"10.3390\/a17110478","type":"journal-article","created":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T07:51:29Z","timestamp":1729842689000},"page":"478","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["List-Based Threshold Accepting Algorithm with Improved Neighbor Operator for 0\u20131 Knapsack Problem"],"prefix":"10.3390","volume":"17","author":[{"given":"Liangcheng","family":"Wu","sequence":"first","affiliation":[{"name":"College of Computer and Information Science, Fujian Agriculture and Forestry University, Fuzhou 350002, China"},{"name":"Key Laboratory of Smart Agriculture and Forestry, Fujian Province University, Fuzhou 350002, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, Fujian Agriculture and Forestry University, Fuzhou 350002, China"},{"name":"Key Laboratory of Smart Agriculture and Forestry, Fujian Province University, Fuzhou 350002, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoyu","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, Fujian Agriculture and Forestry University, Fuzhou 350002, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, Fujian Agriculture and Forestry University, Fuzhou 350002, China"},{"name":"Key Laboratory of Smart Agriculture and Forestry, Fujian Province University, Fuzhou 350002, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2024,10,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0925-5273(01)00231-6","article-title":"A list-based threshold accepting method for job shop scheduling problems","volume":"77","author":"Tarantilis","year":"2002","journal-title":"Int. J. Prod. Econ."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","article-title":"Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing","volume":"90","author":"Dueck","year":"1990","journal-title":"J. Comput. Phys."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1057\/palgrave.jors.2601848","article-title":"Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm","volume":"56","author":"Tarantilis","year":"2005","journal-title":"J. Oper. Res. Soc."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2199","DOI":"10.1016\/S0305-0548(03)00172-2","article-title":"A novel threshold accepting meta-heuristic for the job-shop scheduling problem","volume":"31","author":"Lee","year":"2004","journal-title":"Comput. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"6579","DOI":"10.1021\/ie010570n","article-title":"List-based threshold-accepting algorithm for zero-wait scheduling of multiproduct batch plants","volume":"41","author":"Lee","year":"2002","journal-title":"Ind. Eng. Chem. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"7627","DOI":"10.1007\/s00521-021-06883-x","article-title":"A list-based simulated annealing algorithm with crossover operator for the traveling salesman problem","volume":"34","author":"Ilhan","year":"2022","journal-title":"Neural Comput. Appl."},{"key":"ref_7","unstructured":"Cho, M. (2019). The knapsack problem and its applications to the cargo loading problem. Anal. Appl. Math., 48."},{"key":"ref_8","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. J."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","article-title":"A genetic algorithm for the multidimensional knapsack problem","volume":"4","author":"Chu","year":"1998","journal-title":"J. Heurist."},{"key":"ref_10","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_11","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","article-title":"Dynamic programming and strong bounds for the 0-1 knapsack problem","volume":"45","author":"Martello","year":"1999","journal-title":"Manag. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1287\/mnsc.13.9.723","article-title":"A branch and bound algorithm for the knapsack problem","volume":"13","author":"Kolesar","year":"1967","journal-title":"Manag. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1287\/opre.18.2.306","article-title":"An enumeration algorithm for knapsack problems","volume":"18","author":"Cabot","year":"1970","journal-title":"Oper. Res."},{"key":"ref_14","unstructured":"Fister, I., Yang, X.S., Fister, I., Brest, J., and Fister, D. (2013). A brief review of nature-inspired algorithms for optimization. arXiv."},{"key":"ref_15","first-page":"150","article-title":"An Enhanced Genetic Algorithm to Solve 0\/1 Knapsack Problem","volume":"15","author":"Yadav","year":"2017","journal-title":"Int. J. Comput. Sci. Inf. Secur. (IJCSIS)"},{"key":"ref_16","first-page":"9","article-title":"Ant Colony System Algorithm with Dynamic Pheromone Updating for 0\/1 Knapsack Problem","volume":"11","author":"Alzaqebah","year":"2019","journal-title":"Int. J. Intell. Syst. Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"411","DOI":"10.11591\/ijeecs.v1.i3.pp411-418","article-title":"A new hybrid particle swarm optimization and greedy for 0\u20131 knapsack problem","volume":"1","author":"Nguyen","year":"2016","journal-title":"Indones. Electr. Eng. Comput. Sci."},{"key":"ref_18","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":"2015","journal-title":"Neural Comput. Appl."},{"key":"ref_19","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":"2016","journal-title":"Memetic Comput."},{"key":"ref_20","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_21","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_22","doi-asserted-by":"crossref","unstructured":"Ali, I.M., Essam, D., and Kasmarik, K. (2018, January 8\u201313). An efficient differential evolution algorithm for solving 0\u20131 knapsack problems. Proceedings of the 2018 IEEE Congress on Evolutionary Computation (CEC), Rio de Janeiro, Brazil.","DOI":"10.1109\/CEC.2018.8477916"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2179","DOI":"10.3233\/IFS-141500","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_24","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_25","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_26","first-page":"1567","article-title":"An improved harmony search algorithm for solving optimization problems","volume":"188","author":"Mahdavi","year":"2007","journal-title":"Appl. Math. Comput."},{"key":"ref_27","first-page":"643","article-title":"Global-best harmony search","volume":"198","author":"Omran","year":"2008","journal-title":"Appl. Math. Comput."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"2826","DOI":"10.1016\/j.eswa.2009.09.008","article-title":"Self-adaptive harmony search algorithm for optimization","volume":"37","author":"Wang","year":"2010","journal-title":"Expert Syst. Appl."},{"key":"ref_29","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_30","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\u20131 knapsack problem","volume":"12","author":"Zhan","year":"2019","journal-title":"Memetic Comput."},{"key":"ref_31","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\u20131 knapsack problems","volume":"178","author":"Ervural","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"107469","DOI":"10.1016\/j.cie.2021.107469","article-title":"BSMA: A novel metaheuristic algorithm for multi-dimensional knapsack problems: Method and comprehensive analysis","volume":"159","author":"Mohamed","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"103541","DOI":"10.1016\/j.engappai.2020.103541","article-title":"Tunicate Swarm Algorithm: A new bio-inspired based metaheuristic paradigm for global optimization","volume":"90","author":"Kaur","year":"2020","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","article-title":"Harris hawks optimization: Algorithm and applications","volume":"97","author":"Heidari","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"106946","DOI":"10.1016\/j.cie.2020.106946","article-title":"A binary equilibrium optimization algorithm for 0\u20131 knapsack problems","volume":"151","author":"Mohamed","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"16971","DOI":"10.1007\/s00521-020-04917-4","article-title":"BinEHO: A new binary variant based on elephant herding optimization algorithm","volume":"32","author":"Hakli","year":"2020","journal-title":"Neural Comput. Appl."},{"key":"ref_37","first-page":"87","article-title":"Hybrid greedy Genetic Algorithm for solving 0-1 knapsack problem","volume":"41","author":"Chen","year":"2021","journal-title":"J. Comput. Appl."},{"key":"ref_38","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."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"106949","DOI":"10.1016\/j.cie.2020.106949","article-title":"New binary marine predators optimization algorithms for 0\u20131 knapsack problems","volume":"151","author":"Mohamed","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"1531","DOI":"10.1007\/s10489-020-01893-z","article-title":"Archimedes optimization algorithm: A new metaheuristic algorithm for solving optimization problems","volume":"51","author":"Hashim","year":"2021","journal-title":"Appl. Intell."},{"key":"ref_41","unstructured":"Pisinger, D. (2024, October 17). Instances of 0\/1 Knapsack Problem. Available online: https:\/\/github.com\/likr\/kplib."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"43979","DOI":"10.1109\/ACCESS.2019.2908489","article-title":"A comparative study of meta-heuristic optimization algorithms for 0\u20131 knapsack problem: Some initial results","volume":"7","author":"Ezugwu","year":"2019","journal-title":"IEEE Access"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/11\/478\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T16:20:24Z","timestamp":1760113224000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/11\/478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,25]]},"references-count":42,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2024,11]]}},"alternative-id":["a17110478"],"URL":"https:\/\/doi.org\/10.3390\/a17110478","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,25]]}}}