Skip to content

About

Implementation of the Genetic Algorithm (GA) and Ant Colony Optimisation (ACO) metaheuristics applied to solve the Travelling Salesman Problem (TSP).

Resources

Stars

2 stars

Watchers

1 watching

Forks

Latest commit

 

History

31 Commits

Folders and files

Repository files navigation

Applied Metaheuristics

In this work, we look at generating improved solutions to the 'Travelling Salesman Problem' using metaheuristics. In particular Ant Colonony Optimisation and a variant of the Genetic Algorithm are used. We initally compare the two metaheuristics against a greedy nearest neighbour algorithm and then against one another.

First time setup

  1. Install Python 3.
  2. Install JupyterLab with pip by running: pip install jupyterlab
  3. Clone this repository locally
  4. Open terminal in the cloned directory
  5. Install required Python packages by running: pip install -r requirements.txt
  6. Start JupyterLab by running: jupyter-lab

Dependencies

All Python dependencies that are used in this project should be added to the requirements.txt file on a new line. This allows them all to be installed with a single command: pip install -r requirements.txt

About

Implementation of the Genetic Algorithm (GA) and Ant Colony Optimisation (ACO) metaheuristics applied to solve the Travelling Salesman Problem (TSP).

Resources

Stars

2 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages