Abstract
Meta-heuristics are some of the best-known techniques to approach hard optimization problems, however, there are still questions about what makes some meta-heuristics better than others in a specific problem. This paper presents an analysis of the Firefly and Cuckoo Search Algorithm, such as others meta-heuristics. In order to assess the performance of the Firefly Algorithm and the Cuckoo Search Algorithm, they were compared with other well-known optimization techniques, such as Simulated Annealing and Local Search. Both meta-heuristics analysed in an in-depth computational study, reaching the conclusion that both techniques could be useful in Scheduling Problems and lead to satisfactory solutions quickly and efficiently. Moreover, the results of the analysis show that the Firefly Algorithm, despite having a high runtime, performs better than the other techniques.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
