An Improved Social Cognitive Optimization Algorithm

Article Preview

Abstract:

To improve the global convergence speed of classical social cognitive optimization (SCO) algorithm, a novel hybrid social cognitive optimization algorithm based on quantum behavior (QSCO) is proposed. In the proposed algorithm, learning agents learn in a quantum multi-dimensional space and establish a quantum delta potential well model. A quantum search process is incorporated into local searching operation so as to enhance the local searching efficiency in the neighboring areas of the feasible solutions. Simulation results on a set of benchmark problems show that the proposed algorithm has high optimization efficiency and good global performance.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2580-2583

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Xie X F, Zhang W J, Yang Z L. Social cognitive optimization for nonlinear programming problems. Proceedings of Int. Conf. on Machine Learning and Cybernetics: vol. 2, 4-5 Nov. 2002, Beijing, China, 2002: 779-783.

Google Scholar

[2] Xie X F, Zhang W J. Solving engineering design problems by social cognitive optimization. Proceedings of Genetic and Evolutionary Computation Conference, 2004, Seattle, WA: LNCS, 2004: 261-262.

DOI: 10.1007/978-3-540-24854-5_27

Google Scholar

[3] Sun, Jia-Ze; Geng, Guo-Hua; Wang, Shu-Yan,Hybrid social cognitive optimization algorithm for constrained nonlinear programming Journal of China Universities of Posts and Telecommunications, v 19, n 3, pp.91-99, June (2012).

DOI: 10.1016/s1005-8885(11)60270-7

Google Scholar

[4] Sun J, Feng B, Xu W B. Particle Swarm Optimization with Particles Having Quantum Behavior, Proceedings of 2004 Congress on Evolutionary Computation, 2004, pp.325-331.

DOI: 10.1109/cec.2004.1330875

Google Scholar

[5] Tao Wang. Global optimization for constrained nonlinear programming. Urbana, IL, USA: Illinois University Press, (2001).

Google Scholar