Talk:Artificial bee colony algorithm

Insects Mid‑importance

	Insects portal This article is within the scope of WikiProject Insects, a collaborative effort to improve the coverage of insects 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.InsectsWikipedia:WikiProject InsectsTemplate:WikiProject InsectsInsects articles
Mid	This article has been rated as Mid-importance on the project's importance scale.

Computer science Mid‑importance

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

Mid

This article has been rated as Mid-importance 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}}

Untitled[edit]

Is this the same as Bees algorithm? Andreas Kaufmann (talk) 21:58, 11 February 2008 (UTC)[reply]

I asked myself the same question. I had a brief look at both algorithms and it seems to me that they are indeed very similar. Using the right parameters the Bee algorithm should function like the ABC (e.g. using half of the population as foragers). Oddly neither of the two groups working on ABC and BCO respectively recognize/cite the other algorithm in their articles even though they are similar and sometimes applied to similar problems. —Preceding unsigned comment added by 89.196.71.184 (talk) 19:14, 8 April 2008 (UTC)[reply]

The article at http://s.i-techonline.com/Book/Swarm-Intelligence/ISBN978-3-902613-09-7-swi08.pdf does a great job of summarizing the variations on this algorithm. In fact BCO and ABC are different algorithms developed by different parties, but as the previous poster remarked, the end result is pretty much identical. The articles should probably be merged to talk about both variations in a single article based on the analysis put forth by the linked article. 192.136.15.186 (talk) 20:10, 17 July 2008 (UTC)[reply]

Context wrt: similar work[edit]

This article would be improved if ABC could be explained explicitly in the body of the text, wrt: gradient descent, swarm intelligence, Bees algorithm and particle swarm optimisation. Leondz (talk) 11:26, 18 March 2014 (UTC)[reply]

Deletion proposal[edit]

I didn't see a separate page to discuss the proposed deletion.

While I agree there are too many pages on the metaheuristic optimization stuff, Artificial Bee Colony seems to have even more support than Firefly. I recommend that Artificial Bee Colony be one of the pages to keep. It has 17,400 results on Google Scholar [1] and a number of books searching for "artificial bee colony" intitle:optimization [2] including:

Evolutionary Optimization Algorithms by Dan Simon; Wiley [3]
Extremal Optimization: Fundamentals, Algorithms, and Applications by Yong-Zai Lu, Yu-Wang Chen, Min-Rong Chen, Peng Chen, Guo-Qiang Zeng; CRC Press [4]
Advances in Bio-inspired Computing for Combinatorial Optimization Problems by Camelia-Mihaela Pintea; Springer [5]
Computational Intelligence Paradigms for Optimization Problems Using MATLAB®/SIMULINK® by S. Sumathi, L. Ashok Kumar, Surekha. P; CRC Press [6]
Guided Randomness in Optimization by Maurice Clerc; Wiley [7]

Michaelmalak (talk) 13:21, 17 July 2016 (UTC)[reply]

@Michaelmalak: This is a proposed deletion, so you may simply remove the tag if you disagree.

I do wish to make a case for why it probably shouldn't be kept: I think this particular algorithm has generated a few more citations than the firefly algorithm because it has been around for a few years longer. To me it appears that a certain group of researchers in this field has just become very good at gaming the h-index system (take an existing algorithm, tweak the metaphor, write a Wikipedia article, publish a bunch of "applications" in journals run by that same group, repeat), so I'd be very careful about equating the number of citations Google Scholar reports with notability.

I do not immediately see the difference between this algorithm and ant colony optimization, which has been around for quite a bit longer. I do not, unfortunately, posses a reliable source that I could use to criticize this algorithm in the article on this point. (This is the whole problem with all these metaheuristics, the junk gets published at a faster rate than could be dubunked by the good scientists.) —Ruud 13:45, 19 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), which appears in more or less the same form 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:19, 31 August 2016 (UTC)[reply]