text: In this paper we introduce [[ Ant-Q ]] , a family of algorithms which present many similarities with Q-learning -LRB- Watkins , 1989 -RRB- , and which we apply to the solution of << symmetric and asym-metric instances of the traveling salesman problem -LRB- TSP -RRB- >> .