2389
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- .
 used for: Ant-Q, symmetric and asym-metric instances of the traveling salesman problem -LRB- TSP -RRB-
Given a phrase that describes the relationship between two words, extract the words and the lexical relationship between them. The output format should be "relation1: word1, word2; relation2: word3, word4". 
Option: conjunction, feature of, hyponym of, used for, part of, compare, evaluate for 
Text: {0} 
Answer:
 used for: Ant-Q, symmetric and asym-metric instances of the traveling salesman problem -LRB- TSP -RRB-