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.


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?

  • 2
    $\begingroup$ Ah, the 1960s... when nobody batted an eyelid at companies advertising their products by showing policemen harassing scantily-clad women. $\endgroup$ – David Richerby Mar 18 '15 at 11:21

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.

| cite | improve this answer | |
  • $\begingroup$ "A more direct approach would of course be to simply consider all possible tours, but this number grows so quickly that checking all of them for a modest-size instance, say 50 cities, is well beyond the capabilities of even the fastest of today’s supercomputers." (from linked Applegate, et al.) $\endgroup$ – Jacob Krall Mar 18 '15 at 17:42

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.