2019
DOI: 10.1007/978-981-13-7166-0_21
|View full text |Cite
|
Sign up to set email alerts
|

Analytical Assessment of Nature-Inspired Metaheuristic Algorithms to Elucidate Assembly Line Task Scheduling Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…20 The CS algorithm reaches optimum or near-optimum solutions in less time than many other similar algorithms. Like population-depended algorithms, the CS algorithm contains a few drawbacks, 21 such as slower convergence velocity and simply getting stuck in local optima for a few intricate issues. 22 Therefore, we have attempted to combine cuckoo birds' real-life behaviors with GA operators, like selection, crossover, and mutation, to develop a hybrid GA and CS (CS-GA).…”
Section: Introductionmentioning
confidence: 99%
“…20 The CS algorithm reaches optimum or near-optimum solutions in less time than many other similar algorithms. Like population-depended algorithms, the CS algorithm contains a few drawbacks, 21 such as slower convergence velocity and simply getting stuck in local optima for a few intricate issues. 22 Therefore, we have attempted to combine cuckoo birds' real-life behaviors with GA operators, like selection, crossover, and mutation, to develop a hybrid GA and CS (CS-GA).…”
Section: Introductionmentioning
confidence: 99%