Pareto Improving Selection of the Global Best in Particle Swarm Optimization

Particle Swarm Optimization is an effective stochastic optimization technique that simulates a swarm of particles that fly through a problem space. In the process of searching the problem space for a solution, the individual variables of a candidate solution will often take on inferior values characterized as “Two Steps Forward, One Step Back.” Several approaches to solving this problem have introduced varying notions of cooperation and competition. Instead we characterize the success of these multi-swarm techniques as reconciling conflicting information through a mechanism that makes successive candidates Pareto improvements. We use this analysis to construct a variation of PSO that applies this mechanism to gbest selection. Experiments show that this algorithm performs better than the standard gbest PSO algorithm.

[1]  H. P Nii,et al.  Blackboard Systems , 1986 .

[2]  David Hinkley,et al.  Bootstrap Methods: Another Look at the Jackknife , 2008 .

[3]  Kenneth A. De Jong,et al.  A Cooperative Coevolutionary Approach to Function Optimization , 1994, PPSN.

[4]  Melanie Mitchell,et al.  The royal road for genetic algorithms: Fitness landscapes and GA performance , 1991 .

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

[6]  Charles H. Reilly.  Optimization test problems with uniformly distributed coefficients , 1991, 1991 Winter Simulation Conference Proceedings..

[7]  F. van den Bergh,et al.  Training product unit networks using cooperative particle swarm optimisers , 2001, IJCNN'01. International Joint Conference on Neural Networks. Proceedings (Cat. No.01CH37222).

[8]  Andries Petrus Engelbrecht,et al.  Fitness function evaluations: A fair stopping condition? , 2014, 2014 IEEE Symposium on Swarm Intelligence.

[9]  Michael N. Vrahatis,et al.  Particle Swarm Optimization and Intelligence: Advances and Applications , 2010 .

[10]  Liang Gao,et al.  An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..

[11]  Tunchan Cura,et al.  Particle swarm optimization approach to portfolio optimization , 2009 .

[12]  Mikkel T. Jensen,et al.  Guiding Single-Objective Optimization Using Multi-objective Methods , 2003, EvoWorkshops.

[13]  Ingo Wegener,et al.  Can Single-Objective Optimization Profit from Multiobjective Optimization? , 2008, Multiobjective Problem Solving from Nature.

[14]  D. Corkill.  Blackboard Systems , 1991 .

[15]  Xin-She Yang,et al.  A literature survey of benchmark functions for global optimisation problems , 2013, Int. J. Math. Model. Numer. Optimisation.

[16]  Shane Strasser,et al.  Factored Evolutionary Algorithms , 2017, IEEE Transactions on Evolutionary Computation.

[17]  Lingfeng Wang,et al.  Environmental/economic power dispatch using a fuzzified multi-objective particle swarm optimization algorithm , 2007 .

[18]  Andries Petrus Engelbrecht,et al.  A Cooperative approach to particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[19]  G. Moslehi,et al.  A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search , 2011 .

[20]  M. A. Abido,et al.  Multiobjective particle swarm optimization for environmental/economic dispatch problem , 2009 .

[21]  W. Renhart,et al.  Pareto optimality and particle swarm optimization , 2004, IEEE Transactions on Magnetics.

[22]  Tad Hogg,et al.  Cooperative Problem solving , 1992, Computation: The Micro and the Macro View.