Browse > Article
http://dx.doi.org/10.3745/KIPSTB.2011.18B.1.039

A Design and Analysis of Improved Firefly Algorithm Based on the Heuristic  

Rhee, Hyun-Sook (동양미래대학 전산정보학부)
Lee, Jung-Woo (서강대학교 컴퓨터공학과)
Oh, Kyung-Whan (서강대학교 컴퓨터공학과)
Publication Information
The KIPS Transactions:PartB / v.18B, no.1, 2011 , pp. 39-44 More about this Journal
Abstract
In this paper, we propose a method to improve the Firefly Algorithm(FA) introduced by Xin-She Yang, recently. We design and analyze the improved firefly algorithm based on the heuristic. We compare the FA with the Particle Swarm Optimization (PSO) which the problem domain is similar with the FA in terms of accuracy, algorithm convergence time, the motion of each particle. The compare experiments show that the accuracy of FA is not worse than PSO's, but the convergence time of FA is slower than PSO's. In this paper, we consider intuitive reasons of slow convergence time problem of FA, and propose the improved version of FA using a partial mutation heuristic based on the consideration. The experiments using benchmark functions show the accuracy and convergence time of the improved FA are better than them of PSO and original FA.
Keywords
Firefly Algorithm; Particle Swarm Optimization; Partial Mutation; Nature-inspired Stochastic Optimization;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A. L. Christensen, “From fireflies to fault-tolerant swarms of robots”, Evolutionary Computation, IEEE Transactions on Vol.13, pp.754-766, 2009   DOI   ScienceOn
2 A. Schworer, P. Hovey, “Newton-Raphson Versus Fisher Scoring Algorithm in Calculating Maximum Likelihood Estimates”, Electronic Proceedings of Undergraduate Mathematics Day, No.1, 2004.
3 A. E. Eiben, J. E. Smith, “Introduction to Evolutionary Computing”, Springer-Verlog, New York, 2003.
4 X.-S. Yang, “Firefly algorithms for multimodal optimization”, Stochastic Algorithms: Foundations and Applications, Lecture Notes in Computer Sciences, Vol. 5792, pp. 169-178, 2009.   DOI   ScienceOn
5 J. Kennedy, R. C. Eberhart, “입자 Swarm Optimization”, IEEE International Conference on Neural Network, Vol.4, pp.1942-1948, 1995   DOI
6 Y. Shi, R. C. Eberhart, “A modified 입자 swarm optimizer”, Proceedings of the IEEE International Conference on Evolutionary Computation, pp.69-73, 1998
7 Q, Zhang, G. Gu, “Path planning based on Improved binary 입자 swarm optimization Algorithm”, Robotics, Automation and Mechatronics, 2008 IEEE Conference on, pp.462-466
8 G. Bekey and J. Yuh, “The status of robotics,” IEEE Robotics and Automation Magazine, Vol.15, No.1, pp.80-86, 2008   DOI   ScienceOn
9 A. Howard, M. Matari'c, and G. Sukhatme., “Mobile sensor network deployment using potential fields: A distributed, scalable solution to the area coverage problem,” the 6th International Symposium on Distributed Autonomous Robotics Systems (DARS02), 2002
10 M. Gerke, “Genetic path planning for mobile robots”, American Control Conference, 1999.
11 T. Arei, J. Ota, “Motion Planning of Multiple Mobile Robots”, Proc. IEEE International Conference on Intelligent Robots and Automation, pp.1761-1768, 1992.