Sciweavers

6 search results - page 1 / 2
» Ant-Q: A Reinforcement Learning Approach to the Traveling Sa...
Sort
View
ICML
1995
IEEE
14 years 5 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
2008
Springer
182views Optimization» more  GECCO 2008»
13 years 5 months ago
Scaling ant colony optimization with hierarchical reinforcement learning partitioning
This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. Th...
Erik J. Dries, Gilbert L. Peterson
FLAIRS
2010
13 years 2 months ago
Decision-Theoretic Simulated Annealing
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...
Todd W. Neller, Christopher J. La Pilla
GECCO
2003
Springer
142views Optimization» more  GECCO 2003»
13 years 9 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
ACMICEC
2007
ACM
154views ECommerce» more  ACMICEC 2007»
13 years 8 months ago
Learning and adaptivity in interactive recommender systems
Recommender systems are intelligent E-commerce applications that assist users in a decision-making process by offering personalized product recommendations during an interaction s...
Tariq Mahmood, Francesco Ricci