Revision as of 17:09, 17 March 2015 edit Bender235 (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers, Template editors 472,826 edits m clean up; http->https or pr-URI, per VPP using AWB ← Previous edit		Revision as of 17:13, 10 April 2015 edit undo Brb1031 (talk \| contribs) 1 edit m Language in assumptions made more specific to reflect the form of the "main update" step formula. Next edit →
Line 2: The '''firefly algorithm (FA)''' is a [[metaheuristic]] [[algorithm]], inspired by the flashing behaviour of [[firefly\|fireflies]]. The primary purpose for a firefly's flash is to act as a signal system to attract other fireflies. [[Xin-she Yang\|Xin-She Yang]] formulated this firefly algorithm by assuming:<ref>{{cite book \|first=X. S. \|last=Yang \|title=Nature-Inspired Metaheuristic Algorithms \|___location=Frome \|publisher=Luniver Press \|year=2008 \|isbn=1-905986-10-6 }}</ref> #All fireflies are unisexual, so that ~~one~~any individual firefly will be attracted to all other fireflies; #Attractiveness is proportional to their brightness, and for any two fireflies, the less bright one will be attracted by (and thus move totowards) the brighter one; however, the ~~brightness~~intensity ~~can~~(apparent brightness) decrease as their mutual distance increases; #If there are no fireflies brighter than a given firefly, it will move randomly.

Firefly algorithm: Difference between revisions