Skip to Main Content
In this paper, a neighborhood mutation strategy is proposed and integrated with various niching differential evolution (DE) algorithms to solve multimodal optimization problems. Although variants of DE are highly effective in locating a single global optimum, no DE variant performs competitively when solving multi-optima problems. In the proposed neighborhood based differential evolution, the mutation is performed within each Euclidean neighborhood. The neighborhood mutation is able to maintain the multiple optima found during the evolution and evolve toward the respective global/local optimum. To test the performance of the proposed neighborhood mutation DE, a total of 29 problem instances are used. The proposed algorithms are compared with a number of state-of-the-art multimodal optimization approaches and the experimental results suggest that although the idea of neighborhood mutation is simple, it is able to provide better and more consistent performance over the state-of-the-art multimodal algorithms. In addition, a comparative survey on niching algorithms and their applications are also presented.