Computer Engineering & Science ›› 2020, Vol. 42 ›› Issue (08): 1454-1462.
Previous Articles Next Articles
MA Yong-jie,CHEN Man-li,CHEN Min
Received:
Revised:
Accepted:
Online:
Published:
Abstract: Aimed at the problems of slow convergence and difficulty in maintaining diversity, a dynamic multi-objective evolutionary algorithm based on Pareto solution set segmentation prediction is proposed. When the environmental change is detected, the Pareto optimal solution obtained from the evolution at the previous moment is sorted according to a sub-objective function and divided into three segments according to the size of the sub-objective, then the moving direction of the center point of each Pareto solution set is calculated. Each Pareto subset is systematically sampled to obtain the feature points of the Pareto frontier surface, and the linear model is used to predict the next generation population. According to the difficulty of the optimization problem, adaptive random populations are generated around the predicted population to increase the diversity of the population. Experiments on the three types of standard test functions show that the algorithm can effectively solve the dynamic multi-objective optimization problem.
Key words: dynamic multi-objective optimization, segmentation prediction, system sampling, guiding individuals
CLC Number:
A dynamic multi-objective evolutionary algorithm based 
on Pareto solution set segmentation prediction strategy
MA Yong-jie, CHEN Man-li, CHEN Min. A dynamic multi-objective evolutionary algorithm based on Pareto solution set segmentation prediction strategy[J]. Computer Engineering & Science, 2020, 42(08): 1454-1462.
0 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://joces.nudt.edu.cn/EN/
http://joces.nudt.edu.cn/EN/Y2020/V42/I08/1454