Maximization or Minimization of a fitness function using Jaya Algorithm (JA). A population based method which repeatedly modifies a population of individual solutions. Capable of solving both constrained and unconstrained optimization problems. It does not contain any hyperparameters. For further details: R.V. Rao (2016) <doi:10.5267/j.ijiec.2015.8.004> .
Version: | 0.1.9 |
Imports: | GA |
Suggests: | knitr, rmarkdown, evaluate, testthat |
Published: | 2019-11-12 |
DOI: | 10.32614/CRAN.package.Jaya |
Author: | Mayur Shende [aut], Neeraj Bokde [aut, cre] |
Maintainer: | Neeraj Bokde <neerajdhanraj at gmail.com> |
License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
NeedsCompilation: | no |
CRAN checks: | Jaya results |
Reference manual: | Jaya.pdf |
Vignettes: |
A_guide_to_JA |
Package source: | Jaya_0.1.9.tar.gz |
Windows binaries: | r-devel: Jaya_0.1.9.zip, r-release: Jaya_0.1.9.zip, r-oldrel: Jaya_0.1.9.zip |
macOS binaries: | r-release (arm64): Jaya_0.1.9.tgz, r-oldrel (arm64): Jaya_0.1.9.tgz, r-release (x86_64): Jaya_0.1.9.tgz, r-oldrel (x86_64): Jaya_0.1.9.tgz |
Please use the canonical form https://CRAN.R-project.org/package=Jaya to link to this page.