A Julia wrapper for the Concorde TSP Solver.

This Concorde.jl package is in MIT License. However, the underlying Concorde solver is available for free only for academic research as described in the Concorde website.

] add Concorde
] build Concorde

Currently, this package works in 64-bit operations systems of Windows 10, macOS, and Ubuntu.

Only symmetric problems are supported.

using Concorde
M = [
     0  16   7  14
    16   0   3   5
     7   3   0  16
    14   5  16   0 
]
opt_tour, opt_len = solve_tsp(M)

The distance matrix M must be integer-valued.

using Concorde
n_nodes = 10
x = rand(n_nodes) .* 10000
y = rand(n_nodes) .* 10000
opt_tour, opt_len = solve_tsp(x, y; dist="EUC_2D")

where dist is a choice of the distance function.

Available dist functions are listed in TSPLIB_DOC.pdf. (Some may have not been implemented in this package.)

Using the TSPLIB format:

opt_tour, opt_len = solve_tsp("gr17.tsp")

• Concorde.jl: Julia wrapper of the Concorde TSP Solver.
• LKH.jl: Julia wrapper of the LKH heuristic solver.
• TSPLIB.jl: Reads TSPLIB-format files (*.tsp)
• TravelingSalesmanExact.jl: Julia implementation of Dantzig, Fulkerson, and Johnson's Cutting-Plane Method.