Firefly algorithm efficiency analisys in case of global optimization problem
This paper represents a firefly algorithm, which is one of heuristic algorithms. It is classified among swarm intelligence algorithms, which are being developed rapidly nowdays. The method's efficiency has been tested in case of global optimization problem (finding De Jong's, Rastrigin's and Rosenbroke's functions' optimums). It is based on swarm's of fireflies flashing behaviour that move towards the brightest member of the swarm. The firefly algorithm shows good results at processing both unimodal functions with a single global optimum and multi-extremum functions. The detiled description of the algorithm has been formulated. Its efficiency has been researched depending on different sets of input parameters. Optimal coefficients' values and optimal number of searching agents have been obtained experimentally.