Talk:Ant colony optimization algorithms

= RFC and Discussion on Document Sections =

local vs path search, and the word "also"
Intro states ACO is for "solving computational problems which can be reduced to finding good paths through graphs". Then goes onto state ACO is used with or for local search. local search and path search are different. That is used in *both* context or one or the other needs to be clarified. The word "also" might be helpful in there somewhere? — Preceding unsigned comment added by 49.177.246.100 (talk) 04:34, 17 September 2018 (UTC)

"This algorithm is a member of the ant colony algorithms"
Which algorithm?? ACO is a member of ACO?? — Preceding unsigned comment added by 49.177.246.100 (talk) 04:49, 17 September 2018 (UTC)

related methods
I suggest to move the related methods section to the "combinatorial optimization" article, also including a short description for ACO.

= General Comments =

thank you everyone
I just wanted to say I love each and every one of you that contributed about 80 scholarly articles to the citations page, and my thesis does too. Go free knowledge. 7:30 PM Feb 16 2012 -5:00GMT (East US)

algorithm
This article would benefit from a description of the algorithm in Dorigo's paper, in addition to the high-level overview. I can't find information on the implentation of this algorithm anywhere. Twelvethirteen 08:17, 28 May 2006 (UTC)

Neural networks
Is there any non-trivial difference between ACO and neural networks?
 * They're fundamentally different creatures altogether.
 * ACO is population-based, ANNs are not.
 * ACO is specifically for graph-based problems (or problems which can be converted into graph/decision problems); ANN is more akin to a mathematical function.
 * ANN typically trains via BackProp and gradient descent; via computing errors and filtering those errors back. ACO essentially balances numerous greedy aspects with eachother, premised upon a series of continuous values that have no direct connection to 'errors' at all.
 * ACO could easily be used (and has been used) to train a neural network, but I can't conceive of any way that an ANN could ever 'train' an ACO or ACS. 139.57.100.104 (talk) 02:44, 3 May 2008 (UTC)

Update References
Should the references on this article be updated to follow general Wikipedia style guidelines? --Jeffrey Sharkey 18:59, 1 September 2006 (UTC)

Knapsack Picture
There is no foundation for the knapsack problem caption and image in this article. While it might be relevant, there is insufficient context to support it at present. If this is meant to be an extension of TSP-like problems, that extension should be stated explicitly somewhere in the article. 70.247.162.64 (talk) 03:14, 13 December 2010 (UTC)

More explanation would be helpful
I find the section 'Common extensions' not very clear. I have a background in mathematics and some experience with computer science, and even for me there is nowhere near enough context or explanation. This section clearly would provide good information, but at the moment it only does this for those who already have a good understanding of what ACOAs do and how they work.

Thanks for the introduction to the topic, though, and particularly for the references.

(Apologies for any etiquette problems - this is my first wikipedia post...)

82.130.117.238 (talk) 10:16, 10 December 2014 (UTC)Will

External links modified
Hello fellow Wikipedians,

I have just modified 3 one external links on Ant colony optimization algorithms. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20160304110324/http://www.cse.unt.edu/~smohanty/Publications_Conferences/2012/Mohanty_ISQED2012_Kriging-ACO.pdf to http://www.cse.unt.edu/~smohanty/Publications_Conferences/2012/Mohanty_ISQED2012_Kriging-ACO.pdf
 * Added archive https://web.archive.org/web/20140729081848/http://www.cse.unt.edu/~smohanty/Publications_Conferences/2013/Mohanty_MWSCAS2013_Reversible-Circuit.pdf to http://www.cse.unt.edu/~smohanty/Publications_Conferences/2013/Mohanty_MWSCAS2013_Reversible-Circuit.pdf
 * Added archive https://web.archive.org/web/20110719105224/http://ems.eit.uni-kl.de/index.php?id=156 to http://ems.eit.uni-kl.de/index.php?id=156

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at ).

Cheers.— InternetArchiveBot  (Report bug) 05:04, 15 October 2016 (UTC)

Merge
Support 2016 merge proposal; both Artificial ants and Ant colony optimization algorithms are aiming to make the same key points. Artificial ants currently gives a conceptual overview while the algorithms page is more specific and detailed. I suggest merging to the older article, Ant colony optimization algorithms. Klbrain (talk) 22:40, 7 April 2018 (UTC)
 * Given no objections ... ✅ Klbrain (talk) 21:08, 24 May 2018 (UTC)

Edge selection equation
The "allowed x" is completely obscure. It needs to be explained under the equation. Arkadiusz Bulski 193.33.42.189 (talk) 09:45, 23 April 2021 (UTC)