Research-grade java code implementing a O(n) heuristic for solving the Traveling Salesman Problem (TSP). This code was not designed to be performant (for speed, check out Concorde). Instead, the goal was to create a psychologically plausible cognitive model of how humans solve the TSP. Details, evaluation against human data, and arguments regarding neural plausibility can be found in this technical report.
-
Notifications
You must be signed in to change notification settings - Fork 1
Hierarchical convex hull-based heuristic for solving the Traveling Salesman Problem
License
tmadl/HTSP
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Hierarchical convex hull-based heuristic for solving the Traveling Salesman Problem
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published