Solving systems of unconstrained equations using particle swarm optimization

A new particle swarm optimization algorithm (PSO), nbest, is developed in this paper to solve systems of unconstrained equations. For this purpose, the standard gbest PSO is adapted by redefining the fitness function in order to locate multiple solutions in one run of the algorithm. The new algorithm also introduces the concept of shrinking particle neighborhoods. The resulting nbest algorithm is a first attempt to develop a niching PSO algorithm. The paper presents results that show the new PSO algorithm to be successful in locating multiple solutions.

[1]  A. Cichocki,et al.  Neural networks for solving systems of linear equations and related problems , 1992 .

[2]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[3]  Werner C. Rheinboldt,et al.  Methods for Solving Systems of Nonlinear Equations: Second Edition , 1998 .

[4]  James Kennedy,et al.  Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[5]  Zheru Chi,et al.  Solving linear simultaneous equations by constraining learning neural networks , 2001, IJCNN'01. International Joint Conference on Neural Networks. Proceedings (Cat. No.01CH37222).

[6]  Michael N. Vrahatis,et al.  Modification of the Particle Swarm Optimizer for Locating All the Global Minima , 2001 .