good chemistry is complicated, and a little bit messy -LW |
|
PerlMonks |
Re^2: Travelling problemby Dirk80 (Pilgrim) |
on Dec 21, 2013 at 21:12 UTC ( [id://1068055]=note: print w/replies, xml ) | Need Help?? |
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.
In Section
Seekers of Perl Wisdom
|
|