Solving 0-1 Knapsack Problems by a Discrete Binary Version of Differential Evolution

Authors:
Chen Peng;Li Jian;Liu Zhiming
Affiliations:
-;-;-
Venue:
IITA '08 Proceedings of the 2008 Second International Symposium on Intelligent Information Technology Application - Volume 02
Year:
2008

Citing 0
Cited 3

Solving 0-1 knapsack problems via a hybrid differential evolution

IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
A modified binary differential evolution algorithm

LSMS/ICSEE'10 Proceedings of the 2010 international conference on Life system modeling and simulation and intelligent computing, and 2010 international conference on Intelligent computing for sustainable energy and environment: Part II
A novel modified binary differential evolution algorithm and its applications

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The 0-1 knapsack problem (KP) is one of the classical NP-hard problems with binary decision variables. The traditional differential evolution (DE) is an effective stochastic parallel search evolutionary algorithm for global optimization based on real valued crossover and mutation operations in continuous space. To solve KPs, based on DE, a discrete binary version of differential evolution(DBDE) was introduced, where each component of a mutated vector component changes with the probability and will take on a zero or one value. The approach was implemented to 4 cases. By comparisons with the results of the discrete binary version of particle swarm optimization (DPSO), DBDE outperformed DPSO for all the cases with better solutions and more rapid convergence speed.