Dynamic Neighborhood-Based Particle Swarm Optimization for Multimodal Problems

Abstract EN

Various black-box optimization problems in real world can be classified as multimodal optimization problems.

Neighborhood information plays an important role in improving the performance of an evolutionary algorithm when dealing with such problems.

In view of this, we propose a particle swarm optimization algorithm based on dynamic neighborhood to solve the multimodal optimization problem.

In this paper, a dynamic ε-neighborhood selection mechanism is first defined to balance the exploration and exploitation of the algorithm.

Then, based on the information provided by the neighborhoods, four different particle position updating strategies are designed to further support the algorithm’s exploration and exploitation of the search space.

Finally, the proposed algorithm is compared with 7 state-of-the-art multimodal algorithms on 8 benchmark instances.

The experimental results reveal that the proposed algorithm is superior to the compared ones and is an effective method to tackle multimodal optimization problems.