Hybrid social cognitive optimization algorithm for constrained nonlinear programming

Abstract To improve the global convergence speed of social cognitive optimization (SCO) algorithm, a hybrid social cognitive optimization (HSCO) algorithm based on elitist strategy and chaotic optimization is proposed to solve constrained nonlinear programming problems (NLPs). The proposed algorithm partitions learning agents into three groups in proportion: elite learning agents, chaotic learning agents and common learning agents. The common learning agents work in the search way of traditional SCO, chaotic learning agents search via chaotic search (CS) algorithm based on tent map which helps to avoid the premature convergence, elite learning agents search via elitist selection which helps to improve the global searching performance. Additionally, a chaotic 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, good global performance, and stable optimization outcomes for constrained NLPs.

[1]  Chen Yan.  A Service Selection Model Using Mixed Intelligent Optimization , 2010 .

[2]  Hua Rong,et al.  Study of adaptive chaos embedded particle swarm optimization algorithm based on Skew Tent map , 2010, 2010 International Conference on Intelligent Control and Information Processing.

[3]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[4]  Wang Zhi-quan,et al.  Chaotic optimization algorithm based on Tent map , 2005 .

[5]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[6]  Bin Chen.  Improving Autocorrelation and RFM Autocorrelation Performance of Skew Tent Sequence , 2011, 2011 International Conference on Network Computing and Information Security.

[7]  Y. Dong,et al.  An application of swarm optimization to nonlinear programming , 2005 .

[8]  Wenjun Zhang,et al.  Solving Engineering Design Problems by Social Cognitive Optimization , 2004, GECCO.

[9]  Zhang Jian-ke.  Solving nonlinear systems of equations based on Social Cognitive Optimization , 2008 .

[10]  Cao Xiao-peng.  SCO algorithm based on entropy function for NCP , 2010 .

[11]  Qinghua Zheng,et al.  A Service Selection Model Using Mixed Intelligent Optimization: A Service Selection Model Using Mixed Intelligent Optimization , 2010 .

[12]  Thongchai Srinophakun,et al.  Solving mixed-integer nonlinear programming problems using improved genetic algorithms , 2011 .

[13]  Liu Yijun,et al.  A Study of the Multi-objective Evolutionary Algorithm Based on Elitist Strategy , 2009, 2009 Asia-Pacific Conference on Information Processing.

[14]  Chang Wook Ahn,et al.  Elitism-based compact genetic algorithms , 2003, IEEE Trans. Evol. Comput..

[15]  Kou Xiao-li.  Social cognitive optimization for fractional programs , 2008 .

[16]  Wenjun Zhang,et al.  Handling equality constraints by adaptive relaxing rule for swarm algorithms , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[17]  Xiao-Feng Xie,et al.  Social cognitive optimization for nonlinear programming problems , 2002, Proceedings. International Conference on Machine Learning and Cybernetics.

[18]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization , 1999, Evolutionary Computation.