Comparison of PSO, FA, and BA for Discrete Optimization Problems

Abstract

Swarm intelligence (SI) is widely applied for optimizing both continuous and discrete problems. Many papers have investigated them for continuous optimizations since most swarm-based algorithms are designed based on continuous movements, which are simply calculated using vector-based mathematical operations. It is quite easy to select the best SI algorithm for a given continuous problem. However, it is quite hard to pick an optimum SI algorithm for a discrete problem since the individual movement is difficult to develop. Therefore, in this paper, three SI algorithms: particle swarm optimization (PSO), firefly algorithm (FA), and bat algorithm (BA), are compared to solve some cases of traveling salesman problem (TSP). Evaluation on four TSP cases show that FA is the most effective and efficient since it dynamically evolves some individuals' groups and balances the exploitative-explorative movements.