Path: utzoo!mnetor!tmsoft!torsqnt!lethe!yunexus!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!uunet!kddlab!titcca!sys.titech.ac.jp!check From: check@sys.titech.ac.jp (Takashi Sugawara) Newsgroups: comp.ai.neural-nets Subject: TSP Data, me too! Message-ID: Date: 7 Feb 91 07:11:20 GMT Sender: news@sys.titech.ac.jp Distribution: comp Organization: Tokyo Institute of Technology, Yokohama, Japan. Lines: 33 Hello, from Japan. I study GAs for TSP. I now uses my own crossover and operators for GA. Today I succeed in 100 cities of TSP. And next I'll try with more than 200 cities. But now I have only my own co-ordinates of cities, so; In article <1991Feb5.195412.3036@informatik.uni-erlangen.de> fritzke@immd2.informatik.uni-erlangen.de (B. Fritzke) writes: >>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. yes, I also need them. I need instances and information of it, too. Please send me or post. Thank you. ```````````````````````````````````````````````````````` )) Takashi Sugawara (( @ @ @ @ > Control Engineering, Tokyo Institute of Technology < ~ JAPAN - e-mail : check@sys.titech.ac.jp Office : 8145-922-1111(ext.2689) Fax : 8145-921-1485 ........................................................