TSP_BRUTE
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
      

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.

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.

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.f90, the source code.

Examples and Tests:

• tsp_5.txt, an example of a 5x5 city-to-city distance matrix.
• tsp_5_output.txt, the output file.

List of Routines:

• MAIN is the main program for TSP_BRUTE.
• CH_CAP capitalizes a single character.
• CH_EQI is a case insensitive comparison of two characters for equality.
• CH_TO_DIGIT returns the integer value of a base 10 digit.
• FILE_COLUMN_COUNT counts the number of columns in the first line of a file.
• FILE_ROW_COUNT counts the number of row records in a file.
• GET_UNIT returns a free FORTRAN unit number.
• PERM_NEXT3 computes all of the permutations of N objects, one at a time.
• R8_HUGE returns a very large R8.
• R8MAT_DATA_READ reads data from an R8MAT file.
• R8MAT_HEADER_READ reads the header from an R8MAT file.
• S_TO_R8 reads an R8 from a string.
• S_TO_R8VEC reads an R8VEC from a string.
• S_WORD_COUNT counts the number of "words" in a string.
• TIMESTAMP prints the current YMDHMS date as a time stamp.

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