pyHarmonySearch

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

This version

1.4.1

Jul 11, 2018

1.3.3

Dec 6, 2015

1.3.2

Nov 3, 2014

1.3.1

Nov 3, 2014

1.3

Oct 30, 2014

1.2

Oct 9, 2013

1.1

Oct 4, 2013

1.0.1

Jun 30, 2013

1.0

Jun 30, 2013

Download files

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	Jul 11, 2018
pyHarmonySearch-1.4.1.tar.gz (10.5 kB) Copy SHA256 hash SHA256	Source	None	Jul 11, 2018