Subtour Reversible Algorithm $$ TSP

$$ The sub$-$tour reversal algorithm is a local search method commonly applied to improve existing solutions.

$$ It focuses on identifying and reversing sub$-$tours within a given solution.

$$ A sub$-$tour is essentially a segment of the tour that doesn't connect with the rest of the route.

$$ By reversing the order of the cities within a sub$-$tour, the algorithm aims to create a better overall solution.

$$ Sub$-$tour reversal

$$ Adjusts the sequence of cities visited in the current trial solution

$$ Selects a subsequence and reverses the order