2020
DOI: 10.1177/1748302620962403
|View full text |Cite
|
Sign up to set email alerts
|

Improved cuckoo search algorithm and its application to permutation flow shop scheduling problem

Abstract: Aiming at the problem that the standard cuckoo search algorithm relies on Levy flights, which leads to the step-size randomness of the search process, a self-adaptive step cuckoo search algorithm based on dynamic balance factor is proposed in our paper. First, two parameters are introduced in our paper, which were iteration number ratio parameter and adaptability ratio parameter. Then, a dynamic balance factor parameter is introduced to adjust the weight number of iteration number ratio parameter and adaptabil… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 21 publications
0
8
0
Order By: Relevance
“…In order to evaluate the performance of the computer software, a large number of simulations were conducted. The optimization calculations were performed for the following CS algorithm settings: the number of cuckoos is N = 54 [60][61][62], the number of nests is n = 72, the maximum number of iterations is t max = 30, and the probability is p a = 0.25. The value of the constant coefficient that determines the size of the penalty is γ = 0.55.…”
Section: Results Of Constrained Optimizationmentioning
confidence: 99%
“…In order to evaluate the performance of the computer software, a large number of simulations were conducted. The optimization calculations were performed for the following CS algorithm settings: the number of cuckoos is N = 54 [60][61][62], the number of nests is n = 72, the maximum number of iterations is t max = 30, and the probability is p a = 0.25. The value of the constant coefficient that determines the size of the penalty is γ = 0.55.…”
Section: Results Of Constrained Optimizationmentioning
confidence: 99%
“…We noticed that the issue related to production programs has been approached from several perspectives, as is a complex optimization problem that has been analyzed from different perspectives by different researchers. For example, models such as backpack modelling [23][24][25], the PSO-GA hybrid algorithm [26][27][28], the tabu search algorithm [29][30][31][32], the improved cuckoo search (ICS) [33][34][35], Lagrangian heuristic algorithm and other heuristic algorithms [36][37][38][39][40], the mixed model [36][37][38][39][40][41][42][43], and so on, are other types of models used in the literature.…”
Section: Dao and Marianmentioning
confidence: 99%
“…Cuckoo search (CS) algorithm is a novel intelligent optimization algorithm proposed by Yang [13], which is inspired by the parasitic breeding habit of cuckoos, and it adopts the Lévy ight mode to update the individuals, which can effectively jump out of the local optimum. With the advantages of few parameters, simple operation, fast convergence and strong global optimization ability, the CS algorithm has been successfully applied to a variety of elds, such as multi-objective optimization [14,15], image processing [16,17], resource allocation [18,19], control problems [20,21], and computer vision [22].…”
Section: Introductionmentioning
confidence: 99%