Original_Image_(b)Image_Generated_using_equation(1)_(c)Image_generated_using_equation(2)_(d)_Image_generated_using_equation(3)_(e)Image_generated_using_equation(4).jpg)
Ant colony optimization algorithms
In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. Artificial ants stand for multi-agent methods inspired by the behavior of real ants. The pheromone-based communication of biological ants is often the predominant paradigm used. Combinations of artificial ants and local search algorithms have become a method of choice for numerous optimization tasks involving some sort of graph, e.g., vehicle routing and internet routing.
- Abstraction100002137
- Act100030358
- Activity100407535
- Algorithm105847438
- Chronology106503224
- Communication100033020
- Event100029378
- Evidence106643408
- Indication106797169
- Procedure101023820
- PsychologicalFeature100023100
- Record106647206
- Rule105846932
- Timeline106504965
- TopicalConcept
- WikicatAlgorithms
- WikicatArticlesWhichContainGraphicalTimelines
- WrittenRecord106502378
- YagoPermanentlyLocatedEntity
- Caption
- enChronology of COA algorithms
- Comment
- enIn computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. Artificial ants stand for multi-agent methods inspired by the behavior of real ants. The pheromone-based communication of biological ants is often the predominant paradigm used. Combinations of artificial ants and local search algorithms have become a method of choice for numerous optimization tasks involving some sort of graph, e.g., vehicle routing and internet routing.
- Content
- enImageSize = width:210 height:300 PlotArea = width:170 height:280 left:40 bottom:10 DateFormat = yyyy Period = from:1985 till:2005 TimeAxis = orientation:vertical ScaleMajor = unit:year increment:5 start:1985 Colors= id:fond value:white #rgb id:marque value:rgb id:marque_fond value:rgb BackgroundColors = canvas:fond Define $dx = 7 # décalage du texte à droite de la barre Define $dy = -3 # décalage vertical Define $dy2 = 6 # décalage vertical pour double texte PlotData= bar:Leaders color:marque_fond width:5 mark: align:left fontsize:S from:1989 till:1989 shift: text:studies of collective behavior from:1991 till:1992 shift: text:ant system from:1995 till:1995 shift: text:continuous problem from:1996 till:1996 shift: text:ant colony system from:1996 till:1996 shift: text:max-min ant system from:2000 till:2000 shift: text:proof to convergence from:2001 till:2001 shift: text:multi-objective algorithm
- Depiction
- Has abstract
- enIn computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. Artificial ants stand for multi-agent methods inspired by the behavior of real ants. The pheromone-based communication of biological ants is often the predominant paradigm used. Combinations of artificial ants and local search algorithms have become a method of choice for numerous optimization tasks involving some sort of graph, e.g., vehicle routing and internet routing. As an example, ant colony optimization is a class of optimization algorithms modeled on the actions of an ant colony. Artificial 'ants' (e.g. simulation agents) locate optimal solutions by moving through a parameter space representing all possible solutions. Real ants lay down pheromones directing each other to resources while exploring their environment. The simulated 'ants' similarly record their positions and the quality of their solutions, so that in later simulation iterations more ants locate better solutions. One variation on this approach is the bees algorithm, which is more analogous to the foraging patterns of the honey bee, another social insect. This algorithm is a member of the ant colony algorithms family, in swarm intelligence methods, and it constitutes some metaheuristic optimizations. Initially proposed by Marco Dorigo in 1992 in his PhD thesis, the first algorithm was aiming to search for an optimal path in a graph, based on the behavior of ants seeking a path between their colony and a source of food. The original idea has since diversified to solve a wider class of numerical problems, and as a result, several problems have emerged, drawing on various aspects of the behavior of ants. From a broader perspective, ACO performs a model-based search and shares some similarities with estimation of distribution algorithms.
- Hypernym
- Technique
- Is primary topic of
- Ant colony optimization algorithms
- Label
- enAnt colony optimization algorithms
- Link from a Wikipage to an external page
- www.researchgate.net/profile/Asker_Kazharov/publication/225549674_Ant_colony_optimization_algorithms_for_solving_transportation_problems/links/56e0268e08aec4b3333d0039.pdf
- www.springer.com/la/book/9783642401787
- www.idsia.ch/~luca/acs-ec97.pdf
- vk.com/ant_colony_optimization
- www.scholarpedia.org/article/Ant_colony_optimization
- www.scholarpedia.org/article/Ant_Colony_Optimization
- www.cs.unibo.it/babaoglu/courses/cas05-06/tutorials/Ant_Colony_Optimization.pdf
- www.kaggle.com/code/jamesmcguigan/ant-colony-optimization-algorithm
- www.djoh.net/inde/ANTColony/applet.html
- people.idsia.ch/~gianni/Papers/ArtificialLife-original.pdf
- webspace.webring.com/people/br/raguirre/hormigas/antfarm/
- www.antoptima.com/
- www.eurobios.com/
- www.midaco-solver.com/
- web.archive.org/web/20080616044645/http:/www.nightlab.ch/antsim/
- web.archive.org/web/20131011081948/http:/www.aco-metaheuristic.org/
- web.archive.org/web/20110719105224/http:/ems.eit.uni-kl.de/index.php%3Fid=156
- web.archive.org/web/20120222061542/http:/iridia.ulb.ac.be/IridiaTrSeries/IridiaTr2006-023r001.pdf
- github.com/ugochirico/Java-Ant-Colony-System-Framework
- aisii.azc.uam.mx/mcbc/Cursos/IntCompt/Lectura16.pdf
- www.researchgate.net/profile/Saina_Abolmaali2/publication/312523236_Portfolio_Optimization_using_ant_colony_method_a_case_study_on_Tehran_stock_exchange/links/5ad5cd24a6fdcc29358108d4/Portfolio-Optimization-using-ant-colony-method-a-case-study-on-Tehran-stock-exchange.pdf
- Link from a Wikipage to another Wikipage
- 4-connected neighborhood
- 8-connected
- Algorithm
- Algorithms to estimate distribution
- Ambient networks
- Ant
- Ant colony
- Ants
- Artificial immune system
- Bankruptcy prediction
- Bees algorithm
- Category:Articles which contain graphical timelines
- Category:Nature-inspired metaheuristics
- Category:Optimization algorithms and methods
- Classification
- Collective behavior
- Collective intelligence
- Combinatorial optimization
- Computer science
- Constraint satisfaction
- Cross-entropy
- Cross-entropy method
- Data mining
- Distributed computing
- Edge detection
- Electronic circuit design
- Estimation of distribution algorithm
- Evolutionary algorithm
- File:(a)Original Image (b)Image Generated using equation(1) (c)Image generated using equation(2) (d) Image generated using equation(3) (e)Image generated using equation(4).jpg
- File:Aco shortpath.svg
- File:Aco TSP.svg
- File:ANT Antenna 1.jpg
- File:ANT antenna 2.jpg
- File:Ant Colony Algorihm applied to the Travelling Salesman Problem.gif
- File:Artificial ants.jpg
- File:Knapsack ants.svg
- File:Safari ants.jpg
- Frequency assignment problem
- Generalized assignment problem
- Genetic algorithm
- Graph (discrete mathematics)
- Honey bee
- HUMANT (HUManoid ANT) algorithm
- Information retrieval
- Intelligent Water Drops
- Iteration
- Job-shop scheduling
- Limit of a sequence
- Local search (optimization)
- Luca Maria Gambardella
- Marco Dorigo
- Metaheuristic
- Metaheuristics
- Multi-agent
- Network routing
- Open-shop scheduling
- Operations research
- Optimization (computer science)
- Otsu's method
- Parallel computing
- Parameter space
- Particle swarm optimization
- Partition problem
- People
- Pheromone
- Pierre-Paul Grassé
- Pixel
- Positive feedback
- Probabilistic
- Probability
- Probability distribution
- Protein
- Protein folding
- Protein protein interaction
- Quadratic assignment problem
- Random
- Redundancy allocation problem
- Research-based model
- Routing
- Scheduling algorithm
- Sequential ordering problem
- Set cover problem
- Shortest path problem
- Simulated annealing
- Social insects
- Stigmergy
- Stochastic
- Stochastic diffusion search
- Stochastic gradient descent
- Swarm intelligence
- Tabu search
- Telecommunication
- Telecommunications
- Termites
- Transmission Control Protocol
- Travelling salesman problem
- Vehicle routing problem
- SameAs
- 4Fuqn
- Algorisme de la colònia de formigues
- Algorithme de colonies de fourmis
- Algoritma semut
- Algoritma sireum
- Algoritmo de la colonia de hormigas
- Algoritmo delle colonie di formiche
- Algorytm mrówkowy
- Ameisenalgorithmus
- Ant colony optimization algorithms
- Colônia de formigas (otimização)
- Karınca kolonisi optimizasyon algoritması
- m.02sxf4
- Mierenkolonieoptimalisatie
- Mravlji algoritam
- Optimalizace mravenčí kolonií
- Q460851
- Αλγόριθμοι βελτιστοποίησης αποικιών των μυρμηγκιών
- Алгоритъм за оптимизация по метода на мравките
- Муравьиный алгоритм
- Мурашиний алгоритм
- אופטימיזציית קן הנמלים
- الگوریتم کلونی مورچگان
- خوارزمية قرية النمل
- 蚁群算法
- 蟻コロニー最適化
- Subject
- Category:Articles which contain graphical timelines
- Category:Nature-inspired metaheuristics
- Category:Optimization algorithms and methods
- Thumbnail
- WasDerivedFrom
- Ant colony optimization algorithms?oldid=1112865549&ns=0
- WikiPageLength
- 77899
- Wikipage page ID
- 588615
- Wikipage revision ID
- 1112865549
- WikiPageUsesTemplate
- Template:Collective animal behaviour
- Template:Image frame
- Template:ISBN
- Template:ISSN
- Template:More footnotes
- Template:Multiple issues
- Template:Original research
- Template:Reflist
