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.
Source Distribution
File details
Details for the file pyHarmonySearch-1.2.tar.gz.
File metadata
- Download URL: pyHarmonySearch-1.2.tar.gz
- Upload date:
- Size: 9.5 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | c31f9c3bb169dc4370920677508f1fce2f47c950f0dcea66bb9c2be3027442b2 |
|
| MD5 | 1db24a40e59cac0581a1288689a474c7 |
|
| BLAKE2b-256 | 549bd5908d22d168af350532797a7abec38f5ae72e3752662eab7f4e984ae38c |
