2019
DOI: 10.1016/j.swevo.2018.10.005
|View full text |Cite
|
Sign up to set email alerts
|

A cluster-based clonal selection algorithm for optimization in dynamic environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 28 publications
(12 citation statements)
references
References 26 publications
0
12
0
Order By: Relevance
“…CSA is an evolutionary algorithm, inspired by the natural phenomenon of the biological immune system, which defends the body against external microorganisms. [ 42 ] reviewed recent works by researchers implementing CSA into their proposed network to deal with constraint optimization tasks, such as pattern recognition [ 43 ], scheduling [ 44 ], fault detection [ 45 ] and dynamic optimization [ 46 ]. Mechanisms of CSA gives the inspiration of specific cells to recognize specific antigens which are later selected to proliferate.…”
Section: Introductionmentioning
confidence: 99%
“…CSA is an evolutionary algorithm, inspired by the natural phenomenon of the biological immune system, which defends the body against external microorganisms. [ 42 ] reviewed recent works by researchers implementing CSA into their proposed network to deal with constraint optimization tasks, such as pattern recognition [ 43 ], scheduling [ 44 ], fault detection [ 45 ] and dynamic optimization [ 46 ]. Mechanisms of CSA gives the inspiration of specific cells to recognize specific antigens which are later selected to proliferate.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, Luo et al (2019) proposed a distributed multiple population framework to increase algorithm diversity for solving DOP. Zhang et al (2019b) proposed a new cluster-based clonal selection algorithm, where a max-min distance cluster method based on the fitness and Euclidean distance was used to partition the population. Vafashoar and Meybodi (2020) proposed a multipopulation DE algorithm, which is different from past heterogeneous algorithms.…”
Section: (A) Multi-populationsmentioning
confidence: 99%
“…where g * (i) is the best found position in the ith iteration. This method is first introduced in [36] and then has been used in several DOAs [37]- [41]. A considerable flaw is that it only can detect convergence if the best found position has not improved.…”
Section: A Convergence Detectionmentioning
confidence: 99%