My watch list
my.bionity.com  
Login  

Discrete differential evolutions for the discounted {0-1} knapsack problem

Discrete differential evolutions for the discounted {0-1} knapsack problem
Hong Zhu; Yichao He; Xizhao Wang; Eric C.C. Tsang
International Journal of Bio-Inspired Computation, Vol. 10, No. 4 (2017) pp. 219 - 238
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.

Authors:   Hong Zhu; Yichao He; Xizhao Wang; Eric C.C. Tsang
Journal:   International Journal of Bio-Inspired Computation
DOI:   10.1504/IJBIC.2017.087924
Facts, background information, dossiers
  • genetic algorithms
More about Inderscience Enterprises
Your browser is not current. Microsoft Internet Explorer 6.0 does not support some functions on Chemie.DE