NoFitness

Type Members

abstract type A

Definition Classes
Archive → A
case class EvolutionState(population: Population[Evolution.G, Evolution.P, Evolution.F, Evolution.MF], archive: Evolution.A, generation: Int, terminationState: Evolution.STATE, terminated: Boolean) extends Product with Serializable

Represent a state of the evolution algorithm
Represent a state of the evolution algorithm

Definition Classes
Evolution
type F = None.type

Definition Classes
NoFitness → F
abstract type G

Definition Classes
G
abstract type MF

the type of the meta-fitness
the type of the meta-fitness

Definition Classes
MF
abstract type P

Definition Classes
P
abstract type STATE

Type of the state maintained to study the evolution of the algorithm
Type of the state maintained to study the evolution of the algorithm

Definition Classes
Termination

Abstract Value Members

abstract def breed(individuals: Seq[Individual[G, P, F]], a: A, size: Int)(implicit aprng: Random): Seq[G]

Definition Classes
Breeding
abstract def combine(a1: A, a2: A): A

Definition Classes
Archive
abstract def diff(original: A, modified: A): A

Definition Classes
Archive
abstract def elitism(oldGeneration: Seq[Individual[G, P, F]], newGeneration: Seq[Individual[G, P, F]], archive: A)(implicit aprng: Random): Seq[Individual[G, P, F]]

Definition Classes
Elitism
abstract def express(g: G, rng: Random): P

Definition Classes
Problem
abstract def initialArchive: A

Definition Classes
Archive
abstract def initialState: STATE

Compute the initial state
Compute the initial state
returns
the initial state

Definition Classes
Termination
abstract def lambda: Int

the size of the offspring
the size of the offspring

Definition Classes
Lambda
abstract def modify(individuals: Seq[Individual[G, P, F]], archive: A): Population[G, P, F, MF]

Generate a population from a set of indiviuals
Generate a population from a set of indiviuals
individuals
a set of individual
returns
the population with the meta-fitness for each individual

Definition Classes
Modifier
abstract def terminated(population: ⇒ Population[G, P, F, MF], terminationState: STATE): (Boolean, STATE)

Test if the algorithm has converged.
Test if the algorithm has converged.
population
the current population
terminationState
the actual termination state
returns
a boolean which is equal to true if a terminal state has been detected and the new termination state

Definition Classes
Termination
abstract def toArchive(individuals: Seq[Individual[G, P, F]]): A

Definition Classes
Archive

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def archive(a: A, individuals: Seq[Individual[G, P, F]]): A

Definition Classes
Archive
final def asInstanceOf[T0]: T0

Definition Classes
Any
def buildRNG(seed: Long): Random

Definition Classes
Evolution
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def evaluate(phenotype: P, rng: Random): F

Evaluate a phenotype
Evaluate a phenotype
phenotype
the phenotype to evaluate
returns
the phenotype

Definition Classes
NoFitness → Problem
def evolve(implicit rng: Random): Iterator[EvolutionState]

Definition Classes
Problem
def evolve(expression: (G, Random) ⇒ P, evaluation: (P, Random) ⇒ F)(implicit prng: Random): Iterator[EvolutionState]

Run the evolutionary algorithm
Run the evolutionary algorithm
expression
the genome expression
evaluation
the fitness evaluator
returns
an iterator over the states of the evolution

Definition Classes
Evolution
def evolve(individuals: Seq[Individual[G, P, F]], a: A, expression: (G, Random) ⇒ P, evaluation: (P, Random) ⇒ F)(implicit aprng: Random): Iterator[EvolutionState]

Run the evolutionary algorithm
Run the evolutionary algorithm
individuals
the initial individuals
expression
the genome expression
evaluation
the fitness evaluator
returns
an iterator over the states of the evolution

Definition Classes
Evolution
def filter(individuals: Seq[Individual[G, P, F]]): Seq[Individual[G, P, F]]

Filter the individuals
Filter the individuals
individuals
the set of evaluated individuals
returns
the filtrated individuals

