makeTinyGpSearchHeuristic

The crossover probability for search-heuristics that support
this setting (i.e. TinyGP). Defaults to <code>0.9</code>.

crossoverProbability

The size of TinyGP's selection tournaments.

tournamentSize


The search-heuristic, i.e. the concrete GP search algorithm, is a modular component of RGP.
<code>makeTinyGpSearchHeuristic</code> creates an RGP search-heuristic that mimics the search heuristic
implemented in Riccardo Poli's TinyGP system.


RGP is a simple modular Genetic Programming (GP) system build in
pure R. In addition to general GP tasks, the system supports Symbolic
Regression by GP through the familiar R model formula interface. GP
individuals are represented as R expressions, an (optional) type system
enables domain-specific function sets containing functions of diverse
domain- and range types. A basic set of genetic operators for variation
(mutation and crossover) and selection is provided.

makeTinyGpSearchHeuristic: Tiny GP Search Heuristic for RGP

Description

Usage

Arguments

Value