What is the optimal solution of the 1962 Procter and Gamble's TSP Contest?

Problem Detail: 

In 1962, you could win a prize of \$ 10 000 (about \$ 80 000 in today's money) if you found the solution to an Euclidean travelling salesman problem defined on 33 cities.

http://www.math.uwaterloo.ca/tsp/history/pictorial/car54.html

Looking at the picture, the problem seems pretty easy. However I failed to find more detailed resources on the problem.

Does anybody know some more details, such as the exact distances and an optimal solution?

Asked By : Martin Drozdik

Answered By : David Richerby

Full details are in Robert L. Karg and James L. Thompson, A Heuristic Approach to Solving Traveling Salesman Problems (Management Science, 10(2):225–248, 1964). The PDF is available from JStor and Informs.org (both paywalled). This is the paper that produced the optimal tour of 10,861 miles. It also includes the full distance table but I'll not reproduce that here as it's way too much typing.

The solution is also illustrated on page 15 of The Traveling Salesman Problem by David L. Applegate, Robert E. Bixby, Vasek Chvátal and William J. Cook (Princeton University Press, 2007). The introduction to that book, which includes the relevant page, is freely available from the publisher.

Best Answer from StackOverflow

Question Source : http://cs.stackexchange.com/questions/40528