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.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.0-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 40f7e02fe9eb88a60b1f2cadb945c5e4b669b2024a1f858f507d2a6ad9f8b1e6 |
|
MD5 | aeba810b8fad89a2b9a28baa5e2363c5 |
|
BLAKE2b-256 | 120f2854d61bbda3263fa440a920fd556f5acd015ae0b0eead71156c31e14a24 |