Evolutionary Dynamic Constrained Multiobjective Optimization: Test Suite and Algorithm

Dynamic constrained multiobjective optimization problems (DCMOPs) abound in real-world applications and gain increasing attention in the evolutionary computation community. To evaluate the capability of an algorithm in solving dynamic constrained multiobjective optimization problems (DCMOPs), artifi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on evolutionary computation Ročník 28; číslo 5; s. 1381 - 1395
Hlavní autoři: Chen, Guoyu, Guo, Yinan, Wang, Yong, Liang, Jing, Gong, Dunwei, Yang, Shengxiang
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.10.2024
Témata:
Benchmark testing
Diversity
Diversity reception
dynamic constrained multiobjective optimization
evolutionary algorithm
Heuristic algorithms
Linear programming
Optimization
Sociology
Statistics
test suite
ISSN:1089-778X, 1941-0026
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Dynamic constrained multiobjective optimization problems (DCMOPs) abound in real-world applications and gain increasing attention in the evolutionary computation community. To evaluate the capability of an algorithm in solving dynamic constrained multiobjective optimization problems (DCMOPs), artificial test problems play a fundamental role. Nevertheless, some characteristics of real-world scenarios are not fully considered in the previous test suites, such as time-varying size, location, and shape of feasible regions, the controllable change severity, as well as small feasible regions. Therefore, we develop the generators of objective functions and constraints to facilitate the systematic design of DCMOPs, and then a novel test suite consisting of nine benchmarks, termed as DCP, is put forward. To solve these problems, a dynamic constrained multiobjective evolutionary algorithm (DCMOEA) with a two-stage diversity compensation strategy (TDCEA) is proposed. Some initial individuals are randomly generated to replace historical ones in the first stage, improving the global diversity. In the second stage, the increment between center points of Pareto sets in the past two environments is calculated and employed to adaptively disturb solutions, forming an initial population with good diversity for the new environment. Intensive experiments show that the proposed test problems enable a good understanding of strengths and weaknesses of algorithms, and TDCEA outperforms other state-of-the-art comparative ones, achieving promising performance in tackling DCMOPs.
ISSN:1089-778X
1941-0026
DOI:10.1109/TEVC.2023.3313689