Proceedings of the Genetic and Evolutionary Computation Conference Companion 2019
DOI: 10.1145/3319619.3322068
|View full text |Cite
|
Sign up to set email alerts
|

Operational decomposition for large scale multi-objective optimization problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…In contrast, the diversity-related variables help LSMOEAs find the solution sets with a better distribution. Existing decision-variable grouping strategies can be divided into fixed grouping strategies [ 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 ] and dynamic grouping strategies [ 21 , 22 , 23 , 24 ]. In a fixed grouping strategy, the grouping results do not change during the evolution process, i.e., the evolutionary algorithm for large-scale many-objective optimization, LMEA.…”
Section: Introductionmentioning
confidence: 99%
“…In contrast, the diversity-related variables help LSMOEAs find the solution sets with a better distribution. Existing decision-variable grouping strategies can be divided into fixed grouping strategies [ 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 ] and dynamic grouping strategies [ 21 , 22 , 23 , 24 ]. In a fixed grouping strategy, the grouping results do not change during the evolution process, i.e., the evolutionary algorithm for large-scale many-objective optimization, LMEA.…”
Section: Introductionmentioning
confidence: 99%