Some results of applying a C# / WPF implementation of the ant colony optimisation algorithm to the travelling salesman problem (TSP). My initial observation is that it finds fairly reasonable solutions within a given number of iterations, but falls short of algorithms such as two-opt, Lin-Kernighan etc. The software is built around the Model-View-ViewModel (MVVM) …

Continue reading ‘Applying Ant Colony Optimisation to travelling salesman problems in C#’ »