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.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | d2efe311858cdeb1a65d346ce47ffe63c4601cea3408bf058af722ed84feaa1d |
|
MD5 | 3297158ebd3fb7ee16800162d5fb5ec3 |
|
BLAKE2b-256 | c54e3be878f124d005298d430ad828b2474f7abeab3c9a78c6e0a959aa9f9635 |