For those of you who do not know the Travelling Salesman Problem this is Wikipedias explanation:
The problem can be formulated as follows:
"If there are n cities a salesman must visit, and the distance between each pair of these cities is given, find the shortest tour where each city is visited exactly once and returing to your starting point"."The first thing you'll think is: "Can not be difficult..." That's true. You can easily solve the problem by comparing all possible solutions. However, when you have more than (let's say) 25 cities, it will be soon practically impossible to calculate all the ordered combinations (permutations). This is because the number of combinations is (n-1)!/2. (factorial of n = n * (n-1) * (n-2) * .. * 2 * 1) "
(source: http://travellingsalesmanproblem.com/)
(ps i dont care if the sources are reliable. this is not a bachelor assignement.)
The route |
Stops along the route:
1. City life - Buenos Aires
2. Bariloche
3. El Calafate
To see the Perito Moreno Glacier
Mount Fitz
And Torres Del Pain
4. Go whalewatching in Puerto Madryn
5. Celebrate Christmas in Mar del Plata
6. and New Years in Punta del Este, Uruguay
8. Bike from wineyard to wineyard in Mendoza
10. Relax on the beaches in Chile
11. Hike in Salta
12. I dont know what to do in Jujuy but it looks cool
Hvis du klare å løse det problemet med 100 000 byer vil du bli veldig veldig rik, ifølge foreleseren. Helsing Cat
ReplyDeleteJeg kommer sikkert for en av dine eventyr!!!! heheeh
ReplyDelete