# How could we solve the TSP using a hill-climbing approach?

How could we solve the TSP using a hill-climbing approach?

So, given a sequence of nodes $$x_1, x_2, \dots, x_{n}, x_1$$, how can you create a neighbouring solution that is valid, that is, there is not repeated vertex (apart from the initial and the last one) and all vertices are included?