The Chaos and Stability of Firefly Algorithm Adjacent Individual
In this paper, in order to overcome the defect of the firefly algorithm, for example, the slow convergence rate, low accuracy and easily falling into the local optima in the global optimization search, we propose a dynamic population firefly algorithm based on chaos. The stability between the fireflies is proved, and the similar chaotic phenomenon in firefly algorithm can be simulated.
Article MetricsAbstract view : 266 times
PDF - 152 times
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
TELKOMNIKA Telecommunication, Computing, Electronics and Control
ISSN: 1693-6930, e-ISSN: 2302-9293
Universitas Ahmad Dahlan, 4th Campus, 9th Floor, LPPI Room
Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191
Phone: +62 (274) 563515, 511830, 379418, 371120 ext. 4902, Fax: +62 274 564604