1. 基于模运算的新颖离散差分演化算法求解多背包问题.
- Author
-
王丽娜, 张寒崧, 孙菲, 高泽贤, and 贺毅朝
- Subjects
- *
KNAPSACK problems , *INTEGER programming , *EVOLUTIONARY algorithms , *DIFFERENTIAL evolution , *ALGORITHMS , *TRANSFER functions - 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]
- Published
- 2023
- Full Text
- View/download PDF