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) <doi:10.48550/arXiv.2010.09154>.

Version: 2.3
Imports: Rcpp
LinkingTo: Rcpp, RcppArmadillo
Suggests: testthat (≥ 3.0.0), knitr, rmarkdown, devtools
Published: 2024-06-02
DOI: 10.32614/CRAN.package.LA
Author: Hongzhi Wang [aut, cre], Qian Xiao [aut], Abhyuday Mandal [aut]
Maintainer: Hongzhi Wang <wanghongzhi.ut at>
License: MIT + file LICENSE
NeedsCompilation: yes
Materials: NEWS
CRAN checks: LA results


Reference manual: LA.pdf


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


Please use the canonical form to link to this page.