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).
-
Notifications
You must be signed in to change notification settings - Fork 0
dveloz/TravelingSalesman
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This repository contains several heuristics for solving the Traveling Salesman problem
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published