2016
DOI: 10.1155/2016/4839763
|View full text |Cite
|
Sign up to set email alerts
|

Cuckoo Search Algorithm with Hybrid Factor Using Dimensional Distance

Abstract: This paper proposes a hybrid factor strategy for cuckoo search algorithm by combining constant factor and varied factor. The constant factor is used to the dimensions of each solution which are closer to the corresponding dimensions of the best solution, while the varied factor using a random or a chaotic sequence is utilized to farer dimensions. For each solution, the dimension whose distance to the corresponding one of the best solution is shorter than mean distance of all dimensional distances will be regar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 43 publications
(96 reference statements)
0
6
0
Order By: Relevance
“…where Γ denotes the Gamma function while is a random number in range [0,2]. In this paper this value is selected to be 1.5 [49]. According to [50], updating concentration based on Lèvy distribution can be expressed as:…”
Section: Levy Spiral Flight Equilibrium Optimizermentioning
confidence: 99%
“…where Γ denotes the Gamma function while is a random number in range [0,2]. In this paper this value is selected to be 1.5 [49]. According to [50], updating concentration based on Lèvy distribution can be expressed as:…”
Section: Levy Spiral Flight Equilibrium Optimizermentioning
confidence: 99%
“…According to [10], Cuckoo Search using two random walks, Lévy Flights Random Walk (LFRW) and biased Random Walk (BRW). Lévy Flights Random Walk (LFRW) is a random walk with stepsize based on the Lévy distribution.…”
Section: Cuckoo Search Algorithmmentioning
confidence: 99%
“…where and V are random numbers and obey the normal distribution; Γ is the standard Gamma function and is a parameter usually taken as 1.5 [29]. Therefore, the update formula of CS algorithm can be calculated as…”
Section: The Standard Cs Algorithmmentioning
confidence: 99%
“…where is discovery probability; 1 and 2 are two randomly selected solutions [29]. If the objective function of is smaller than ( + 1), is regarded as the next generation solution; otherwise ( + 1) would remain unchanged.…”
Section: The Standard Cs Algorithmmentioning
confidence: 99%