Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem Export

@inproceedings{citeulike:698970, abstract = {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 asymmetric instances of the traveling salesman problem (TSP). Ant-Q algorithms were inspired by work on the ant system (AS), a distributed algorithm for combinatorial optimization based on the metaphor of ant colonies which was recently proposed in (Dorigo, 1992; Dorigo, Maniezzo and Colorni, 1996). We show that AS is a...}, author = {Gambardella, Luca M. and Dorigo, Marco}, booktitle = {International Conference on Machine Learning}, citeulike-article-id = {698970}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.7194}, keywords = {1995, ant-system}, pages = {252--260}, posted-at = {2008-08-26 09:59:24}, priority = {1}, title = {Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.7194}, year = {1995} }

TY - CONF ID - citeulike:698970 L3 - citeulike-article-id:698970 N2 - 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 asymmetric instances of the traveling salesman problem (TSP). Ant-Q algorithms were inspired by work on the ant system (AS), a distributed algorithm for combinatorial optimization based on the metaphor of ant colonies which was recently proposed in (Dorigo, 1992; Dorigo, Maniezzo and Colorni, 1996). We show that AS is a... EP - 260 TI - Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem T2 - International Conference on Machine Learning SP - 252 KW - 1995 KW - ant-system AU - Gambardella, Luca AU - Dorigo, Marco PY - 1995/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.7194 ER -