Skip to content

Latest commit

 

History

History
3 lines (3 loc) · 321 Bytes

File metadata and controls

3 lines (3 loc) · 321 Bytes

Traveling Salesman

This repository contains a collection of different approaches towards the famous Traveling Salesman problem.
In each folder you will find a Jupyter Notebook displaying the best route found by a specific heuristic through a set of cities in three different countries (Qatar, Uruguay and Luxembourg).