From 8189116ea4b5db4675e31dfd04a5687d55e29262 Mon Sep 17 00:00:00 2001 From: Eduardo Pedroni Date: Tue, 6 May 2014 14:29:37 +0100 Subject: Added javadocs, made minor changes to the comments --- doc/jcgp/backend/modules/Module.html | 288 ++++++++++++ doc/jcgp/backend/modules/class-use/Module.html | 292 ++++++++++++ .../backend/modules/es/EvolutionaryStrategy.html | 290 ++++++++++++ doc/jcgp/backend/modules/es/MuPlusLambda.html | 330 +++++++++++++ .../backend/modules/es/TournamentSelection.html | 333 ++++++++++++++ .../modules/es/class-use/EvolutionaryStrategy.html | 213 +++++++++ .../backend/modules/es/class-use/MuPlusLambda.html | 124 +++++ .../modules/es/class-use/TournamentSelection.html | 124 +++++ doc/jcgp/backend/modules/es/package-frame.html | 22 + doc/jcgp/backend/modules/es/package-summary.html | 162 +++++++ doc/jcgp/backend/modules/es/package-tree.html | 146 ++++++ doc/jcgp/backend/modules/es/package-use.html | 180 ++++++++ .../backend/modules/mutator/FixedPointMutator.html | 284 ++++++++++++ doc/jcgp/backend/modules/mutator/Mutator.html | 281 ++++++++++++ .../modules/mutator/PercentPointMutator.html | 285 ++++++++++++ doc/jcgp/backend/modules/mutator/PointMutator.html | 281 ++++++++++++ .../modules/mutator/ProbabilisticMutator.html | 319 +++++++++++++ .../mutator/class-use/FixedPointMutator.html | 124 +++++ .../backend/modules/mutator/class-use/Mutator.html | 269 +++++++++++ .../mutator/class-use/PercentPointMutator.html | 124 +++++ .../modules/mutator/class-use/PointMutator.html | 179 ++++++++ .../mutator/class-use/ProbabilisticMutator.html | 124 +++++ .../backend/modules/mutator/package-frame.html | 24 + .../backend/modules/mutator/package-summary.html | 182 ++++++++ doc/jcgp/backend/modules/mutator/package-tree.html | 151 ++++++ doc/jcgp/backend/modules/mutator/package-use.html | 210 +++++++++ doc/jcgp/backend/modules/package-frame.html | 20 + doc/jcgp/backend/modules/package-summary.html | 144 ++++++ doc/jcgp/backend/modules/package-tree.html | 137 ++++++ doc/jcgp/backend/modules/package-use.html | 201 ++++++++ doc/jcgp/backend/modules/problem/BestFitness.html | 341 ++++++++++++++ .../modules/problem/DigitalCircuitProblem.html | 455 ++++++++++++++++++ doc/jcgp/backend/modules/problem/Problem.html | 508 +++++++++++++++++++++ .../modules/problem/SymbolicRegressionProblem.html | 468 +++++++++++++++++++ .../modules/problem/TestCaseProblem.TestCase.html | 358 +++++++++++++++ .../backend/modules/problem/TestCaseProblem.html | 427 +++++++++++++++++ .../modules/problem/TravellingSalesmanProblem.html | 433 ++++++++++++++++++ .../modules/problem/class-use/BestFitness.html | 212 +++++++++ .../problem/class-use/DigitalCircuitProblem.html | 124 +++++ .../backend/modules/problem/class-use/Problem.html | 217 +++++++++ .../class-use/SymbolicRegressionProblem.html | 124 +++++ .../class-use/TestCaseProblem.TestCase.html | 249 ++++++++++ .../modules/problem/class-use/TestCaseProblem.html | 227 +++++++++ .../class-use/TravellingSalesmanProblem.html | 124 +++++ .../backend/modules/problem/package-frame.html | 28 ++ .../backend/modules/problem/package-summary.html | 188 ++++++++ doc/jcgp/backend/modules/problem/package-tree.html | 163 +++++++ doc/jcgp/backend/modules/problem/package-use.html | 305 +++++++++++++ 48 files changed, 10794 insertions(+) create mode 100644 doc/jcgp/backend/modules/Module.html create mode 100644 doc/jcgp/backend/modules/class-use/Module.html create mode 100644 doc/jcgp/backend/modules/es/EvolutionaryStrategy.html create mode 100644 doc/jcgp/backend/modules/es/MuPlusLambda.html create mode 100644 doc/jcgp/backend/modules/es/TournamentSelection.html create mode 100644 doc/jcgp/backend/modules/es/class-use/EvolutionaryStrategy.html create mode 100644 doc/jcgp/backend/modules/es/class-use/MuPlusLambda.html create mode 100644 doc/jcgp/backend/modules/es/class-use/TournamentSelection.html create mode 100644 doc/jcgp/backend/modules/es/package-frame.html create mode 100644 doc/jcgp/backend/modules/es/package-summary.html create mode 100644 doc/jcgp/backend/modules/es/package-tree.html create mode 100644 doc/jcgp/backend/modules/es/package-use.html create mode 100644 doc/jcgp/backend/modules/mutator/FixedPointMutator.html create mode 100644 doc/jcgp/backend/modules/mutator/Mutator.html create mode 100644 doc/jcgp/backend/modules/mutator/PercentPointMutator.html create mode 100644 doc/jcgp/backend/modules/mutator/PointMutator.html create mode 100644 doc/jcgp/backend/modules/mutator/ProbabilisticMutator.html create mode 100644 doc/jcgp/backend/modules/mutator/class-use/FixedPointMutator.html create mode 100644 doc/jcgp/backend/modules/mutator/class-use/Mutator.html create mode 100644 doc/jcgp/backend/modules/mutator/class-use/PercentPointMutator.html create mode 100644 doc/jcgp/backend/modules/mutator/class-use/PointMutator.html create mode 100644 doc/jcgp/backend/modules/mutator/class-use/ProbabilisticMutator.html create mode 100644 doc/jcgp/backend/modules/mutator/package-frame.html create mode 100644 doc/jcgp/backend/modules/mutator/package-summary.html create mode 100644 doc/jcgp/backend/modules/mutator/package-tree.html create mode 100644 doc/jcgp/backend/modules/mutator/package-use.html create mode 100644 doc/jcgp/backend/modules/package-frame.html create mode 100644 doc/jcgp/backend/modules/package-summary.html create mode 100644 doc/jcgp/backend/modules/package-tree.html create mode 100644 doc/jcgp/backend/modules/package-use.html create mode 100644 doc/jcgp/backend/modules/problem/BestFitness.html create mode 100644 doc/jcgp/backend/modules/problem/DigitalCircuitProblem.html create mode 100644 doc/jcgp/backend/modules/problem/Problem.html create mode 100644 doc/jcgp/backend/modules/problem/SymbolicRegressionProblem.html create mode 100644 doc/jcgp/backend/modules/problem/TestCaseProblem.TestCase.html create mode 100644 doc/jcgp/backend/modules/problem/TestCaseProblem.html create mode 100644 doc/jcgp/backend/modules/problem/TravellingSalesmanProblem.html create mode 100644 doc/jcgp/backend/modules/problem/class-use/BestFitness.html create mode 100644 doc/jcgp/backend/modules/problem/class-use/DigitalCircuitProblem.html create mode 100644 doc/jcgp/backend/modules/problem/class-use/Problem.html create mode 100644 doc/jcgp/backend/modules/problem/class-use/SymbolicRegressionProblem.html create mode 100644 doc/jcgp/backend/modules/problem/class-use/TestCaseProblem.TestCase.html create mode 100644 doc/jcgp/backend/modules/problem/class-use/TestCaseProblem.html create mode 100644 doc/jcgp/backend/modules/problem/class-use/TravellingSalesmanProblem.html create mode 100644 doc/jcgp/backend/modules/problem/package-frame.html create mode 100644 doc/jcgp/backend/modules/problem/package-summary.html create mode 100644 doc/jcgp/backend/modules/problem/package-tree.html create mode 100644 doc/jcgp/backend/modules/problem/package-use.html (limited to 'doc/jcgp/backend/modules') diff --git a/doc/jcgp/backend/modules/Module.html b/doc/jcgp/backend/modules/Module.html new file mode 100644 index 0000000..b194964 --- /dev/null +++ b/doc/jcgp/backend/modules/Module.html @@ -0,0 +1,288 @@ + + + + + +Module + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
    +
  • Detail: 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
