Demo of interactive simulation of two different algorithms solving the Travelling Salesman Problem. The code can be downloaded at my Github account (link in video).
Hey..i looked through your code. As a beginner who's just starting with this kinda stuff i had some doubts. The way u did simulated annealing...u mentioned about cutting sequence and swapping the parts in line 218. Isn't that a feature of genetic algorithm? Sorry if its a stupid doubt. I wasn't able to look through the course on coursera u mentioned.
Hi, I don't know much about genetic algorithms but I think you're right, you could classify the cut-and-swap logic as such. As for the Coursera course, I did this in about 2013 and haven't visited that platform for about 5 years now so I have no idea whether it's still available or not. At some point Coursera did switch to a paying-for-every-course model, I think, so it became obsolete for me because I did courses there just for fun.
Oh ok..thanks for the reply. I was trying to modify your code to see if i could compare genetic algorithm and simulated annealing instead of direct sampling and simulated annealing.
