Figure 1: Traveling Salesman Problem Using an Evolutionary Algorithm in Action This article assumes you have intermediate or better programming skill but doesn't assume you know anything about ...

The Journal of the Operational Research Society, Vol. 29, No. 7 (Jul., 1978), pp. 697-701 (5 pages) The paper describes a heuristic algorithm for the asymmetric travelling salesman problem. The ...

The traveling-salesman problem is a generalized form of the simple problem to find the smallest closed loop that connects a number of points in a plane. Efforts in the past to find an efficient method ...

This is known, in the field of mathematics, as the travelling salesman problem. To solve it for more than a handful of "stops," it will almost certainly require a quantum computer. Here's why.