+ + +
+ + +
+
jcgp.backend.modules
+

Class Module

+
+
+ +
+
    +
  • +
    +
    Direct Known Subclasses:
    +
    EvolutionaryStrategy, Mutator, Problem
    +
    +
    +
    +
    public abstract class Module
+extends java.lang.Object
    +
    This class defines the expected behaviour of a module. Generally, modules + are entities which contain parameters; these can be retrieved using + getLocalParameters(). GUIs should make use of this getter + to display visual parameter controls to users. Subclasses don't have direct + access to the list; instead they must use registerParameter() (ideally + in the constructor) to make sure the parameters are returned. +
    + In addition, implementations of Module should specify a module name + in their constructor using setName(). If a name is not provided, + the simple name of the class will be used. +
    + All modules, by definition, contain a reference to the experiment's resources, which + must be passed at construction. The resources should be accessed with getResources().
    +
    +
    Author:
    +
    Eduardo Pedroni
    +
    See Also:
    +
    Parameter
    +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethod and Description
      java.util.ArrayList<Parameter<?>>getLocalParameters() +
      This method is used by the GUI in order to build visual + representations of all parameters used by the module.
      +
      java.lang.StringtoString() 
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
        • +
      +
      • +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getLocalParameters

        +
        public final java.util.ArrayList<Parameter<?>> getLocalParameters()
        +
        This method is used by the GUI in order to build visual + representations of all parameters used by the module. + Therefore, any parameters returned here will be displayed + visually.
        +
        +
        Returns:
        +
        a list of generic parameters exposed by the module.
        +
        +
        • +
      + + + +
        +
      • +

        toString

        +
        public java.lang.String toString()
        +
        +
        Overrides:
        +
        toString in class java.lang.Object
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
    +
  • Detail: 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/class-use/Module.html b/doc/jcgp/backend/modules/class-use/Module.html new file mode 100644 index 0000000..6ab68d0 --- /dev/null +++ b/doc/jcgp/backend/modules/class-use/Module.html @@ -0,0 +1,292 @@ + + + + + +Uses of Class jcgp.backend.modules.Module + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.Module

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/es/EvolutionaryStrategy.html b/doc/jcgp/backend/modules/es/EvolutionaryStrategy.html new file mode 100644 index 0000000..d18e01f --- /dev/null +++ b/doc/jcgp/backend/modules/es/EvolutionaryStrategy.html @@ -0,0 +1,290 @@ + + + + + +EvolutionaryStrategy + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
    +
  • Detail: 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
+ + +
+ + +
+
jcgp.backend.modules.es
+

Class EvolutionaryStrategy

+
+
+ +
+
    +
  • +
    +
    Direct Known Subclasses:
    +
    MuPlusLambda, TournamentSelection
    +
    +
    +
    +
    public abstract class EvolutionaryStrategy
+extends Module
    +
    This class specifies the characteristics of an evolutionary strategy. The evolutionary + strategy's job is to generate the next population of solutions. In JCGP this is done by modifying + the provided population object rather than creating a new one. +

    + A typical implementation of EvolutionaryStratey iterates through the chromosomes + in the population and selects the individual(s) to be promoted. It then uses + mutator.mutate() to generically mutate the promoted individual(s). Parameter-dependent + strategies can be implemented by accessing the parameters via the resources + argument. +

    + Parameters may be specified to control the implemented strategy. Any parameters + registered with registerParameters() should be displayed by the user interface, + if it is being used. See Module for more information. +

    + It is advisable to use Resources.reportln() and Resources.report() + to print any relevant information. Note that reportln() and report() are affected + by the report interval base parameter. Use Resources.println() and + Resources.print() to print information regardless of the current generation. + See Resources for more information.
    +
    +
    Author:
    +
    Eduardo Pedroni
    +
    See Also:
    +
    Module
    +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Method Summary

      + + + + + + + + + + +
      All Methods Instance Methods Abstract Methods 
      Modifier and TypeMethod and Description
      abstract voidevolve(Population population, + Mutator mutator) +
      Performs the selection algorithm and uses the mutator to create + the next generation of solutions.
      +
      + +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
        • +
      +
      • +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        evolve

        +
        public abstract void evolve(Population population,
+                            Mutator mutator)
        +
        Performs the selection algorithm and uses the mutator to create + the next generation of solutions.
        +
        +
        Parameters:
        +
        population - the population to evolve.
        +
        mutator - the mutator with which to mutate the promoted individuals.
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
    +
  • Detail: 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/es/MuPlusLambda.html b/doc/jcgp/backend/modules/es/MuPlusLambda.html new file mode 100644 index 0000000..3ca75c9 --- /dev/null +++ b/doc/jcgp/backend/modules/es/MuPlusLambda.html @@ -0,0 +1,330 @@ + + + + + +MuPlusLambda + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + +
+
jcgp.backend.modules.es
+

Class MuPlusLambda

+
+
+ +
+
    +
  • +
    +
    +
    public class MuPlusLambda
+extends EvolutionaryStrategy
    +
    (μ + λ)-ES +

    + This strategy selects the μ fittest chromosomes from the population. + The promoted individuals are copied into the new population and mutated + λ times, but also carried forward unchanged. The total population size + is μ + λ. +

    + Two integer parameters are used to control this strategy: parents + and offspring. They are constrained in that they must always add up to + the population size, and must never be smaller than 1. +
    + One additional parameter, report, controls whether a detailed log of the + algorithm's operation is to be printed or not. Reports respect the report + interval base parameter.
    +
    +
    Author:
    +
    Eduardo Pedroni
    +
    See Also:
    +
    EvolutionaryStrategy
    +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Summary

      + + + + + + + + +
      Constructors 
      Constructor and Description
      MuPlusLambda(Resources resources) +
      Creates a new instance of MuPlusLambda.
      +
      +
      • +
    + +
      +
    • + + +

      Method Summary

      + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethod and Description
      voidevolve(Population population, + Mutator mutator) +
      Performs the selection algorithm and uses the mutator to create + the next generation of solutions.
      +
      + +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
        • +
      +
      • +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        MuPlusLambda

        +
        public MuPlusLambda(Resources resources)
        +
        Creates a new instance of MuPlusLambda.
        +
        +
        Parameters:
        +
        resources - a reference to the experiment's resources.
        +
        +
        • +
      +
      • +
    + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        evolve

        +
        public void evolve(Population population,
+                   Mutator mutator)
        +
        Description copied from class: EvolutionaryStrategy
        +
        Performs the selection algorithm and uses the mutator to create + the next generation of solutions.
        +
        +
        Specified by:
        +
        evolve in class EvolutionaryStrategy
        +
        Parameters:
        +
        population - the population to evolve.
        +
        mutator - the mutator with which to mutate the promoted individuals.
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/es/TournamentSelection.html b/doc/jcgp/backend/modules/es/TournamentSelection.html new file mode 100644 index 0000000..59e63cd --- /dev/null +++ b/doc/jcgp/backend/modules/es/TournamentSelection.html @@ -0,0 +1,333 @@ + + + + + +TournamentSelection + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + +
+
jcgp.backend.modules.es
+

Class TournamentSelection

+
+
+ +
+
    +
  • +
    +
    +
    public class TournamentSelection
