Abstract
This paper first proposes a discrete differential evolution algorithm for discounted {0-1} knapsack problems (D{0-1}KP) based on feasible solutions represented by the 0-1 vector. Subsequently, based on two encoding mechanisms of transforming a real vector into an integer vector, two new algorithms for solving D{0-1}KP are given through using integer vectors defined on {0, 1, 2, 3}n to represent feasible solutions of the problem. Finally, the paper conducts a comparative study on the performance between our proposed three discrete differential evolution algorithms and those developed by common genetic algorithms for solving several types of large scale D{0-1}KP problems. The paper confirms the feasibility and effectiveness of designing discrete differential evolution algorithms for D{0-1}KP by encoding conversion approaches.
| Original language | English |
|---|---|
| Pages (from-to) | 219-238 |
| Number of pages | 20 |
| Journal | International Journal of Bio-Inspired Computation |
| Volume | 10 |
| Issue number | 4 |
| Early online date | 15 Nov 2017 |
| DOIs | |
| Publication status | Published - 2017 |
| Externally published | Yes |
Bibliographical note
The first author and corresponding authors contributed equally the same to this article which was supported by the Macao Science and Technology Development Funds (100/2013/A3 and 081/2015/A3), Basic Research Project of Knowledge Innovation Program in Shenzhen (JCYJ20150324140036825), National Natural Science Foundations of China (61503252 and 71371063), Scientific Research Project Program of Colleges and Universities in Hebei Province (ZD2016005), and Natural Science Foundation of Hebei Province (F2016403055).Keywords
- Differential evolution
- Discounted {0-1} knapsack problem
- Encoding conversion method
- Repairing and optimisation