Distributed minimum spanning tree differential evolution for multimodal optimization problems

doi:10.1007/s00500-019-03875-x

Return

Distributed minimum spanning tree differential evolution for multimodal optimization problems

2019-03-05

PRE

DOI：10.1007/s00500-019-03875-x

Original

Original request for help

Save

Abstract

En 中文

Multimodal optimization problem (MMOP) requires to find optima as many as possible for a single problem. Recently, many niching techniques have been proposed to tackle MMOPs. However, most of the niching techniques are either sensitive to the niching parameters or causing a waste of fitness evaluations. In this paper, we proposed a novel niching technique based on minimum spanning tree (MST) and applied it into differential evolution (DE), termed as MSTDE, to solve MMOPs. In every generation, an MST is built based on the distance information among the individuals. After that, we cut the M largest weighted edges of the MST to form some subtrees, so-called subpopulations. The DE operators are executed within the subpopulations. Besides, a dynamic pruning ratio (DPR) strategy is proposed to determine M with an attempt to reduce its sensitivity, so as to enhance the niching performance. Meanwhile, the DPR strategy can achieve a good balance between diversity and convergence. Besides, taking the advantage of fast availability in time from virtual machines (VMs), a distributed model is applied in MSTDE, where different subpopulations run concurrently on distributed VMs. Experiments have been conducted on the CEC2013 multimodal benchmark functions to test the performance of MSTDE, and the experimental results show that MSTDE can outperform many existed multimodal optimization algorithms.

Keywords:

Differential evolution

Minimum spanning tree

Multimodal optimization problems

Distributed model

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.