Skip to content
Example implementation of 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.
algorithms
.gitignore
Makefile
README.md
main.cpp
tsp.hpp
tsplib.cpp
tsplib.hpp

README.md

tsp_impl

Example implementation of Traveling Salesman Problem.

how to use

  • clone this repository.

  • compile

$ cd tsp_impl
$ make
  • call tsp_impl with option.
$ ./tsp_impl

Usage: tsp_impl [ -l ][ -a ] -t <tsplib_file>

  -t tsplib_file    test data that included tsplib
  -l                list of algorithms and tsplib files
  -a name           define target algorithm (default: brute force)
  -h                print this help

One of -l or -t must be specified.

Test case

Download TSPLIB data.

MP-TESTDATA - The TSPLIB Symmetric Traveling Salesman Problem Instances

You can’t perform that action at this time.