Modified Firefly Algorithm

Abstract

Firefly algorithm is one of the new metaheuristic algorithms for optimization problems. The algorithm is inspired by the flashing behavior of fireflies. In the algorithm, randomly generated solutions will be considered as fireflies, and brightness is assigned depending on their performance on the objective function. One of the rules used to construct the algorithm is, a firefly will be attracted to a brighter firefly, and if there is no brighter firefly, it will move randomly. In this paper we modify this random movement of the brighter firefly by generating random directions in order to determine the best direction in which the brightness increases. If such a direction is not generated, it will remain in its current position. Furthermore the assignment of attractiveness is modified in such a way that the effect of the objective function is magnified. From the simulation result it is shown that the modified firefly algorithm performs better than the standard one in finding the best solution with smaller CPU time.

A comprehensive review of firefly algorithms

“…Both factors allow significant scope for algorithm improvements ( Table 2). For example, Luleseged et al [46] modified the random movement of the brightest firefly that in some generations, when the current best position does not improve, may decreases its brightness. The proposed modification tries to improve the brightest firefly position generating the m-uniform random vectors and moves it in the direction of the best performance.…”

A Systematic Review on Firefly Algorithm: Past, Present, and Future

“…Surafel et al [15] changed the random movement of brightest firefly and find out that brightness of light gets decreased if the current best position stop improving further. They tried to enhance the position of brightest firefly which follows m-uniform random walk and move in best position direction.…”

Discrete Firefly Algorithm for Clustered Multi-Temperature Joint Distribution with Fuzzy Travel Times

“…They suggested randomly choosing a direction in which the brightness of the brightest firefly increases if the firefly moves in that direction. If there exists no such direction, the brightest firefly must stay in its current position [31] . However, the brightest firefly F j will cease moving in the discrete firefly algorithm proposed here, because r jj =0 and consequently n=0 by applying Eq.…”