Talk:Firefly algorithm

This article was nominated for deletion on 15 July 2016. The result of the discussion was keep.

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

The following Wikipedia contributor may be personally or professionally connected to the subject of this article. Relevant policies and guidelines may include conflict of interest, autobiography, and neutral point of view.

Metafun (talk · contribs)

I am disputing the article's claim that FA is 'clearly superior' to PSO. The claim is based on the Chatterjee et al. reference (10). That paper only states that FA is superior to PSO for their proposed problem. It is fallacious to imply that FA is clearly superior to PSO for other problems based solely on the evidence of that application paper.

How does this compare too Glowworm swarm optimization 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)

Link added, comparison welcomed indeed. Utopiah (talk) 09:30, 26 March 2010 (UTC)[reply]

Neutrality[edit]

The article is biased. Comparisons to other Metaheuristics imply that the Firefly algorithm was a universal super-algorithm, which is not possible. — Preceding unsigned comment added by Schwatzwutz (talk • contribs) 11:38, 17 August 2013 (UTC)[reply]

I do not think the article is biased, though some of the papers may indicate the algorithm can be superior in their applications. So it's all up to the interpretation of the results. I have working in this area for many years, and I have rewrote that sentence to weaken the claims by that article. — Preceding unsigned comment added by Ουδέτερος (talk • contribs) 11:29, 7 December 2013 (UTC)[reply]

Deleted content[edit]

A large amount of content and references was removed with this series of edits. Diego (talk) 20:21, 29 July 2016 (UTC)[reply]

Criticism[edit]

I have removed the boilerplate criticism section that appeared in the lede of this article (and in many others). I have replaced it with a section that covers only the criticism specific to this algorithm, and refers the reader to the more general criticism of nature-inspired metaheuristics at List of metaphor-based metaheuristics. Since I have made similar removals or replacements on other pages, if anyone has an issue with this one, it's best to start an omnibus discussion at Talk:List of metaphor-based metaheuristics. —Psychonaut (talk) 19:02, 31 August 2016 (UTC)[reply]