Serialized Form


Package ec

Class ec.Breeder implements Serializable

Class ec.BreedingPipeline implements Serializable

Serialized Fields

mybase

Parameter mybase
My parameter base -- I keep it around so I can print some messages that are useful with it (not deep cloned)

sources

BreedingSource[] sources
Array of sources feeding the pipeline

Class ec.BreedingSource implements Serializable

Serialized Fields

probability

float probability
The probability that this BreedingSource will be chosen to breed over other BreedingSources. This may or may not be used, depending on what the caller to this BreedingSource is. It also might be modified by external sources owning this object, for their own purposes. A BreedingSource should not use it for any purpose of its own, nor modify it except when setting it up.

The most common modification is to normalize it with some other set of probabilities, then set all of them up in increasing summation; this allows the use of the fast static BreedingSource-picking utility method, BreedingSource.pickRandom(...). In order to use this method, for example, if four breeding source probabilities are {0.3, 0.2, 0.1, 0.4}, then they should get normalized and summed by the outside owners as: {0.3, 0.5, 0.6, 1.0}.

Class ec.Evaluator implements Serializable

Serialized Fields

p_problem

Problem p_problem

Class ec.EvolutionState implements Serializable

Serialized Fields

statics

java.util.Vector statics
A place for you to stash pointers to static objects so that they'll get serialized. Java doesn't serialize static objects by default; you have to write them yourself. ECJ does this for its Clique objects (for example, GPType or GPNodeConstraints). However, some of these objects (like GPNodeConstraints) are typically only pointed to by bytes, not pointers. This means that if they're all stored in a static hash table, they never get serialized. So we stash one of them here, in statics, and it gets serialized, and is responsible for serializing the rest of 'em.

parameters

ParameterDatabase parameters
The parameter database (threadsafe). Parameter objects are also threadsafe. Nonetheless, you should generally try to treat this database as read-only.

random

