The Differential Evolution Algorithm Based on Domain Partition for Solving 0-1 Knapsack Problem
Zhu Li · Journal of Jiangxi Normal University · 2012
In order to solve the 0-1 knapsack problems more effectively,a new differential evolution algorithm based on domain partition method is proposed.The mutation operator of traditional differential evolution algorithm(DE) is modified to guarantee the closure of mutation operation.With the domain partition method introduced in and some hopeless points removed off,the searching field of the optimal solution is reduced.Accordingly,the probability of finding the optimal solution is improved.To ensure the diversity of population,the solution with the least object function value is replaced by the best feasible solution found by the domain partition method combined with greedy method.Numerical experiments show that the new algorithm is of more robustness,of better global searching ability,and of greater probability to find the optimal solution of knapsack problem than those algorithms mentioned in the literatures.