Solving 0-1 knapsack problems via a hybrid differential evolution

Authors:
Shu Jun;Li Jian
Affiliations:
Institute of Electrical and Electronic Engineering, Hubei University of Industrial, Wuhan, China;Department of Computer Engineering, Hubei University of Education, Wuhan, China
Venue:
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Year:
2009

Citing 2
Cited 1

Improving EAX with restricted 2-opt

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Solving 0-1 Knapsack Problems by a Discrete Binary Version of Differential Evolution

IITA '08 Proceedings of the 2008 Second International Symposium on Intelligent Information Technology Application - Volume 02

Wisdom of artificial crowds algorithm for solving NP-hard problems

International Journal of Bio-Inspired Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The 0-1 knapsack problem (KP) is a classical NP-hard problem with binary decision variables. The traditional differential evolution (DE) is an effective stochastic parallel search evolutionary algorithm and customized to continuous function optimization. To solve KPs, based on DE, a discrete binary version of differential evolution (DBDE) was employed, where each component of a mutated vector component changes with the probability and will take on a zero or one value. Moreover, a heuristic operator was employed to handle the constraint and to enhance local search. The approach was implemented to 3 cases. By comparisons with the other evolutionary algorithms, DBDE have shown the feasibility and effectiveness.