readme

Algorithm based on the outline of (Lin, 1965) for unix

    Traveling Salesman Problem Solver for unix
    Copyright (C) 1997  K. L. Dunn

    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

    Author: K. L. Dunn    email: [e-mail]

Traveling Salesman Problem Solver

Building:

You will need the GNU C compiler system, v2.6.x or later, to compile
tsp.c.  There is no makefile.  On most platforms, this should work:

   gcc -O2 -o tsp tsp.c

Installing:

Put the executable (output of the compiler) in a directory in your path.

Running:

tsp expects an even number of integer arguments.  Each pair of numbers
represents the planar coordinates of one of the nodes to be "visited".

For example, if you issue:

   tsp 1 1 2 2 1 2 2 1

which are the orners of a square, the tsp will output something like:

   4 2 3 1

which are the indeces of the coordinate pairs in optimal path order.



Author:

  K. L. Dunn   [e-mail]