+extends EvolutionaryStrategy
    +
    Tournament selection +

    + This strategy generates a new population by selecting a specified number + of chromosomes from the original population and selecting the fittest out + of the isolated subset (the tournament). The selected individual is mutated + using the specified mutator. This process is repeated until the new population + is complete. +

    + One integer parameter is used to control this strategy: tournament + size. This must always be greater than 0 and smaller than or equal to the + population size. Setting it to equal population size results in the same + chromosome being selected for every tournament, and setting it to 1 leads + to an effectively random search. +
    + One additional parameter, report, controls whether a detailed log of the + algorithm's operation is to be printed or not. Reports respect the report + interval base parameter.
    +
    +
    Author:
    +
    Eduardo Pedroni
    +
    See Also:
    +
    EvolutionaryStrategy
    +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Summary

      + + + + + + + + +
      Constructors 
      Constructor and Description
      TournamentSelection(Resources resources) +
      Creates a new instance of TournamentSelection.
      +
      +
      • +
    + +
      +
    • + + +

      Method Summary

      + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethod and Description
      voidevolve(Population population, + Mutator mutator) +
      Performs the selection algorithm and uses the mutator to create + the next generation of solutions.
      +
      + +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
        • +
      +
      • +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        TournamentSelection

        +
        public TournamentSelection(Resources resources)
        +
        Creates a new instance of TournamentSelection.
        +
        +
        Parameters:
        +
        resources - a reference to the experiment's resources.
        +
        +
        • +
      +
      • +
    + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        evolve

        +
        public void evolve(Population population,
+                   Mutator mutator)
        +
        Description copied from class: EvolutionaryStrategy
        +
        Performs the selection algorithm and uses the mutator to create + the next generation of solutions.
        +
        +
        Specified by:
        +
        evolve in class EvolutionaryStrategy
        +
        Parameters:
        +
        population - the population to evolve.
        +
        mutator - the mutator with which to mutate the promoted individuals.
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/es/class-use/EvolutionaryStrategy.html b/doc/jcgp/backend/modules/es/class-use/EvolutionaryStrategy.html new file mode 100644 index 0000000..ed70f1e --- /dev/null +++ b/doc/jcgp/backend/modules/es/class-use/EvolutionaryStrategy.html @@ -0,0 +1,213 @@ + + + + + +Uses of Class jcgp.backend.modules.es.EvolutionaryStrategy + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.es.EvolutionaryStrategy

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/es/class-use/MuPlusLambda.html b/doc/jcgp/backend/modules/es/class-use/MuPlusLambda.html new file mode 100644 index 0000000..7b38f2a --- /dev/null +++ b/doc/jcgp/backend/modules/es/class-use/MuPlusLambda.html @@ -0,0 +1,124 @@ + + + + + +Uses of Class jcgp.backend.modules.es.MuPlusLambda + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.es.MuPlusLambda

+
+
No usage of jcgp.backend.modules.es.MuPlusLambda
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/es/class-use/TournamentSelection.html b/doc/jcgp/backend/modules/es/class-use/TournamentSelection.html new file mode 100644 index 0000000..3de5cbb --- /dev/null +++ b/doc/jcgp/backend/modules/es/class-use/TournamentSelection.html @@ -0,0 +1,124 @@ + + + + + +Uses of Class jcgp.backend.modules.es.TournamentSelection + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.es.TournamentSelection

+
+
No usage of jcgp.backend.modules.es.TournamentSelection
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/es/package-frame.html b/doc/jcgp/backend/modules/es/package-frame.html new file mode 100644 index 0000000..2341ef5 --- /dev/null +++ b/doc/jcgp/backend/modules/es/package-frame.html @@ -0,0 +1,22 @@ + + + + + +jcgp.backend.modules.es + + + + + +

jcgp.backend.modules.es

+
+

Classes

+ +
+ + diff --git a/doc/jcgp/backend/modules/es/package-summary.html b/doc/jcgp/backend/modules/es/package-summary.html new file mode 100644 index 0000000..bb760c8 --- /dev/null +++ b/doc/jcgp/backend/modules/es/package-summary.html @@ -0,0 +1,162 @@ + + + + + +jcgp.backend.modules.es + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Package jcgp.backend.modules.es

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/es/package-tree.html b/doc/jcgp/backend/modules/es/package-tree.html new file mode 100644 index 0000000..5ebca47 --- /dev/null +++ b/doc/jcgp/backend/modules/es/package-tree.html @@ -0,0 +1,146 @@ + + + + + +jcgp.backend.modules.es Class Hierarchy + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Hierarchy For Package jcgp.backend.modules.es

+Package Hierarchies: + +
+
+

Class Hierarchy

+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/es/package-use.html b/doc/jcgp/backend/modules/es/package-use.html new file mode 100644 index 0000000..a9a2c2d --- /dev/null +++ b/doc/jcgp/backend/modules/es/package-use.html @@ -0,0 +1,180 @@ + + + + + +Uses of Package jcgp.backend.modules.es + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Package
jcgp.backend.modules.es

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/mutator/FixedPointMutator.html b/doc/jcgp/backend/modules/mutator/FixedPointMutator.html new file mode 100644 index 0000000..3614df1 --- /dev/null +++ b/doc/jcgp/backend/modules/mutator/FixedPointMutator.html @@ -0,0 +1,284 @@ + + + + + +FixedPointMutator + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
    +
  • Detail: 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
+ + +
+ + +
+
jcgp.backend.modules.mutator
+

Class FixedPointMutator

+
+
+ +
+
    +
  • +
    +
    +
    public class FixedPointMutator
+extends PointMutator
    +
    Fixed point mutator +

    + This operator uses the point mutator + algorithm to mutate a user-defined fixed + number of genes.
    +
    +
    Author:
    +
    Eduardo Pedroni
    +
    See Also:
    +
    PointMutator
    +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Summary

      + + + + + + + + +
      Constructors 
      Constructor and Description
      FixedPointMutator(Resources resources) +
      Creates a new instance of FixedPointMutator.
      +
      +
      • +
    + +
      +
    • + + +

      Method Summary

      + + +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
        • +
      +
      • +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        FixedPointMutator

        +
        public FixedPointMutator(Resources resources)
        +
        Creates a new instance of FixedPointMutator.
        +
        +
        Parameters:
        +
        resources - a reference to the experiment's resources.
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
    +
  • Detail: 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/mutator/Mutator.html b/doc/jcgp/backend/modules/mutator/Mutator.html new file mode 100644 index 0000000..13aafdb --- /dev/null +++ b/doc/jcgp/backend/modules/mutator/Mutator.html @@ -0,0 +1,281 @@ + + + + + +Mutator + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
    +
  • Detail: 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
+ + +
+ + +
+
jcgp.backend.modules.mutator
+

Class Mutator

+
+
+ +
+
    +
  • +
    +
    Direct Known Subclasses:
    +
    PointMutator, ProbabilisticMutator
    +
    +
    +
    +
    public abstract class Mutator
+extends Module
    +
    This class specifies the basic characteristics of a mutation operator. Its job is + to modify the connections and functions of the chromosome according to the operator's + parameters. +

    + Parameters may be specified to control the implemented mutation. Any parameters + registered with registerParameters() should be displayed by the user interface, + if it is being used. See Module for more information. +

    + It is advisable to use Resources.reportln() and Resources.report() + to print any relevant information. Note that reportln() and report() are affected + by the report interval base parameter. Use Resources.println() and + Resources.print() to print information regardless of the current generation. + See Resources for more information.
    +
    +
    Author:
    +
    Eduardo Pedroni
    +
    See Also:
    +
    Module
    +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Method Summary

      + + + + + + + + + + +
      All Methods Instance Methods Abstract Methods 
      Modifier and TypeMethod and Description
      abstract voidmutate(Chromosome chromosome) +
      Applies mutations to the specified chromosome according + to the parameter values.
      +
      + +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
        • +
      +
      • +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        mutate

        +
        public abstract void mutate(Chromosome chromosome)
        +
        Applies mutations to the specified chromosome according + to the parameter values.
        +
        +
        Parameters:
        +
        chromosome - the chromosome to mutate.
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
    +
  • Detail: 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/mutator/PercentPointMutator.html b/doc/jcgp/backend/modules/mutator/PercentPointMutator.html new file mode 100644 index 0000000..968640e --- /dev/null +++ b/doc/jcgp/backend/modules/mutator/PercentPointMutator.html @@ -0,0 +1,285 @@ + + + + + +PercentPointMutator + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
    +
  • Detail: 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
+ + +
+ + +
+
jcgp.backend.modules.mutator
+

Class PercentPointMutator

+
+
+ +
+
    +
  • +
    +
    +
    public class PercentPointMutator
