in reply to Re: Travelling problem
in thread Travelling problem
Yes, you are right. The "travelling salesman problem" exactly describes my problem. Thank you!!!
I have 24 places and I know the distance between these places in km. I have to visit the first place, then 22 places in any order and then the 24th place. I don't need a perfect solution. I just want to find a short way, not the shortest one. And the computation time should not be too long. An approximation is enough.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^3: Travelling problem (minimal hamilton path)
by LanX (Saint) on Dec 21, 2013 at 23:04 UTC | |
|
Re^3: Travelling problem
by BrowserUk (Patriarch) on Dec 21, 2013 at 21:21 UTC | |
by Dirk80 (Pilgrim) on Dec 21, 2013 at 21:31 UTC | |
by BrowserUk (Patriarch) on Dec 21, 2013 at 22:01 UTC | |
by Dirk80 (Pilgrim) on Dec 22, 2013 at 00:23 UTC |