Question, what's the described algorithm to iterate over k-opt pairs? is it something like this: for i in 1 to n-4: for j in i+2 to n: pair1 = (i, i+1) pair2 = (j, j+1) Thank you
the professor is showing you all the possible changes at each iteration, but he explains at 2:36 that for now we are just taking the first discovered improvement
![Algorithms for NP-Hard Problems (Section 20.4: The 2-OPT Heuristic for the TSP) [Part 1 of 2]](http://i.ytimg.com/vi/dYEWqrp-mho/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.4: The 2-OPT Heuristic for the TSP) [Part 1 of 2]](/img/tr.png)
Thanks for that! really well explained!
How do you calculate the costs of the green tours?
Question, what's the described algorithm to iterate over k-opt pairs?
is it something like this:
for i in 1 to n-4:
for j in i+2 to n:
pair1 = (i, i+1)
pair2 = (j, j+1)
Thank you
Why the network with score 23 not tried to improve further?
Yeah right!
the professor is showing you all the possible changes at each iteration, but he explains at 2:36 that for now we are just taking the first discovered improvement
Thank you so much