Ant Colony Optimization for Tthe Traveling Salesman Problem.
Project description
ACOpy
Ant Colony Optimization for the Traveling Salesman Problem.
Free software: Apache Software License 2.0
Documentation: https://acopy.readthedocs.io.
Features
Uses NetworkX for graph representation
Solver can be customized via plugins
Has a utility for plotting information about the solving process
CLI tool that supports reading graphs in a variety of formats (including tsplib95)
Support for plotting iteration data using matplotlib and pandas
ACOpy was formerly called “Pants.”
For now, only Python 3.6+ is supported. If there is demand I will add support for 3.4+.
Credits
This package was created with Cookiecutter and the audreyr/cookiecutter-pypackage project template.
History
0.6.2 (2019-02-02)
Fix import issue
0.6.1 (2018-10-07)
Bump dependency on tsplib95 to 0.3.2
0.6.0 (2018-08-18)
First release on PyPI as acopy
Complete rewrite
Support for networkx
Support for tsplib95
Customizable solver
Plotting capabilities
Now uses Apache 2.0 License (formerly GPLv3)
Supports only python 3.6+
0.5.2 (2014-09-09)
Last release on the PyPI as ACO-Pants
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for acopy-0.6.2-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 4281997610a27a7fae20341cfc2931cf848549f269628d5f9bcbafe65126e65d |
|
MD5 | c3565986701fba3e6835ee9de9941b2d |
|
BLAKE2b-256 | c9a7d7520c40da4368abe830d3bc82d3e8148587ff1e9704318fff00c1eb188b |