in reply to Re^2: Travelling problem (Anyone better 82991?)
in thread Travelling problem
Wow, I'm impressed about your ability to find that fast a very good solution. I don't know the perfect value. But 84860km seems to be a very short distance for the 24 places.
Of course I want to try to write my own code. But it would be interesting for me which algorithm you used. Until now I did not have success with the Graph module. See Re^3: Travelling problem
Now I'll try the minimal hamilton path.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^4: Travelling problem (Anyone better <strike>86850</strike> 84860?)
by BrowserUk (Patriarch) on Dec 22, 2013 at 23:58 UTC |