A solver based on Heuristic Tree Search
Project description
Tree Search Solver (Python)
A solver based on heuristic tree search.
This is the Python3 version of the C++ package 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:
- Greedy
greedy
- Best First Search
best_first_search
- Iterative Beam Search
iterative_beam_search
Examples
Usage, running examples from command line
Install
pip3 install treesearchsolverpy
Running an example:
mkdir -p data/travellingsalesman/instance
python3 -m examples.travellingsalesman -a generator -i data/travellingsalesman/instance
python3 -m examples.travellingsalesman -a iterative_beam_search -i data/travellingsalesman/instance_50.json
Update:
pip3 install --upgrade treesearchsolverpy
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.5-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | cf4013cf13caed75be34c9a8f2eaddf0d51956018df9dc0da962abba7457181b |
|
MD5 | 3a3a2ebd54a5cb73c51163e6f836fa72 |
|
BLAKE2b-256 | 8277eca774fd7e9426ffe8e3e7bd2623c76544dbf09b4902b08f662ccef0f527 |