A novel particle swarm optimizer without velocity: Simplex-PSO

Abstract

A simplex particle swarm optimization (simplex-PSO) derived from the Nelder-Mead simplex method was proposed to optimize the high dimensionality functions. In simplex-PSO, the velocity term was abandoned and its reference objectives were the best particle and the centroid of all particles except the best particle. The convergence theorems of linear time-varying discrete system proved that simplex-PSO is of consistent asymptotic convergence. In order to reduce the probability of trapping into a local optimal value, an extremum mutation was introduced into simplex-PSO and simplex-PSO-t (simplex-PSO with turbulence) was devised. Several experiments were carried out to verify the validity of simplex-PSO and simplex-PSO-t, and the experimental results confirmed the conclusions: (1) simplex-PSO-t can optimize high-dimension functions with 200-dimensionality; (2) compared PSO with chaos PSO (CPSO), the best optimum index increases by a factor of 1×10²–1×10⁴.

Keywords

Nelder-Mead simplex method / particle swarm optimizer / high-dimension function optimization / convergence analysis

References

[1] ClercM.Stagnation analysis in particle swarm optimizer [R], 2006, Colchester, Department of Computer Science, University of Essex

[2] ClercM., KennedyM.. The particle swarm-explosion, stability, and convergence in multidimensional complex space [J]. IEEE Transaction on Evolutionary Computation, 2002, 6(1): 58-73

[3] LangdonW. B.Kernel methods for PSOs [R], 2005, Colchester, Department of Computer Science, University of Essex

[4] RobertoB., MauroB., SrinivasP.Do not be afraid of local minima [R], 2005, Trento, Department of Information and Communication Technology, University of Trento

[5] AugerA., HansenN., CorneD., MichalewiczZ., MckayB., FogelD.. A restart CMA evolution strategy with increasing population size [C]. Proceeding of the 2005 IEEE Congress on Evolutionary Computation, 2005, Edinburgh, IEEE Press: 1769-1775

[6] Gang-qiangE., XunS.-y.. Particle swarm optimization based on dynamic population size [J]. Information and Control, 2008, 37(1): 18-27

[7] LiT., LaiX.-z., WuMin.. A novel two-swarm based particle swarm optimization algorithm for optimal power flow problem [J]. Journal of Central South University: Science and Technology, 2007, 38(1): 133-137

[8] LiuH.-b., WangX.-k., TanG.-zhen.. Convergence analysis of particle swarm optimization and improvement of chaotic [J]. Control and Decision, 2006, 21(6): 636-640

[9] LangdonW. B., RiccardoP.. Evolving problems to learn about particle swarm and other optimizers [C]. Proceedings of the 2005 Genetic and Evolutionary Computation Conference for ACM SIGEVO (GECCO2005), 2005, New York, ACM Press: 81-88

[10] LiuB., WangL., JinY.-h., TangF., HuangD.-xian.. Improved particles swarm optimization combined with chaos [J]. Chaos, Solitons and Fractals, 2005, 25(5): 1261-1271

[11] LeeH. P., LiangY. C.. An improved GA and a novel PSO-GA-based hybrid algorithm [J]. Information Processing Letters, 2005, 93(5): 255-261

[12] GuangQ.-l., ZhaoF.-qiang.. Parallel hybrid PSO-GA algorithm and its application to layout design [J]. Structural and Multidisciplinary Optimization, 2006, 33(5): 749-758

[13] GeorgeA. D., HaftkaR. T.. Parallel asynchronous particle swarm optimization [J]. International Journal for Numerical Method in Engineering, 2006, 67(5): 578-595

[14] SchuffeJ. F., ReinboltJ. A.. Parallel global optimization with particle swarm algorithm [J]. International Journal of Numerical Methods in Engineering, 2004, 61(13): 2296-2315

[15] KennedyJ., EberhartR. C.. Bare bones particle swarms [J]. Evolution Computation, 2003, 12(6): 258-265

[16] ChristopherK., KevinD., SahniS.. The Kalman swarm: A new approach to particle motion in swarm optimization [C]. Proceedings of the third IASTED International Conference Advances in Computer Science and Technology, 2007, Calgary, ACTA Press: 606-614

[17] HuW., LiZ.-shu.. A simpler and more effective particle swarm optimization [J]. Journal of Software, 2007, 18(4): 861-868

[18] NelderJ. A., MeadR.. A simplex method for function minimum [J]. Computer Journal, 1965, 7(2): 308-313

[19] HelioJ. C., CarlileC. L.. A GA-simplex hybrid algorithm for global minimization of molecular potential energy functions [J]. Annals of Operation Research, 2005, 38(1): 189-202

[20] WangF., QiuY.-hui.. A novel particle swarm algorithm using simplex method [J]. Information and Control, 2005, 34(1): 9-14

[21] XiaoYang.Analysis of dynamical systems [M], 2002, Beijing City, Beifang Jiaotong University Press: 64-73

[22] YenJ., LiaoJ. C., BogjuG.. A hybrid approach to modeling metabolic systems using a genetic algorithm and simplex method [J]. Parallel Computing, 2002, 28(2): 173-191

[23] MahfoufM., LinkensD. A.Adaptive weighted swarm optimization for multiobjective optimal design of alloy steels [R], 2006, Colchester, Department of Computer Science, University of Essex

[24] ChenW., ShiS.-jang.. The development of information guided evolution algorithm for global optimization [J]. Journal of Global Optimization, 2006, 36(4): 517-535

[25] JasonT., NorR. M., SahniS.. Hybridizing adaptive and non-adaptive mutation for cooperative exploration of complex multimodal search space [C]. Proceedings of the third IASTED International Conference Advances in Computer Science and Technology, 2007, Calgary, ACTA Press: 476-498

[26] ZhangG.-l., LuH.-yan.. Hybrid real-coded genetic algorithm with quasic-simplex technology [J]. International Journal of Computer Science and Network Security, 2006, 6(10): 246-256

[27] DebK., AnandA., JoshiD.. A computationally efficient evolutionary algorithm for real-parameter evolution [J]. Evolutionary Computation, 2005, 13(4): 371-395

[28] DebK., SindhyaK., OkabeT.. Self-adaptive simulated binary crossover for real-parameter optimization [C]. Proceedings of the 2007 Genetic and Evolutionary Computation Conference for ACM SIGEVO (GECCO-2007), 2007, New York, ACM Press: 414-419