Title :
Notice of Retraction
Greedy genetic algorithm to Bounded Knapsack Problem
Author :
Kaystha, S. ; Agarwal, S.
Author_Institution :
Comput. Sci. & Eng. Dept., Motilal Nehru Nat. Inst. of Technol., Allahabad, India
Abstract :
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
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.
Keywords :
genetic algorithms; greedy algorithms; knapsack problems; bounded knapsack problem; greedy genetic algorithm; Biological cells; Cryptography; Genetics; Irrigation; Bounded Knapsack; Combinatorial Problem; Genetic Algorithm; Greedy Algorithm; Optimization; component;
Conference_Titel :
Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4244-5537-9
DOI :
10.1109/ICCSIT.2010.5563867
