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>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
2.3 |
rolling linux/jammy R-4.5 | LA_2.3.tar.gz |
122.7 KiB |
2.3 |
rolling linux/noble R-4.5 | LA_2.3.tar.gz |
127.6 KiB |
2.3 |
rolling source/ R- | LA_2.3.tar.gz |
10.9 KiB |
2.3 |
latest linux/jammy R-4.5 | LA_2.3.tar.gz |
122.7 KiB |
2.3 |
latest linux/noble R-4.5 | LA_2.3.tar.gz |
127.6 KiB |
2.3 |
latest source/ R- | LA_2.3.tar.gz |
10.9 KiB |
2.3 |
2026-04-26 source/ R- | LA_2.3.tar.gz |
10.9 KiB |
2.3 |
2026-04-23 source/ R- | LA_2.3.tar.gz |
10.9 KiB |
2.3 |
2026-04-09 windows/windows R-4.5 | LA_2.3.zip |
532.7 KiB |
2.3 |
2025-04-20 source/ R- | LA_2.3.tar.gz |
10.9 KiB |