Adaptive particle swarm optimization algorithm for dynamic environments

  • Authors:

  • Iman Rezazadeh;Mohammad Reza Meybodi;Ahmad Naebi

  • Affiliations:

  • Department of Computer Engineering, Qazvin Islamic Azad University, Qazvin, Iran;Department of Computer Engineering and Information Technology, Amirkabir University of Technology, Tehran, Iran;Department of Computer Engineering, Qazvin Islamic Azad University, Qazvin, Iran

  • Venue:
  • ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many real world optimization problems are dynamic in which global optimum and local optimum change over time. Particle swarm optimization has performed well to find and track optimum in dynamic environments. In this paper, we propose a new particle swarm optimization algorithm for dynamic environments. The proposed algorithm utilizes FCM to adapt exclusion radios and utilize a local search on best swarm to accelerate progress of algorithm and adjust inertia weight adaptively. To improve the search performance, when the search areas of two swarms are overlapped, the worse swarms will be removed. Moreover, in order to track quickly the changes in the environment, all particles in the swarm convert to quantum particles when a change in the environment is detected. Experimental results on different dynamic environments modeled by moving peaks benchmark show that the proposed algorithm outperforms other PSO algorithms, for all evaluated environments.