DocumentCode
2044521
Title
Solve Zero-One Knapsack Problem by Greedy Genetic Algorithm
Author
Shao, Yuxiang ; Xu, Hongwen ; Yin, Weiming
Author_Institution
Sch. of Comput. Sci. & Technol., China Univ. of Geosci., Wuhan
fYear
2009
fDate
23-24 May 2009
Firstpage
1
Lastpage
4
Abstract
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.
Keywords
genetic algorithms; greedy algorithms; knapsack problems; greedy algorithm; greedy genetic algorithm; selection strategy; zero-one knapsack problem; Computer science; Convergence; Filling; Genetic algorithms; Genetic mutations; Geology; Greedy algorithms; Mathematical model; NP-hard problem; Production;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems and Applications, 2009. ISA 2009. International Workshop on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-3893-8
Electronic_ISBN
978-1-4244-3894-5
Type
conf
DOI
10.1109/IWISA.2009.5073116
Filename
5073116
Link To Document