pyHarmonySearch is a pure Python implementation of the harmony search (HS) global optimization algorithm.
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.
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size & hash SHA256 hash help||File type||Python version||Upload date|
|pyHarmonySearch-1.4.1-py3-none-any.whl (10.2 kB) Copy SHA256 hash SHA256||Wheel||3.7|
|pyHarmonySearch-1.4.1.tar.gz (10.5 kB) Copy SHA256 hash SHA256||Source||None|