A TSP solver for Python without any dependencies.
elkai - a Python 3 TSP solver
💾 To install it run
pip install elkai
💻 Supported platforms: elkai is available on Windows, Linux, OS X for Python 3.5 and above as a binary wheel.
import elkai elkai.solve_int_matrix([ [1, 1], [1, 1] ]) # Output: [0, 1]
solve_int_matrix(matrix, runs=10) solves an instance of the asymmetric TSP problem with integer distances.
matrix: an N*N matrix representing an integer distance matrix between cities.
An example of N=3 city arrangement:
[ # cities are zero indexed, d() is distance [0, 4, 9], # d(0, 0), d(0, 1), d(0, 2) [4, 0, 10], # d(1, 0), d(1, 1), ... [2, 4, 0] # ... and so on ]
runs: An integer representing how many iterations the solver should perform. By default, 10.
Return value: The tour represented as a list of indices. The indices are zero-indexed and based on the distance matrix order.
solve_float_matrix(matrix, runs=10) has the same signature as the previous, but allows floating point distances. It may be inaccurate.
What's the difference between LKH and elkai?
elkai is a library that contains the LKH solver and has some wrapper code to expose it to Python. The advantage is that you don't have to compile LKH yourself or download LKH executables and then manually parse the output.
How accurately does it solve TSP problems?
Instances with known solutions, which are up to N=315 cities, can be solved optimally.
Can you run multiple threads?
The library doesn't not release the GIL during the solution search, so other threads will be blocked. If you want to solve multiple problems concurrently you may try the multiprocessing module.
P.S.: The LKH solver was written in C with one problem per process in mind. We try to clean up the global state before and after solving a problem, but leaks are possible - if you want to help out, run Valgrind or similar diagnostics and submit an issue/PR.
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.