+extends PointMutator
    +
    Percent point mutator +

    + This operator calculates how many genes to mutate based on the mutation rate + parameter. The total number of genes is computed from the number of nodes, + the arity and the number of outputs. It then uses the point mutation + algorithm to perform the required number of mutations.
    +
    +
    Author:
    +
    Eduardo Pedroni
    +
    See Also:
    +
    PointMutator
    +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Summary

      + + + + + + + + +
      Constructors 
      Constructor and Description
      PercentPointMutator(Resources resources) +
      Creates a new instance of PercentPointMutator.
      +
      +
      • +
    + +
      +
    • + + +

      Method Summary

      + + +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
        • +
      +
      • +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        PercentPointMutator

        +
        public PercentPointMutator(Resources resources)
        +
        Creates a new instance of PercentPointMutator.
        +
        +
        Parameters:
        +
        resources - a reference to the experiment's resources.
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
    +
  • Detail: 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/mutator/PointMutator.html b/doc/jcgp/backend/modules/mutator/PointMutator.html new file mode 100644 index 0000000..691eece --- /dev/null +++ b/doc/jcgp/backend/modules/mutator/PointMutator.html @@ -0,0 +1,281 @@ + + + + + +PointMutator + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
    +
  • Detail: 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
+ + +
+ + +
+
jcgp.backend.modules.mutator
+

Class PointMutator

+
+
+ +
+
    +
  • +
    +
    Direct Known Subclasses:
    +
    FixedPointMutator, PercentPointMutator
    +
    +
    +
    +
    public abstract class PointMutator
+extends Mutator
    +
    Point mutator +

    + In point mutation, a number of random genes + is picked and mutated until all required + mutations have been performed. The actual number + of genes to be mutated can be defined in any + arbitrary way.
    +
    +
    Author:
    +
    Eduardo Pedroni
    +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Method Summary

      + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethod and Description
      voidmutate(Chromosome chromosome) +
      Applies mutations to the specified chromosome according + to the parameter values.
      +
      + +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
        • +
      +
      • +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        mutate

        +
        public void mutate(Chromosome chromosome)
        +
        Description copied from class: Mutator
        +
        Applies mutations to the specified chromosome according + to the parameter values.
        +
        +
        Specified by:
        +
        mutate in class Mutator
        +
        Parameters:
        +
        chromosome - the chromosome to mutate.
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
    +
  • Detail: 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/mutator/ProbabilisticMutator.html b/doc/jcgp/backend/modules/mutator/ProbabilisticMutator.html new file mode 100644 index 0000000..c4e22ae --- /dev/null +++ b/doc/jcgp/backend/modules/mutator/ProbabilisticMutator.html @@ -0,0 +1,319 @@ + + + + + +ProbabilisticMutator + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + +
+
jcgp.backend.modules.mutator
+

Class ProbabilisticMutator

+
+
+ +
+
    +
  • +
    +
    +
    public class ProbabilisticMutator
+extends Mutator
    +
    Probabilistic mutator +

    + This operator iterates through every mutable gene in the chromosome and + decides whether to mutate each of them individually. + The decision is made based on the difference between the mutation probability + and a randomly generated double between 0 and 100.
    +
    +
    Author:
    +
    Eduardo Pedroni
    +
    See Also:
    +
    Mutator
    +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Summary

      + + + + + + + + +
      Constructors 
      Constructor and Description
      ProbabilisticMutator(Resources resources) +
      Creates a new instance of ProbabilisticMutator.
      +
      +
      • +
    + +
      +
    • + + +

      Method Summary

      + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethod and Description
      voidmutate(Chromosome chromosome) +
      Applies mutations to the specified chromosome according + to the parameter values.
      +
      + +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
        • +
      +
      • +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        ProbabilisticMutator

        +
        public ProbabilisticMutator(Resources resources)
        +
        Creates a new instance of ProbabilisticMutator.
        +
        +
        Parameters:
        +
        resources - a reference to the experiment's resources.
        +
        +
        • +
      +
      • +
    + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        mutate

        +
        public void mutate(Chromosome chromosome)
        +
        Description copied from class: Mutator
        +
        Applies mutations to the specified chromosome according + to the parameter values.
        +
        +
        Specified by:
        +
        mutate in class Mutator
        +
        Parameters:
        +
        chromosome - the chromosome to mutate.
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/mutator/class-use/FixedPointMutator.html b/doc/jcgp/backend/modules/mutator/class-use/FixedPointMutator.html new file mode 100644 index 0000000..695222a --- /dev/null +++ b/doc/jcgp/backend/modules/mutator/class-use/FixedPointMutator.html @@ -0,0 +1,124 @@ + + + + + +Uses of Class jcgp.backend.modules.mutator.FixedPointMutator + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.mutator.FixedPointMutator

+
+
No usage of jcgp.backend.modules.mutator.FixedPointMutator
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/mutator/class-use/Mutator.html b/doc/jcgp/backend/modules/mutator/class-use/Mutator.html new file mode 100644 index 0000000..3107012 --- /dev/null +++ b/doc/jcgp/backend/modules/mutator/class-use/Mutator.html @@ -0,0 +1,269 @@ + + + + + +Uses of Class jcgp.backend.modules.mutator.Mutator + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.mutator.Mutator

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/mutator/class-use/PercentPointMutator.html b/doc/jcgp/backend/modules/mutator/class-use/PercentPointMutator.html new file mode 100644 index 0000000..f605d5a --- /dev/null +++ b/doc/jcgp/backend/modules/mutator/class-use/PercentPointMutator.html @@ -0,0 +1,124 @@ + + + + + +Uses of Class jcgp.backend.modules.mutator.PercentPointMutator + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.mutator.PercentPointMutator

+
+
No usage of jcgp.backend.modules.mutator.PercentPointMutator
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/mutator/class-use/PointMutator.html b/doc/jcgp/backend/modules/mutator/class-use/PointMutator.html new file mode 100644 index 0000000..feeb525 --- /dev/null +++ b/doc/jcgp/backend/modules/mutator/class-use/PointMutator.html @@ -0,0 +1,179 @@ + + + + + +Uses of Class jcgp.backend.modules.mutator.PointMutator + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.mutator.PointMutator

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/mutator/class-use/ProbabilisticMutator.html b/doc/jcgp/backend/modules/mutator/class-use/ProbabilisticMutator.html new file mode 100644 index 0000000..0186442 --- /dev/null +++ b/doc/jcgp/backend/modules/mutator/class-use/ProbabilisticMutator.html @@ -0,0 +1,124 @@ + + + + + +Uses of Class jcgp.backend.modules.mutator.ProbabilisticMutator + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.mutator.ProbabilisticMutator

+
+
No usage of jcgp.backend.modules.mutator.ProbabilisticMutator
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/mutator/package-frame.html b/doc/jcgp/backend/modules/mutator/package-frame.html new file mode 100644 index 0000000..da1968b --- /dev/null +++ b/doc/jcgp/backend/modules/mutator/package-frame.html @@ -0,0 +1,24 @@ + + + + + +jcgp.backend.modules.mutator + + + + + +

jcgp.backend.modules.mutator

+
+

Classes

+ +
+ + diff --git a/doc/jcgp/backend/modules/mutator/package-summary.html b/doc/jcgp/backend/modules/mutator/package-summary.html new file mode 100644 index 0000000..a5bfb94 --- /dev/null +++ b/doc/jcgp/backend/modules/mutator/package-summary.html @@ -0,0 +1,182 @@ + + + + + +jcgp.backend.modules.mutator + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Package jcgp.backend.modules.mutator

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/mutator/package-tree.html b/doc/jcgp/backend/modules/mutator/package-tree.html new file mode 100644 index 0000000..a83ce31 --- /dev/null +++ b/doc/jcgp/backend/modules/mutator/package-tree.html @@ -0,0 +1,151 @@ + + + + + +jcgp.backend.modules.mutator Class Hierarchy + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Hierarchy For Package jcgp.backend.modules.mutator

+Package Hierarchies: + +
+
+

Class Hierarchy

