A Modified Particle Swarm Optimization Using FCM for Moving Peaks Benchmark

Many optimization problems in real world are dynamic and they are changing over time. For resolving these problems, many different algorithms have been proposed. One of these, is PSO algorithm which has well supported its ability in resolving static problems. But this algorithm has some problems in dynamic environments. In this paper, an improved PSO algorithm with inertia parameter has been proposed for dynamic environments which increase the convergence speed of algorithm in getting close toward optimizations. In the proposed algorithm, in order to prevent excessive compression of groups at the end of each iteration, the distance between each group is measured and if this distance is lower than a threshold which is adjusted by a dynamic clustering, the worse group will be eliminated. When some changes is observed in the environment, first the particles’ memory is evaluated, then the particles are distributed inside a super globe with the best particle in the center to increase the group diversity. In order to optimize the results, a local search is applied around the best particle of the group. For evaluating the proposed algorithm, moving peaks benchmark was used. The findings showed that the proposed method operates better than other methods.

[1]  Xiaodong Li,et al.  Particle Swarms for Dynamic Optimization Problems , 2008, Swarm Intelligence.

[2]  Mohammad Reza Meybodi,et al.  A New Particle Swarm Optimization Algorithm for Dynamic Environments , 2010, SEMCCO.

[3]  Irene Moser.  All Currently Known Publications On Approaches Which Solve the Moving Peaks Problem , 2007 .

[4]  Antonina Starita,et al.  Particle swarm optimization for multimodal functions: a clustering approach , 2008 .

[5]  Hartmut Schmeck,et al.  Designing evolutionary algorithms for dynamic optimization problems , 2003 .

[6]  Shengxiang Yang,et al.  Evolutionary Computation in Dynamic and Uncertain Environments , 2007, Studies in Computational Intelligence.

[7]  Tim Blackwell,et al.  Particle Swarm Optimization in Dynamic Environments , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.

[8]  Changhe Li,et al.  A Clustering Particle Swarm Optimizer for Locating and Tracking Multiple Optima in Dynamic Environments , 2010, IEEE Transactions on Evolutionary Computation.

[9]  Changhe Li,et al.  A clustering particle swarm optimizer for dynamic optimization , 2009, 2009 IEEE Congress on Evolutionary Computation.

[10]  Mohammad Reza Meybodi,et al.  Cellular PSO: A PSO for Dynamic Environments , 2009, ISICA.

[11]  David A. Pelta,et al.  An Analysis of Particle Properties on a Multi-swarm PSO for Dynamic Optimization Problems , 2009, CAEPIA.

[12]  Jürgen Branke,et al.  Evolutionary Optimization in Dynamic Environments , 2001, Genetic Algorithms and Evolutionary Computation.

[13]  Yongji Wang,et al.  Multi-swarm Particle Swarm Optimizer with Cauchy Mutation for Dynamic Optimization Problems , 2009, ISICA.

[14]  Changhe Li,et al.  Fast Multi-Swarm Optimization for Dynamic Optimization Problems , 2008, 2008 Fourth International Conference on Natural Computation.

[15]  Shigeyoshi Tsutsui,et al.  Advances in evolutionary computing: theory and applications , 2003 .

[16]  Jürgen Branke,et al.  Memory enhanced evolutionary algorithms for changing optimization problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[17]  Carlos Cruz Corona,et al.  Improvement Strategies for Multi-swarm PSO in Dynamic Environments , 2010, NICSO.