Skip to content

Latest commit

 

History

History
35 lines (31 loc) · 1.05 KB

README.md

File metadata and controls

35 lines (31 loc) · 1.05 KB

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