Newsgroups: comp.ai.neural-nets
Path: cantaloupe.srv.cs.cmu.edu!nntp.club.cc.cmu.edu!hudson.lm.com!news.pop.psu.edu!news.cac.psu.edu!howland.reston.ans.net!swrinde!pipex!lyra.csx.cam.ac.uk!warwick!news.dcs.warwick.ac.uk!not-for-mail
From: Martyn.Amos@dcs.warwick.ac.uk (Martyn Amos)
Subject: Re: Look for the data of Travelling Salesman Problem !
Message-ID: <1995Jan7.164326.25826@dcs.warwick.ac.uk>
Sender: news@dcs.warwick.ac.uk (Network News)
Nntp-Posting-Host: pyrites
Organization: Department of Computer Science, Warwick University, England
References: <cel.28@sun4.ee.ncku.edu.tw> <3eju94$pdd@newsbf02.news.aol.com>
Date: Sat, 7 Jan 1995 16:43:26 GMT
Lines: 26

In article <3eju94$pdd@newsbf02.news.aol.com> carlmcook@aol.com (CarlMCook) writes:
>Robert,
>
>>>I wanna to solve the old problem - Travelling Salesman Problem recently,
>
>but I don't have the real data to simulate.<<
>
>I wrote a demo program in Visual Basic that used GA's to solve the TSP.  I
>just used data from the Official Airline Guide for actual airline
>inter-city distances.  Of course, it was a small number of cities (< 20)
>so I didn't mind typing them all in.  I don't know if they are available
>in electronic form or not.  I would suppose so, but I'm not sure where.

Check the OR library at Imperial College:

WWW access now available at http://mscmga.ms.ic.ac.uk/

Regards,

Martyn

-- 
Martyn Amos = martyn@dcs.warwick.ac.uk =  Parallel Computation Group,
=-=-=-=-=-= = martyn@alife.santafe.edu =  Department of Computer Science,
-=-=-=-=-=- =   (Santa Fe Institute)   =  University of Warwick, Coventry, UK
------------         http://www.dcs.warwick.ac.uk/~martyn/       ------------
