`tsp-tools` is a package for Traveling Salesman Problem for Python.
Project description
tsp-tools is a package for Traveling Salesman Problem for Python.
import tsp_tools t = tsp_tools.tsp([(0,0), (0,1), (1,0), (1,1)]) print(t) # distance, node index list >>> (4.0, [0, 2, 3, 1]) mat = [[ 0, 1, 1, 1.5], [ 1, 0, 1.5, 1], [ 1, 1.5, 0, 1], [1.5, 1, 1, 0]] # Distance Matrix r = range(len(mat)) # Dictionary of distance dist = {(i, j): mat[i][j] for i in r for j in r} print(tsp_tools.tsp(r, dist)) >>> (4.0, [0, 2, 3, 1])
Note: When large size, ortoolpy.ortools_vrp may be efficient.
See also https://pypi.org/project/ortoolpy/
Requirements
Python 3
more-itertools
Features
nothing
Setup
$ pip install tsp-tools
History
0.0.1 (2015-10-2)
first release
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distributions
No source distribution files available for this release.See tutorial on generating distribution archives.
Built Distribution
Close
Hashes for tsp_tools-0.2.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | b11f4b0d3707dcdc75910be489e9b85e6468446b09bd1e596d4f4d2127a717b2 |
|
MD5 | cdd08ee6dc125d6ef46ac30a0bd7300c |
|
BLAKE2b-256 | 847aacb8e0b776240887dccbc8072dcf900bbee9db2078307529d5f1ea3becac |