An Estimation of Distribution Algorithm With Multi-Leader Search

Abstract

The estimation of distribution algorithm (EDA) is a well-known stochastic search method but is easily affected by the ill-shaped distribution of solutions and can thus become trapped in stagnation. In this paper, we propose a novel modified EDA with a multi-leader search (MLS) mechanism, namely, the MLS-EDA. To strengthen the exploration performance, an enhanced distribution model that considers the information of population and distribution is utilized to generate new candidates. Moreover, when the algorithm stagnates, the MLS mechanism will be activated to perform a local search and shrink the search scope. The performance of the MLS-EDA in addressing complex optimization problems is verified using the CEC 2014 and CEC 2017 testbeds with 30D, 50D and 100D tests. Several modern algorithms, including the top-performing methods in the CEC 2014 and CEC 2017 competitions, are considered as competitors. The competitive performance of our proposed MLS-EDA is discussed based on the comparison results.

An Adaptive Evolutionary Multi-Objective Estimation of Distribution Algorithm and Its Application to Multi-UAV Path Planning

“…Select [P S • sr] outstanding individuals from the population according to the ranking and calculate the mean vector µ (t) according to Eq.12; model. This strategy enables the construction of the probability distribution model using historical information from the previous generation [28]- [30]. The size of the global best solution set Gbest is set to around P S/2, and if the number of nondominated sorted first levels is greater than P S/2, then all individuals in the first level are used as the global best solution set Gbest.…”