tsp_brute

tsp_brute, a C++ code which solves small versions of the traveling salesman problem (TSP), using brute force.

The user must prepare a file beforehand, containing the city-to-city distances. The program will request the name of this file, and then read it in. An example of such a file is:

        0  3  4  2  7
        3  0  4  6  3
        4  4  0  5  8
        2  6  5  0  6
        7  3  8  6  0
      

Licensing:

The information on this web page is distributed under the MIT license.

Languages:

tsp_brute is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.

Related Data and Programs:

tsp_brute_test

cpp_combinatorics, a C++ code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.

tsp, a dataset directory which contains test data for the traveling salesperson problem;

Reference:

1. Gerhard Reinelt,
   TSPLIB - A Traveling Salesman Problem Library,
   ORSA Journal on Computing,
   Volume 3, Number 4, Fall 1991, pages 376-384.

Source Code:

• tsp_brute.cpp, the source code.
• tsp_brute.sh, compiles the source code.