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.
Project details
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.
Source Distribution
Built Distribution
Hashes for pyHarmonySearch-1.4.2-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | d762a5d43e9fcbe79d7932e936d1a0fc64e11a31af3ae1a9119cdeeb67f2913c |
|
MD5 | 275dd22289e68aa4d64098f460f49eaa |
|
BLAKE2b-256 | c625b9d07c447811cbfd01991d224181e4ec1043e934cc96e35641162f8b36db |