Newsgroups: comp.ai.genetic,comp.ai.neural-nets
Path: cantaloupe.srv.cs.cmu.edu!rochester!cornellcs!newsstand.cit.cornell.edu!newstand.syr.edu!news.maxwell.syr.edu!mr.net!www.nntp.primenet.com!nntp.primenet.com!su-news-hub1.bbnplanet.com!news.bbnplanet.com!cpk-news-hub1.bbnplanet.com!EU.net!usenet2.news.uk.psi.net!uknet!usenet1.news.uk.psi.net!uknet!uknet!lyra.csx.cam.ac.uk!warwick!news.nott.ac.uk!nott-cs!trent-doc!cgo
From: cgo@doc.ntu.ac.uk (Mr Chris Goodwin)
Subject: Route finnding algorithms
X-Nntp-Posting-Host: bob
Message-ID: <E1yCH3.EuG@doc.ntu.ac.uk>
Sender: news@doc.ntu.ac.uk
Organization: The Nottingham Trent University, DOC.
X-Newsreader: TIN [version 1.2 PL2]
Date: Thu, 5 Dec 1996 17:55:50 GMT
Lines: 19
Xref: glinda.oz.cs.cmu.edu comp.ai.genetic:10555 comp.ai.neural-nets:34964

Hi all,

	The Travelling Saleman Problem is a well-known benchmark
with GA's and NN's.  I have a different problem which I was wondering
if anyone had attacked with these methods.

	I have a collection of towns, all connected via roads. I want
to get from one town to a different one via the quickest or
shortest route.  What is it?

	The AutoRoute program does this problem - is their algorithm
well-known, or a closely guarded secret? Is there a technical
term for this problem?

Many thanks for any help or references,

Chris Goodwin
cgo@doc.ntu.ac.uk

