Simulated Annealing

[@portiseremacunix]

Super good video!

[@marklondon9004]

Nice.

[@ashweenasundar]

Hello, can I have look on the code that you used in this video?

[@elong5]

Can I possibly see the code for the TSP example?

[@cricbee007-jy5wc]

Very Interesting, can I get the code for traveling salesman problem.

[@oleksandrknyga868]

Would it be possible to get the code you had used in the video for traveling saleseman example?

[@BYUFLOWLab]

Take a look at Algorithm 8.5 in our book: flowlab.groups.et.byu.net/mdobook.pdf for psuedocode. I do have some Julia code I could share if you send me an email address.

[@pellythirteen5654]

For a human it is easy to see that if the chosen path shows crossings , it can not be the shortest path. But , is it not true that if a path has NO crossings , it must automatically be the shortest path ?

[@BYUFLOWLab]

No, because in general there are many solutions without crossings and some will be shorter than others.

[@robbypradana-ei4yv]

I'm interesting about this. May i have ur email. Ee can discuss about it . Can yiu help me about my research. Thanks before