Simulated Annealing Visualization: Solving Travelling Salesman Problem

This video illustrates how the traveling salesman problem (TSP) can be solved (an optimal solution can be approached) by simulated annealing.

Music:
© Setuniman (License: CC BY-NC 3.0)

[chickenkorma]

65 second explanation and i got the basic idea of simulated annealing. Perfect video!

[lkapo]

Thank you for the video. It was suggested to us in our Markov Chain lecture.

[gaussagain]

Thank you for your video. Marvellous.
Can the same approach be used to study the generation of universal Turing machines (as their states and labels increase)?

[sonerdemirel]

hello, do you run the code 500 times and select the best? Then you increase the step till 1000. I also study on SA but I dont get a graph like yours in terms of step x length graph. I work on different problem, not TSP.

[divertechnology]

Excellent video - i need to learn this.

[i_camioneta]

covered 3 hours of lecture in 3 minutes

[sonerdemirel]

Hello, I really missed something. If the length of each Markov chain is 500, how temperature is decreasing exponentially in the graph. For example, in my graph, it is constant till the length of each Markov chain is reached. I did not understand how to graph it, can you give some detail to let me check & correct my graph. If you decrease temperature in each Markov chain how temperature is not cooled till all chains is finished.

[yuchenglin]

Great Video, do you have the equation for calculating accept probability?

[Doctor-Lean]

Good interesting . Cloud you share python code?

[haithamnajdawi]

I would like to ask you that how can we measure the time (in seconds) required to reach convergence?
and can you please send me the code I want to run it on python

[brunosouza]

Hi, could you give me the code? I'm very intersting