A fireworks algorithm using tournament selection operator

In recent decade, several nature-inspired swarm intelligence-based optimization techniques have been improved. these techniques, which give solutions close to optimum in an acceptable time, have been applied successfully to solve the problems in science and social sciences. fireworks algorithm (fa), inspired by observing fireworks explosion, is a new swarm intelligence algorithm. this relatively new technique has been utilized to tackle diverse problems and obtained better performance than other popular techniques such as particle swarm optimization, ant colony, and genetic algorithm. despite the good results obtained, fa requires long computation time to achieve the optimum solution. to eliminate long computation time drawback of fa, in this study, a fa using tournament selection is proposed. the performance of the proposed fa, which involves tournament selection operator, is tested on well-known 15 numerical optimization problems. experimental results reveal that proposed fa has a significant performance improvement in term of computation time and solution quality in comparison with original fa.