Publicação
Firefly and cuckoo search algorithm for scheduling problems: a performance analysis
| Resumo: | 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. |
|---|---|
| Autores principais: | Moreira, Carlota |
| Outros Autores: | Costa, Catarina; Santos, André S.; Bastos, João A.; Varela, M.L.R.; Brito, Marlene F. |
| Assunto: | Cuckoo search algorithm Firefly algorithm Meta-heuristics Simulated annealing |
| Ano: | 2023 |
| País: | Portugal |
| Tipo de documento: | comunicação em conferência |
| Tipo de acesso: | acesso restrito |
| Instituição associada: | Universidade do Minho |
| Idioma: | inglês |
| Origem: | RepositóriUM - Universidade do Minho |
| Resumo: | 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. |
|---|