fritzke@immd2.informatik.uni-erlangen.de (B. Fritzke) (03/24/91)
Hi there, I have developed a (yet another) neural algorithm for the Euclidean Travelling Salesman Problem. Now I'd like to compare its performance against other (neural or conventional) algorithms. So, has anybody out there an implementation of a TSP-Algorithm (preferably written in C or C++) and is willing to mail it to me? I am also able to do ftp. I am especially interested in the algorithm of Lin & Kernighan, since it seems to be the best (or?). Thanks for any answer, Bernd Bernd Fritzke ------> e-mail: fritzke@immd2.informatik.uni-erlangen.de University of Erlangen, CS IMMD II, Martensstr. 3, 8520 Erlangen (FRG) PS.: There exists a publicly available collection of Travelling Salesman Problems, partly with optimal solutions, with many examples from the literature. It is available via ftp as follows: ********************************* ftp titan.rice.edu (or ftp 128.42.1.30) Login Userid : Anonymous Password: Anonymous cd public set binary get tsplib.tar.z quit uncompress tsplib.tar.z tar xvf tsplib.tar ********************************* This collection has been compiled by Gerhard Reinelt Institut fuer Mathematik Universitaet Augsburg It could serve as a kind of reference for comparing the quality of algorithms.