By Topic

An improved genetic algorithm for the multiconstrained 0-1 knapsack problem

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

1 Author(s)
Raidl, G.R. ; Inst. for Comput. Graphics, Vienna Univ. of Technol., Austria

The paper presents an improved hybrid genetic algorithm (GA) for solving the multiconstrained 0-1 knapsack problem (MKP). Based on the solution of the LP relaxed MKP, an efficient pre-optimization of the initial population is suggested. Furthermore, the GA uses sophisticated repair and focal improvement operators which are applied to each newly generated solution. Care has been taken to define these new operators in a way avoiding problems with the loss of population diversity. The new algorithm has been empirically compared to other previous approaches by using a standard set of “large sized” test data. Results show that most of the time the new GA converges much faster to better solutions, in particular for large problems

Published in:

Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on

Date of Conference:

4-9 May 1998