Brute Force Solution of Traveling Salesman Problem

TSP_BRUTE is a FORTRAN90 program 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


The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.


TSP_BRUTE is available in a C version and a C++ version and a FORTRAN77 version and a FORTRAN90 version and a MATLAB version.

Related Data and Programs:

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

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

COMBINATION_LOCK, a FORTRAN90 program which simulates the process of determining the secret combination of a lock.

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

LAU_NP, a FORTRAN90 library 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 library which seeks solutions of the partition problem, splitting a set of integers into two subsets with equal sum.

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

SUBSET_SUM, a FORTRAN90 library which seeks solutions of the subset sum problem.

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

TSP_IO, a FORTRAN90 library which reads or writes files in the TSP format used for examples of the traveling salesperson problem.

TSP_LAU, a FORTRAN90 library which implements a heuristic algorithm for the solution of the traveling salesperson problem, by Hang Tong Lau.


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

Source Code:

Examples and Tests:

List of Routines:

You can go up one level to the FORTRAN90 source codes.

Last revised on 19 January 2013.