A RADICLE STUDY OF FIRE-FLY ALGORITHM

Firefly algorithm (FA) is a metaheuristic algorithm which was proposed by Dr. XinShe Yang in 2008 at Cambridge University [12], inspired by the flashing behaviour of firefly insects. In this paper, we will see how firefly algorithm is being used in different engineering process applications and also...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of advanced research in computer science 2018-05, Vol.9 (Special Issue 3), p.1
Hauptverfasser: Mandal, Sanjeet, Spoorthi Rakesh
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Firefly algorithm (FA) is a metaheuristic algorithm which was proposed by Dr. XinShe Yang in 2008 at Cambridge University [12], inspired by the flashing behaviour of firefly insects. In this paper, we will see how firefly algorithm is being used in different engineering process applications and also how it is more efficient than others. Firefly algorithm is better than many other methods as it gives optimal solution with minimum time complexity. Our paper show how firefly algorithm is modified and used with other methods to implement and obtain solution for different problems. Firefly algorithm has advantages over other algorithm such as automatical subdivision and the ability of dealing with multimodality. Also the parameters in firefly algorithm can be tuned to control the randomness as iterations proceed, so that convergence can also be sped up by tuning these parameters. These above advantages makes it flexible to deal with continuous problems, clustering and classifications, and combinational as well.
ISSN:0976-5697
DOI:10.26483/ijarcs.v9i0.6186