+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/mutator/package-use.html b/doc/jcgp/backend/modules/mutator/package-use.html new file mode 100644 index 0000000..d0f85c6 --- /dev/null +++ b/doc/jcgp/backend/modules/mutator/package-use.html @@ -0,0 +1,210 @@ + + + + + +Uses of Package jcgp.backend.modules.mutator + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Package
jcgp.backend.modules.mutator

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/package-frame.html b/doc/jcgp/backend/modules/package-frame.html new file mode 100644 index 0000000..876d8f2 --- /dev/null +++ b/doc/jcgp/backend/modules/package-frame.html @@ -0,0 +1,20 @@ + + + + + +jcgp.backend.modules + + + + + +

jcgp.backend.modules

+
+

Classes

+ +
+ + diff --git a/doc/jcgp/backend/modules/package-summary.html b/doc/jcgp/backend/modules/package-summary.html new file mode 100644 index 0000000..cd347f1 --- /dev/null +++ b/doc/jcgp/backend/modules/package-summary.html @@ -0,0 +1,144 @@ + + + + + +jcgp.backend.modules + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Package jcgp.backend.modules

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/package-tree.html b/doc/jcgp/backend/modules/package-tree.html new file mode 100644 index 0000000..3be8d8f --- /dev/null +++ b/doc/jcgp/backend/modules/package-tree.html @@ -0,0 +1,137 @@ + + + + + +jcgp.backend.modules Class Hierarchy + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Hierarchy For Package jcgp.backend.modules

+Package Hierarchies: + +
+
+

Class Hierarchy

+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/package-use.html b/doc/jcgp/backend/modules/package-use.html new file mode 100644 index 0000000..8c933e0 --- /dev/null +++ b/doc/jcgp/backend/modules/package-use.html @@ -0,0 +1,201 @@ + + + + + +Uses of Package jcgp.backend.modules + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Package
jcgp.backend.modules

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/BestFitness.html b/doc/jcgp/backend/modules/problem/BestFitness.html new file mode 100644 index 0000000..9578099 --- /dev/null +++ b/doc/jcgp/backend/modules/problem/BestFitness.html @@ -0,0 +1,341 @@ + + + + + +BestFitness + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+ + +
+ + +
+ + +
+
jcgp.backend.modules.problem
+

Enum BestFitness

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    java.io.Serializable, java.lang.Comparable<BestFitness>
    +
    +
    +
    +
    public enum BestFitness
+extends java.lang.Enum<BestFitness>
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Enum Constant Summary

      + + + + + + + + + + + +
      Enum Constants 
      Enum Constant and Description
      HIGH 
      LOW 
      +
      • +
    + +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + + + +
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethod and Description
      static BestFitnessvalueOf(java.lang.String name) +
      Returns the enum constant of this type with the specified name.
      +
      static BestFitness[]values() +
      Returns an array containing the constants of this enum type, in +the order they are declared.
      +
      +
        +
      • + + +

        Methods inherited from class java.lang.Enum

        +compareTo, equals, getDeclaringClass, hashCode, name, ordinal, toString, valueOf
        • +
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +getClass, notify, notifyAll, wait, wait, wait
        • +
      +
      • +
    +
    • +
+
+
+
    +
  • + + + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        values

        +
        public static BestFitness[] values()
        +
        Returns an array containing the constants of this enum type, in +the order they are declared. This method may be used to iterate +over the constants as follows: +
        +for (BestFitness c : BestFitness.values())
+    System.out.println(c);
+
        +
        +
        Returns:
        +
        an array containing the constants of this enum type, in the order they are declared
        +
        +
        • +
      + + + +
        +
      • +

        valueOf

        +
        public static BestFitness valueOf(java.lang.String name)
        +
        Returns the enum constant of this type with the specified name. +The string must match exactly an identifier used to declare an +enum constant in this type. (Extraneous whitespace characters are +not permitted.)
        +
        +
        Parameters:
        +
        name - the name of the enum constant to be returned.
        +
        Returns:
        +
        the enum constant with the specified name
        +
        Throws:
        +
        java.lang.IllegalArgumentException - if this enum type has no constant with the specified name
        +
        java.lang.NullPointerException - if the argument is null
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+ + +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/DigitalCircuitProblem.html b/doc/jcgp/backend/modules/problem/DigitalCircuitProblem.html new file mode 100644 index 0000000..d9d3011 --- /dev/null +++ b/doc/jcgp/backend/modules/problem/DigitalCircuitProblem.html @@ -0,0 +1,455 @@ + + + + + +DigitalCircuitProblem + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+ + +
+ + +
+ + +
+
jcgp.backend.modules.problem
+

Class DigitalCircuitProblem

+
+
+ +
+
    +
  • +
    +
    +
    public class DigitalCircuitProblem
+extends TestCaseProblem<UnsignedInteger>
    +
    Digital circuit problem +

    + Using this problem type, digital logic circuits can be evolved. + parseData() must be used to load the desired circuit + truth table in the standard CGP .plu format.
    +
    +
    Author:
    +
    Eduardo Pedroni
    +
    See Also:
    +
    DigitalCircuitFunctions
    +
    +
    • +
+
+
+ +
+
+
    +
  • + +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        DigitalCircuitProblem

        +
        public DigitalCircuitProblem(Resources resources)
        +
        Construct a new instance of DigitalCircuitProblem.
        +
        +
        Parameters:
        +
        resources - a reference to the experiment's resources.
        +
        +
        • +
      +
      • +
    + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        evaluate

        +
        public void evaluate(Population population,
+                     Resources resources)
        +
        Description copied from class: Problem
        +
        The most important method of the problem type. This is called once + per generation, when the new population has been generated. +

        + The basic functionality of this method is to loop through all chromosomes + in the population and decode them according to the problem type. The + fitness of each chromosome is then calculated using the problem data + or otherwise (subjective problem types such as art generation might + leave fitness evaluations up to the user) and assigned to the appropriate + chromosome. +

        + In addition, realisations of this method should update the value of + bestFitness as appropriate, since the value of this parameter is displayed + if a GUI is in use.
        +
        +
        Specified by:
        +
        evaluate in class Problem
        +
        Parameters:
        +
        population - the population to be evaluated.
        +
        resources - parameters and utilities for optional reference.
        +
        +
        • +
      + + + +
        +
      • +

        parseTestCase

        +
        public TestCaseProblem.TestCase<UnsignedInteger> parseTestCase(java.lang.String[] inputs,
+                                                               java.lang.String[] outputs)
        +
        Description copied from class: TestCaseProblem
        +
        This method is used internally by addTestCase() in order + to appropriately parse strings into the right data type for the + test cases. Since the data type is problem-dependent, subclasses must + implement this method. This method must return a built TestCase + object from the arguments given.
        +
        +
        Parameters:
        +
        inputs - the inputs represented as strings.
        +
        outputs - the outputs represented as strings.
        +
        Returns:
        +
        the parsed test case.
        +
        +
        • +
      + + + +
        +
      • +

        perfectSolutionFound

        +
        public int perfectSolutionFound(Population population)
        +
        Description copied from class: Problem
        +
        Used to assert whether a given population contains a perfect solution + to the problem. It is up to the problem to define what qualifies + a perfect solution, as some problems (subject ones such as music and + art evolution, for example) might not have perfect solutions at all.
        +
        +
        Specified by:
        +
        perfectSolutionFound in class Problem
        +
        Parameters:
        +
        population - the population to search through for a perfect chromosome.
        +
        Returns:
        +
        the perfect solution index, if one exits, -1 if no perfect solution was found.
        +
        +
        • +
      + + + +
        +
      • +

        hasImprovement

        +
        public int hasImprovement(Population population)
        +
        Description copied from class: Problem
        +
        Used to assert whether a given population has a chromosome that is an improvement over + the current best chromosome. A typical implementation of this method + will simply compare chromosome fitness values, though the problem type + is free to implement this in any way.
        +
        +
        Specified by:
        +
        hasImprovement in class Problem
        +
        Parameters:
        +
        population - the population potentially containing a fitter chromosome.
        +
        Returns:
        +
        the index of the first chromosome in the population that is an improvement, -1 if none is found.
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+ + +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/Problem.html b/doc/jcgp/backend/modules/problem/Problem.html new file mode 100644 index 0000000..0d08b2a --- /dev/null +++ b/doc/jcgp/backend/modules/problem/Problem.html @@ -0,0 +1,508 @@ + + + + + +Problem + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + +
+
jcgp.backend.modules.problem
+

