1. Dynamic Selection Preference-Assisted Constrained Multiobjective Differential Evolution
- Author
-
Kunjie Yu, Yong Luo, Boyang Qu, Caitong Yue, and Jing Liang
- Subjects
0209 industrial biotechnology ,Mathematical optimization ,Computer science ,Pareto principle ,Evolutionary algorithm ,02 engineering and technology ,Computer Science Applications ,Human-Computer Interaction ,Constraint (information theory) ,020901 industrial engineering & automation ,Control and Systems Engineering ,Search algorithm ,Differential evolution ,Convergence (routing) ,0202 electrical engineering, electronic engineering, information engineering ,Benchmark (computing) ,020201 artificial intelligence & image processing ,Electrical and Electronic Engineering ,Software ,Selection (genetic algorithm) - Abstract
Solving constrained multiobjective optimization problems brings great challenges to an evolutionary algorithm, since it simultaneously requires the optimization among several conflicting objective functions and the satisfaction of various constraints. Hence, how to adjust the tradeoff between objective functions and constraints is crucial. In this article, we propose a dynamic selection preference-assisted constrained multiobjective differential evolutionary (DE) algorithm. In our approach, the selection preference of each individual is suitably switching from the objective functions to constraints as the evolutionary process. To be specific, the information of objective function, without considering any constraints, is extracted based on Pareto dominance to maintain the convergence and diversity by exploring the feasible and infeasible regions; while the information of constraint is used based on constrained dominance principle to promote the feasibility. Then, the tradeoff in these two kinds of information is adjusted dynamically, by emphasizing the utilization of objective functions at the early stage and focusing on constraints at the latter stage. Furthermore, to generate the promising offspring, two DE operators with distinct characteristics are selected as components of the search algorithm. Experiments on four test suites including 56 benchmark problems indicate that the proposed method exhibits superior or at least competitive performance, in comparison with other well-established methods.
- Published
- 2022