Definition Classes
IndividualFilter
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def fitness: SimpleLens[F, Seq[Double]]

Definition Classes
NoFitness → MG
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def step(individuals: Seq[Individual[G, P, F]], archive: A, expression: (G, Random) ⇒ P, evaluation: (P, Random) ⇒ F)(implicit rng: Random): (Seq[Individual[G, P, F]], A)

Evolve one step
Evolve one step
individuals
the current population
archive
the current archive
expression
expression of the genome
evaluation
the fitness evaluator
returns
a new population of evaluated solutions

Definition Classes
Evolution
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toPopulation(individuals: Seq[Individual[G, P, F]], a: A): Population[G, P, F, MF]

Generate a population from a set of indiviuals that is filtered in a first time
Generate a population from a set of indiviuals that is filtered in a first time
individuals
a set of individual
returns
the filtred population with the meta-fitness for each individual

Definition Classes
Modifier
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

trait NoFitness extends Problem with MG

Type Members

abstract type A

case class EvolutionState(population: Population[Evolution.G, Evolution.P, Evolution.F, Evolution.MF], archive: Evolution.A, generation: Int, terminationState: Evolution.STATE, terminated: Boolean) extends Product with Serializable

type F = None.type

abstract type G

abstract type MF

abstract type P

abstract type STATE

Abstract Value Members

abstract def breed(individuals: Seq[Individual[G, P, F]], a: A, size: Int)(implicit aprng: Random): Seq[G]

abstract def combine(a1: A, a2: A): A

abstract def diff(original: A, modified: A): A

abstract def elitism(oldGeneration: Seq[Individual[G, P, F]], newGeneration: Seq[Individual[G, P, F]], archive: A)(implicit aprng: Random): Seq[Individual[G, P, F]]

abstract def express(g: G, rng: Random): P

abstract def initialArchive: A

abstract def initialState: STATE

abstract def lambda: Int

abstract def modify(individuals: Seq[Individual[G, P, F]], archive: A): Population[G, P, F, MF]

abstract def terminated(population: ⇒ Population[G, P, F, MF], terminationState: STATE): (Boolean, STATE)

abstract def toArchive(individuals: Seq[Individual[G, P, F]]): A

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def archive(a: A, individuals: Seq[Individual[G, P, F]]): A

final def asInstanceOf[T0]: T0

def buildRNG(seed: Long): Random

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def evaluate(phenotype: P, rng: Random): F

def evolve(implicit rng: Random): Iterator[EvolutionState]

def evolve(expression: (G, Random) ⇒ P, evaluation: (P, Random) ⇒ F)(implicit prng: Random): Iterator[EvolutionState]

def evolve(individuals: Seq[Individual[G, P, F]], a: A, expression: (G, Random) ⇒ P, evaluation: (P, Random) ⇒ F)(implicit aprng: Random): Iterator[EvolutionState]

def filter(individuals: Seq[Individual[G, P, F]]): Seq[Individual[G, P, F]]

def finalize(): Unit

def fitness: SimpleLens[F, Seq[Double]]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def step(individuals: Seq[Individual[G, P, F]], archive: A, expression: (G, Random) ⇒ P, evaluation: (P, Random) ⇒ F)(implicit rng: Random): (Seq[Individual[G, P, F]], A)

final def synchronized[T0](arg0: ⇒ T0): T0

def toPopulation(individuals: Seq[Individual[G, P, F]], a: A): Population[G, P, F, MF]

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from fitness.MG

Inherited from Problem

Inherited from Evolution

Inherited from elitism.Elitism

Inherited from breed.Breeding

Inherited from archive.Archive

Inherited from Lambda

Inherited from modifier.Modifier

Inherited from archive.A

Inherited from modifier.IndividualFilter

Inherited from termination.Termination

Inherited from modifier.MF

Inherited from fitness.F

Inherited from phenotype.P

Inherited from genome.G

Inherited from AnyRef

Inherited from Any

Ungrouped