Class Problem

+
+
+ +
+
    +
  • +
    +
    Direct Known Subclasses:
    +
    TestCaseProblem
    +
    +
    +
    +
    public abstract class Problem
+extends Module
    +
    Defines the general behaviour of a CGP problem. The primary function of Problem + is to evaluate a population and assign a fitness value to each chromosome. +
    + Problems are free to define whether better fitness means a higher or lower fitness value. + In some problem types, it is more convenient to treat fitness 0 as the best possible value. + This can be done by changing the fitness orientation to BestFitness.HIGH or BestFitness.LOW as appropriate. + Fitness orientation is set to high by default. +

    + When extending this class, the constructor should call a few methods in order to + properly construct the problem type: setFunctionSet(), setFileExtension() and setFitnessOrientation(), + with the respective arguments. As with all subclasses of Module, setName() and + registerParameters() should be used where appropriate as well. +

    + It is advisable to use Resources.reportln() and Resources.report() + to print any relevant information. Note that reportln() and report() are affected + by the report interval base parameter. Use Resources.println() and + Resources.print() to print information regardless of the current generation. + See Resources for more information.
    +
    +
    Author:
    +
    Eduardo Pedroni
    +
    See Also:
    +
    Module
    +
    +
    • +
+
+
+ +
+
+
    +
  • + +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        Problem

        +
        public Problem(Resources resources)
        +
        Initialises the two problem-wide parameters, maxFitness and bestFitness.
        +
        +
        Parameters:
        +
        resources - a reference to the experiment's resources.
        +
        +
        • +
      +
      • +
    + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        evaluate

        +
        public abstract void evaluate(Population population,
+                              Resources resources)
        +
        The most important method of the problem type. This is called once + per generation, when the new population has been generated. +

        + The basic functionality of this method is to loop through all chromosomes + in the population and decode them according to the problem type. The + fitness of each chromosome is then calculated using the problem data + or otherwise (subjective problem types such as art generation might + leave fitness evaluations up to the user) and assigned to the appropriate + chromosome. +

        + In addition, realisations of this method should update the value of + bestFitness as appropriate, since the value of this parameter is displayed + if a GUI is in use.
        +
        +
        Parameters:
        +
        population - the population to be evaluated.
        +
        resources - parameters and utilities for optional reference.
        +
        +
        • +
      + + + +
        +
      • +

        perfectSolutionFound

        +
        public abstract int perfectSolutionFound(Population population)
        +
        Used to assert whether a given population contains a perfect solution + to the problem. It is up to the problem to define what qualifies + a perfect solution, as some problems (subject ones such as music and + art evolution, for example) might not have perfect solutions at all.
        +
        +
        Parameters:
        +
        population - the population to search through for a perfect chromosome.
        +
        Returns:
        +
        the perfect solution index, if one exits, -1 if no perfect solution was found.
        +
        +
        • +
      + + + +
        +
      • +

        hasImprovement

        +
        public abstract int hasImprovement(Population population)
        +
        Used to assert whether a given population has a chromosome that is an improvement over + the current best chromosome. A typical implementation of this method + will simply compare chromosome fitness values, though the problem type + is free to implement this in any way.
        +
        +
        Parameters:
        +
        population - the population potentially containing a fitter chromosome.
        +
        Returns:
        +
        the index of the first chromosome in the population that is an improvement, -1 if none is found.
        +
        +
        • +
      + + + +
        +
      • +

        parseProblemData

        +
        public abstract void parseProblemData(java.io.File file,
+                                      ModifiableResources resources)
        +
        Parses the specified file and uses the parsed data to + set up the problem type instance appropriately. Any necessary + resource changes can be performed using the provided ModifiableResources + instance. +

        + In addition, realisations of this method should update the value of + maxFitness where appropriate, as this may be displayed to the user + if a GUI is in use.
        +
        +
        Parameters:
        +
        file - the data file to parse.
        +
        resources - a modifiable reference to the experiment's resources.
        +
        +
        • +
      + + + +
        +
      • +

        getFunctionSet

        +
        public FunctionSet getFunctionSet()
        +
        +
        Returns:
        +
        the FunctionSet object used by this problem type.
        +
        +
        • +
      + + + +
        +
      • +

        getFileExtension

        +
        public java.lang.String getFileExtension()
        +
        +
        Returns:
        +
        the file extension accepted by this problem type for problem data files.
        +
        +
        • +
      + + + +
        +
      • +

        getFitnessOrientation

        +
        public BestFitness getFitnessOrientation()
        +
        +
        Returns:
        +
        the fitness orientation of this particular problem.
        +
        +
        • +
      + + + +
        +
      • +

        getBestFitness

        +
        public double getBestFitness()
        +
        +
        Returns:
        +
        the current best fitness, in other words, the fitness + value of the fittest chromosome in the current generation.
        +
        +
        • +
      + + + +
        +
      • +

        reset

        +
        public void reset()
        +
        Resets the bestFitness parameter.
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/SymbolicRegressionProblem.html b/doc/jcgp/backend/modules/problem/SymbolicRegressionProblem.html new file mode 100644 index 0000000..1ab3746 --- /dev/null +++ b/doc/jcgp/backend/modules/problem/SymbolicRegressionProblem.html @@ -0,0 +1,468 @@ + + + + + +SymbolicRegressionProblem + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+ + +
+ + +
+ + +
+
jcgp.backend.modules.problem
+

Class SymbolicRegressionProblem

+
+
+ +
+
    +
  • +
    +
    +
    public class SymbolicRegressionProblem
+extends TestCaseProblem<java.lang.Double>
    +
    Symbolic regression functions +

    + Using this problem type, regression problems can be solved. + parseData() must be used to load the desired function + data in the standard CGP .dat format. +

    + This problem uses quite a few parameters: +
      +
    • Error threshold: the maximum difference allowed between an + evolved output and the equivalent output from the problem data. + Outputs within the error threshold will be considered correct. + This is only used if hits is enabled.
      • +
    • Perfection threshold: if the fitness is calculated without + using the hits method, it is a decimal value. A solution is + considered perfect when the difference between its fitness and + the maximum possible fitness is within the perfection threshold.
      • +
    • Hits-based fitness: increment the fitness by 1 whenever the + chromosome output is within the error threshold.
    +
    +
    Author:
    +
    Eduardo Pedroni
    +
    See Also:
    +
    SymbolicRegressionFunctions
    +
    +
    • +
