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

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

• I am sure someone could help you if you present your understanding of the problem and showed where you are stuck. Otherwise, on the surface this looks like a coursework dump . . . please use edit to add details relevant to your attempts at solving this problem – Neil Slater Mar 29 at 8:47

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?