Sciweavers

4 search results - page 1 / 1
» Solving Symmetric and Asymmetric TSPs by Ant Colonies
Sort
View
ICEC
1996
123views more  ICEC 1996»
14 years 5 days ago
Solving Symmetric and Asymmetric TSPs by Ant Colonies
- In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We a...
Luca Maria Gambardella, Marco Dorigo
ICML
1995
IEEE
14 years 11 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
GECCO
2003
Springer
142views Optimization» more  GECCO 2003»
14 years 4 months 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
ICUMT
2009
13 years 8 months ago
A COP for cooperation in a P2P streaming protocol
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
María Elisa Bertinat, Darío Padula, ...