Travelling Salesman Problem "solver" in C++
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.
.gitignore Implemented the shuffling Jun 25, 2014
Makefile First commit! Jun 25, 2014 Create Aug 31, 2014
tsp.cpp Algorithm upgrade Jun 28, 2014


Travelling Salesman Problem "solver" in C++

We had a friendly competition at Jayway where I work of who could get the best result in different instances of the Traveling Salesman Problem. I wrote my solver in C++ to refresh my knowledge there an it worked fairly well. I quickly achieved very good results on the smaller instances but had problems dealing with instances with 10,000 nodes.