1. Travelling Salesman
- Posted by Arthur Adamson <euclid at ISOC.NET>
Oct 25, 1997
-
Last edited Oct 26, 1997
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
2. Re: Travelling Salesman
At 08:39 PM 10/25/97 -0400, you wrote:
>---------------------- Information from the mail header -----------------------
>Sender: Euphoria Programming for MS-DOS <EUPHORIA at
>MIAMIU.ACS.MUOHIO.EDU>
>Poster: Arthur Adamson <euclid at ISOC.NET>
>Subject: Travelling Salesman
>-------------------------------------------------------------------------------
>
> 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
>
Yes, I'd like to see it.
The version that I'm working on, about which I wrote you in August or
thereabouts, is not quite finished yet. It seems to run, but hasn't
produced any output yet, either because the problem is so huge (surprise!)
or because it has a hidden bug somewhere. I'm looking for it.
Wally Riley
wryly at mindspring.com
