Travelling Salesman Problem

Summary

We implemented the MAX-MIN Ant System algorithm to solve the Travelling Salesman Problem

Installation

To install the dependencies use pip and the requirements.txt in this directory. e.g.

    $ pip install -r requirements.txt

How to Run

Open the jupyter notebook tsp_aco.ipynb and run the cells

Files

• model.py: Contains the agent class, and the overall model class.
• tsp_aco.ipynb: Notebook demonstrating how to run experiments and parameter sweeps on the model.
• data/wi29.tsp: TSP problem instance in tsplib format.