Skip to content
This repository has been archived by the owner on Mar 17, 2018. It is now read-only.
/ tsp-solver Public archive

Heuristics and exact methods for solving the Traveling Salesman Problem

Notifications You must be signed in to change notification settings

asrivast28/tsp-solver

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

78 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Select Approaches for Solving the Travelling Salesman Problem

This project was undertaken as part of CSE 6140 - CSE Algorithms. The final report for the project can be found here.

Contributors

Building

SCons

SCons is used for building the project. It is based on Python and can be easily downloaded and installed. After installing SCons, following needs to be executed on the command line:

scons [DEBUG=1]

This builds the project in builds/[release|debug] directory under the current directory and installs the final executable, named tspsolver[_debug], in the current directory.

Make

Alternatively, the project can also be built using Makefile by executing following on the command line:

make

This builds the project in the top level directory under the current directory and installs the final executable, named tspsolver, in the current directory. Note that only release version can be built using Makefile. Please use SCons, described above, if you want to build the debug version.

Required Libraries

Boost libraries are required for building the project. Installing libboost-all-dev, on Linux, should do the trick.

Running

The executable can be run as follows:

./tspsolver[_debug] --alg [BnB | Approx | Heur| LS1 | LS2] --inst <filename.tsp> [--time <cutoff (in seconds)>] [--seed <seed number>]

About

Heuristics and exact methods for solving the Traveling Salesman Problem

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published