The HMS (Hierarchic Memetic Strategy) is a composite global optimization strategy consisting of a multi-population evolutionary strategy and some auxiliary methods. The HMS makes use of a dynamically-evolving data structure that provides an organization among the component populations. It is a tree with a fixed maximal height and variable internal node degree. Each component population is governed by a particular evolutionary engine. This package provides a simple R implementation with examples of using different genetic algorithms as the population engines. References: J. Sawicki, M. ÅoÅ, M. SmoÅka, J. Alvarez-Aramberri (2022) <doi:10.1007/s11047-020-09836-w>.
Version: 1.0.1 Imports: GA, msm, methods, uuid, graphics Suggests: testthat (≥ 3.0.0), ecr, filelock, parallel, doParallel, grDevices, smoof Published: 2023-10-25 DOI: 10.32614/CRAN.package.hmsr Author: Wojciech Achtelik [aut, cre], Marcin Kozubek [aut], Maciej SmoÅka [ths, aut] (Java original), AGH University of Kraków [cph] Maintainer: Wojciech Achtelik <wachtelik at gmail.com> BugReports: https://github.com/WojtAcht/hms/issues License: MIT + file LICENSE URL: https://wojtacht.github.io/hms/ NeedsCompilation: no Materials: README, NEWS CRAN checks: hmsr results Documentation: Downloads: Linking:Please use the canonical form https://CRAN.R-project.org/package=hmsr to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4