Classical and quantum-inspired electromagnetism-like mechanism for solving 0/1 knapsack problems

In this paper, we propose a novel evolutionary computing method which is called quantum-inspired electromagnetism-like mechanism (QEM) to solve 0/1 knapsack problem. QEM is based on the electromagnetism theory and using the characteristic of quantum computation. It can rapidly and efficiently find out the optimal solution of combinatorial optimization problem. We compare the conventional genetic algorithm (CGA), quantum-inspired genetic algorithm (QGA), traditional electromagnetism-like mechanism algorithm (EM) and the quantum-inspired electromagnetism-like mechanism algorithm (QEM). The experiment results show that the QEM is better than CGA, EM and QGA in general cases.

[1]  Lov K. Grover.  Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.

[2]  Shu-Cherng Fang,et al.  An Electromagnetism-like Mechanism for Global Optimization , 2003, J. Glob. Optim..

[3]  Saeed Jalili,et al.  A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems , 2008, GECCO '08.

[4]  Yanchun Liang,et al.  A novel quantum swarm evolutionary algorithm and its applications , 2007, Neurocomputing.

[5]  R. Feynman.  Simulating physics with computers , 1999 .

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

[7]  P. Benioff.  The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines , 1980 .

[8]  L. K. Grover.  Quantum mechanical searching , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[9]  Shuyuan Yang,et al.  A novel quantum evolutionary algorithm and its application , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[10]  Jong-Hwan Kim,et al.  Quantum-inspired evolutionary algorithms with a new termination criterion, H/sub /spl epsi// gate, and two-phase scheme , 2004, IEEE Transactions on Evolutionary Computation.

[11]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[12]  Jingjing Zhao,et al.  Quantum-inspired evolutionary multicast algorithm , 2009, 2009 IEEE International Conference on Systems, Man and Cybernetics.

[13]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[14]  Todd A. Brun,et al.  Quantum Computing , 2011, Computer Science, The Hardware, Software and Heart of It.

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

[16]  Mario Vanhoucke,et al.  AN ELECTROMAGNETISM META-HEURISTIC FOR THE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM , 2004 .

[17]  Jong-Hwan Kim,et al.  Genetic quantum algorithm and its application to combinatorial optimization problem , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[18]  D. Deutsch.  Quantum computational networks , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[19]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[20]  Chellapilla Patvardhan,et al.  A novel quantum evolutionary algorithm for quadratic Knapsack problem , 2009, 2009 IEEE International Conference on Systems, Man and Cybernetics.