Publication

Bat algorithm for discrete optimization problems: an analysis

View document

Bibliographic Details
Summary:In this article the application of the discrete version of the bat algorithm to flowshop scheduling problems is presented and compared with Simulated Annealing, Local Search, as well as versions of each that start from constructive heuristics (Palmer and CDS). Bat algorithm is a novel metaheuristic, developed for continuous problems that has shown exceptional results. This paper intends to assess its effectiveness and efficiency for discrete problems when compared with other optimization techniques, including Simulated Annealing and Local Search, whose results are already proven. First, it was developed a literature review about those algorithms, then they were implemented in VBA with Microsoft Excel. Once implemented, the parameterization was carried out, ensuring an adequate application of the algorithms before they can be compared. Then, the methods were applied for 30 normally distributed instances, in order to draw broader conclusions. Finally, a statistical evaluation was carried out and concluded the inferiority of the Local Search in relation to the metaheuristics and the superiority of the hybrid version of the Bat Algorithm with CDS in relation to Simulated Annealing, with significantly better solutions, in an equal computation time.
Main Authors:Sousa, Bruno
Other Authors:Guerreiro, Rita; Santos, André S.; Bastos, João A.; Varela, M.L.R.; Brito, Marlene F.
Subject:Bat algorithm Dudek and smith Flowshop Metaheuristics Palmer and Campbell Simulated annealing
Year:2023
Country:Portugal
Document type:conference paper
Access type:restricted access
Associated institution:Universidade do Minho
Language:English
Origin:RepositóriUM - Universidade do Minho

Similar Items

Similar Items