2017
DOI: 10.1007/978-3-319-52015-5_39
|View full text |Cite
|
Sign up to set email alerts
|

A Novel PSO-DE Co-evolutionary Algorithm Based on Decomposition Framework

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…To make the evolutionary search converge faster, researchers have proposed many methods, including modification of evolutionary operators [31], using elite archive [32], ensembles [33] to increase the chance of selecting better parents, and niching methods [34] for local exploitation [35]. In terms of population diversity, some approaches have designed for escaping local optima and improving the performance of exploration [36]. Regarding the above two issues, in this research we will propose a novel GA with an elite archive for increasing convergence and a mating selection strategy which allows one parent to be selected from the whole population for increasing diversity.…”
Section: Evolutionary Computationmentioning
confidence: 99%
“…To make the evolutionary search converge faster, researchers have proposed many methods, including modification of evolutionary operators [31], using elite archive [32], ensembles [33] to increase the chance of selecting better parents, and niching methods [34] for local exploitation [35]. In terms of population diversity, some approaches have designed for escaping local optima and improving the performance of exploration [36]. Regarding the above two issues, in this research we will propose a novel GA with an elite archive for increasing convergence and a mating selection strategy which allows one parent to be selected from the whole population for increasing diversity.…”
Section: Evolutionary Computationmentioning
confidence: 99%
“…In this way, particles will expand to farthest points in search space and have ability to converge faster than PSO . Moreover, researchers have already compared evolutionary algorithms like NSGA II (non‐dominated sorting genetic algorithm) with PSO‐DE for constrained optimization and found that PSO‐DE has performed better than NSGA II and other algorithms in literature. Moreover, PSO‐DE also has shown good results when compared with other PSO variants and DE variants …”
Section: Hierarchical Coordination and Optimization Frameworkmentioning
confidence: 99%