LA: Lioness Algorithm (LA)

Contains Lioness Algorithm (LA) for finding optimal designs over continuous design space, optimal Latin hypercube designs, and optimal order-of-addition designs. LA is a brand new nature-inspired meta-heuristic optimization algorithm. Detailed methodologies of LA and its implementation on numerical simulations can be found at Hongzhi Wang, Qian Xiao and Abhyuday Mandal (2021) <arXiv:2010.09154>.

Version: 0.1.2
Imports: stats, LHD (≥ 1.3.3), utils
Suggests: testthat (≥ 3.0.0), knitr, rmarkdown, devtools
Published: 2021-09-22
Author: Hongzhi Wang [aut, cre], Qian Xiao [aut], Abhyuday Mandal [aut]
Maintainer: Hongzhi Wang <hw34508 at>
License: MIT + file LICENSE
NeedsCompilation: no
Materials: NEWS
CRAN checks: LA results


Reference manual: LA.pdf
Vignettes: Vignette for Package LA


Package source: LA_0.1.2.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): LA_0.1.2.tgz, r-release (x86_64): LA_0.1.2.tgz, r-oldrel: LA_0.1.2.tgz
Old sources: LA archive


Please use the canonical form to link to this page.