An enhanced binary slime mould algorithm for solving the 0-1 knapsack problem

Abdollahzadeh B., Barshandeh S., Javadi H., Epicoco N.

ENGINEERING WITH COMPUTERS, cilt.38, sa.SUPPL 4, ss.3423-3444, 2022 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 38 Sayı: SUPPL 4
  • Basım Tarihi: 2022
  • Doi Numarası: 10.1007/s00366-021-01470-z
  • Dergi Adı: ENGINEERING WITH COMPUTERS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Aerospace Database, Applied Science & Technology Source, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.3423-3444
  • Anahtar Kelimeler: 0-1 knapsack problem, Slime mould algorithm, Transfer function, Penalty function, Repair algorithm, Gaussian mutation operator, Bitwise operations, PARTICLE SWARM OPTIMIZATION, TRAVELING SALESMAN PROBLEM, BRANCH
  • Hacettepe Üniversitesi Adresli: Evet

Özet

The slime mould algorithm (SMA) has recently been introduced to solve continuous engineering problems, which has been employed to solve a wide range of various problems due to its good performance. This paper presents an enhanced binary SMA for solving the 0-1 knapsack problem at different scales. In the presented binary SMA, eight different transfer functions have been used and evaluated. The transfer function, which has performed better than others, has been proposed for the subsequent experiments. The Bitwise and Gaussian mutation operators are used to enhance the performance of the proposed binary SMA. Furthermore, a penalty function and a repair algorithm are used to handle infeasible solutions. The proposed method's performance was evaluated statistically on 63 standard datasets with different scales. The obtained results from the proposed method were compared with ten state-of-the-art methods. The results indicated the superiority of the proposed methods.