Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem

The 0-1 knapsack problem (KP01) is a well-known combinatorial optimization problem. It is an NP-hard problem which plays important roles in computing theory and in many real life applications. Chemical reaction optimization (CRO) is a new optimization framework, inspired by the nature of chemical reactions. CRO has demonstrated excellent performance in solving many engineering problems such as the quadratic assignment problem, neural network training, multimodal continuous problems, etc. This paper proposes a new chemical reaction optimization with greedy strategy algorithm (CROG) to solve KP01. The paper also explains the operator design and parameter turning methods for CROG. A new repair function integrating a greedy strategy and random selection is used to repair the infeasible solutions. The experimental results have proven the superior performance of CROG compared to genetic algorithm (GA), ant colony optimization (ACO) and quantum-inspired evolutionary algorithm (QEA).

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

[2]  Hans Kellerer,et al.  Knapsack problems , 2004 .

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

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

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

[6]  Kenli Li,et al.  Optimal parallel algorithm for the knapsack problem without memory conflicts , 2003, Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies.

[7]  Jin Xu,et al.  Chemical Reaction Optimization for Task Scheduling in Grid Computing , 2011, IEEE Transactions on Parallel and Distributed Systems.

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

[9]  Victor O. K. Li,et al.  Evolutionary artificial neural network based on Chemical Reaction Optimization , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

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

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

[12]  Feng-Tse Lin,et al.  Solving the knapsack problem with imprecise weight coefficients using genetic algorithms , 2008, Eur. J. Oper. Res..

[13]  Victor O. K. Li,et al.  Chemical Reaction Optimization for population transition in peer-to-peer live streaming , 2010, IEEE Congress on Evolutionary Computation.

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

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

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

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

[18]  Jin Xu,et al.  Stock Portfolio Selection Using Chemical Reaction Optimization , 2011 .

[19]  Victor O. K. Li,et al.  Chemical Reaction Optimization: a tutorial , 2012, Memetic Computing.

[20]  Victor O. K. Li,et al.  Real-Coded Chemical Reaction Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[21]  Victor O. K. Li,et al.  Chemical Reaction Optimization for Cognitive Radio Spectrum Allocation , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[22]  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.

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

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

[25]  Victor O. K. Li,et al.  Network Coding Optimization Based on Chemical Reaction Optimization , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

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

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

[28]  Victor O. K. Li,et al.  Chemical Reaction Optimization for the Grid Scheduling Problem , 2010, 2010 IEEE International Conference on Communications.

[29]  Victor O. K. Li,et al.  Chemical-Reaction-Inspired Metaheuristic for Optimization , 2010, IEEE Transactions on Evolutionary Computation.

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

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

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

[33]  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.