A two-stage evolutionary algorithm based on three indicators for constrained multi-objective optimization

One of the key issues in solving constrained multi-objective optimization problems (CMOPs) is balancing the three indicators of convergence, diversity, and feasibility. We believe at different stages of the evolution, different indicators should be emphasized. This paper proposes a two-stage constra...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Expert systems with applications Ročník 195; s. 116499
Hlavní autoři: Dong, Jun, Gong, Wenyin, Ming, Fei, Wang, Ling
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.06.2022
Elsevier BV
Témata:
Benchmarks
Constrained multi-objective optimization
Convergence
Diversity
Evolutionary algorithm
Evolutionary algorithms
Feasibility
Genetic algorithms
Indicators
Multiple objective analysis
Pareto optimization
Performance evaluation
Two-stage
Constrained multi-objective optimization
Feasibility
Two-stage
Evolutionary algorithm
Diversity
Convergence
ISSN:0957-4174, 1873-6793
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í:One of the key issues in solving constrained multi-objective optimization problems (CMOPs) is balancing the three indicators of convergence, diversity, and feasibility. We believe at different stages of the evolution, different indicators should be emphasized. This paper proposes a two-stage constrained multi-objective evolutionary algorithm (CMOEA) with different emphases on the three indicators. In Stage-I, the Pareto nondominated sorting and the unbiased two-objective model are used to evaluate the three indicators. The purpose of Stage-I is to obtain solutions with good distribution and to prevent the population from falling into local optima. After Stage-I, almost all of the individuals in the population are distributed in the vicinity of all feasible areas. The goal of Stage-II is to quickly converge the population to the Pareto front (PF). Thirty benchmark CMOPs and four real-world problems were used to evaluate the performance of our algorithm. Experimental results indicate that our approach achieved significantly better results or was at least competitive to the compared eight state-of-the-art CMOEAs on most of the benchmark problems. •A TSTI method is proposed for the CMOPs.•Two stages are used in TSTI with different goals.•TSTI obtains better results compared with six related methods.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2022.116499