public class SimpleEvolutionState extends EvolutionState
First, all the individuals in the population are created. (A)Then all individuals in the population are evaluated. Then the population is replaced in its entirety with a new population of individuals bred from the old population. Goto (A).
Evolution stops when an ideal individual is found (if quitOnRunComplete is set to true), or when the number of generations (loops of (A)) exceeds the parameter value numGenerations. Each generation the system will perform garbage collection and checkpointing, if the appropriate parameters were set.
This approach can be readily used for most applications of Genetic Algorithms and Genetic Programming.
breeder, breedthreads, C_STARTED_FRESH, C_STARTED_FROM_CHECKPOINT, checkpoint, checkpointDirectory, checkpointModulo, checkpointPrefix, evalthreads, evaluator, exchanger, finisher, generation, initializer, job, numEvaluations, numGenerations, output, P_BREEDER, P_CHECKPOINT, P_CHECKPOINTDIRECTORY, P_CHECKPOINTMODULO, P_CHECKPOINTPREFIX, P_EVALUATIONS, P_EVALUATOR, P_EXCHANGER, P_FINISHER, P_GENERATIONS, P_INITIALIZER, P_QUITONRUNCOMPLETE, P_STATISTICS, parameters, population, quitOnRunComplete, R_FAILURE, R_NOTDONE, R_SUCCESS, random, randomSeedOffset, runtimeArguments, statistics, UNDEFINED| Constructor and Description |
|---|
SimpleEvolutionState() |
| Modifier and Type | Method and Description |
|---|---|
int |
evolve() |
void |
finish(int result) |
void |
startFresh() |
resetFromCheckpoint, run, setup, startFromCheckpointpublic void startFresh()
startFresh in class EvolutionStatepublic int evolve()
evolve in class EvolutionStatepublic void finish(int result)
finish in class EvolutionStateresult - Copyright © 2014 Evolutionary Computation Laboratory at George Mason University. All rights reserved.