By Topic

Solve Zero-One Knapsack Problem by Greedy Genetic Algorithm

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
$33 $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)
Yuxiang Shao ; Sch. of Comput. Sci. & Technol., China Univ. of Geosci., Wuhan ; Hongwen Xu ; Weiming Yin

In order to overcome the disadvantages of the traditional genetic algorithm and improve the speed and precision of the algorithm, the author improved the selection strategy, integrated the greedy algorithm with the genetic algorithm and formed the greedy genetic algorithm. The paper discussed the basic idea and method to solve the zero-one knapsack problem using this greedy genetic algorithm. The experiments prove the feasibility and validity of the algorithm.

Published in:

Intelligent Systems and Applications, 2009. ISA 2009. International Workshop on

Date of Conference:

23-24 May 2009