A TSP solver using a self organizing map (Wikipedia), which is quite fast when optimum is not needed. Within a couple % of optimum on maps with 10 000 cities in about a minute. Written in C++ and Qt. The pdf contains more detailed information.
-
Notifications
You must be signed in to change notification settings - Fork 0
fredrikpe/TSP-SelfOrganizingMap
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
A TSP solver using self organizing map. Written in C++ and Qt
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published