2017 International Conference on Industrial Informatics - Computing Technology, Intelligent Technology, Industrial Information 2017
DOI: 10.1109/iciicii.2017.45
|View full text |Cite
|
Sign up to set email alerts
|

Multiple-Population Jaya Algorithm for Continuous Function Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…It has been proved that, compared with a single population, algorithms with multiple populations can effectively improve solution diversity for both single-objective optimization problems [5,32,33] and MOOPs [13,31,42] by dividing the population into multiple co-evolutionary/cooperative subpopulations. Nevertheless, some multi-population algorithms, such as MPEA/SG [30] and CIEMO/D [40], change the number of subpopulations during evolution, which makes it a tough challenge to determine the appropriate number of subpopulations when solving MaOPs.…”
Section: Introductionmentioning
confidence: 99%
“…It has been proved that, compared with a single population, algorithms with multiple populations can effectively improve solution diversity for both single-objective optimization problems [5,32,33] and MOOPs [13,31,42] by dividing the population into multiple co-evolutionary/cooperative subpopulations. Nevertheless, some multi-population algorithms, such as MPEA/SG [30] and CIEMO/D [40], change the number of subpopulations during evolution, which makes it a tough challenge to determine the appropriate number of subpopulations when solving MaOPs.…”
Section: Introductionmentioning
confidence: 99%