Travelling Salesman
- Posted by Arthur Adamson <euclid at ISOC.NET> Oct 25, 1997
- 803 views
Some of you have shared my interest in the the travelling salesman problem. I have improved my solution and found, via genetic Euphoria, a path length of 1085.4149 for the Scientific American test set of 200 cities. If anyone wants the solution or the euphoria program, let me know. Bye, Art Arthur P. Adamson, The Cincinnati Engine Man, euclid at isoc.net