Path: utzoo!censor!geac!lethe!yunexus!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!cs.utexas.edu!sun-barr!lll-winken!uunet!mcsun!unido!fauern!faui43.informatik.uni-erlangen.de!immd2.informatik.uni-erlangen.de!fritzke
From: fritzke@immd2.informatik.uni-erlangen.de (B. Fritzke)
Newsgroups: comp.ai.neural-nets
Subject: Traveling Salesman Data needed!
Keywords: Optimization, TSP
Message-ID: <1991Feb5.195412.3036@informatik.uni-erlangen.de>
Date: 5 Feb 91 19:54:12 GMT
Article-I.D.: informat.1991Feb5.195412.3036
Organization: Universitaet Erlangen, CS-Dep. IMMD II
Lines: 23

I'm looking for sample Traveling Salesman Problems (TSP) to test the network
model I have developed. 
Specifically I look for instances of the Euclidean TSP. This is the case,
when all the n cities are distributed in the unit square and the distance 
measure is the Euclidiean distance.

I would like to get together with the examples the shortest known path length or
(even better) the optimal path length.

Perhaps someone out there has the data of the 318-city problem posed by Lin &
Kernighan?

Otherwise any problem size < 5000 is appreciated.

Please answer by e-mail!

Thanks for any help.


Bernd Fritzke

Bernd Fritzke ------>  e-mail: fritzke@immd2.informatik.uni-erlangen.de
University of Erlangen, CS IMMD II, Martensstr. 3,  8520 Erlangen (Germany)