Hierarchical convex hull-based heuristic for solving the Traveling Salesman Problem
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
build
libtsp
nbproject
src
.classpath
.gitignore
.project
LICENSE
README.md
SolverTest.log
SolverTest_60-30_optp.log
SolverTest_rnd.log
asdf2.tsp
build.xml
madl_tsp_paper.pdf
manifest.mf
screenshot.png

README.md

Hierarchical convex hull-based heuristic for solving the Traveling Salesman Problem

logo

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.