This is the second part in my series on the “travelling salesman problem” (TSP). Part one covered defining the TSP and utility code that will be used for the various optimisation algorithms I shall discuss.

### solution landscapes

A common way to visualise searching for solutions in an optimisation problem, such as the TSP, is to think of the solutions existing within a “landscape”. Better solutions exist higher up and we can take a step from one solution to another in search of better solutions. How we make steps will depend on the “move operators” we have available and will therefore also affect how the landscape “looks”. It will change which solutions are “adjacent” to each other. For a simple optimisation problem we can directly visual the solution landscape:

The red dot represents our current solution. It should be pretty clear that if we simply carry on going “uphill” we’ll get to the highest point in this solution landscape.

If we are using evolutionary optimisation methods a solution landscape will often be referred to as a fitness landscape.

### hill-climbing

Hill-climbing, pretty much the simplest of the stochastic optimisation methods, works like this:

- pick a place to start
- take any step that goes “uphill”
- if there are no more uphill steps, stop;

otherwise carry on taking uphill steps

Metaphorically the algorithm climbs up a hill one step at a time. It is a “greedy” algorithm and only ever takes steps that take it uphill (though it can be adapted to behave differently). This means that it is pretty quick to get to the top of a hill, but depending on where it starts it may not get to the top of the biggest hill:

As you can see our current solution (the red dot) can only go downhill from it’s current position – yet it is not at the highest point in the solution landscape.

The “biggest” hill in the solution landscape is known as the global maximum. The top of any other hill is known as a local maximum (it’s the highest point in the local area). Standard hill-climbing will tend to get stuck at the top of a local maximum, so we can modify our algorithm to restart the hill-climb if need be. This will help hill-climbing find better hills to climb – though it’s still a random search of the initial starting points.

### objective and initialisation functions

To get started with the hill-climbing code we need two functions:

- an initialisation function – that will return a random solution
- an objective function – that will tell us how “good” a solution is

For the TSP the initialisation function will just return a tour of the correct length that has the cities arranged in a random order.

The objective function will return the **negated** length of a tour/solution. We do this because we want to *maximise* the objective function, whilst at the same time *minimise* the tour length.

As the hill-climbing code won’t know specifically about the TSP we need to ensure that the initialisation function takes no arguments and returns a tour of the correct length and the objective function takes one argument (the solution) and returns the negated length.

So assuming we have our city co-ordinates in a variable `coords`

and our distance matrix in `matrix`

we can define the objective function and initialisation functions as follows:

```
def init_random_tour(tour_length):
tour=range(tour_length)
random.shuffle(tour)
return tour
init_function=lambda: init_random_tour(len(coords))
objective_function=lambda tour: -tour_length(matrix,tour) #note negation
```

Relying on closures to let us associate `len(coords)`

with the `init_random_tour`

function and `matrix`

with the `tour_length`

function. The end result is two function ` init_function`

and `objective_function`

that are suitable for use in the hill-climbing function.

### the basic hill-climb

The basic hill-climb looks like this in Python:

```
def hillclimb(
init_function,
move_operator,
objective_function,
max_evaluations):
'''
hillclimb until either max_evaluations
is reached or we are at a local optima
'''
best=init_function()
best_score=objective_function(best)
num_evaluations=1
while num_evaluations < max_evaluations:
# examine moves around our current position
move_made=False
for next in move_operator(best):
if num_evaluations >= max_evaluations:
break
# see if this move is better than the current
next_score=objective_function(next)
num_evaluations+=1
if next_score > best_score:
best=next
best_score=next_score
move_made=True
break # depth first search
if not move_made:
break # we couldn't find a better move
# (must be at a local maximum)
return (num_evaluations,best_score,best)
```

(I’ve removed some logging statements for clarity)

The parameters are as follow:

`init_function`

– the function used to create our initial solution`move_operator`

– the function we use to iterate over all possible “moves” for a given solution (for the TSP this will be`reversed_sections`

or`swapped_cities`

)`objective_function`

– used to assign a numerical score to a solution – how “good” the solution is (as defined above for the TSP)`max_evaluations`

– used to limit how much search we will perform (how many times we’ll call the`objective_function`

)

### hill-climb with random restart

With a random restart we get something like:

```
def hillclimb_and_restart(
init_function,
move_operator,
objective_function,
max_evaluations):
'''
repeatedly hillclimb until max_evaluations is reached
'''
best=None
best_score=0
num_evaluations=0
while num_evaluations < max_evaluations:
remaining_evaluations=max_evaluations-num_evaluations
evaluated,score,found=hillclimb(
init_function,
move_operator,
objective_function,
remaining_evaluations)
num_evaluations+=evaluated
if score > best_score or best is None:
best_score=score
best=found
return (num_evaluations,best_score,best)
```

The parameters match those of the `hillclimb`

function.

This function simply calls `hillclimb`

