A solver based on Heuristic Tree Search
Project description
Tree Search Solver (Python)
A solver based on heuristic tree search.
This is the Python version of fontanf/treesearchsolver.
Description
The goal of this repository is to provide a simple framework to quickly implement algorithms based on heuristic tree search.
Solving a problem only requires a couple hundred lines of code (see examples).
Algorithms:
- Iterative Beam Search
iterative_beam_search
Examples
Usage, running examples from command line
python3 -m examples.travellingsalesman -a generator -i data/travellingsalesman/instance
python3 -m examples.travellingsalesman -a iterative_beam_search -i data/travellingsalesman/instance_50.json
Usage, Python library
See examples.
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
Close
Hashes for treesearchsolverpy-0.0.2-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | a00d5797f19be35ad536b74f9f37f1c99d053c3f50f3ca0c77740f0e835718ba |
|
MD5 | 53d9334a599cf366506ba7e81f1ecb0e |
|
BLAKE2b-256 | c004dd7b705e9b3acbc68c5cae127b945f53415ad60fa6d6ae54bd863bbffa19 |