Multi-population Based Univariate Marginal Distribution Algorithm for Dynamic Optimization Problems

摘要

Many real-world problems are dynamic optimization problems in which the optimal solutions need to be continuously tracked over time. In this paper a multi-population based univariate marginal distribution algorithm (MUMDA) is proposed to solve dynamic optimization problems. The main idea of the algorithm is to construct several probability models by dividing the population into several parts. The objective is to divide the search space into several regions to maintain the diversity. Concretely, MUMDA uses one probability vector to do the search in the promising areas identified previously, and uses other probability vectors to search for new promising optimal solutions. Moreover the convergence of univariate marginal distribution algorithm (UMDA) is proved, which can be used to analyze the validity of the proposed algorithm. Finally, the experimental study was carried out to compare the performance of several UMDA, and the results show that the MUMDA is effective and can be well adaptive to the dynamic environments rapidly.