repeatedly until we have hit the limit specified by `max_evaluations`

, whereas `hillclimb`

on it’s own will not necessarily use all of the evaluations assigned to it.

### results

Running the two different move operators (`reversed_sections`

and `swapped_cities`

– see part one for their definitions) on a 100 city tour produced some interesting differences.

Ten runs of 50000 evaluations (calls to the objective function) yielded:

reversed_sections | swapped_cities |
---|---|

-4039.86 | -6451.12 |

-4075.04 | -6710.48 |

-4170.41 | -6818.04 |

-4178.59 | -6830.57 |

-4199.94 | -6831.48 |

-4209.69 | -7216.22 |

-4217.59 | -7357.70 |

-4222.46 | -7603.30 |

-4243.78 | -7657.69 |

-4294.93 | -7750.79 |

(these are the scores from the objective function and represent negative tour length)

In this case `reversed_sections`

clearly performed much better. The best solution for `reversed_sections`

looked like:

Whereas the best for `swapped_cities`

is clearly much worse:

It’s pretty clear then that `reversed_sections`

is the better move operator. This is most likely due to it being less “destructive” than `swapped_cities`

, as it preserves entire sections of a route, yet still affects the ordering of multiple cities in one go.

### conclusion

As can be seen hill-climbing is a very simple algorithm that can produce *good* results – provided one uses the right move operator.

However it is not without it’s drawbacks and is prone to getting stuck at the top of “local maximums”.

Most of the other algorithms I will discuss later attempt to counter this weakness in hill-climbing. The next algorithm I will discuss (simulated annealing) is actually a pretty simple modification of hill-climbing, but gives us a much better chance at finding the global maximum for a given solution landscape.

### source-code

Full source-code is available here as a .tar.gz file. Again some unit tests are included, which can be run using nosetests.

(The source-code contains more code than shown here, to handle parsing parameters passed to the program etc. I’ve not discussed this extra code here simply to save space.)

hi

thank you very much but i can not download full source

may you correct download link or send me it?

sincerely

thanks i could download

please send the full source code for hill climbing method

in c/c++ linguages

thanking you.

@karthick sorry there’s only a Python version here. Though it shouldn’t be too hard to made a c/c++ version yourself…

I trying to implement tabu search for TSP using your source code. Can you suggest what changes I need to make, in particular how should I update the tabu list? Thank you.

@ashresth How have you tried to modify the code for tabu search? I principle you “just” need to maintain a list of previously tried moves, that you will no longer do. The hillclimbing code will probably need more modification to make it work for tabu though. At the moment the move_operator always returns new solutions, but you need to just record the move used to get to that solution.

Thanks a lot John!

Using your code to understand the approach. Wondering why I am not having the same results as I am making few modifications when porting to 3.3 and other few customisations, but still got a good result (had to run 5000000 iterations instead of 50000, though…).

PS: no: it is not related to a statistical issue but implementation…

Hard to say without seeing the code. Though guessing you’ve got some small difference in there, that’s affecting things. I’d re-check the code relating to the objective function and make sure that the 2.x code and 3.x code both return the same number for a given solution.

My money would have been on something statistical. Is it the same city map?

Thanks a lot John,

First of all please let me express my admiration to you and all the people like you in the community who are supporting us. Without that support we would be totally lost!

Back to your code, I will follow your advice, thanks. Yes: I am using your data as the only benchmark so far.

A comment that could interest you and the community is that I also found a clever code at Hetland (“Python Algorithms”, pp 262) which works as a 2-approximation for a metric TSP. Could the approximation be a better init_tour than the random one? Maybe you would like in the future to comment about it in this excellent page? I already made some comparisons but still not sure that my code is working correctly, so…

I dare say that using a non-random approximation of the initial tour might well give better results than just hill climbing alone.

This sort of things is normally called a “meta algorithm”. Basically combining a heuristic algorithm (like 2-approximation) with a stochastic algorithm (like hill climbing). The only down side is that sometimes you end up “overfitted” solutions. Basically the initial heuristic algorithm moves you to a part of the fitness landscape that while good, is not as good as it could be. However in practice meta algorithms normally provide a good trade off wrt to speed vs fitness of end solution.

The only other downside is that using meta algorithms using then voids the “blackbox” optimisation nature of these algorithms, as the heuristics usually involve more domain knowledge than just the objective function and a set of operators. Though of course that is why they often work very well – it just means you can’t use that same algorithm on an unrelated problem. Whereas hill climbing is a very general algorithm, that could be used on any number of NP problems. That’s just an argument for tidyness for the sake of it…

What if I had a starting point and wanted to finish at any node without coming back? I have 61 nodes.

Could you email me on the address provided?

Would love your help.

Andrew

Hi Andrew,

you’d change the objective function in that case. Basically you’d just not include the final distance from the last city back to the first one.

cheers,

John