+
+
+ +
+
+
    +
  • + +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        SymbolicRegressionProblem

        +
        public SymbolicRegressionProblem(Resources resources)
        +
        Creates a new instance of SymbolicRegressionProblem.
        +
        +
        Parameters:
        +
        resources - a reference to the experiment's resources.
        +
        +
        • +
      +
      • +
    + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        evaluate

        +
        public void evaluate(Population population,
+                     Resources resources)
        +
        Description copied from class: Problem
        +
        The most important method of the problem type. This is called once + per generation, when the new population has been generated. +

        + The basic functionality of this method is to loop through all chromosomes + in the population and decode them according to the problem type. The + fitness of each chromosome is then calculated using the problem data + or otherwise (subjective problem types such as art generation might + leave fitness evaluations up to the user) and assigned to the appropriate + chromosome. +

        + In addition, realisations of this method should update the value of + bestFitness as appropriate, since the value of this parameter is displayed + if a GUI is in use.
        +
        +
        Specified by:
        +
        evaluate in class Problem
        +
        Parameters:
        +
        population - the population to be evaluated.
        +
        resources - parameters and utilities for optional reference.
        +
        +
        • +
      + + + +
        +
      • +

        parseTestCase

        +
        public TestCaseProblem.TestCase<java.lang.Double> parseTestCase(java.lang.String[] inputs,
+                                                                java.lang.String[] outputs)
        +
        Description copied from class: TestCaseProblem
        +
        This method is used internally by addTestCase() in order + to appropriately parse strings into the right data type for the + test cases. Since the data type is problem-dependent, subclasses must + implement this method. This method must return a built TestCase + object from the arguments given.
        +
        +
        Parameters:
        +
        inputs - the inputs represented as strings.
        +
        outputs - the outputs represented as strings.
        +
        Returns:
        +
        the parsed test case.
        +
        +
        • +
      + + + +
        +
      • +

        perfectSolutionFound

        +
        public int perfectSolutionFound(Population population)
        +
        Description copied from class: Problem
        +
        Used to assert whether a given population contains a perfect solution + to the problem. It is up to the problem to define what qualifies + a perfect solution, as some problems (subject ones such as music and + art evolution, for example) might not have perfect solutions at all.
        +
        +
        Specified by:
        +
        perfectSolutionFound in class Problem
        +
        Parameters:
        +
        population - the population to search through for a perfect chromosome.
        +
        Returns:
        +
        the perfect solution index, if one exits, -1 if no perfect solution was found.
        +
        +
        • +
      + + + +
        +
      • +

        hasImprovement

        +
        public int hasImprovement(Population population)
        +
        Description copied from class: Problem
        +
        Used to assert whether a given population has a chromosome that is an improvement over + the current best chromosome. A typical implementation of this method + will simply compare chromosome fitness values, though the problem type + is free to implement this in any way.
        +
        +
        Specified by:
        +
        hasImprovement in class Problem
        +
        Parameters:
        +
        population - the population potentially containing a fitter chromosome.
        +
        Returns:
        +
        the index of the first chromosome in the population that is an improvement, -1 if none is found.
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+ + +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/TestCaseProblem.TestCase.html b/doc/jcgp/backend/modules/problem/TestCaseProblem.TestCase.html new file mode 100644 index 0000000..5373cf2 --- /dev/null +++ b/doc/jcgp/backend/modules/problem/TestCaseProblem.TestCase.html @@ -0,0 +1,358 @@ + + + + + +TestCaseProblem.TestCase + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + +
+
jcgp.backend.modules.problem
+

Class TestCaseProblem.TestCase<U>

+
+
+ +
+
    +
  • +
    +
    Type Parameters:
    +
    U - the data type of the test case.
    +
    +
    +
    Enclosing class:
    +
    TestCaseProblem<T>
    +
    +
    +
    +
    public static class TestCaseProblem.TestCase<U>
+extends java.lang.Object
    +
    Basic data type for encapsulating test cases, it simply + contains arrays of inputs and outputs and associated getters.
    +
    +
    Author:
    +
    Eduardo Pedroni
    +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Summary

      + + + + + + + + +
      Constructors 
      Constructor and Description
      TestCase(U[] inputs, + U[] outputs) +
      Creates a new test case, inputs and outputs + must be specified upon instantiation.
      +
      +
      • +
    + + +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Detail

      + + + + + +
        +
      • +

        TestCase

        +
        public TestCase(U[] inputs,
+                U[] outputs)
        +
        Creates a new test case, inputs and outputs + must be specified upon instantiation.
        +
        +
        Parameters:
        +
        inputs - the array of inputs.
        +
        outputs - the array of outputs.
        +
        +
        • +
      +
      • +
    + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getInput

        +
        public U getInput(int index)
        +
        +
        Parameters:
        +
        index - the index to return.
        +
        Returns:
        +
        the indexed input.
        +
        +
        • +
      + + + +
        +
      • +

        getOutput

        +
        public U getOutput(int index)
        +
        +
        Parameters:
        +
        index - the index to return.
        +
        Returns:
        +
        the indexed output.
        +
        +
        • +
      + + + +
        +
      • +

        getInputs

        +
        public U[] getInputs()
        +
        +
        Returns:
        +
        the complete array of inputs.
        +
        +
        • +
      + + + +
        +
      • +

        getOutputs

        +
        public U[] getOutputs()
        +
        +
        Returns:
        +
        the complete array of outputs.
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/TestCaseProblem.html b/doc/jcgp/backend/modules/problem/TestCaseProblem.html new file mode 100644 index 0000000..663bc0a --- /dev/null +++ b/doc/jcgp/backend/modules/problem/TestCaseProblem.html @@ -0,0 +1,427 @@ + + + + + +TestCaseProblem + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+ + +
+ + +
+ + +
+
jcgp.backend.modules.problem
+

Class TestCaseProblem<T>

+
+
+ +
+
    +
  • +
    +
    Type Parameters:
    +
    T - the data type to be used by the TestCaseProblem.
    +
    +
    +
    Direct Known Subclasses:
    +
    DigitalCircuitProblem, SymbolicRegressionProblem
    +
    +
    +
    +
    public abstract class TestCaseProblem<T>
+extends Problem
    +
    Abstract model for a problem that uses test cases. A test case + problem is any problem that compares the chromosome output to + an expected output taken from a table of input-output mappings. +

    + This class defines a basic data type for storing test cases, + TestCase, and provides core functionality to add and manipulate + test cases in the problem. A subclass of TestCaseProblem + must simply override parseTestCase() to convert parsed + problem data strings into the required data type (T).
    +
    +
    Author:
    +
    Eduardo Pedroni
    +
    See Also:
    +
    Problem
    +
    +
    • +
+
+
+ +
+
+
    +
  • + +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        TestCaseProblem

        +
        public TestCaseProblem(Resources resources)
        +
        Creates a new TestCaseProblem object.
        +
        +
        Parameters:
        +
        resources - a reference to the experiment's resources.
        +
        +
        • +
      +
      • +
    + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getTestCases

        +
        public javafx.collections.ObservableList<TestCaseProblem.TestCase<T>> getTestCases()
        +
        +
        Returns:
        +
        a list containing the test cases.
        +
        +
        • +
      + + + +
        +
      • +

        addTestCase

        +
        public final void addTestCase(java.lang.String[] inputs,
+                              java.lang.String[] outputs)
        +
        Adds test cases to the problem instance as they get parsed from a + problem data file. This template method uses parseTestCase, which + must be implemented by subclasses.
        +
        +
        Parameters:
        +
        inputs - the inputs represented as strings.
        +
        outputs - the outputs represented as strings.
        +
        +
        • +
      + + + +
        +
      • +

        clearTestCases

        +
        public void clearTestCases()
        +
        Remove all test cases.
        +
        • +
      + + + +
        +
      • +

        parseProblemData

        +
        public void parseProblemData(java.io.File file,
+                             ModifiableResources resources)
        +
        Description copied from class: Problem
        +
        Parses the specified file and uses the parsed data to + set up the problem type instance appropriately. Any necessary + resource changes can be performed using the provided ModifiableResources + instance. +

        + In addition, realisations of this method should update the value of + maxFitness where appropriate, as this may be displayed to the user + if a GUI is in use.
        +
        +
        Specified by:
        +
        parseProblemData in class Problem
        +
        Parameters:
        +
        file - the data file to parse.
        +
        resources - a modifiable reference to the experiment's resources.
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+ + +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/TravellingSalesmanProblem.html b/doc/jcgp/backend/modules/problem/TravellingSalesmanProblem.html new file mode 100644 index 0000000..4a2d0c9 --- /dev/null +++ b/doc/jcgp/backend/modules/problem/TravellingSalesmanProblem.html @@ -0,0 +1,433 @@ + + + + + +TravellingSalesmanProblem + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + +
+
jcgp.backend.modules.problem
+

Class TravellingSalesmanProblem

+
+
+ +
+
    +
  • +
    +
    +
    public class TravellingSalesmanProblem
+extends Problem
    +
    Travelling salesman problem +

    + Using this problem type, travelling salesman tours can be evolved. + parseData() must be used to load the desired city + coordinates in the standard .tsp format.
    +
    +
    Author:
    +
    Eduardo Pedroni
    +
    See Also:
    +
    TravellingSalesmanFunctions
    +
    +
    • +
