Letter to the Editor—Graphic Solution of the Traveling-Salesman Problem

Abstract

The traveling-salesman problem consists in selecting from a total number of closed-circuit routes all passing through a number N of given points the one shortest route. To consider all the possible circuits would lead to excessive computations. However, this problem may be solved practically by using a simple, essentially intuitive method.