A double auxiliary optimization constrained multi-objective evolutionary algorithm

In evolutionary constrained multi-objective optimization, the use of auxiliary optimization is gradually attracting attention. It is noted that different forms of auxiliary optimization have different advantages. Combining these advantages in an appropriate manner can further improve the algorithm’s...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Mathematics and computers in simulation Ročník 220; s. 567 - 579
Hlavní autori: Yang, Yongkuan, Yan, Bing, Kong, Xiangsong, Zhao, Jing
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.06.2024
Predmet:
Constrained multi-objective optimization
Evolutionary algorithms
Multi-auxiliary optimization
Tri-population co-evolution
Multi-auxiliary optimization
Constrained multi-objective optimization
Tri-population co-evolution
Evolutionary algorithms
ISSN:0378-4754, 1872-7166
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In evolutionary constrained multi-objective optimization, the use of auxiliary optimization is gradually attracting attention. It is noted that different forms of auxiliary optimization have different advantages. Combining these advantages in an appropriate manner can further improve the algorithm’s performance. Motivated by this inspiration, we propose a double auxiliary optimization constrained multi-objective evolutionary algorithm, namely DAO. In DAO, two auxiliary optimizations, i.e., the unconstrained optimization and the (M+1)-objective optimization, are applied in a proposed tri-population co-evolution strategy. In this strategy, three populations are used to optimize the core optimization and the two auxiliary optimizations in an interactive evolution form. Furthermore, DAO develops a (M+1)-objective environmental selection strategy to deeply explore the boundary between the feasible and infeasible regions. In experimental studies, the performance of DAO and four other state-of-the-art algorithms is evaluated on three distinct benchmark test suites and two intricate real-world problem scenarios. The outcome of the comprehensive evaluation shows the competitive of DAO solving constrained multi-objective optimization problems.
ISSN:0378-4754
1872-7166
DOI:10.1016/j.matcom.2024.02.012