tsp_brute


tsp_brute, a FORTRAN90 code which solves small versions of the traveling salesman problem, 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 computer code and data files described and made available on this web page are distributed under the GNU LGPL license.

Languages:

tsp_brute is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a Python version.

Related Data and Programs:

tsp_brute_test

change_making, a FORTRAN90 code which considers the change making problem, in which a given sum is to be formed using coins of various denominations.

cities, a FORTRAN90 code which handles various problems associated with a set of "cities" on a map.

combination_lock, a FORTRAN90 code which simulates the process of determining the secret combination of a lock.

knapsack_01, a FORTRAN90 code which uses brute force to solve small versions of the 0/1 knapsack problem;

lau_np, a FORTRAN90 code which includes heuristic approaches to certain NP-complete problems, including the traveling salesman problem, the K-center problem and the K-median problem.

partition_problem, a FORTRAN90 code which seeks solutions of the partition problem, splitting a set of integers into two subsets with equal sum.

satisfy, a FORTRAN90 code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem.

subset_sum, a FORTRAN90 code which seeks solutions of the subset sum problem.

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

tsp_io, a FORTRAN90 code which reads or writes files in the format used for examples of the traveling salesperson problem (TSP).

tsp_lau, a FORTRAN90 code which implements a heuristic algorithm for the solution of the traveling salesperson problem (TSP), by Hang Tong Lau.

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:


Last revised on 19 January 2013.