ABSTRACT Gravitational search algorithm (GSA) is a recent introduced global convergence guaranteed algorithm. In this paper, a quantum-behaved gravitational search algorithm, namely called as QGSA, is proposed. In the proposed QGSA each individual mass moves in a Delta potential well in feasible search space with a center which is weighted average of all kbests. The QGSA is tested on several benchmark functions and compared with the GSA. It is shown that the quantum-behaved gravitational search algorithm has faster convergence speed with good precision, and thus generating a better performance.
Cite this paper
M. Moghadam, H. Nezamabadi-Pour and M. Farsangi, "A Quantum Behaved Gravitational Search Algorithm," Intelligent Information Management, Vol. 4 No. 6, 2012, pp. 390-395. doi: 10.4236/iim.2012.46043.
 E. Rashedi, H. Nezamabadi-Pour and S. Saryazdi, “GSA: A Gravitational Search Algorithm,” Information Science, Vol. 179, No. 13, 2009, pp. 2232-2248.
 K. S. Tang, K. F. Man, S. Kwong and Q. He, “Genetic Algorithms and Their Applications,” IEEE Signal Processing Magazine, Vol. 13, No. 6, 1996, pp. 22-37
 F. V. D. Bergh and A. P. Engelbrecht, “A Study of Particle Swarm Optimization Particle Trajectories,” Information Sciences, Vol. 176, No. 8, 2006, pp. 937-971.
 X. F. Pang, “Quantum Mechanics in Nonlinear Systems,” World Scientific Publishing Company, River Edge, 2005.
 W. Schweizer, “Numerical Quantum Dynamics,” Hingham, 2001.
 M. Dorigo, V. Maniezzo and A. Colorni, “The Ant System: Optimization by a Colony of Cooperating Agents,” IEEE Transactions on Systems, Man, and Cybernetics, Vol. 26, 1, 1996, pp. 29-41. doi:10.1109/3477.484436