1. Nature-inspired algorithms for 0-1 knapsack problem: A survey.
- Author
-
Zhou, Yongquan, Shi, Yan, Wei, Yuanfei, Luo, Qifang, and Tang, Zhonghua
- Subjects
- *
KNAPSACK problems , *METAHEURISTIC algorithms , *ALGORITHMS , *BACKPACKS , *COMBINATORIAL optimization - Abstract
• The 0-1 knapsack problem (KP01) is one of the classic variants of knapsack problems in which the aim is to select the items with the total profit to be in the knapsack. • In this paper, a comprehensive survey on the recent advances in 0-1 knapsack problem is presented. • Literature survey reveals some interesting challenges and future research directions. 0-1 knapsack problem (KP01) is one of the classic variants of knapsack problems in which the aim is to select the items with the total profit to be in the knapsack. In contrast, the constraint of the maximum capacity of the knapsack is satisfied. KP01 has many applications in real-world complex problems such as resource distribution, portfolio optimization, etc. This study reviews the basic theory and main algorithms of 0-1 knapsack, proposes many different types of nature-inspired metaheuristic algorithms, and divides existing 0-1 knapsack problems into 6 types according to the different coding methods of the algorithms, for a comprehensive overview of it. In this paper, a comprehensive survey on the recent advances in 0-1 knapsack problem is presented. Literature survey reveals some interesting challenges and future research directions. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF