search

lutzzdias / travelling-salesman-problem

0 stars 1 forks source link

[Solution] local_moves #12

Closed lutzzdias closed 10 months ago

lutzzdias commented 11 months ago

Returns an iterable with all of the possible moves for the current solution state.

In our case, a move would probably be created with the 3 opt logic but this is open for debate

AlexandreAndrade00 commented 10 months ago

A move will be created with the last case of 3-opt. Because it isn't necessary to reverse the segments, in consequence, only the new edge distances change and that's what we want.

3-opt_7-case.pdf

@lutzzdias