{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:42:08Z","timestamp":1784180528376,"version":"3.55.0"},"reference-count":36,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100005911","name":"Najran University","doi-asserted-by":"publisher","award":["NU\/-\/SERC\/10\/639"],"award-info":[{"award-number":["NU\/-\/SERC\/10\/639"]}],"id":[{"id":"10.13039\/501100005911","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The discounted {0-1} knapsack problem (D{0-1}KP) is a multi-constrained optimization and an extended form of the 0-1 knapsack problem. The DKP is composed of a set of item batches where each batch has three items and the objective is to maximize profit by selecting at most one item from each batch. Therefore, the D{0-1}KP is complex and has found many applications in real economic problems and other areas where the concept of promotional discounts exists. As DKP belongs to a binary class problem, so the novel binary particle swarm optimization variant with modifications is proposed in this paper. The acceleration coefficients are important parameters of the particle swarm optimization algorithm that keep the balance between exploration and exploitation. In conventional binary particle swarm optimization (BPSO), the acceleration coefficients of each particle remain the same in iteration, whereas in the proposed variant, fitness-based acceleration coefficient binary particle swarm optimization (FACBPSO), values of acceleration coefficients are based on the fitness of each particle. This modification enforces the least fit particles to move fast and best fit accordingly, which accelerates the convergence speed and reduces the computing time. Experiments were conducted on four instances of DKP having 10 datasets of each instance and the results of FACBPSO were compared with conventional BPSO and the new exact algorithm using a greedy repair strategy. The results demonstrate that the proposed algorithm outperforms PSO-GRDKP and the new exact algorithm in solving four instances of D{0-1}KP, with improved convergence speed and feasible solution time.<\/jats:p>","DOI":"10.3390\/sym14061208","type":"journal-article","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T06:31:59Z","timestamp":1655101919000},"page":"1208","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Fitness-Based Acceleration Coefficients Binary Particle Swarm Optimization (FACBPSO) to Solve the Discounted Knapsack Problem"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8539-7024","authenticated-orcid":false,"given":"Adel","family":"Sulaiman","sequence":"first","affiliation":[{"name":"College of Computer Science and Information Systems, Najran University, Najran 61441, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marium","family":"Sadiq","sequence":"additional","affiliation":[{"name":"Department of Computer Science & Information Technology, Mirpur University of Science & Technology (MUST), Mirpur 10250, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3074-8944","authenticated-orcid":false,"given":"Yasir","family":"Mehmood","sequence":"additional","affiliation":[{"name":"Department of Computer Science & Information Technology, Mirpur University of Science & Technology (MUST), Mirpur 10250, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2191-3461","authenticated-orcid":false,"given":"Muhammad","family":"Akram","sequence":"additional","affiliation":[{"name":"College of Computer Science and Information Systems, Najran University, Najran 61441, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7540-2336","authenticated-orcid":false,"given":"Ghassan Ahmed","family":"Ali","sequence":"additional","affiliation":[{"name":"College of Computer Science and Information Systems, Najran University, Najran 61441, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s43674-021-00010-y","article-title":"An improved group theory-based optimization algorithm for discounted 0-1 knapsack problem","volume":"1","author":"Wang","year":"2021","journal-title":"Adv. Comput. Intell."},{"key":"ref_2","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_3","first-page":"48","article-title":"The knapsack problem and its applications to the cargo loading problem","volume":"13","author":"Cho","year":"2019","journal-title":"Anal. Appl. Math."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"M\u00fcller, S., Al-Shatri, H., Wichtlhuber, M., Hausheer, D., and Klein, A. (September, January 30). Computation offloading in wireless multi-hop networks: Energy minimization via multi-dimensional knapsack problem. Proceedings of the 2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), Hong Kong, China.","DOI":"10.1109\/PIMRC.2015.7343576"},{"key":"ref_5","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_6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10479-013-1312-9","article-title":"Resource capacity allocation to stochastic dynamic competitors: Knapsack problem for perishable items and index-knapsack heuristic","volume":"241","author":"Jacko","year":"2016","journal-title":"Ann. Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.isatra.2017.03.008","article-title":"Admissibility and robust stabilization of continuous linear singular fractional order systems with the fractional order \u03b1: The 0 <\u03b1<1 case","volume":"82","author":"Zhang","year":"2018","journal-title":"ISA Trans."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.9734\/ajrcos\/2019\/v3i230087","article-title":"Meta-heuristics approach to knapsack problem in memory management","volume":"3","author":"Oppong","year":"2019","journal-title":"Asian J. Res. Comput. Sci."},{"key":"ref_9","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_10","doi-asserted-by":"crossref","first-page":"5175","DOI":"10.1109\/TAC.2019.2910738","article-title":"Low-complexity tracking control of strict-feedback systems with unknown control directions","volume":"64","author":"Zhang","year":"2019","journal-title":"IEEE Trans. Autom. Control"},{"key":"ref_11","first-page":"157","article-title":"Solving the knapsack problem for adaptive multimedia systems","volume":"2","author":"Khan","year":"2002","journal-title":"Stud. Inform. Univ."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Chan, H., Tran-Thanh, L., Wilder, B., Rice, E., Vayanos, P., and Tambe, M. (2018, January 1\u20133). Utilizing housing resources for homeless youth through the lens of multiple multi-dimensional knapsacks. Proceedings of the 2018 AAAI\/ACM Conference on AI, Ethics, and Society, New Orleans, LA, USA.","DOI":"10.1145\/3278721.3278757"},{"key":"ref_13","first-page":"1","article-title":"A Least-Loss Algorithm for a Bi-Objective One-Dimensional Cutting-Stock Problem","volume":"6","author":"Alfares","year":"2019","journal-title":"Int. J. Appl. Ind. Eng. (IJAIE)"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Du, Y., and Xu, F. (2020). A hybrid multi-step probability selection particle swarm optimization with dynamic chaotic inertial weight and acceleration coefficients for numerical function optimization. Symmetry, 12.","DOI":"10.3390\/sym12060922"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1109\/TEVC.2021.3080683","article-title":"Set Theory Based Operator Design in Evolutionary Algorithms for Solving Knapsack Problems","volume":"25","author":"Wang","year":"2021","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Kellerer, H., Pferschy, U., and Pisinger, D. (2004). Multidimensional knapsack problems. Knapsack Problems, Springer.","DOI":"10.1007\/978-3-540-24777-7"},{"key":"ref_17","unstructured":"Guldan, B. (2007). Heuristic and Exact Algorithms for Discounted Knapsack Problems. [Master\u2019s Thesis, University of Erlangen-N\u00fcrnberg]."},{"key":"ref_18","first-page":"6921","article-title":"Dynamic programming based algorithms for the discounted {0\u20131} knapsack problem","volume":"218","author":"Rong","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Sara\u00e7, T., and Sipahioglu, A. (2007). A genetic algorithm for the quadratic multiple knapsack problem. International Symposium on Brain, Vision, and Artificial Intelligence, Springer.","DOI":"10.1007\/978-3-540-75555-5_47"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10878-014-9717-1","article-title":"Algorithms for randomized time-varying knapsack problems","volume":"31","author":"He","year":"2016","journal-title":"J. Comb. Optim."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ins.2011.07.033","article-title":"Fusing ant colony optimization with Lagrangian relaxation for the multiple-choice multidimensional knapsack problem","volume":"182","author":"Ren","year":"2012","journal-title":"Inf. Sci."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"3350","DOI":"10.1007\/s10489-020-01722-3","article-title":"A novel discrete whale optimization algorithm for solving knapsack problems","volume":"50","author":"Li","year":"2020","journal-title":"Appl. Intell."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Wilbaut, C., Todosijevic, R., Hanafi, S., and Fr\u00e9ville, A. (2021). Heuristic and exact fixation-based approaches for the discounted 0-1 knapsack problem. arXiv.","DOI":"10.2139\/ssrn.4062902"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1872","DOI":"10.1007\/s10489-020-01652-0","article-title":"Solving discounted {0-1} knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm","volume":"50","author":"Wu","year":"2020","journal-title":"Appl. Intell."},{"key":"ref_25","first-page":"91","article-title":"An accelerated convergent particle swarm optimizer (ACPSO) of multimodal functions","volume":"25","author":"Mehmood","year":"2019","journal-title":"Intell. Autom. Soft Comput."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.ins.2016.07.037","article-title":"Exact and approximate algorithms for discounted {0-1} knapsack problem","volume":"369","author":"He","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"10708","DOI":"10.1109\/ACCESS.2018.2809445","article-title":"Binary moth search algorithm for discounted {0-1} knapsack problem","volume":"6","author":"Feng","year":"2018","journal-title":"IEEE Access"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.future.2021.07.033","article-title":"A binary moth search algorithm based on self-learning for multidimensional knapsack problems","volume":"126","author":"Feng","year":"2022","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"3019","DOI":"10.1007\/s00521-017-2903-1","article-title":"Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem","volume":"30","author":"Feng","year":"2018","journal-title":"Neural Comput. Appl."},{"key":"ref_30","first-page":"656","article-title":"New simplified model of discounted {0-1} knapsack problem and solution by genetic algorithm","volume":"39","author":"Yang","year":"2019","journal-title":"J. Comput. Appl."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1504\/IJBIC.2017.087924","article-title":"Discrete differential evolutions for the discounted {0-1} knapsack problem","volume":"10","author":"Zhu","year":"2017","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Zhou, H., and Wei, X. (2021). Particle swarm optimization based on a novel evaluation of diversity. Algorithms, 14.","DOI":"10.3390\/a14020029"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"G\u00f3mez-Montoya, R.A., Cano, J.A., Cort\u00e9s, P., and Salazar, F. (2020). A discrete particle swarm optimization to solve the put-away routing problem in distribution centres. Computation, 8.","DOI":"10.3390\/computation8040099"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Mehmood, Y., Sadiq, M., Shahzad, W., and Amin, F. (2018, January 17\u201319). Fitness-based acceleration coefficients to enhance the convergence speed of novel binary particle swarm optimization. Proceedings of the 2018 International Conference on Frontiers of Information Technology (FIT), Islamabad, Pakistan.","DOI":"10.1109\/FIT.2018.00069"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"541","DOI":"10.3390\/smartcities3020029","article-title":"A particle swarm optimization algorithm for the solution of the transit network design problem","volume":"3","author":"Cipriani","year":"2020","journal-title":"Smart Cities"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Kiani, A.T., Nadeem, M.F., Ahmed, A., Khan, I.A., Alkhammash, H.I., and Sajjad, I.A. (2021). An Improved Particle Swarm Optimization with Chaotic Inertia Weight and Acceleration Coefficients for Optimal Extraction of PV Models Parameters. Energies, 14.","DOI":"10.3390\/en14112980"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/6\/1208\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:27:58Z","timestamp":1760138878000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/6\/1208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":36,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2022,6]]}},"alternative-id":["sym14061208"],"URL":"https:\/\/doi.org\/10.3390\/sym14061208","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,10]]}}}