“Ant colony optimization”的版本间的差异

来自集智百科 - 复杂系统|人工智能|复杂科学|复杂网络|自组织
跳到导航 跳到搜索
（清空页面）
标签：清空
第1行： 第1行：
−
Chronology of ant colony optimization algorithms.
 
−
* 1959, [[Pierre-Paul Grassé]] invented the theory of [[stigmergy]] to explain the behavior of nest building in [[termites]];<ref>P.-P. Grassé, ''La reconstruction du nid et les coordinations inter-individuelles chez Belicositermes natalensis et Cubitermes sp. La théorie de la Stigmergie : Essai d’interprétation du comportement des termites constructeurs'', Insectes Sociaux, numéro 6, p. 41-80, 1959.</ref>
 
−
* 1983, Deneubourg and his colleagues studied the [[collective behavior]] of [[ants]];<ref>J.L. Denebourg, J.M. Pasteels et J.C. Verhaeghe, ''[https://pdfs.semanticscholar.org/caac/71608a5e6b0907a8a99bba30d72d9a304152.pdf Probabilistic Behaviour in Ants : a Strategy of Errors?]'', Journal of Theoretical Biology, numéro 105, 1983.</ref>
 
−
* 1988, and Moyson Manderick have an article on '''self-organization''' among ants;<ref name="F. Moyson, B. Manderick">F. Moyson, B. Manderick, ''The collective behaviour of Ants : an Example of Self-Organization in Massive Parallelism'', Actes de AAAI Spring Symposium on Parallel Models of Intelligence, Stanford, Californie, 1988.</ref>
 
−
* 1989, the work of Goss, Aron, Deneubourg and Pasteels on the '''collective behavior of Argentine ants''', which will give the idea of ant colony optimization algorithms;<ref name="S. Goss">S. Goss, S. Aron, J.-L. Deneubourg et J.-M. Pasteels, ''[https://www.researchgate.net/profile/Serge_Aron/publication/301232811_Self-Organized_Shortcuts_in_the_Argentine_Ant/links/59967b5daca27283b11d9070/Self-Organized-Shortcuts-in-the-Argentine-Ant.pdf Self-organized shortcuts in the Argentine ant]'', Naturwissenschaften, volume 76, pages 579-581, 1989</ref>
 
−
* 1989, implementation of a model of behavior for food by Ebling and his colleagues;<ref>M. Ebling, M. Di Loreto, M. Presley, F. Wieland, et D. Jefferson,''An Ant Foraging Model Implemented on the Time Warp Operating System'', Proceedings of the SCS Multiconference on Distributed Simulation, 1989</ref>
 
−
* 1991, M. Dorigo proposed the '''ant system''' in his doctoral thesis (which was published in 1992<ref name="M. Dorigo, Optimization, Learning and Natural Algorithms" />). A technical report extracted from the thesis and co-authored by V. Maniezzo and A. Colorni<ref>Dorigo M., V. Maniezzo et A. Colorni, ''Positive feedback as a search strategy'', rapport technique numéro 91-016, Dip. Elettronica, Politecnico di Milano, Italy, 1991</ref> was published five years later;<ref name="Ant system" />
 
−
* 1994, Appleby and Steward of British Telecommunications Plc published the first application to [[telecommunications]] networks<ref>Appleby, S. & Steward, S. Mobile software agents for control in telecommunications networks, BT Technol. J., 12(2):104–113, April 1994</ref>
 
−
* 1995, Gambardella and Dorigo proposed '''ant-q''', <ref> L.M. Gambardella and M. Dorigo, "Ant-Q: a reinforcement learning approach to the traveling salesman problem", Proceedings of ML-95, Twelfth International Conference on Machine Learning, A. Prieditis and S. Russell (Eds.), Morgan Kaufmann, pp. 252–260, 1995 </ref> the preliminary version of ant colony system as first estension of ant system; <ref name="Ant system" />.
 
−
* 1996, Gambardella and Dorigo proposed '''ant colony system''' <ref> L.M. Gambardella and M. Dorigo, "Solving Symmetric and Asymmetric TSPs by Ant Colonies", Proceedings of the IEEE Conference on Evolutionary Computation, ICEC96, Nagoya, Japan, May 20-22, pp. 622-627, 1996; </ref>
 
−
* 1996, publication of the article on ant system;<ref name="Ant system" />
 
−
* 1996, Hoos and Stützle invent the '''max-min ant system''';<ref name="T. Stützle et H.H. Hoos" />
 
−
* 1997, Dorigo and Gambardella proposed ant colony system hybrized with local search;<ref name="M. Dorigo et L.M. Gambardella" />
 
−
* 1997, Schoonderwoerd and his colleagues published an improved application to [[telecommunication]] networks;<ref>R. Schoonderwoerd, O. Holland, J. Bruten et L. Rothkrantz, ''[https://pdfs.semanticscholar.org/f09e/03c5d759c7ca04e443d496e23c981f1b4a5d.pdf Ant-based load balancing in telecommunication networks]'', Adaptive Behaviour, volume 5, numéro 2, pages 169-207, 1997</ref>
 
−
* 1998, Dorigo launches first conference dedicated to the ACO algorithms;<ref>M. Dorigo, ''ANTS’ 98, From Ant Colonies to Artificial Ants : First International Workshop on Ant Colony Optimization, ANTS 98'', Bruxelles, Belgique, octobre 1998.</ref>
 
−
* 1998, Stützle proposes initial '''parallel implementations''';<ref>T. Stützle, ''Parallelization Strategies for Ant Colony Optimization'', Proceedings of PPSN-V, Fifth International Conference on Parallel Problem Solving from Nature, Springer-Verlag, volume 1498, pages 722-731, 1998.</ref>
 
−
*1999, Gambardella, Taillard and Agazzi proposed ''' macs-vrptw''', first multi ant colony system applied to vehicle routing problems with time windows, <ref> L.M. Gambardella, E. Taillard, G. Agazzi, "MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows", In D. Corne, M. Dorigo and F. Glover, editors, New Ideas in Optimization, McGraw-Hill, London, UK, pp. 63-76, 1999.</ref>
 
−
* 1999, Bonabeau, Dorigo and Theraulaz publish a book dealing mainly with artificial ants<ref>É. Bonabeau, M. Dorigo et G. Theraulaz, ''Swarm intelligence'', Oxford University Press, 1999.</ref>
 
−
* 2000, special issue of the Future Generation Computer Systems journal on ant algorithms<ref>M. Dorigo , G. Di Caro et T. Stützle, ''[https://www.academia.edu/download/30765111/FGCS-Editorial-final.pdf Special issue on "Ant Algorithms]"'', Future Generation Computer Systems, volume 16, numéro 8, 2000</ref>
 
−
* 2000, first applications to the [[Scheduling algorithm|scheduling]], scheduling sequence and the [[constraint satisfaction|satisfaction of constraints]];
 
−
* 2000, Gutjahr provides the first evidence of [[limit of a sequence|convergence]] for an algorithm of ant colonies<ref>W.J. Gutjahr, ''[http://iridia.ulb.ac.be/~mdorigo/ACO/downloads/ants5.pdf A graph-based Ant System and its convergence]'', Future Generation Computer Systems, volume 16, pages 873-888, 2000.</ref>
 
−
* 2001, the first use of COA algorithms by companies ([http://www.eurobios.com/ Eurobios] and [http://www.antoptima.com/ AntOptima]);
 
−
* 2001, Iredi and his colleagues published the first '''multi-objective''' algorithm<ref>S. Iredi, D. Merkle et M. Middendorf, ''[https://link.springer.com/chapter/10.1007/3-540-44719-9_25 Bi-Criterion Optimization with Multi Colony Ant Algorithms]'', Evolutionary Multi-Criterion Optimization, First International Conference (EMO’01), Zurich, Springer Verlag, pages 359-372, 2001.</ref>
 
−
* 2002, first applications in the design of schedule, Bayesian networks;
 
−
* 2002, Bianchi and her colleagues suggested the first algorithm for [[stochastic]] problem;<ref>L. Bianchi, L.M. Gambardella et M.Dorigo, ''[http://hcot.ir/wp-content/uploads/2015/03/An-Ant-Colony-Optimization-Approach-to-the-Probabilistic-Traveling-Salesman-Problem.pdf An ant colony optimization approach to the probabilistic traveling salesman problem]'', PPSN-VII, Seventh International Conference on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Springer Verlag, Berlin, Allemagne, 2002.</ref>
 
−
* 2004, Dorigo and Stützle publish the Ant Colony Optimization book with MIT Press <ref>M. Dorigo and T. Stützle, ''Ant Colony Optimization'', MIT Press, 2004.</ref>
 
−
* 2004, Zlochin and Dorigo show that some algorithms are equivalent to the [[stochastic gradient descent]], the [[cross-entropy method]] and [[algorithms to estimate distribution]]<ref name="Zlochin model-based search"/>
 
−
* 2005, first applications to [[protein folding]] problems.
 
−
* 2012, Prabhakar and colleagues publish research relating to the operation of individual ants communicating in tandem without pheromones, mirroring the principles of computer network organization. The communication model has been compared to the [[Transmission Control Protocol]].<ref>B. Prabhakar, K. N. Dektar, D. M. Gordon, "The regulation of ant colony foraging activity without spatial information ", PLOS Computational Biology, 2012. URL: http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1002670</ref>
 
−
* 2016, first application to peptide sequence design.<ref name=":0" />
 
−
* 2017, successful integration of the multi-criteria decision-making method PROMETHEE into the ACO algorithm ([[HUMANT (HUManoid ANT) algorithm|HUMANT algorithm]]).<ref>{{cite journal|last1=Mladineo|first1=Marko|last2=Veza|first2=Ivica|last3=Gjeldum|first3=Nikola|title=Solving partner selection problem in cyber-physical production networks using the HUMANT algorithm|journal=International Journal of Production Research|date=2017|volume=55|issue=9|pages=2506–2521|doi=10.1080/00207543.2016.1234084}}</ref>
 
  
−
==References==
 
−
{{Reflist|30em}}
 

2020年4月8日 (三) 20:35的版本

取自“https://wiki.swarma.org/index.php?title=Ant_colony_optimization&oldid=2322”