2023
DOI: 10.1109/tcyb.2022.3151974
|View full text |Cite
|
Sign up to set email alerts
|

An Evolutionary Algorithm With Constraint Relaxation Strategy for Highly Constrained Multiobjective Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 23 publications
(5 citation statements)
references
References 63 publications
0
5
0
Order By: Relevance
“…However, this model suffers from slow convergence speed and long computation time. An optimization algorithm based on augmented electron constraints is established by Sun [15]. It implements the optimization search process by simulating the motion of particles in the electron cloud.…”
Section: Related Workmentioning
confidence: 99%
“…However, this model suffers from slow convergence speed and long computation time. An optimization algorithm based on augmented electron constraints is established by Sun [15]. It implements the optimization search process by simulating the motion of particles in the electron cloud.…”
Section: Related Workmentioning
confidence: 99%
“…To date, co-evolutionary algorithms have shown their effectiveness in solving complex constrained optimization problems in many works (Li et al, 2019b;Tian et al, 2021;Qiao et al, 2022a;Sun et al, 2023). These algorithms often co-evolve multiple populations, where one population is used to solve the original problem and the other populations are used to solve helper problems.…”
Section: General Framework Of Tpcmaomentioning
confidence: 99%
“…In our experimental comparison, we used the inverted generational distance (IGD) [88] and the hypervolume (HV) [89] to evaluate the performance of different algorithms. The performance of the algorithm can be fully measured by the IGD and HV metrics [90,91].…”
Section: Performance Metricmentioning
confidence: 99%