An easy  to use Linear Programming Solver. 7 simple steps -  Click here for an example.
Press the F1 key to bring up the help file.

Screenshots - Click image to view.

Try this tool:

 

  • Download the trial version.

 

 

  • Install the software by double-clicking the Installer Package Icon on your computer.

 

 

  • Launch program by double-clicking the Archer Tool icon on your computer.

 

 

  • Press F1 key to bring up Help File

 

 

  •  Read the Help File and solve traveling salesman problems!
The software Installer package.
The software program icon.

Deluxe TSP Tool

 

  F1

To get the most out of the software, read the help file first.
Archer Tool, ATC ToolPack, and the toolbox logo are trademarks of The Archer Tool Company, LLC.
Use of Website is subject to these

All web materials-text, images, graphics, music, and sound are protected by copyright laws.

This site is best viewed with javascript enabled.

Home | Analysis Software | Industrial Engineering | Operations Research

Engineering Economics | Industrial Law | Industry Careers | Ask The Analyst

Click center for screenshot.
Click center for screenshot.

Find The Shortest Route or Path With This TSP Solver!

Deluxe Traveling Salesman Problem (TSP) Tool

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 Traveling Salesman Problem (TSP)

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.

Job Set-up problem as a TSP

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.

Automatic Insertion machine as a TSP

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 and specific starting and ending points.

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

The Deluxe TSP Tool

Try a Trial Version! -20 points

This software tool is on sale.
An easy  to use Traveling Salesman Problem Solver. Click here for an example that saves gasoline.

        Registered Version