(Solved) : 6 Solve Traveling Salesman Problem Following Graph Using Local Search 2 Substitute Neighbo Q37156155 . . . .

Please explain how you got the answer

#6 Solve Traveling Salesman Problem for the following graph using local search with 2-substitute neighborhoods. Initial Hamiltonian cycle is 1-3-5-2-4 Iteration 1. Hamiltonian cycle: Iteration 2. Hamiltonian cvcle: Iteration 3. Hamiltonian cvcle: Iteration 4. Hamiltonian cycle: Iteration 5. Hamiltonian cycle: Iteration 6. Hamiltonian cycle: Iteration 7. Hamiltonian cycle: ; its length is ; its length is ; its length is ; its length is ; its length is ; its length is ; its