MersenneTwisterFast[] random
An array of random number generators, indexed by the thread number you were given (or, if you're not in a multithreaded area, use 0). These generators are not threadsafe in and of themselves, but if you only use the random number generator assigned to your thread, as was intended, then you get random numbers in a threadsafe way. These generators must each have a different seed, of course.v

output

Output output
The output and logging facility (threadsafe). Keep in mind that output in Java is expensive.

breedthreads

int breedthreads
The requested number of threads to be used in breeding, excepting perhaps a "parent" thread which gathers the other threads. If breedthreads = 1, then the system should not be multithreaded during breeding. Don't modify this during a run.

evalthreads

int evalthreads
The requested number of threads to be used in evaluation, excepting perhaps a "parent" thread which gathers the other threads. If evalthreads = 1, then the system should not be multithreaded during evaluation. Don't modify this during a run.

checkpoint

boolean checkpoint
Should we checkpoint at all?

checkpointPrefix

java.lang.String checkpointPrefix
The requested prefix start filenames, not including a following period. You probably shouldn't modify this during a run.

checkpointModulo

int checkpointModulo
The requested number of generations that should pass before we write out a checkpoint file.

gc

boolean gc
Whether or not the system should be doing forced garbage collection after each generation. You probably shouldn't modify this during a run.

gcModulo

int gcModulo
The requested number of generations that should pass before we force a garbage collection. For this to have any effect, gc must be true.

aggressivegc

boolean aggressivegc
Whether or not the system should be doing aggressive forced garbage collection after each generation. "Aggressive" means that garbage collection is repeatedly performed until there is absolutely no memory left to reclaim. This flag has no effect unless gc is also set to true. You probably shouldn't modify this during a run.

quitOnRunComplete

boolean quitOnRunComplete
Whether or not the system should prematurely quit when Evaluator returns true for runComplete(...) (that is, when the system found an ideal individual.

generation

int generation
The current generation of the population in the run. For non-generational approaches, this probably should represent some kind of incrementing value, perhaps the number of individuals evaluated so far. You probably shouldn't modify this.

numGenerations

int numGenerations
The number of generations the evolutionary computation system will run until it ends. If after the population has been evaluated the Evaluator returns true for runComplete(...), and quitOnRunComplete is true, then the system will quit. You probably shouldn't modify this.

population

Population population
The current population. This is not a singleton object, and may be replaced after every generation in a generational approach. You should only access this in a read-only fashion.

initializer

Initializer initializer
The population initializer, a singleton object. You should only access this in a read-only fashion.

finisher

Finisher finisher
The population finisher, a singleton object. You should only access this in a read-only fashion.

breeder

Breeder breeder
The population breeder, a singleton object. You should only access this in a read-only fashion.

evaluator

Evaluator evaluator
The population evaluator, a singleton object. You should only access this in a read-only fashion.

statistics

Statistics statistics
The population statistics, a singleton object. You should generally only access this in a read-only fashion.

exchanger

Exchanger exchanger
The population exchanger, a singleton object. You should only access this in a read-only fashion.

Class ec.Exchanger implements Serializable

Class ec.Finisher implements Serializable

Class ec.Individual implements Serializable

Serialized Fields

fitness

Fitness fitness
The fitness of the Individual.

species

Species species
The species of the Individual.

evaluated

boolean evaluated
Has the individual been evaluated and its fitness determined yet?

Class ec.Initializer implements Serializable

Class ec.Population implements Serializable

Serialized Fields

subpops

Subpopulation[] subpops

Class ec.Problem implements Serializable

Class ec.SelectionMethod implements Serializable

Class ec.Species implements Serializable

Serialized Fields

i_prototype

Individual i_prototype
The prototypical individual for this species.

pipe_prototype

BreedingPipeline pipe_prototype

Class ec.Statistics implements Serializable

Serialized Fields

children

Statistics[] children

Class ec.Subpopulation implements Serializable

Serialized Fields

loadInds

java.io.File loadInds
A new subpopulation should be loaded from this file if it is non-null; otherwise they should be created at random.

f_prototype

Fitness f_prototype
The prototypical fitness for individuals in this subpopulation.

species

Species species
The species for individuals in this subpopulation.

individuals

Individual[] individuals
The subpopulation's individuals.

numDuplicateRetries

int numDuplicateRetries
Do we allow duplicates?


Package ec.breed

Class ec.breed.BufferedBreedingPipeline implements Serializable

Serialized Fields

buffer

Individual[] buffer

currentSize

int currentSize

Class ec.breed.ForceBreedingPipeline implements Serializable

Serialized Fields

numInds

int numInds

Class ec.breed.GenerationSwitchPipeline implements Serializable

Serialized Fields

maxGeneratable

int maxGeneratable

generateMax

boolean generateMax

generationSwitch

int generationSwitch

Class ec.breed.MultiBreedingPipeline implements Serializable

Serialized Fields

maxGeneratable

int maxGeneratable

generateMax

boolean generateMax

Class ec.breed.ReproductionPipeline implements Serializable

Serialized Fields

mustClone

boolean mustClone


Package ec.coevolve

Class ec.coevolve.CompetitiveEvaluator implements Serializable

Serialized Fields

style

int style

groupSize

int groupSize

allowOverEvaluation

boolean allowOverEvaluation

nGames

int nGames

Class ec.coevolve.IncrementalAveragedFitness implements Serializable

Serialized Fields

numEvals

int numEvals


Package ec.es

Class ec.es.ESEvolutionState implements Serializable

Serialized Fields

mu

int[] mu

lambda

int[] lambda

comparison

byte[] comparison

count

int[] count
Modified by multiple threads, don't fool with this

Class ec.es.ESSelection implements Serializable

Class ec.es.MuCommaLambdaBreeder implements Serializable

Class ec.es.MuPlusLambdaBreeder implements Serializable


Package ec.exchange

Class ec.exchange.InterPopulationExchange implements Serializable

Serialized Fields

base

Parameter base
My parameter base -- I need to keep this in order to help the server reinitialize contacts

exchangeInformation

ec.exchange.InterPopulationExchange.IPEInformation[] exchangeInformation

immigrants

Individual[][] immigrants

nImmigrants

int[] nImmigrants

nrSources

int nrSources

Class ec.exchange.IslandExchange implements Serializable

Serialization Methods

readObject

private void readObject(java.io.ObjectInputStream in)
                 throws java.io.IOException,
                        java.lang.ClassNotFoundException
Custom serialization

writeObject

private void writeObject(java.io.ObjectOutputStream out)
                  throws java.io.IOException
Custom serialization
Serialized Fields

serverThread

java.lang.Thread serverThread
The thread of the server (is different than null only for the island with the server)

base

Parameter base
My parameter base -- I need to keep this in order to help the server reinitialize contacts

serverAddress

java.lang.String serverAddress
The address of the server

serverPort

int serverPort
The port of the server

clientPort

int clientPort
The port of the client mailbox

iAmServer

boolean iAmServer
whether the server should be running on the current island or not

ownId

java.lang.String ownId
the id of the current island

immigrantsSelectionMethod

SelectionMethod immigrantsSelectionMethod
the selection method for emigrants

indsToDieSelectionMethod

SelectionMethod indsToDieSelectionMethod
the selection method for individuals to be replaced by immigrants

mailbox

ec.exchange.IslandExchangeMailbox mailbox

mailboxThread

java.lang.Thread mailboxThread

number_of_destination_islands

int number_of_destination_islands

synchronous

boolean synchronous
synchronous or asynchronous communication

modulo

int modulo
how often to send individuals

offset

int offset
after how many generations to start sending individuals

size

int size
how many individuals to send each time

outSockets

java.net.Socket[] outSockets

outWriters

java.io.PrintWriter[] outWriters

outgoingIds

java.lang.String[] outgoingIds

running

boolean[] running

serverSocket

java.net.Socket serverSocket

toServer

java.io.PrintWriter toServer

fromServer

java.io.LineNumberReader fromServer

alreadyReadGoodBye

boolean alreadyReadGoodBye

message

java.lang.String message


Package ec.gp

Class ec.gp.ADF implements Serializable

Serialized Fields

associatedTree

int associatedTree
The ADF's associated tree

functionName

java.lang.String functionName
The "function name" of the ADF, to distinguish it from other ADF functions you might provide.

Class ec.gp.ADFArgument implements Serializable

Serialized Fields

argument

int argument

Class ec.gp.ADFContext implements Serializable

Serialized Fields

adf

ADF adf
The ADF/ADM node proper

arg_proto

GPData arg_proto
A prototypical GPData node.

arguments

GPData[] arguments
An array of GPData nodes (none of the null, when it's used) holding an ADF's arguments' return results

Class ec.gp.ADFStack implements Serializable

Serialized Fields

context_proto

ADFContext context_proto

onStack

int onStack

onSubstack

int onSubstack

inReserve

int inReserve

stack

ADFContext[] stack

substack

ADFContext[] substack

reserve

ADFContext[] reserve

Class ec.gp.ADM implements Serializable

Class ec.gp.ERC implements Serializable

Class ec.gp.GPAtomicType implements Serializable

Class ec.gp.GPBreedingPipeline implements Serializable

Class ec.gp.GPData implements Serializable

Class ec.gp.GPFuncInfo implements Serializable

Serialized Fields

node

GPNode node
The stored node

Class ec.gp.GPFunctionSet implements Serializable

Serialization Methods

readObject

private void readObject(java.io.ObjectInputStream in)
                 throws java.io.IOException,
                        java.lang.ClassNotFoundException

writeObject

private void writeObject(java.io.ObjectOutputStream out)
                  throws java.io.IOException
Serialized Fields

name

java.lang.String name
Name of the GPFunctionSet

nodes_h

java.util.Hashtable nodes_h
The nodes that our GPTree can use: arrays of nodes hashed by type.

nodes

GPFuncInfo[][] nodes
The nodes that our GPTree can use: nodes[type][thenodes].

nonterminals_h

java.util.Hashtable nonterminals_h
The nonterminals our GPTree can use: arrays of nonterminals hashed by type.

nonterminals

GPFuncInfo[][] nonterminals
The nonterminals our GPTree can use: nonterminals[type][thenodes].

terminals_h

java.util.Hashtable terminals_h
The terminals our GPTree can use: arrays of terminals hashed by type.

terminals

GPFuncInfo[][] terminals
The terminals our GPTree can use: terminals[type][thenodes].

nodesByArity

GPFuncInfo[][][] nodesByArity
Nodes == a given arity, that is: nodesByArity[type][arity][thenodes]

nonterminalsUnderArity

GPFuncInfo[][][] nonterminalsUnderArity
Nonterminals <= a given arity, that is: nonterminalsUnderArity[type][arity][thenodes] -- this will be O(n^2). Obviously, the number of nonterminals at arity slot 0 is 0.

nonterminalsOverArity

GPFuncInfo[][][] nonterminalsOverArity
Nonterminals >= a given arity, that is: nonterminalsOverArity[type][arity][thenodes] -- this will be O(n^2). Obviously, the number of nonterminals at arity slot 0 is all the nonterminals of that type.

p_funcinfo

GPFuncInfo p_funcinfo
The prototypical GPFuncInfo node.

Class ec.gp.GPIndividual implements Serializable

Serialized Fields

trees

GPTree[] trees

Class ec.gp.GPInitializer implements Serializable

Class ec.gp.GPNode implements Serializable

Serialized Fields

parent

GPNodeParent parent
The GPNode's parent. 4 bytes. :-( But it really helps simplify breeding.

children

GPNode[] children

argposition

byte argposition
The argument position of the child in its parent. This is a byte to save space (GPNode is the critical object space-wise) -- besides, how often do you have 256 children? You can change this to a short or int easily if you absolutely need to. It's possible to eliminate even this and have the child find itself in its parent, but that's an O(children[]) operation, and probably not inlinable, so I figure a byte is okay.

constraints

byte constraints
The GPNode's constraints. This is a byte to save space -- how often do you have 256 different GPNodeConstraints? Well, I guess it's not infeasible. You can increase4 this to an int without much trouble. You typically shouldn't access the constraints through this variable -- use the constraints() method instead.

Class ec.gp.GPNodeBuilder implements Serializable

Serialized Fields

minSize

int minSize

maxSize

int maxSize
the minium possible size -- if unused, it's 0

sizeDistribution

float[] sizeDistribution
the maximum possible size -- if unused, it's 0

Class ec.gp.GPNodeConstraints implements Serializable

Serialization Methods

readObject

private void readObject(java.io.ObjectInputStream in)
                 throws java.io.IOException,
                        java.lang.ClassNotFoundException

writeObject

private void writeObject(java.io.ObjectOutputStream out)
                  throws java.io.IOException
Serialized Fields

probabilityOfSelection

float probabilityOfSelection
Probability of selection -- an auxillary measure mostly used by PTC1/PTC2 right now

constraintNumber

byte constraintNumber
The byte value of the constraints -- we can only have 256 of them

returntype

GPType returntype
The return type for a GPNode

childtypes

GPType[] childtypes
The children types for a GPNode

name

java.lang.String name
The name of the GPNodeConstraints object -- this is NOT the name of the GPNode

Class ec.gp.GPNodeGatherer implements Serializable

Serialized Fields

node

GPNode node

Class ec.gp.GPProblem implements Serializable

Serialized Fields

stack

ADFStack stack
The GPProblem's stack

data

GPData data
The GPProblems' GPData

Class ec.gp.GPSetType implements Serializable

Serialized Fields

types_packed

int[] types_packed
A packed, sorted array of atomic types in the set

types_sparse

boolean[] types_sparse
A sparse array of atomic types in the set

types_h

java.util.Hashtable types_h
The hashtable of types in the set

Class ec.gp.GPSpecies implements Serializable

Class ec.gp.GPSteadyStateSpecies implements Serializable

Serialized Fields

deselector

SelectionMethod deselector

Class ec.gp.GPTree implements Serializable

Serialized Fields

child

GPNode child
the root GPNode in the GPTree

owner

GPIndividual owner
the owner of the GPTree

constraints

byte constraints
constraints on the GPTree -- don't access the constraints through this variable -- use the constraints() method instead, which will give the actual constraints object.

useLatex

boolean useLatex
Use latex to print for humans?

Class ec.gp.GPTreeConstraints implements Serializable

Serialization Methods

readObject

private void readObject(java.io.ObjectInputStream in)
                 throws java.io.IOException,
                        java.lang.ClassNotFoundException

writeObject

private void writeObject(java.io.ObjectOutputStream out)
                  throws java.io.IOException
Serialized Fields

name

java.lang.String name

constraintNumber

byte constraintNumber
The byte value of the constraints -- we can only have 256 of them

init

GPNodeBuilder init
The builder for the tree

treetype

GPType treetype
The type of the root of the tree

functionset

GPFunctionSet functionset
The function set for nodes in the tree

Class ec.gp.GPType implements Serializable

Serialization Methods

readObject

private void readObject(java.io.ObjectInputStream in)
                 throws java.io.IOException,
                        java.lang.ClassNotFoundException

writeObject

private void writeObject(java.io.ObjectOutputStream out)
                  throws java.io.IOException
Serialized Fields

name

java.lang.String name
The name of the type

type

int type
The preassigned integer value for the type


Package ec.gp.breed

Class ec.gp.breed.InternalCrossoverPipeline implements Serializable

Serialized Fields

nodeselect0

GPNodeSelector nodeselect0
How the pipeline chooses the first subtree

nodeselect1

GPNodeSelector nodeselect1
How the pipeline chooses the second subtree

numTries

int numTries
How many times the pipeline attempts to pick nodes until it gives up.

maxDepth

int maxDepth
The deepest tree the pipeline is allowed to form. Single terminal trees are depth 1.

tree1

int tree1
Is the first tree fixed? If not, this is -1

tree2

int tree2
Is the second tree fixed? If not, this is -1

Class ec.gp.breed.MutateAllNodesPipeline implements Serializable

Serialized Fields

nodeselect

GPNodeSelector nodeselect
How the pipeline chooses a subtree to mutate

tree

int tree
Is our tree fixed? If not, this is -1

Class ec.gp.breed.MutateDemotePipeline implements Serializable

Serialized Fields

numTries

int numTries
The number of times the pipeline tries to build a valid mutated tree before it gives up and just passes on the original

maxDepth

int maxDepth
The maximum depth of a mutated tree

tree

int tree
Is our tree fixed? If not, this is -1

gatherer

GPNodeGatherer gatherer
Temporary Node Gatherer

demotableNode

GPNode demotableNode

Class ec.gp.breed.MutateERCPipeline implements Serializable

Serialized Fields

nodeselect

GPNodeSelector nodeselect
How the pipeline chooses a subtree to mutate

tree

int tree
Is our tree fixed? If not, this is -1

Class ec.gp.breed.MutateOneNodePipeline implements Serializable

Serialized Fields

nodeselect

GPNodeSelector nodeselect
How the pipeline chooses a subtree to mutate

tree

int tree
Is our tree fixed? If not, this is -1

Class ec.gp.breed.MutatePromotePipeline implements Serializable

Serialized Fields

tree

int tree
Is our tree fixed? If not, this is -1

numTries

int numTries
The number of times the pipeline tries to build a valid mutated tree before it gives up and just passes on the original

promotableNode

GPNode promotableNode

Class ec.gp.breed.MutateSwapPipeline implements Serializable

Serialized Fields

numTries

int numTries
The number of times the pipeline tries to build a valid mutated tree before it gives up and just passes on the original

tree

int tree
Is our tree fixed? If not, this is -1

swappableNode

GPNode swappableNode

Class ec.gp.breed.RehangPipeline implements Serializable

Serialized Fields

numTries

int numTries
The number of times the pipeline tries to find a tree with a nonterminal before giving up and just copying the individual.

tree

int tree
Is our tree fixed? If not, this is -1

rehangableNode

GPNode rehangableNode


Package ec.gp.build

Class ec.gp.build.PTC1 implements Serializable

Serialized Fields

maxDepth

int maxDepth
The largest maximum tree depth PTC1 can specify -- should be big.

expectedSize

int expectedSize
The default expected tree size for PTC1

Class ec.gp.build.PTC2 implements Serializable

Serialized Fields

maxDepth

int maxDepth
The largest maximum tree depth GROW can specify -- should be big.

s_node

GPNode[] s_node

s_argpos

int[] s_argpos

s_depth

int[] s_depth

s_size

int s_size

dequeue_node

GPNode dequeue_node

dequeue_argpos

int dequeue_argpos

dequeue_depth

int dequeue_depth

Class ec.gp.build.PTCFunctionSet implements Serializable

Serialized Fields

q_ty

float[][] q_ty
terminal probabilities[type][thenodes], in organized form

q_ny

float[][] q_ny
nonterminal probabilities[type][thenodes], in organized form

p_y

float[][] p_y
cache of nonterminal selection probabilities -- dense array [size-1][type]. If any items are null, they're not in the dense cache.

Class ec.gp.build.RandomBranch implements Serializable

Class ec.gp.build.RandTree implements Serializable

Serialized Fields

arities

int[] arities

aritySetupDone

boolean aritySetupDone

permutations

java.util.LinkedList permutations

Class ec.gp.build.Uniform implements Serializable

Serialized Fields

functionsets

GPFunctionSet[] functionsets

_functionsets

java.util.Hashtable _functionsets

funcnodes

java.util.Hashtable funcnodes

numfuncnodes

int numfuncnodes

maxarity

int maxarity

maxtreesize

int maxtreesize

_truesizes

java.math.BigInteger[][][] _truesizes

truesizes

double[][][] truesizes

useTrueDistribution

boolean useTrueDistribution

NUMTREESOFTYPE

java.math.BigInteger[][][] NUMTREESOFTYPE

NUMTREESROOTEDBYNODE

java.math.BigInteger[][][] NUMTREESROOTEDBYNODE

NUMCHILDPERMUTATIONS

java.math.BigInteger[][][][][] NUMCHILDPERMUTATIONS

ROOT_D

ec.gp.build.UniformGPNodeStorage[][][][] ROOT_D

ROOT_D_ZERO

boolean[][][] ROOT_D_ZERO

CHILD_D

double[][][][][] CHILD_D


Package ec.gp.koza

Class ec.gp.koza.CrossoverPipeline implements Serializable

Serialized Fields

nodeselect1

GPNodeSelector nodeselect1
How the pipeline selects a node from individual 1

nodeselect2

GPNodeSelector nodeselect2
How the pipeline selects a node from individual 2

tree1

int tree1
Is the first tree fixed? If not, this is -1

tree2

int tree2
Is the second tree fixed? If not, this is -1

numTries

int numTries
How many times the pipeline attempts to pick nodes until it gives up.

maxDepth

int maxDepth
The deepest tree the pipeline is allowed to form. Single terminal trees are depth 1.

tossSecondParent

boolean tossSecondParent
Should the pipeline discard the second parent after crossing over?

parents

GPIndividual[] parents
Temporary holding place for parents

Class ec.gp.koza.FullBuilder implements Serializable

Serialized Fields

maxDepth

int maxDepth
The largest maximum tree depth FULL can specify.

minDepth

int minDepth
The smallest maximum tree depth FULL can specify.

Class ec.gp.koza.GrowBuilder implements Serializable

Serialized Fields

maxDepth

int maxDepth
The largest maximum tree depth GROW can specify.

minDepth

int minDepth
The smallest maximum tree depth GROW can specify.

Class ec.gp.koza.HalfBuilder implements Serializable

Serialized Fields

maxDepth

int maxDepth
The largest maximum tree depth RAMPED HALF-AND-HALF can specify.

minDepth

int minDepth
The smallest maximum tree depth RAMPED HALF-AND-HALF can specify.

pickGrowProbability

float pickGrowProbability
The likelihood of using GROW over FULL.

Class ec.gp.koza.KozaFitness implements Serializable

Serialized Fields

fitness

float fitness
This ranges from 0 (best) to infinity (worst). Koza leaves the exact definition of rawFitness up to the domain problem, but I define it here as equivalent to the standardized fitness, hence the simple definitions of rawFitness() and standardizedFitness() below.

hits

int hits
This auxillary measure is used in some problems for additional information. It's a traditional feature of Koza-style GP, and so although I think it's not very useful, I'll leave it in anyway.

Class ec.gp.koza.KozaNodeSelector implements Serializable

Serialized Fields

rootProbability

float rootProbability
The probability the root must be chosen

terminalProbability

float terminalProbability
The probability a terminal must be chosen

nonterminalProbability

float nonterminalProbability
The probability a nonterminal must be chosen.

nonterminals

int nonterminals
The number of nonterminals in the tree, -1 if unknown.

terminals

int terminals
The number of terminals in the tree, -1 if unknown.

nodes

int nodes
The number of nodes in the tree, -1 if unknown.

gatherer

GPNodeGatherer gatherer
Used internally to look for a node. This is threadsafe as long as an instance of KozaNodeSelector is used by only one thread.

Class ec.gp.koza.KozaShortStatistics implements Serializable

Serialized Fields

doFull

boolean doFull

best_of_run_a

Individual[] best_of_run_a

totalNodes

long[] totalNodes

totalDepths

long[] totalDepths

lastTime

long lastTime

lastUsage

long lastUsage

statisticslog

int statisticslog
The Statistics' log

Class ec.gp.koza.KozaStatistics implements Serializable

Serialized Fields

statisticslog

int statisticslog
The Statistics' log

best_of_run

Individual[] best_of_run
The best individual we've found so far

doFull

boolean doFull

numInds

long numInds

lastTime

long lastTime

initializationTime

long initializationTime

breedingTime

long breedingTime

evaluationTime

long evaluationTime

nodesInitialized

long nodesInitialized

nodesEvaluated

long nodesEvaluated

nodesBred

long nodesBred

lastUsage

long lastUsage

initializationUsage

long initializationUsage

breedingUsage

long breedingUsage

evaluationUsage

long evaluationUsage

Class ec.gp.koza.KozaSteadyStateStatistics implements Serializable

Serialized Fields

doFull

boolean doFull

best_of_run_a

Individual[] best_of_run_a

totalNodes

long[] totalNodes

totalDepths

long[] totalDepths

genNodes

long[][] genNodes

genDepths

long[][] genDepths

lastTime

long lastTime

lastUsage

long lastUsage

statisticslog

int statisticslog
The Statistics' log

Class ec.gp.koza.MutationPipeline implements Serializable

Serialized Fields

nodeselect

GPNodeSelector nodeselect
How the pipeline chooses a subtree to mutate

builder

GPNodeBuilder builder
How the pipeline builds a new subtree

numTries

int numTries
The number of times the pipeline tries to build a valid mutated tree before it gives up and just passes on the original

maxDepth

int maxDepth
The maximum depth of a mutated tree

equalSize

boolean equalSize
Do we try to replace the subtree with another of the same size?

tree

int tree
Is our tree fixed? If not, this is -1


Package ec.multiobjective

Class ec.multiobjective.MultiObjectiveFitness implements Serializable

Serialized Fields

criterionIsAnd

boolean criterionIsAnd
is the ideal individual critereon one which does an AND over the "idealness" of each of the fitnesses (as opposed to an OR)?

multifitness

float[] multifitness
The various fitnesses.


Package ec.multiobjective.spea2

Class ec.multiobjective.spea2.SPEA2Breeder implements Serializable

Class ec.multiobjective.spea2.SPEA2Evaluator implements Serializable

Class ec.multiobjective.spea2.SPEA2MultiObjectiveFitness implements Serializable

Serialized Fields

multifitness

float[] multifitness
The various fitnesses.

SPEA2Fitness

double SPEA2Fitness
SPEA2 overall fitness

SPEA2Strength

double SPEA2Strength
SPEA2 strength (# of nodes it dominates)

SPEA2RawFitness

double SPEA2RawFitness
SPEA2 RAW fitness

SPEA2kthNNDistance

double SPEA2kthNNDistance
SPEA2 NN distance

Class ec.multiobjective.spea2.SPEA2Subpopulation implements Serializable

Serialized Fields

archiveSize

int archiveSize
The SPEA2 archive size

Class ec.multiobjective.spea2.SPEA2TournamentSelection implements Serializable

Serialized Fields

size

int size
Size of the tournament

probabilityOfSelection

double probabilityOfSelection
What's our probability of selection? If 1.0, we always pick the "good" individual.

pickWorst

boolean pickWorst
Do we pick the worst instead of the best?


Package ec.parsimony

Class ec.parsimony.BucketTournament implements Serializable

Serialized Fields

size

int size
Size of the tournament

pickWorst

boolean pickWorst
Do we pick the worst instead of the best?

nBuckets

int nBuckets

bucketValues

int[] bucketValues

Class ec.parsimony.DoubleTournament implements Serializable

Serialized Fields

size

int size
Size of the tournament

size2

int size2

probabilityOfSelection

double probabilityOfSelection
What's our probability of selection? If 1.0, we always pick the "good" individual.

probabilityOfSelection2

double probabilityOfSelection2

pickWorst

boolean pickWorst
Do we pick the worst instead of the best?

pickWorst2

boolean pickWorst2

doLengthFirst

boolean doLengthFirst

Class ec.parsimony.LexicographicTournament implements Serializable

Serialized Fields

size

int size
Size of the tournament

pickWorst

boolean pickWorst
Do we pick the worst instead of the best?

Class ec.parsimony.ParsimonyBinaryTournament implements Serializable

Serialized Fields

size

int size
Size of the tournament

sizeprob

float sizeprob
The probability to choose individuals based on size and independent of fitness

pickWorst

boolean pickWorst
Do we pick the worst instead of the best?

Class ec.parsimony.ProportionalTournament implements Serializable

Serialized Fields

fitnessPressureProb

double fitnessPressureProb
The probability of having the tournament based on fitness

size

int size
Size of the tournament

probabilityOfSelection

double probabilityOfSelection
What's our probability of selection? If 1.0, we always pick the "good" individual.

pickWorst

boolean pickWorst
Do we pick the worst instead of the best?

Class ec.parsimony.RatioBucketTournament implements Serializable

Serialized Fields

size

int size
Size of the tournament

pickWorst

boolean pickWorst
Do we pick the worst instead of the best?

ratio

float ratio
The value of RATIO

bucketValues

int[] bucketValues


Package ec.rule

Class ec.rule.Rule implements Serializable

Serialized Fields

constraints

byte constraints
An index to a RuleConstraints

Class ec.rule.RuleConstraints implements Serializable

Serialization Methods

readObject

private void readObject(java.io.ObjectInputStream in)
                 throws java.io.IOException,
                        java.lang.ClassNotFoundException

writeObject

private void writeObject(java.io.ObjectOutputStream out)
                  throws java.io.IOException
Serialized Fields

constraintNumber

byte constraintNumber
The byte value of the constraints -- we can only have 256 of them

name

java.lang.String name
The name of the RuleConstraints object

Class ec.rule.RuleIndividual implements Serializable

Serialized Fields

rulesets

RuleSet[] rulesets
The individual's rulesets.

Class ec.rule.RuleInitializer implements Serializable

Class ec.rule.RuleSet implements Serializable

Serialized Fields

constraints

byte constraints
An index to a RuleSetConstraints

rules

Rule[] rules
The rules in the rule set

numRules

int numRules
How many rules are there used in the rules array

Class ec.rule.RuleSetConstraints implements Serializable

Serialization Methods

readObject

private void readObject(java.io.ObjectInputStream in)
                 throws java.io.IOException,
                        java.lang.ClassNotFoundException

writeObject

private void writeObject(java.io.ObjectOutputStream out)
                  throws java.io.IOException
Serialized Fields

minSize

int minSize

maxSize

int maxSize

sizeDistribution

float[] sizeDistribution

p_add

float p_add

p_del

float p_del

p_randorder

float p_randorder

rulePrototype

Rule rulePrototype
The prototype of the Rule that will be used in the RuleSet (the RuleSet contains only rules with the specified prototype).

constraintNumber

byte constraintNumber
The byte value of the constraints -- we can only have 256 of them

name

java.lang.String name
The name of the RuleSetConstraints object

Class ec.rule.RuleSpecies implements Serializable


Package ec.rule.breed

Class ec.rule.breed.RuleCrossoverPipeline implements Serializable

Serialized Fields

tossSecondParent

boolean tossSecondParent
Should the pipeline discard the second parent after crossing over?

parents

RuleIndividual[] parents
Temporary holding place for parents

Class ec.rule.breed.RuleMutationPipeline implements Serializable


Package ec.select

Class ec.select.BestSelection implements Serializable

Serialized Fields

sortedFit

float[] sortedFit
Sorted, normalized, totalized fitnesses for the population

sortedPop

int[] sortedPop
Sorted population -- since I *have* to use an int-sized individual (short gives me only 16K), I might as well just have pointers to the population itself. :-(

pickWorst

boolean pickWorst
Do we pick the worst instead of the best?

bestn

int bestn

Class ec.select.FirstSelection implements Serializable

Class ec.select.FitProportionateSelection implements Serializable

Serialized Fields

sortedFit

float[] sortedFit
Sorted, normalized, totalized fitnesses for the population

Class ec.select.GreedyOverselection implements Serializable

Serialized Fields

sortedFitOver

float[] sortedFitOver

sortedFitUnder

float[] sortedFitUnder

sortedPop

int[] sortedPop
Sorted population -- since I *have* to use an int-sized individual (short gives me only 16K), I might as well just have pointers to the population itself. :-(

top_n_percent

float top_n_percent

gets_n_percent

float gets_n_percent

Class ec.select.MultiSelection implements Serializable

Serialized Fields

selects

SelectionMethod[] selects
The MultiSelection's individuals

Class ec.select.RandomSelection implements Serializable

Class ec.select.TournamentSelection implements Serializable

Serialized Fields

size

int size
Size of the tournament

probabilityOfSelection

double probabilityOfSelection
What's our probability of selection? If 1.0, we always pick the "good" individual.

pickWorst

boolean pickWorst
Do we pick the worst instead of the best?


Package ec.simple

Class ec.simple.SimpleBreeder implements Serializable

Serialized Fields

elite

int[] elite
An array[subpop] of the number of elites to keep for that subpopulation

Class ec.simple.SimpleEvaluator implements Serializable

Class ec.simple.SimpleEvolutionState implements Serializable

Serialized Fields

debugState

int debugState

debugNum

int debugNum

Class ec.simple.SimpleExchanger implements Serializable

Class ec.simple.SimpleFinisher implements Serializable

Class ec.simple.SimpleFitness implements Serializable

Serialized Fields

fitness

float fitness
The fitness. Ranges from [0.0,infinity) -- see Fitness.fitness() for more information
See Also:
#ec.Fitness.fitness()

isIdeal

boolean isIdeal

Class ec.simple.SimpleInitializer implements Serializable

Class ec.simple.SimpleShortStatistics implements Serializable

Serialized Fields

statisticslog

int statisticslog
The Statistics' log

doFull

boolean doFull

best_of_run_a

Individual[] best_of_run_a

lengths

long[] lengths

lastTime

long lastTime

lastUsage

long lastUsage

Class ec.simple.SimpleStatistics implements Serializable

Serialized Fields

statisticslog

int statisticslog
The Statistics' log

best_of_run

Individual[] best_of_run
The best individual we've found so far


Package ec.steadystate

Class ec.steadystate.SteadyStateBreeder implements Serializable

Serialized Fields

bp

BreedingPipeline[] bp
If st.firstTimeAround, this acts exactly like SimpleBreeder. Else, it only breeds one new individual per subpopulation, to place in position 0 of the subpopulation.

deselectors

SelectionMethod[] deselectors
Loaded during the first iteration of breedPopulation

Class ec.steadystate.SteadyStateEvaluator implements Serializable

Class ec.steadystate.SteadyStateEvolutionState implements Serializable

Serialized Fields

newIndividuals

int[] newIndividuals

inNextPseudogeneration

boolean inNextPseudogeneration

firstTimeAround

boolean firstTimeAround

pseudogeneration

int pseudogeneration


Package ec.teambots

Class ec.teambots.ECSimulationCanvas implements Serializable

Serialized Fields

bufferedInputString

java.lang.String bufferedInputString

g

java.awt.Graphics g

parent

java.awt.Frame parent

height

int height

width

int width

preserveSize

boolean preserveSize

bgcolor

java.awt.Color bgcolor

bgimage

java.awt.Image bgimage

buffer

java.awt.Image buffer

bufferg

java.awt.Graphics bufferg

read_once

boolean read_once

pause

boolean pause

graphics_on

boolean graphics_on

simulated_objects

EDU.gatech.cc.is.simulation.SimulatedObject[] simulated_objects

control_systems

EDU.gatech.cc.is.abstractrobot.ControlSystemS[] control_systems

top

double top

bottom

double bottom

left

double left

right

double right

time_compression

double time_compression

current_time

long current_time

sim_time

long sim_time

timestep

long timestep

timeout

long timeout

seed

long seed

trials

int trials

run_sim_thread

java.lang.Thread run_sim_thread

descriptionfile

java.lang.String descriptionfile

idcounter

int idcounter

to_draw

boolean to_draw

draw_ids

boolean draw_ids

draw_icons

boolean draw_icons

draw_robot_state

boolean draw_robot_state

draw_object_state

boolean draw_object_state

draw_trails

boolean draw_trails

visionNoiseMean

double visionNoiseMean

visionNoiseStddev

double visionNoiseStddev

visionNoiseSeed

long visionNoiseSeed

startrun

long startrun

frames

long frames

description_file_loaded

boolean description_file_loaded

keep_running

boolean keep_running

Class ec.teambots.TeambotsExampleProblem implements Serializable

Class ec.teambots.TeambotsProblem implements Serializable

Serialized Fields

width

int width

height

int height

numBots

int numBots

simulator

ECSimulationCanvas simulator
the simulator

graphics

boolean graphics
whether the simulation will have graphics displaying or not

inputFileName

java.lang.String inputFileName

simulatorFrame

java.awt.Frame simulatorFrame


Package ec.util

Class ec.util.Announcement implements Serializable

Serialized Fields

text

java.lang.String text
The announcement's...anouncement.

verbosity

int verbosity
The announcement's maximum verbosity value

Class ec.util.BadParameterException implements Serializable

Class ec.util.Log implements Serializable

Serialized Fields

filename

java.io.File filename
A filename, if the writer writes to a file

verbosity

int verbosity
The log's verbosity.

postAnnouncements

boolean postAnnouncements
Should the log post announcements?

restarter

LogRestarter restarter
The log's restarter

repostAnnouncementsOnRestart

boolean repostAnnouncementsOnRestart
Should the log repost all announcements on restart

appendOnRestart

boolean appendOnRestart
If the log writes to a file, should it append to the file on restart, or should it overwrite the file?

Class ec.util.LogRestarter implements Serializable

Class ec.util.MersenneTwister implements Serializable

Serialization Methods

readObject

private void readObject(java.io.ObjectInputStream in)
                 throws java.io.IOException,
                        java.lang.ClassNotFoundException

writeObject

private void writeObject(java.io.ObjectOutputStream out)
                  throws java.io.IOException
Serialized Fields

mt

int[] mt

mti

int mti

mag01

int[] mag01

__nextNextGaussian

double __nextNextGaussian

__haveNextNextGaussian

boolean __haveNextNextGaussian

Class ec.util.MersenneTwisterFast implements Serializable

Serialized Fields

mt

int[] mt

mti

int mti

mag01

int[] mag01

nextNextGaussian

double nextNextGaussian

haveNextNextGaussian

boolean haveNextNextGaussian

Class ec.util.Output implements Serializable

Serialized Fields

errors

boolean errors

logs

java.util.Vector logs

announcements

java.util.Vector announcements

verbosity

int verbosity

flush

boolean flush

Class ec.util.OutputException implements Serializable

Class ec.util.ParamClassLoadException implements Serializable

Class ec.util.Parameter implements Serializable

Serialized Fields

param

java.lang.String param

Class ec.util.ParameterDatabase implements Serializable

Serialized Fields

printState

int printState

parents

java.util.Vector parents

directory

java.io.File directory

checked

boolean checked

gotten

java.util.Hashtable gotten

accessed

java.util.Hashtable accessed


Package ec.vector

Class ec.vector.BitVectorIndividual implements Serializable

Serialized Fields

genome

boolean[] genome

Class ec.vector.ByteVectorIndividual implements Serializable

Serialized Fields

genome

byte[] genome

Class ec.vector.DoubleVectorIndividual implements Serializable

Serialized Fields

genome

double[] genome

Class ec.vector.FloatVectorIndividual implements Serializable

Serialized Fields

genome

float[] genome

Class ec.vector.FloatVectorSpecies implements Serializable

Serialized Fields

minGene

double minGene

maxGene

double maxGene

minGenes

double[] minGenes
Set to null if not specified

maxGenes

double[] maxGenes
Set to null if not specified

Class ec.vector.GeneVectorIndividual implements Serializable

Serialized Fields

genome

VectorGene[] genome

Class ec.vector.GeneVectorSpecies implements Serializable

Serialized Fields

genePrototype

VectorGene genePrototype

Class ec.vector.IntegerVectorIndividual implements Serializable

Serialized Fields

genome

int[] genome

Class ec.vector.IntegerVectorSpecies implements Serializable

Serialized Fields

minGene

long minGene

maxGene

long maxGene

minGenes

long[] minGenes
Set to null if not specified

maxGenes

long[] maxGenes
Set to null if not specified

Class ec.vector.LongVectorIndividual implements Serializable

Serialized Fields

genome

long[] genome

Class ec.vector.ShortVectorIndividual implements Serializable

Serialized Fields

genome

short[] genome

Class ec.vector.VectorGene implements Serializable

Class ec.vector.VectorIndividual implements Serializable

Class ec.vector.VectorSpecies implements Serializable

Serialized Fields

mutationProbability

float mutationProbability
Probability that a gene will mutate

crossoverProbability

float crossoverProbability
Probability that a gene will cross over -- ONLY used in V_ANY_POINT crossover

crossoverType

int crossoverType
What kind of crossover do we have?

genomeSize

int genomeSize
How big of a genome should we create on initialization?

chunksize

int chunksize
How big of chunks should we define for crossover?


Package ec.vector.breed

Class ec.vector.breed.VectorCrossoverPipeline implements Serializable

Serialized Fields

tossSecondParent

boolean tossSecondParent
Should the pipeline discard the second parent after crossing over?

parents

VectorIndividual[] parents
Temporary holding place for parents

Class ec.vector.breed.VectorMutationPipeline implements Serializable