The Nearest Neighbour Heuristic

Never one to give up easily, Santa decided to roll up his sleeves and put together an algorithm that could find a rough plan for the journey without waiting so long

What do you think about the results?

This notebook provides a simple implementation of the Nearest Neighbour Heuristic. The algorithm is performs much faster than our implementation of the MTZ model. The solution provided is a valid one, since it does not contain any subtours, and respects all the constraints of our TSP model.

However, as a greedy heuristic, the results leave much to be desired... Scroll down and you will see what we mean!