fr.iscpif.mgo

Evolution

trait Evolution extends Termination with Modifier with Lambda with G with F with P with MF with Archive with Breeding with Elitism

Trait evolution provide the feature to define an evolutionary algorithm

Self Type
Evolution
Linear Supertypes
elitism.Elitism, breed.Breeding, archive.Archive, Lambda, modifier.Modifier, archive.A, modifier.IndividualFilter, termination.Termination, modifier.MF, fitness.F, phenotype.P, genome.G, AnyRef, Any
Known Subclasses
BehaviourSearch, GAProblem, Himmelblau, Map, NSGAII, NoFitness, Problem, Profile, Rastrigin, RastriginVector, Rosenbrock, SMSEMOEA, Scaling, Sphere, ZDT4
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Evolution
  2. Elitism
  3. Breeding
  4. Archive
  5. Lambda
  6. Modifier
  7. A
  8. IndividualFilter
  9. Termination
  10. MF
  11. F
  12. P
  13. G
  14. AnyRef
  15. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. abstract type A

    Definition Classes
    Archive → A

  2. 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

  3. abstract type F

    Definition Classes
    F

  4. abstract type G

    Definition Classes
    G

  5. abstract type MF

    the type of the meta-fitness

    the type of the meta-fitness

    Definition Classes
    MF

  6. abstract type P

    Definition Classes
    P

  7. 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

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

    Definition Classes
    Breeding

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

    Definition Classes
    Archive

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

    Definition Classes
    Archive

  4. 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

  5. abstract def initialArchive: A

    Definition Classes
    Archive

  6. abstract def initialState: STATE

    Compute the initial state

    Compute the initial state

    returns

    the initial state

    Definition Classes
    Termination

  7. abstract def lambda: Int

    the size of the offspring

    the size of the offspring

    Definition Classes
    Lambda

  8. 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

  9. 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

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

    Definition Classes
    Archive

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    Archive

  5. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  6. def buildRNG(seed: Long): Random

  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  8. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  10. 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

  11. 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

  12. 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

  13. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  14. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  15. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  16. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  17. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  18. final def notify(): Unit

    Definition Classes
    AnyRef

  19. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  20. 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

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

    Definition Classes
    AnyRef

  22. 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

  23. def toString(): String

    Definition Classes
    AnyRef → Any

  24. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  26. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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