Skip to content
/ tsp Public

Methods and algorithms pertaining to finding the shortest tour for a fully connected graph, i.e. solutions to the Travelling Salesman Problem.

License

Notifications You must be signed in to change notification settings

oliverfunk/tsp

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

19 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Solution to the Travelling Sales Problem

Methods and algorithms pertaining to finding the shortest tour for a fully connected graph, i.e. solutions to the Travelling Salesman Problem.

At the moment, only Ant Colony Optimization has been implemented (https://en.wikipedia.org/wiki/Ant_colony_optimization_algorithms).

Credits:

Dorigo, Marco, and Mauro Birattari. "Ant colony optimization." Encyclopedia of machine learning. Springer US, 2010. 36-39.

About

Methods and algorithms pertaining to finding the shortest tour for a fully connected graph, i.e. solutions to the Travelling Salesman Problem.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages