Screenshots - Click image to view.

Software Description:

For the classic Traveling Salesman Problem (TSP), the objective is to visit each city only once and in a sequence such that the total travel distance (or time) is minimized (or find the least cost route). This is illustrated below.

The TSP routing problem, while an interesting problem in itself, is an excellent model for many practical problems encountered in normal manufacturing operations. The TSP can be applied to the problem of scheduling jobs through a machine or flexible cell to minimize set-up times as shown below. The "Cities" are jobs to be processed, the "Distances" are the times required to set-up the machine between jobs, and the "Salesman" is a machine or manufacturing cell.

Another example of an application of the TSP model is the sequencing of insertions in an Automatic Insertion operation. The robot picks components out of a number of bins and inserts them in precise locations on a surface such as an electronic board. The "Cities" are the locations on the surface, the "Distances" are the distances between the locations including a trip to the required bin to pick up the correct part, and the "Salesman" is the robot. This is illustrated below.

Archer Tools Deluxe TSP Tool is a route optimizer that connects the dots to form a cost-efficient path. This technology can also be used to address a problem that everyone faces: How do I stretch my gasoline budget? The Deluxe TSP Tool can find a gas-saving path. Click HERE to see how.

The Deluxe TSP Tool can provide good solutions to the classic Traveling Salesman Problem (TSP) and also gives you maximum flexibility by allowing Geo-coordinates with KML outputs for mapping.

You also get a data list with the tool that contains over 1,000 US cities with which to create inter-city routing problems.