 | This article was nominated for deletion on 15 July 2016. The result of the discussion was no consensus. |
 | This redirect does not require a rating on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||
| |||||||||||||||
How does this compare too Firefly algorithm and are these articles not describing the same algorithm (if not, what is the difference, and there should be a link to each other). patrick (talk)
Good questions patrick !!! More description is needed ! —Preceding unsigned comment added by 178.73.63.95 (talk) 10:24, 7 November 2010 (UTC)
Well it is a scientific algorithm that has been published by a noted publisher (http://www.springerlink.com/content/q384863157693332/) and throws up over 600 references in google. Notable enough? —Preceding unsigned comment added by 109.152.86.210 (talk) 20:23, 14 November 2010 (UTC)
In GSO each agent's moving direction is based on the strength of signal emitted by a distinctive group of neighbors within circular sensor range. FA move strategy takes into account agents located in the entire search space and a random step as well. All pairs of fireflies are also independently examined. Attractiveness in the FA is fixed, movement update is done in a different fashion. There are also other significant differences like the best individual behavior and more subtle ones e.g. naming conventions. I'd say that GSO is definitely better suited for capturing all local minima of multi-modal functions. On the other hand I see FA as an effective tool for finding global minimizers. —Preceding unsigned comment added by Szymonl (talk • contribs) 23:21, 24 November 2010 (UTC)