2018
DOI: 10.1007/978-981-13-2829-9_39
|View full text |Cite
|
Sign up to set email alerts
|

Cooperative Co-evolution with Principal Component Analysis for Large Scale Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…Mahdavi et al 11,29 comprehensively surveyed the research progress of DE and PSO in LSGO, and summarized three kinds of decomposition methods, that is, static grouping, learning‐based dynamic grouping and random dynamic grouping. Particularly, the dynamic grouping method can change the sizes of the subcomponents, in which the problem's characteristics are used to conduct the division of interacting decision variables before or during the optimization process 7,9,29,33,37 . Sun et al 33 originally developed a sufficient condition to judge whether the intersection of two unit vectors were nonempty, after which a recursive differential grouping strategy was derived to identify the interaction between two subsets of decision variables.…”
Section: Related Research Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Mahdavi et al 11,29 comprehensively surveyed the research progress of DE and PSO in LSGO, and summarized three kinds of decomposition methods, that is, static grouping, learning‐based dynamic grouping and random dynamic grouping. Particularly, the dynamic grouping method can change the sizes of the subcomponents, in which the problem's characteristics are used to conduct the division of interacting decision variables before or during the optimization process 7,9,29,33,37 . Sun et al 33 originally developed a sufficient condition to judge whether the intersection of two unit vectors were nonempty, after which a recursive differential grouping strategy was derived to identify the interaction between two subsets of decision variables.…”
Section: Related Research Workmentioning
confidence: 99%
“…Particularly, the dynamic grouping method can change the sizes of the subcomponents, in which the problem's characteristics are used to conduct the division of interacting decision variables before or during the optimization process. 7,9,29,33,37 Sun et al 33 originally developed a sufficient condition to judge whether the intersection of two unit vectors were nonempty, after which a recursive differential grouping strategy was derived to identify the interaction between two subsets of decision variables. Kim et al 7 proposed an efficient variable interdependency identification and decomposition method, in which three core strategies, that is, binary variable space search, dynamic perturbation caching and prevariable sorting, were used to execute variable decomposition without the loss of decomposition accuracy.…”
Section: Cooperative Coevolutionary Approachmentioning
confidence: 99%
“…This information is utilized in velocity vectors of particles. Because PCA is a powerful tool in dimensional reduction, it helped EAs solve high dimensional optimization problems [13,14]. Besides its application in designing search operators, local principal component analysis is used for building a regularity model in multiobjective estimation of distribution algorithms [15,16].…”
Section: Introductionmentioning
confidence: 99%