TY - JOUR
T1 - Multi-population and diffusion UMDA for dynamic multimodal problems
AU - Wu, Yan
AU - Wang, Yuping
AU - Liu, Xiaoxiong
AU - Ye, Jimin
PY - 2010/10
Y1 - 2010/10
N2 - In dynamic environments, it is important to track changing optimal solutions over time. Univariate marginal distribution algorithm (UMDA) which is a class algorithm of estimation of distribution algorithms attracts more and more attention in recent years. In this paper a new multi-population and diffusion UMDA (MDUMDA) is proposed for dynamic multimodal problems. The multi-population approach is used to locate multiple local optima which are useful to find the global optimal solution quickly to dynamic multimodal problems. The diffusion model is used to increase the diversity in a guided fashion, which makes the neighbor individuals of previous optimal solutions move gradually from the previous optimal solutions and enlarge the search space. This approach uses both the information of current population and the part history information of the optimal solutions. Finally experimental studies on the moving peaks benchmark are carried out to evaluate the proposed algorithm and compare the performance of MDUMDA and multi-population quantum swarm optimization (MQSO) from the literature. The experimental results show that the MDUMDA is effective for the function with moving optimum and can adapt to the dynamic environments rapidly.
AB - In dynamic environments, it is important to track changing optimal solutions over time. Univariate marginal distribution algorithm (UMDA) which is a class algorithm of estimation of distribution algorithms attracts more and more attention in recent years. In this paper a new multi-population and diffusion UMDA (MDUMDA) is proposed for dynamic multimodal problems. The multi-population approach is used to locate multiple local optima which are useful to find the global optimal solution quickly to dynamic multimodal problems. The diffusion model is used to increase the diversity in a guided fashion, which makes the neighbor individuals of previous optimal solutions move gradually from the previous optimal solutions and enlarge the search space. This approach uses both the information of current population and the part history information of the optimal solutions. Finally experimental studies on the moving peaks benchmark are carried out to evaluate the proposed algorithm and compare the performance of MDUMDA and multi-population quantum swarm optimization (MQSO) from the literature. The experimental results show that the MDUMDA is effective for the function with moving optimum and can adapt to the dynamic environments rapidly.
KW - Dynamic multimodal problems
KW - Dynamic optimization
KW - Multipopulation scheme
KW - Univariate marginal distribution algorithm (UMDA)
UR - http://www.scopus.com/inward/record.url?scp=78149318696&partnerID=8YFLogxK
U2 - 10.3969/j.issn.1004-4132.2010.05.010
DO - 10.3969/j.issn.1004-4132.2010.05.010
M3 - 文章
AN - SCOPUS:78149318696
SN - 1671-1793
VL - 21
SP - 777
EP - 783
JO - Journal of Systems Engineering and Electronics
JF - Journal of Systems Engineering and Electronics
IS - 5
ER -