Introduction
Following on from a previous posting on Simulated Annealing applied to travelling salesman problems, here is a posting that carries on in a similar vein, this time focusing on genetic algorithms as our optimization technique of choice.
(more…)
Introduction
Some initial results from experimenting with the 2-opt heuristic and applying it to a standard traveling salesman test problem.
C# / WPF equivalent implementation can be found here:
A summary of the 2-opt heuristic is given here:
http://en.wikipedia.org/wiki/2-opt
A nearest neighbour search algorithm is included in the implementation. A comparison is made of the kind of results we get from the 2-opt algorithms, with and without improving the initial tour using the nearest neighbour algorithm.
(more…)