Nature-inspired algorithms for 0-1 knapsack problem: A survey

被引：2
|
作者：
Zhou, Yongquan [1 ,3 ,4 ,5 ]
Shi, Yan [2 ,5 ]
Wei, Yuanfei [1 ,3 ]
Luo, Qifang [4 ,5 ]
Tang, Zhonghua [4 ]
机构：
[1] Guangxi Univ Nationalities, Xiangsihu Coll, Nanning 530225, Peoples R China
[2] Guangxi Univ Nationalities, Coll Elect Informat, Nanning 530006, Peoples R China
[3] Natl Univ Malaysia, Fac Informat Sci & Technol, Bangi 43600, Selangor, Malaysia
[4] Guangxi Univ Nationalities, Coll Artificial Intelligence, Nanning 530006, Peoples R China
[5] Guangxi Key Labs Hybrid Computat & IC Design Anal, Nanning 530006, Peoples R China
来源：
NEUROCOMPUTING | 2023年 / 554卷
基金：
中国国家自然科学基金;
关键词：
Metaheuristic; 0-1; KP; Nature-inspired optimization; Combinatorial optimization; Survey; FROG-LEAPING ALGORITHM; OPTIMIZATION ALGORITHM; SEARCH ALGORITHM; DIFFERENTIAL EVOLUTION; LEARNING ALGORITHM; BAT ALGORITHM; DEEP MODEL; COLONY; INFORMATION; ALLOCATION;
D O I：
10.1016/j.neucom.2023.126630
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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.
引用
收藏
页数：12
相关论文
共 50 条
  • [1] Evolutionary and heuristic algorithms for multiobjective 0-1 knapsack problem
    Kumar, Rajeev
    Singh, R. K.
    Singhal, A. P.
    Bhartia, Atul
    APPLICATIONS OF SOFT COMPUTING: RECENT TRENDS, 2006, : 331 - +
  • [2] New trends in exact algorithms for the 0-1 knapsack problem
    Martello, S
    Pisinger, D
    Toth, P
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 123 (02) : 325 - 332
  • [3] Research on genetic algorithms for the discounted {0-1} knapsack problem
    He Y.-C.
    Wang X.-Z.
    Li W.-B.
    Zhang X.-L.
    Chen Y.-Y.
    2016, Science Press (39): : 2614 - 2630
  • [4] Exact and approximate algorithms for discounted {0-1} knapsack problem
    He, Yi-Chao
    Wang, Xi-Zhao
    He, Yu-Lin
    Zhao, Shu-Liang
    Li, Wen-Bin
    INFORMATION SCIENCES, 2016, 369 : 634 - 647
  • [5] Improved Dynamic Programming Algorithms for the 0-1 Knapsack Problem
    Meng, Xiaohua
    Zhu, Yue-an
    Wu, Xiaoming
    PROCEEDINGS OF 2010 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (ICCSIT 2010), VOL 8, 2010, : 19 - 22
  • [6] Reoptimizing the 0-1 knapsack problem
    Archetti, Claudia
    Bertazzi, Luca
    Speranza, M. Grazia
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (17) : 1879 - 1887
  • [7] ALGORITHM FOR 0-1 KNAPSACK PROBLEM
    LAURIERE, M
    MATHEMATICAL PROGRAMMING, 1978, 14 (01) : 1 - 10
  • [8] COLLAPSING 0-1 KNAPSACK PROBLEM
    POSNER, ME
    GUIGNARD, M
    MATHEMATICAL PROGRAMMING, 1978, 15 (02) : 155 - 161
  • [9] Exact algorithms for the 0-1 Time-Bomb Knapsack Problem
    Monaci, Michele
    Pike-Burke, Ciara
    Santini, Alberto
    COMPUTERS & OPERATIONS RESEARCH, 2022, 145
  • [10] Dynamic programming based algorithms for the discounted {0-1} knapsack problem
    Rong, Aiying
    Figueira, Jose Rui
    Klamroth, Kathrin
    APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (12) : 6921 - 6933
12345