Skip to search formSkip to main contentSkip to account menu

Ant colony optimization algorithms

Known as: Ant system, Ant colony optimization, Ant colony optimisation 
In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Real world problems don't always come with sufficient, complete, and precise data; classical algorithms are facing some… 
Highly Cited
2009
Highly Cited
2009
This article presents a heuristic particle swarm ant colony optimization algorithm to solve engineering optimization problems… 
2008
2008
The Ant colony optimization (ACO) algorithm is relatively a new meta-heuristic algorithm and a successful paradigm of all the… 
2008
2008
Routing algorithm is a pivotal technology for ad hoc networks, in this paper, an algorithm for routing in mobile ad hoc networks… 
Highly Cited
2007
Highly Cited
2007
  • H. DuanXiufen Yu
  • 2007
  • Corpus ID: 8184163
Ant colony optimization was originally presented under the inspiration during collective behavior study results on real ant… 
Highly Cited
2006
Highly Cited
2006
  • R. MisraC. Mandal
  • 2006
  • Corpus ID: 7789982
Data aggregation is an essential paradigm for energy efficient routing in energy constraint wireless sensor networks. The… 
Highly Cited
2005
Highly Cited
2005
The original ant system algorithm is simplified leading to a generalized ant colony optimization algorithm that can be used to… 
Review
2004
Review
2004
The difficulty to solve multiple objective combinatorial optimization problems with traditional techniques has urged researchers… 
Highly Cited
2004
Highly Cited
2004
This paper presents an improvement ant colony optimization algorithm for mining classification rule called ACO-Miner The goal of… 
2003
2003
A mobile ad hoc network (MANET) consists of mobile wireless nodes that communicate in a distributed fashion without any…