Back to Search
Start Over
基于模运算的新颖离散差分演化算法求解多背包问题.
- Source :
-
Application Research of Computers / Jisuanji Yingyong Yanjiu . Aug2023, Vol. 40 Issue 8, p2334-2360. 7p. - Publication Year :
- 2023
-
Abstract
- The multiple knapsack problem(MKP) is a special knapsack problem with great difficulty. In order to solve MKP by differential evolution(DE), this paper first established the integer programming model of MKP. Based on a simple and efficient new transfer function based on modulo operation, it proposed a novel discrete differential evolution algorithm MODDE. Then, the method used an efficient algorithm GROA to eliminate the unfeasible solution of MKP by greedy strategy. Therefrom, this paper proposed a new method for solving MKP based on MODDE. Finally, it used MODDE to solve 30 international instances of MKP. Comparing with 4 representative evolution algorithms shows that MODDE not only has better calculation results; but also has stronger stability. It is indeed an efficient algorithm for solving MKP [ABSTRACT FROM AUTHOR]
Details
- Language :
- Chinese
- ISSN :
- 10013695
- Volume :
- 40
- Issue :
- 8
- Database :
- Academic Search Index
- Journal :
- Application Research of Computers / Jisuanji Yingyong Yanjiu
- Publication Type :
- Academic Journal
- Accession number :
- 169933051
- Full Text :
- https://doi.org/10.19734/j.issn.1001-3695.2023.01.0004