Skip to content

Self-organising maps for finding a sub-optimal solution for the traveling salesman problem.

License

Notifications You must be signed in to change notification settings

davidmeijer/som-tsp

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

License: MIT


Description

Small console app for using self-organising maps to calculate a sub-optimal solution for the traveling salesman problem for a given set of coordinates.

Example

Create a sub-optimal shortest route for visiting all places in The Netherlands:

./run_program.sh ./data/nl.csv
0 iterations 5,000 iterations 10,000 iterations
15,000 iterations 20,000 iterations 25,000 iterations

About

Self-organising maps for finding a sub-optimal solution for the traveling salesman problem.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages