Traveling Salesman Problem Visualization

Visually compares Greedy, Local Search, and Simulated Annealing strategies for addressing the Traveling Salesman problem.

Update:

Sources:

[Chris_t]

Love how the music speeds up when the code is in action, it actually makes it enjoyable and not a bunch of boring moving lines.

[patanypang]

the background music make it looks extra cool

[Cscuile]

I always come back to this video due to the sheer amount of beauty it contains.

[Kurchack]

I first watched it to understand methods of solving TSP. Then I watched it 4 more times because it's so optically pleasing.

[sindorei]

I watched this 2 or 3 years ago. Now, I am here again.

Great video! Visualization and your choice of music make me watch this over and over again.

[astarothgr]

This is the absolute best TL;DW (too long, didn't watch) video for anybody looking for a quick intro into what is local search. Great work!

[noxiouspro]

This isn't just a good visualization but also a good production video.
Thus it's might invite more audience into the field.

[Playncooler]

Man, travelling salesmen are smarter nowadays...

[Cscuile]

This is the most beautiful algorithm video I have seen on youtube.

[decepticonSB]

best visualization I've seen on TSP

[insaneviruss]

Finally a video that explains the core logic so easily, thanks a tonn!

[littlelilly]

These kind of video are actual motivation to get into the stuff

[philipwells]

Oh this is so beautiful. Thanks for making this video! 

[WhiteDragon]

An idea I had for the travelling salesman problem (when the points are in some euclidean space):
1) Enclose the smallest possible convex hull around all of the points.
2) For each point not on the edge of the current hull, pick the one that is closest to the hull (or, that would increase the length of the path the least if inserted into the closest hull edge).
3) Bend the hull to include that point. The point would be inserted between the two points already in the hull forming the edge that it is closest to.
4) Go to step 2 until there are no points left not part of the hull.

For added precision, you could enumerate through all of the first N possible vertex insertions and use the combination of insertions that results in the shortest path. The above algorithm assumes N == 1.

I just tried doing this manually in MS Paint and it seems to work pretty well. I got almost the same result you did at 1:17 (though I did eyeball it).

[_motho_]

the drums are like routes connecting and colliding with eachother. i like it

[yogi]

What a magnificent way of explaining these concepts, thank you! 

[emperorlelouch]

Wow, it's so intense and difficult that there had to be epic music to accompany it

[Randomperson-byeg]

2.3*10^624 possibility? That is 10^544 times more than atoms in observable universe

[ChairmanMo]

If you ever played Galactic Civilizations 3, you have to deal with this problem too when you start to set up your Hypergate networks. Thanks for the suggestions about moving the edges. That will help!

[JonDotExe]

Love it! These are the types of visualizations we need to get people into mathematics. So much easier to understand than a dude at a white board