By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chen Peng ; Inf. Technol. Center, China Three Gorges Univ., Yichang ; Li Jian ; Liu Zhiming

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.

Published in:

Intelligent Information Technology Application, 2008. IITA '08. Second International Symposium on  (Volume:2 )

Date of Conference:

20-22 Dec. 2008