Skip to Main Content
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 for increase of convergence speed has been adaptive configured by inertia weight value and to improve obtained solutions uses from a local search and to avoid wasting function evaluation of stopped swarms. 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.
Date of Conference: 20-22 Sept. 2011