Given a non-directed graph G N with n cities, supposing that there is a traveling cost between each pair of cities, TSP tries to find a tour of the minimal total cost visiting each city exactly once.
the asymmetric traveling salesman problem (ATSP) tries to find a tour of the minimal total cost on a directed graph, where the traveling costs between two nodes are different in each direction.