Sciweavers

1484 search results - page 11 / 297
» Ants meeting algorithms
Sort
View
IAT
2003
IEEE
14 years 1 months ago
Classification Rule Discovery with Ant Colony Optimization
—Ant-based algorithms or ant colony optimization (ACO) algorithms have been applied successfully to combinatorial optimization problems. More recently, Parpinelli and colleagues ...
Bo Liu, Hussein A. Abbass, Bob McKay
ICML
1995
IEEE
14 years 8 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
ANTSW
2006
Springer
13 years 11 months ago
On the Invariance of Ant System
It is often believed that the performance of ant system, and in general of ant colony optimization algorithms, depends somehow on the scale of the problem instance at hand. The iss...
Mauro Birattari, Paola Pellegrini, Marco Dorigo
IMCSIT
2010
13 years 5 months ago
Effectiveness of Solving Traveling Salesman Problem Using Ant Colony Optimization on Distributed Multi-Agent Middleware
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
Sorin Ilie, Costin Badica
GECCO
2003
Springer
142views Optimization» more  GECCO 2003»
14 years 27 days ago
Revisiting Elitism in Ant Colony Optimization
Ant Colony Optimization (ACO) has been applied successfully in solving the Traveling Salesman Problem. Marco Dorigo et al. used Ant System (AS) to explore the Symmetric Traveling S...
Tony White, Simon Kaegi, Terri Oda