Genetic algorithm based on greedy strategy in the 0-1 knapsack problem

3rd International Conference on Genetic and Evolutionary Computing, WGEC 2009

Volumn , Issue , 2009, Pages 105-107

  Zhao, JiangFei ^a   Huang, Tinglei ^a   Pang, Fei ^a   Liu, YuanJie ^a  

^a GUILIN UNIVERSITY OF ELECTRONIC TECHNOLOGY   (China)

Author keywords

0 1 knapsack problem; Genetic algorithm; Greedy strategy

Indexed keywords

0-1 KNAPSACK PROBLEM; EXPONENTIAL GROWTH; GREEDY ALGORITHMS; GREEDY METHOD; GREEDY STRATEGIES; IN-FIELD; KNAPSACK PROBLEMS; OPTIMAL SOLUTIONS; SEARCH SPACES; SOLUTION SPACE;

GENETIC ALGORITHMS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMAL SYSTEMS;

PROBLEM SOLVING;

EID: 77950651063     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WGEC.2009.43     Document Type: Conference Paper

References (6)

1. Yang Liu The Genetic Algor ithm of Solv ing 0- 1'sKnapsack Problem and Its Improvement[J] Tianjin Normal University Natural Science Edition 9/2003J.
2. Clerk Maxwell, A Treatise on Electricity and Magnetism, 3rd ed., vol.2. Oxford: Clarendon, 1892, pp.68-73.
3. Wenlan Chen, JianHua Liu a genetic algorithm in Solving a knapsack problem Computer of FuJian 5/2006
4. TanShan Yan Greedy algorithm based on Hybrid Genetic Algorithm for Solving 0 / 1 knapsack problem Research and Development 7/2006
5. HongWei Huo,Jin Xu,Zheng Bao Solving 0-1 knapsack problem using genetic algorithm Tha Journal of Xi'an University of Electronic Science and Technology August 1999
6. GuangLin Shi, WeiXiang Shi Genetic Algorithm and its New Progress in Research and Application Basic science April of 1997