In 1954, Dantzig, Fulkerson, and Johnson  found the optimal solution to traveling salesman
problem with 49 numbers of cities.
Gambardella, "Ant colony system: a cooperative learning approach to the traveling salesman
problem," IEEE Transactions on Evolutionary Computation, vol.
Punnen, The Traveling Salesman
Problem And Its Variations, Springer Science & Business Media, 2002.
This paper describes the Multiagent Planning Problem, a variant of the classical Multiple Traveling Salesman
Merz, "Genetic local search algorithm for solving symmetric and asymmetric traveling salesman
problems," in Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC '96), pp.
and Srikanth K.: "An optimal solution method for large-scale multiple traveling salesman
The traveling salesman
problem (TSP) is an NP-hard problem in combinatorial optimization studied in operations research and theoretical computer science .
We presented a hybrid sequential constructive sampling algorithm for the bottleneck traveling salesman
problem, and tested with some TSPLIB instances.
In 1872, traveling salesman
Aaron Montgomery Ward experimented with mail order catalogs to sell products directly to his rural customers, lowering prices by removing the middleman at the general store.
In very broad terms, this is the premise of the "Traveling Salesman
Problem," or TSP, an old math game used to calculate the shortest and cheapest way to visit a given number of cities and get back home.
"An Analogue Approach to the Traveling Salesman
problem Using an Elastic Net Method".