##
**Modified firefly algorithm.**
*(English)*
Zbl 1268.65082

Summary: The 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 are 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.

### MSC:

65K05 | Numerical mathematical programming methods |

90C15 | Stochastic programming |

90C59 | Approximation methods and heuristics in mathematical programming |

### Software:

PLCP
PDFBibTeX
XMLCite

\textit{S. L. Tilahun} and \textit{H. C. Ong}, J. Appl. Math. 2012, Article ID 467631, 12 p. (2012; Zbl 1268.65082)

Full Text:
DOI

### References:

[1] | N. Svilen and Z. Tsvetan, “Load optimization in training the olympic rowing (Skiff) champion from Beijing, 2008: case study,” Serbian Journal of Sports Sciences, vol. 5, pp. 41-50, 2011. |

[2] | X. Gong, S. A. Vorobyov, and C. Tellambura, “Optimal bandwidth and power allocation for sum ergodic capacity under fading channels in cognitive radio networks,” IEEE Transactions on Signal Processing, vol. 59, no. 4, pp. 1814-1826, 2011. · Zbl 1392.94225 · doi:10.1109/TSP.2010.2101069 |

[3] | S. S. Rao, Engineering Optimization: Theory and Practice, John Wiley & Sons, 3rd edition, 2009. |

[4] | D. W. K. Yeung and L. A. Petrosyan, Subgame Consistent Economic Optimization: An Advanced Cooperative Dynamic Game Analysis, Birkhäuser, 2011. · Zbl 1272.91006 |

[5] | R. J. Vanderbei, Linear Programming: Foundations and Extensions, International Series in Operations Research & Management Science, Springer, 3rd edition, 2008. · Zbl 0874.90133 · doi:10.1007/978-0-387-74388-2 |

[6] | J. F. Bonnans, J. C. Gilbert, C. Lemaréchal, and C. A. Sagastizábal, Numerical Optimization: Theoretical and Practical Aspects, Springer, 2003. · Zbl 1014.65045 |

[7] | R. Fletcher, Practical Methods of Optimization, John Wiley & Sons, 2000. · Zbl 0905.65002 |

[8] | E. G. Talbi, Metaheuristics: From Design to Implementation, John Wiley & Sons, 2009. · Zbl 1190.90293 |

[9] | T. Apostolopoulos and A. Vlachos, “Application of the firefly algorithm for solving the economic emissions load dispatch problem,” International Journal of Combinatorics, vol. 2011, Article ID 523806, 23 pages, 2011. · Zbl 1279.90198 |

[10] | S. L. Tilahun and H. C. Ong, “Bus timetabling as a fuzzy multiobjective optimization problem using preference based genetic algorithm,” Promet Traffic & Transportation, vol. 24, no. 3, 2012. · doi:10.7307/ptt.v24i3.311 |

[11] | J. Y. Wang and C. M. Lin, “Mass transit route network design using genetic algorithm,” Journal of the Chinese Institute of Engineers, vol. 33, no. 2, pp. 301-315, 2010. · doi:10.1080/02533839.2010.9671619 |

[12] | M. Negnevitsky, Artificial Intelligence: A Guide To Intelligent System, Henry Ling Limited, Harlow, England, 2005. |

[13] | X. S. Yang, “Firefly algorithms for multimodal optimization,” in Proceedings of the 5th International Conference on Stochastic Algorithms: Foundation and Applications (SAGA ’09), vol. 5792 of Lecture notes in Computer Science, pp. 169-178, 2009. · Zbl 1260.90164 |

[14] | X. S. Yang, Nature-Inspired Metaheuristic Algorithm, Luniver Press, Beckington, UK:, 2nd edition, 2010. · Zbl 1197.90348 |

[15] | M. Molga and C. Smutnicki, Test functions for optimization needs, 2005, http://www.zsd.ict.pwr.wroc.pl/files/docs/functions.pdf. |

[16] | E. J. S. Pires, J. A. T. MacHado, P. B. De Moura Oliveira, J. B. Cunha, and L. Mendes, “Particle swarm optimization with fractional-order velocity,” Nonlinear Dynamics, vol. 61, no. 1-2, pp. 295-301, 2010. · Zbl 1204.90119 · doi:10.1007/s11071-009-9649-y |

[17] | J. G. Digalalis and K. G. Margaritis, “On benchmarking functions for genetic algorithm,” International Journal of Computer Mathematics, vol. 1, pp. 1-27, 2000. |

[18] | S. K. Mishra, Repulsive Particle Swarm Method on Some Diffcult Test Problems of Global Optimization, North-Eastern Hill University (NEHU), Meghalaya, India, 2006, http://ssrn.com/abstract=928538. |

[19] | X. S. Yang and Firefly Algorithm, “Stochastic test functions and design optimisation,” International Journal of Bio-Inspired Computation, vol. 2, no. 2, p. 7884, 2010. |

[20] | P. Ittipong, P. Luangpaiboon, and P. Pongcharoen, “Solving nonlinear continuous mathematical models using shuffled frog leaping and memetic algorithms,” in Operations Research Network in Thailand (OR-NET ’08), vol. 25, pp. 79-85, 2008, http://as.nida.ac.th/ornet/ORNET2008/08papers/79-85.pdf. |

[21] | M. Molga and C. Smutnicki, Test functions for optimization needs, 2005, http://www.bioinformaticslaboratory.nl/twikidata/pub/Education/NBICResearchSchool/Optimization/VanKampen/BackgroundInformation/TestFunctions-Optimization.pdf. |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.