Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/chkwon/concorde.jl
A Julia wrapper for the Concorde TSP Solver.
https://github.com/chkwon/concorde.jl
concorde travelling-salesman-problem tsp tsp-solver
Last synced: 26 days ago
JSON representation
A Julia wrapper for the Concorde TSP Solver.
- Host: GitHub
- URL: https://github.com/chkwon/concorde.jl
- Owner: chkwon
- License: other
- Created: 2021-02-24T01:21:51.000Z (over 3 years ago)
- Default Branch: master
- Last Pushed: 2024-03-14T04:26:04.000Z (8 months ago)
- Last Synced: 2024-09-15T07:15:53.067Z (about 2 months ago)
- Topics: concorde, travelling-salesman-problem, tsp, tsp-solver
- Language: Julia
- Homepage:
- Size: 1.25 MB
- Stars: 13
- Watchers: 4
- Forks: 2
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
- License: LICENSE.md
Awesome Lists containing this project
README
# Concorde.jl
[](https://github.com/chkwon/Concorde.jl/actions?query=workflow%3ACI)
[](https://codecov.io/gh/chkwon/Concorde.jl)
A Julia wrapper for the [Concorde](http://www.math.uwaterloo.ca/tsp/concorde.html) TSP Solver.
# License
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](http://www.math.uwaterloo.ca/tsp/concorde.html) website.
# Installation
```julia
] add Concorde
] build Concorde
```
Currently, this package works in 64-bit operations systems of Windows 10, macOS, and Ubuntu.
# Usage
Only symmetric problems are supported.
## Using a distance matrix
```julia
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 coordinates
```julia
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`](http://webhotel4.ruc.dk/~keld/research/LKH/LKH-2.0/DOC/TSPLIB_DOC.pdf). (Some may have not been implemented in this package.)
## Using an input file
Using the [TSPLIB format](http://webhotel4.ruc.dk/~keld/research/LKH/LKH-2.0/DOC/TSPLIB_DOC.pdf):
```julia
opt_tour, opt_len = solve_tsp("gr17.tsp")
```
# Related Projects
- [Concorde.jl](https://github.com/chkwon/Concorde.jl): Julia wrapper of the [Concorde TSP Solver](http://www.math.uwaterloo.ca/tsp/concorde/index.html).
- [LKH.jl](https://github.com/chkwon/LKH.jl): Julia wrapper of the [LKH heuristic solver](http://webhotel4.ruc.dk/~keld/research/LKH/).
- [TSPLIB.jl](https://github.com/matago/TSPLIB.jl): Reads [TSPLIB-format](http://webhotel4.ruc.dk/~keld/research/LKH/LKH-2.0/DOC/TSPLIB_DOC.pdf) files (`*.tsp`)
- [TravelingSalesmanExact.jl](https://github.com/ericphanson/TravelingSalesmanExact.jl): Julia implementation of [Dantzig, Fulkerson, and Johnson's Cutting-Plane Method](https://doi.org/10.1287/opre.2.4.393).