This blog presents an implementation of an Ant Colony Optimization (ACO) framework using Visual C# 2005 Express.
What is ACO ?
ACO is the evolution of the Ant Algorithms, algorithms that were based on observation on ants. It is a metaheuristic algorithm that is used to solve complex problems (NP-hard) such as the Travelling Salesman Problem(in this problem, a salesman has to travel across each city in a minimum distance). There is a lot of litterate on ACO and TSP on the web...
Where does it come from ?
My implementation is based on the book Ant Colony Optimization from Marco Dorigo. I must say that the authors have takened care of giving clear and well-detailled pseudo-code to make an implementation easy.
The first results
Here are some outputs of the TSP computation of burma14 using my framework. The red line represents the best-so-far solution, the other lines are colored with respect to their pheromone intensity.
Download
The download called MetaHeuristics is available at http://www.codeplex.com/metaheuristics .
Page rendered at Thursday, December 04, 2008 6:10:01 AM UTC
Disclaimer The opinions expressed herein are my own personal opinions and do not represent my employer's view in anyway.