fritzke@immd2.informatik.uni-erlangen.de (B. Fritzke) (02/06/91)
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)