Two-Archive Evolutionary Algorithm for Constrained Multiobjective Optimization

When solving constrained multiobjective optimization problems, an important issue is how to balance convergence, diversity, and feasibility simultaneously. To address this issue, this paper proposes a parameter-free constraint handling technique, a two-archive evolutionary algorithm, for constrained...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on evolutionary computation Ročník 23; číslo 2; s. 303 - 315
Hlavní autori: Li, Ke, Chen, Renzhi, Fu, Guangtao, Yao, Xin
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.04.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Archives & records
Constraint handling
Convergence
decomposition-based technique
evolutionary algorithm (EA)
Evolutionary algorithms
Evolutionary computation
Genetic algorithms
Linear programming
Mathematical programming
multiobjective optimization
Multiple objective analysis
Optimization
Parents
Sociology
Sorting
Statistics
two-archive strategy
ISSN:1089-778X, 1941-0026
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:When solving constrained multiobjective optimization problems, an important issue is how to balance convergence, diversity, and feasibility simultaneously. To address this issue, this paper proposes a parameter-free constraint handling technique, a two-archive evolutionary algorithm, for constrained multiobjective optimization. It maintains two collaborative archives simultaneously: one, denoted as the convergence-oriented archive (CA), is the driving force to push the population toward the Pareto front; the other one, denoted as the diversity-oriented archive (DA), mainly tends to maintain the population diversity. In particular, to complement the behavior of the CA and provide as much diversified information as possible, the DA aims at exploring areas under-exploited by the CA including the infeasible regions. To leverage the complementary effects of both archives, we develop a restricted mating selection mechanism that adaptively chooses appropriate mating parents from them according to their evolution status. Comprehensive experiments on a series of benchmark problems and a real-world case study fully demonstrate the competitiveness of our proposed algorithm, in comparison to five state-of-the-art constrained evolutionary multiobjective optimizers.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-778X
1941-0026
DOI:10.1109/TEVC.2018.2855411