Solving 0 - 1 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy

This paper proposes a new artificial chemical reaction optimization algorithm with a greedy strategy to solve 0-1 knapsack problem. The artificial chemical reaction optimization (ACROA) inspiring the chemical reaction process is used to implement the local and global search. A new repair operator integrating a greedy strategy and random selection is used to repair the infeasible solutions. The experimental results have proven the superior performance of ACROA compared to genetic algorithm, and quantum-inspired evolutionary algorithm.

[1]  Bilal Alatas,et al.  A novel chemistry based metaheuristic optimization method for mining of classification rules , 2012, Expert Syst. Appl..

[2]  Tinglei Huang,et al.  Genetic Algorithm Based on Greedy Strategy in the 0-1 Knapsack Problem , 2009, 2009 Third International Conference on Genetic and Evolutionary Computing.

[3]  Tung Khac Truong,et al.  Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem , 2013, Appl. Soft Comput..

[4]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[5]  Chi-Sung Laih,et al.  Linearly shift knapsack public-key cryptosystem , 1989, IEEE J. Sel. Areas Commun..

[6]  Paulo José Paupitz Gonçalves,et al.  Control of Limit Cycle Oscillation in a Three Degrees of Freedom Airfoil Section Using Fuzzy Takagi-Sugeno Modeling , 2014 .

[7]  Kenli Li,et al.  Optimal parallel algorithms for the knapsack problem without memory conflicts , 2008, Journal of Computer Science and Technology.

[8]  Ronald L. Rivest,et al.  A knapsack-type public key cryptosystem based on arithmetic in finite fields , 1988, IEEE Trans. Inf. Theory.

[9]  Sartaj Sahni,et al.  Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.

[10]  P. Kolesar.  A Branch and Bound Algorithm for the Knapsack Problem , 1967 .

[11]  Bilal Alatas,et al.  ACROA: Artificial Chemical Reaction Optimization Algorithm for global optimization , 2011, Expert Syst. Appl..

[12]  Rattan Preet Singh.  Solving 0–1 Knapsack problem using Genetic Algorithms , 2011, 2011 IEEE 3rd International Conference on Communication Software and Networks.

[13]  Hanxiao Shi,et al.  Solution to 0/1 Knapsack Problem Based on Improved Ant Colony Algorithm , 2006, 2006 IEEE International Conference on Information Acquisition.

[14]  Wei Shen,et al.  An Improved Genetic Algorithm for 0-1 Knapsack Problems , 2011, 2011 Second International Conference on Networking and Distributed Computing.

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

[16]  Anthony J. McAuley,et al.  A New Trapdoor Knapsack Public-Key Cryptosystem , 1985, EUROCRYPT.

[17]  Yu Yang,et al.  The support vector machine parameter optimization method based on artificial chemical reaction optimization algorithm and its application to roller bearing fault diagnosis , 2015 .

[18]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[19]  A. J. McAuley,et al.  New trapdoor-knapsack public-key cryptosystem , 1985 .

[20]  Tung Khac Truong,et al.  A Roller Bearing Fault Diagnosis Method Based on LCD Energy Entropy and ACROA-SVM , 2014 .

[21]  Zhuangkuo Li,et al.  A novel multi-mutation binary particle swarm optimization for 0/1 knapsack problem , 2009, 2009 Chinese Control and Decision Conference.

[22]  Jianhua Wu,et al.  Solving 0-1 knapsack problem by a novel global harmony search algorithm , 2011, Appl. Soft Comput..

[23]  Jong-Hwan Kim,et al.  Quantum-inspired evolutionary algorithm for a class of combinatorial optimization , 2002, IEEE Trans. Evol. Comput..

[24]  Chao Liu,et al.  A Schema-Guiding Evolutionary Algorithm for 0-1 Knapsack Problem , 2009, 2009 International Association of Computer Science and Information Technology - Spring Conference.

[25]  Chou-Yuan Lee,et al.  A New Approach for Solving 0/1 Knapsack Problem , 2006, 2006 IEEE International Conference on Systems, Man and Cybernetics.

[26]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .