Skip to content

Self organizing maps (SOM) for approximating a travelling salesman problem (TSP)

Notifications You must be signed in to change notification settings

dramsauer/Self-Organizing-Maps-for-TSP

Repository files navigation

Traveling Salesman Problem with Self-Organizing-Maps

In this project the shortest route through some beer gardens in Regensburg should be learned using a a 1-dim circular SOM with 18 nodes.

alt text

alt text

About

Self organizing maps (SOM) for approximating a travelling salesman problem (TSP)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages