Analysis and Comparison of Firefly Algorithm for Measuring Convergence Rate in Distributed Environment
摘要
Evolutionary algorithms are widely adapted by researcher for obtaining optimal result in different applications. Firefly algorithm is one of the important evolutionary algorithms used for Various optimization problems. Firefly uses non-linear updating equations. They create high convergence and distinguished from other comparative approaches. In this work exhaustive analysis of firefly algorithm has been demonstrated by varying different convergence expressions. Performance is evaluated by varying the randomness strength and population size. The modified Firefly algorithm is also compared with other competitive appearance like Particle swarm optimization, Genetic algorithm, Cat swarm optimization, Dragonfly algorithm and results are illustrated.