Prerequisites
 Basic knowledge of Matlab programming
Overview
In this exercise we focus on using ACO in order to find solutions for TSP.
Ant colony optimization (ACO) is a populationbased 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.
Exercises
Instructions: ACO_instructions.pdf
Support materials: ACO_support_materials.zip