+
+
+ +
+
+
    +
  • + +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        TravellingSalesmanProblem

        +
        public TravellingSalesmanProblem(Resources resources)
        +
        Construct a new instance of TravellingSalesmanProblem.
        +
        +
        Parameters:
        +
        resources - a reference to the experiment's resources.
        +
        +
        • +
      +
      • +
    + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        evaluate

        +
        public void evaluate(Population population,
+                     Resources resources)
        +
        Description copied from class: Problem
        +
        The most important method of the problem type. This is called once + per generation, when the new population has been generated. +

        + The basic functionality of this method is to loop through all chromosomes + in the population and decode them according to the problem type. The + fitness of each chromosome is then calculated using the problem data + or otherwise (subjective problem types such as art generation might + leave fitness evaluations up to the user) and assigned to the appropriate + chromosome. +

        + In addition, realisations of this method should update the value of + bestFitness as appropriate, since the value of this parameter is displayed + if a GUI is in use.
        +
        +
        Specified by:
        +
        evaluate in class Problem
        +
        Parameters:
        +
        population - the population to be evaluated.
        +
        resources - parameters and utilities for optional reference.
        +
        +
        • +
      + + + +
        +
      • +

        isPerfectSolution

        +
        public boolean isPerfectSolution(Chromosome fittest)
        +
        Description copied from class: Problem
        +
        Used to assert whether a given chromosome is a perfect solution + to the problem. It is up to the problem to define what qualifies + a perfect solution, as some problems (subject ones such as music and + art evolution, for example) might not have perfect solutions at all. +

        + Note that if this method returns true, the experiment will move on + to the next run, or finish if no more runs are left.
        +
        +
        Specified by:
        +
        isPerfectSolution in class Problem
        +
        Parameters:
        +
        fittest - the potentially perfect chromosome.
        +
        Returns:
        +
        true if the argument is a perfect solution.
        +
        +
        • +
      + + + +
        +
      • +

        parseProblemData

        +
        public void parseProblemData(java.io.File file,
+                             ModifiableResources resources)
        +
        Description copied from class: Problem
        +
        Parses the specified file and uses the parsed data to + set up the problem type instance appropriately. Any necessary + resource changes can be performed using the provided ModifiableResources + instance. +

        + In addition, realisations of this method should update the value of + maxFitness where appropriate, as this may be displayed to the user + if a GUI is in use.
        +
        +
        Specified by:
        +
        parseProblemData in class Problem
        +
        Parameters:
        +
        file - the data file to parse.
        +
        resources - a modifiable reference to the experiment's resources.
        +
        +
        • +
      + + + +
        +
      • +

        isImprovement

        +
        public boolean isImprovement(Chromosome fittest)
        +
        Description copied from class: Problem
        +
        Used to assert whether a given chromosome is an improvement over + the current best chromosome. A typical implementation of this method + will simply compare chromosome fitness values, though the problem type + is free to implement this in any way.
        +
        +
        Specified by:
        +
        isImprovement in class Problem
        +
        Parameters:
        +
        fittest - the potentially fitter chromosome.
        +
        Returns:
        +
        true if the argument is fitter than the currently fittest chromosome.
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/class-use/BestFitness.html b/doc/jcgp/backend/modules/problem/class-use/BestFitness.html new file mode 100644 index 0000000..3e1aec5 --- /dev/null +++ b/doc/jcgp/backend/modules/problem/class-use/BestFitness.html @@ -0,0 +1,212 @@ + + + + + +Uses of Class jcgp.backend.modules.problem.BestFitness + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.problem.BestFitness

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/class-use/DigitalCircuitProblem.html b/doc/jcgp/backend/modules/problem/class-use/DigitalCircuitProblem.html new file mode 100644 index 0000000..0a41224 --- /dev/null +++ b/doc/jcgp/backend/modules/problem/class-use/DigitalCircuitProblem.html @@ -0,0 +1,124 @@ + + + + + +Uses of Class jcgp.backend.modules.problem.DigitalCircuitProblem + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.problem.DigitalCircuitProblem

+
+
No usage of jcgp.backend.modules.problem.DigitalCircuitProblem
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/class-use/Problem.html b/doc/jcgp/backend/modules/problem/class-use/Problem.html new file mode 100644 index 0000000..df1956b --- /dev/null +++ b/doc/jcgp/backend/modules/problem/class-use/Problem.html @@ -0,0 +1,217 @@ + + + + + +Uses of Class jcgp.backend.modules.problem.Problem + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.problem.Problem

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/class-use/SymbolicRegressionProblem.html b/doc/jcgp/backend/modules/problem/class-use/SymbolicRegressionProblem.html new file mode 100644 index 0000000..6347b53 --- /dev/null +++ b/doc/jcgp/backend/modules/problem/class-use/SymbolicRegressionProblem.html @@ -0,0 +1,124 @@ + + + + + +Uses of Class jcgp.backend.modules.problem.SymbolicRegressionProblem + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.problem.SymbolicRegressionProblem

+
+
No usage of jcgp.backend.modules.problem.SymbolicRegressionProblem
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/class-use/TestCaseProblem.TestCase.html b/doc/jcgp/backend/modules/problem/class-use/TestCaseProblem.TestCase.html new file mode 100644 index 0000000..51bc5c0 --- /dev/null +++ b/doc/jcgp/backend/modules/problem/class-use/TestCaseProblem.TestCase.html @@ -0,0 +1,249 @@ + + + + + +Uses of Class jcgp.backend.modules.problem.TestCaseProblem.TestCase + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.problem.TestCaseProblem.TestCase

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/class-use/TestCaseProblem.html b/doc/jcgp/backend/modules/problem/class-use/TestCaseProblem.html new file mode 100644 index 0000000..2924adc --- /dev/null +++ b/doc/jcgp/backend/modules/problem/class-use/TestCaseProblem.html @@ -0,0 +1,227 @@ + + + + + +Uses of Class jcgp.backend.modules.problem.TestCaseProblem + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.problem.TestCaseProblem

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/class-use/TravellingSalesmanProblem.html b/doc/jcgp/backend/modules/problem/class-use/TravellingSalesmanProblem.html new file mode 100644 index 0000000..e8d6a27 --- /dev/null +++ b/doc/jcgp/backend/modules/problem/class-use/TravellingSalesmanProblem.html @@ -0,0 +1,124 @@ + + + + + +Uses of Class jcgp.backend.modules.problem.TravellingSalesmanProblem + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Class
jcgp.backend.modules.problem.TravellingSalesmanProblem

+
+
No usage of jcgp.backend.modules.problem.TravellingSalesmanProblem
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/package-frame.html b/doc/jcgp/backend/modules/problem/package-frame.html new file mode 100644 index 0000000..7089f7c --- /dev/null +++ b/doc/jcgp/backend/modules/problem/package-frame.html @@ -0,0 +1,28 @@ + + + + + +jcgp.backend.modules.problem + + + + + +

jcgp.backend.modules.problem

+
+

Classes

+ +

Enums

+ +
+ + diff --git a/doc/jcgp/backend/modules/problem/package-summary.html b/doc/jcgp/backend/modules/problem/package-summary.html new file mode 100644 index 0000000..381db7a --- /dev/null +++ b/doc/jcgp/backend/modules/problem/package-summary.html @@ -0,0 +1,188 @@ + + + + + +jcgp.backend.modules.problem + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Package jcgp.backend.modules.problem

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/package-tree.html b/doc/jcgp/backend/modules/problem/package-tree.html new file mode 100644 index 0000000..1ff07b5 --- /dev/null +++ b/doc/jcgp/backend/modules/problem/package-tree.html @@ -0,0 +1,163 @@ + + + + + +jcgp.backend.modules.problem Class Hierarchy + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Hierarchy For Package jcgp.backend.modules.problem

+Package Hierarchies: + +
+
+

Class Hierarchy

+ +

Enum Hierarchy

+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/doc/jcgp/backend/modules/problem/package-use.html b/doc/jcgp/backend/modules/problem/package-use.html new file mode 100644 index 0000000..32be276 --- /dev/null +++ b/doc/jcgp/backend/modules/problem/package-use.html @@ -0,0 +1,305 @@ + + + + + +Uses of Package jcgp.backend.modules.problem + + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Uses of Package
jcgp.backend.modules.problem

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + -- cgit v1.2.3