Notice of RetractionGreedy genetic algorithm to Bounded Knapsack Problem

This paper proposes an approach to find solution to the Bounded Knapsack Problem (BKP). BKP is a generalization of 0/1 knapsack problem in which multiple instances of distinct items but a single knapsack is considered. This problem occurs in many ways in real-life, such as cryptography, finance, etc. A genetic algorithm using greedy approach is proposed to solve this problem. The experiments prove the feasibility and validity of the algorithm.

[1]  Akinori Kanasugi,et al.  Genetic Algorithm that can Dynamically Change Number of Individuals and Accuracy , 2007, 2007 Frontiers in the Convergence of Bioscience and Information Technologies.

[2]  R. Spillman.  Solving large knapsack problems with a genetic algorithm , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[3]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

[4]  Masakazu Suzuki,et al.  An efficient solution for compositional design problems by Multi-stage Genetic Algorithm , 2007, 2007 IEEE 22nd International Symposium on Intelligent Control.

[5]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[6]  Yuxiang Shao,et al.  Solve Zero-One Knapsack Problem by Greedy Genetic Algorithm , 2009, 2009 International Workshop on Intelligent Systems and Applications.

[7]  Alex S. Fukunaga.  A new grouping genetic algorithm for the Multiple Knapsack Problem , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[8]  Hisao Ishibuchi,et al.  Comparison between Single-Objective and Multi-Objective Genetic Algorithms: Performance Comparison and Performance Measures , 2006, 2006 IEEE International Conference on Evolutionary Computation.