Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches
By Rajesh Matai, Surya Prakash Singh, Madan Lal Mittal. 2010
344 citations recorded by the source corpus.
1.1 Origin The traveling salesman problem (TSP) were studied in the 18th century by a mathematician from Ireland named Sir William Rowam Hamilton and by the British mathematician named Thomas Penyngton Kirkman. Detailed discussion about the work of Hamilton & Kirkman can be seen from the book titled Graph Theory (Biggs et al. 1976). It is believed that the general form of the TSP have been first studied by Kalr Menger in Vienna and Harvard. The problem was later promoted by Hassler, Whitney & Merrill at Princeton. A detailed dscription about the connection between Menger & Whitney, and the development of the TSP can be found in (Schrijver, 1960).
Subfields: Artificial Intelligence, Automotive Engineering, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/b909557180699a85e0bdb195c5c53220c3a84ad3
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
Citations in the corpus
- Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model (2024, background): “Figure 9 illustrates the heuristic designed by EoH for updating the guiding distance matrix for TSP.”