Home Page Image

MIT Press
659 pp., 290 illus.
September 2008

ISBN-10: 0-262-06271-2
ISBN-13: 978-0-262-06271-8 


Exercises: Ant Colony Optimization


  • Basic knowledge of Matlab programming


In this exercise we focus on using ACO in order to find solutions for TSP.

Ant colony optimization (ACO) is a population-based metaheuristic that can be used to find approximate solutions to difficult optimization problems.

In Traveling Salesman Problem (TSP) you are given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once.


Instructions: ACO_instructions.pdf
Support materials: ACO_support_materials.zip


created by claudio mattiussi, 2008