pyHarmonySearch is a pure Python implementation of the harmony search (HS) global optimization algorithm.
Project description
pyHarmonySearch is a pure Python implementation of the harmony search (HS) global optimization algorithm. HS is a metaheuristic search algorithm that, similar to simulated annealing, tabu, and evolutionary searches, is based on real world phenomena. Specifically, HS mimics a jazz band improvising together. Courtesy Wikipedia:
In the HS algorithm, each musician (= decision variable) plays (= generates) a note (= a value) for finding a best harmony (= global optimum) all together.
pyHarmonySearch supports both continuous and discrete variables and can take advantage of parallel processing using Python’s built-in multiprocessing module.
For more information on pyHarmonySearch, visit the GitHub project page.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
| Filename, size | File type | Python version | Upload date | Hashes |
|---|---|---|---|---|
| Filename, size pyHarmonySearch-1.4.3-py3-none-any.whl (11.6 kB) | File type Wheel | Python version py3 | Upload date | Hashes View |
| Filename, size pyHarmonySearch-1.4.3.tar.gz (10.6 kB) | File type Source | Python version None | Upload date | Hashes View |
Hashes for pyHarmonySearch-1.4.3-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | c72e27e610675bd8a30187716a4b91aa0fecf0a1aa4b93e5001cbf7352b75cce |
|
| MD5 | 8df8df772f19691e517dfd5fe680b4f6 |
|
| BLAKE2-256 | e33bd7de29c8cdf7a6d9365da2bea6bdc83a1782e00437981956b325e0bc028f |
