TOMS456
Routing Problem
TOMS456
is a FORTRAN77 library which
implements ACM TOMS algorithm 456, for the routing problem.
The text of many ACM TOMS algorithms is available online
through ACM:
http://www.acm.org/pubs/calgo
or NETLIB:
http://www.netlib.org/toms/index.html.
Languages:
TOMS456 is available in
a FORTRAN77 version.
Related Programs and Data:
CITIES,
a FORTRAN90 library of
which defines various problems associated with a set of
"cities" on a map.
CITIES,
a dataset directory which
contains some sets of intercity distances that can be used
with this code.
LAU_NP,
a FORTRAN90 library which
includes a routine for the heuristic solution of the traveling
salesman problem.
Usage:

call routng ( n, p, sn, en, m, d, l, r )

N is the number of nodes,
P is the node number index, but on output is replaced
by the optimal connection,
SN and EN are the start and end nodes,
M is the order of the distance matrix,
D is the distance matrix,
L is output as the length of the shortest connection,
R is the number of runs (that is, the number
of iterations of the algorithm. This should be less than
or equal to 2*N).
Reference:

Zdenek Fencl,
Algorithm 456:
Routing Problem,
Communications of the ACM,
Volume 16, Number 9, September 1973, pages 572574.
Source Code:
Examples and Tests:
List of Routines:

ROUTNG finds the shortest serial branchless connection
between N nodes of a net beginning at a start node SN and
terminating at the end node EN.
You can go up one level to
the FORTRAN77 source codes.
Last revised on 09 December 2005.