.png){kind=icon}
.png){kind=icon}
Return
An enhanced binary slime mould algorithm for solving the 0-1 knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s00366-021-01470-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
0-1 knapsack problem
Slime mould algorithm
Transfer function
Penalty function
Repair algorithm
Gaussian mutation operator
Bitwise operations
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.9
Papers:
2.6K
Citations:
9.3K
View more organizations