A New Moth-Flame Optimization Algorithm for Discounted {0-1} Knapsack Problem

被引:7
作者
Tung Khac Truong [1 ]
机构
[1] Van Lang Univ, Fac Informat Technol, Ho Chi Minh City, Vietnam
关键词
D O I
10.1155/2021/5092480
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The discounted {0-1} knapsack problem may be a kind of backpack issue with gathering structure and rebate connections among things. A moth-flame optimization algorithm has shown good searchability combined with an effective solution presentation designed for the discounted {0-1} knapsack problem. A new encoding scheme used a shorter length binary vector to help reduce the search domain and speed up the computing time. A greedy repair procedure is used to help the algorithm have fast convergence and reduce the gap between the best-found solution and the optimal solution. The experience results of 30 discounted {0-1} knapsack problem instances are used to evaluate the proposed algorithm. The results demonstrate that the proposed algorithm outperforms the two binary PSO algorithms and the genetic algorithm in solving 30 DKP01 instances. The Wilcoxon rank-sum test is used to support the proposed declarations.
引用
收藏
页数:15
相关论文
共 50 条
[21]   An Ameliorated Moth-flame Optimization Algorithm [J].
Zhao, Xiao-dong ;
Fang, Yi-ming ;
Ma, Zhuang ;
Xu, Miao .
2018 37TH CHINESE CONTROL CONFERENCE (CCC), 2018, :2372-2377
[22]   Different Transfer Functions for Binary Particle Swarm Optimization with a New Encoding Scheme for Discounted {0-1} Knapsack Problem [J].
Truong, Tung Khac .
MATHEMATICAL PROBLEMS IN ENGINEERING, 2021, 2021
[23]   THE MULTIDIMENSIONAL 0-1 KNAPSACK PROBLEM A New Heuristic Algorithm Combined with 0-1 Linear Programming [J].
Csebfalvi, Aniko ;
Csebfalvi, Gyorgy .
ECTA 2011/FCTA 2011: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION THEORY AND APPLICATIONS AND INTERNATIONAL CONFERENCE ON FUZZY COMPUTATION THEORY AND APPLICATIONS, 2011, :203-207
[24]   New binary bat algorithm for solving 0-1 knapsack problem [J].
Rizk-Allah, Rizk M. ;
Hassanien, Aboul Ella .
COMPLEX & INTELLIGENT SYSTEMS, 2018, 4 (01) :31-53
[25]   A modified hybrid rice optimization algorithm for solving 0-1 knapsack problem [J].
Zhe Shu ;
Zhiwei Ye ;
Xinlu Zong ;
Shiqin Liu ;
Daode Zhang ;
Chunzhi Wang ;
Mingwei Wang .
Applied Intelligence, 2022, 52 :5751-5769
[26]   A modified hybrid rice optimization algorithm for solving 0-1 knapsack problem [J].
Shu, Zhe ;
Ye, Zhiwei ;
Zong, Xinlu ;
Liu, Shiqin ;
Zhang, Daode ;
Wang, Chunzhi ;
Wang, Mingwei .
APPLIED INTELLIGENCE, 2022, 52 (05) :5751-5769
[27]   An improved particle swarm optimization algorithm for solving 0-1 knapsack problem [J].
Zhang, Guo-Li ;
Wei, Yi .
PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, :915-+
[28]   AN ALGORITHM FOR THE 0-1 EQUALITY KNAPSACK-PROBLEM [J].
RAM, B ;
SARIN, S .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1988, 39 (11) :1045-1049
[29]   Binary social group optimization algorithm for solving 0-1 knapsack problem [J].
Naik, Anima ;
Chokkalingam, Pradeep Kumar .
DECISION SCIENCE LETTERS, 2022, 11 (01) :55-72
[30]   A PARALLEL ALGORITHM FOR THE 0-1 KNAPSACK-PROBLEM [J].
LOOTS, W ;
SMITH, THC .
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1992, 21 (05) :349-362