Code for TSP
drvinceknight opened this issue · comments
Vince Knight commented
@geraintpalmer made a good suggestion to make:
get_initial_solution
get_neighbour
get_cost
inputs to a run_neighbourhood_search
function.
Three nice options to look at for get_neightbour
:
get_random_solution
swap_two_stops
swap_two_paths
The benefits of all this include:
- Highlighting the mathematical building blocks of neighbourhood search
- Show the effect of trying different neighbourhoods