Python micro framework for building nature-inspired algorithms.
Nature-inspired algorithms are a very popular tool for solving optimization problems. Numerous variants of nature-inspired algorithms have been developed since the beginning of their era. To prove their versatility, those were tested in various domains on various applications, especially when they are hybridized, modified or adapted. However, implementation of nature-inspired algorithms is sometimes a difficult, complex and tedious task. In order to break this wall, NiaPy is intended for simple and quick use, without spending time for implementing algorithms from scratch.
- numerous benchmark functions implementations,
- use of various nature-inspired algorithms without struggle and effort with a simple interface,
- easy comparison between nature-inspired algorithms and
- export of results in various formats (LaTeX, JSON, Excel).
Python micro framework for building nature-inspired algorithms. Official documentation is available here.
The micro framework features following algorithms:
- Artificial bee colony algorithm
- Bat algorithm
- Differential evolution algorithm
- Firefly algorithm
- Flower pollination algorithm
- Genetic algorithm
- Grey wolf optimizer
- Particle swarm optimization
- Hybrid bat algorithm
- Self-adaptive differential evolution algorithm
The following benchmark functions are included in NiaPy:
- Chung Reynolds
- Happy cat
- Schumer Steiglitz
- Schwefel 2.21
- Schwefel 2.22
- Sum Squares
- Python 3.6+ (backward compatibility with 2.7.14)
- click == *
- numpy == 1.14.0
- scipy == 1.0.0
- xlsxwriter == 1.0.2
List of development dependencies and requirements can be found in the installation section of NiaPy documentation.
Install NiaPy with pip:
$ pip install NiaPy
or directly from the source code:
$ git clone https://github.com/NiaOrg/NiaPy.git $ cd NiaPy $ python setup.py install
After installation, the package can imported:
$ python >>> import NiaPy >>> NiaPy.__version__
For more usage examples please look at examples folder.
We encourage you to contribute to NiaPy! Please check out the Contributing to NiaPy guide for guidelines about how to proceed.
Everyone interacting in NiaPy’s codebases, issue trackers, chat rooms and mailing lists is expected to follow the NiaPy code of conduct.
This package is distributed under the MIT License. This license can be found online at http://www.opensource.org/licenses/MIT.
This framework is provided as-is, and there are no guarantees that it fits your purposes or that it is bug-free. Use it at your own risk!
1.0.2 (Oct 24, 2018)
- fix Bat and Hybrid Bat algorithms
1.0.1 (Mar 21, 2018)
This release reflects the changes from Journal of Open Source Software (JOSS) review: - Better API Documentation - Clarification of set-up requirements in README - Improved paper
1.0.0 (Feb 28, 2018)
- stable release 1.0.0
1.0.0rc2 (Feb 28, 2018)
- fix PyPI build
1.0.0rc1 (Feb 28, 2018)
- version 1.0.0 release candidate 1
- added 10 algorithms
- added 26 benchmark functions
- added Runner utility with export functionality
Release history Release notifications | RSS feed
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size NiaPy-1.0.2-py3-none-any.whl (55.6 kB)||File type Wheel||Python version py3||Upload date||Hashes View|
|Filename, size NiaPy-1.0.2.tar.gz (42.5 kB)||File type Source||Python version None||Upload date||Hashes View|