Parameter mybase
double likelihood
BreedingSource[] sources
double probability
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}.
Problem p_problem
MasterProblem masterproblem
ParameterDatabase parameters
MersenneTwisterFast[] random
Output output
int breedthreads
int evalthreads
boolean checkpoint
File checkpointDirectory
String checkpointPrefix
int checkpointModulo
int randomSeedOffset
boolean quitOnRunComplete
Object[] job
String[] runtimeArguments
int generation
int numGenerations
long numEvaluations
Population population
Initializer initializer
Finisher finisher
Breeder breeder
Evaluator evaluator
Statistics statistics
Exchanger exchanger
ArrayList<E> trials
Individual[] context
Subpopulation[] subpops
boolean loadInds
Parameter file
Individual i_prototype
BreedingPipeline pipe_prototype
Fitness f_prototype
Statistics[] children
boolean silentFile
boolean silentPrint
boolean loadInds
Parameter file
Species species
Individual[] individuals
int numDuplicateRetries
int extraBehavior
String[] problemTypes
String[] noiseTypes
int problemType
int noise
boolean reevaluateNoisyProblems
double fOpt
double[] xOpt
double fAdd_Init
double f0
double[][] rotation
double[][] rot2
double[][] linearTF
double[] peaks21
double[] peaks22
int[] rperm
int[] rperm21
int[] rperm22
double[][] xLocal
double[][] xLocal21
double[][] xLocal22
double[][] arrScales
double[][] arrScales21
double[][] arrScales22
double[] aK
double[] bK
double[] peakvalues
double scales
boolean[] start
boolean[] accept
int numNodes
int[] from
int[] to
int[] reading
int numEdges
int[][] reading1
int[] reading1_l
int[][] reading0
int[] reading0_l
int[][] epsilon
int[] epsilon_l
boolean[][] posT
boolean[][] negT
boolean[][] posA
boolean[][] negA
boolean[] state1
boolean[] state2
boolean generalize
int totpos
int totneg
String problemName
int problemSize
Individual best_of_run
private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException
IOExceptionClassNotFoundExceptionprivate void writeObject(ObjectOutputStream out) throws IOException
IOExceptionBufferedImage original
BufferedImage image
Graphics graphics
int[] xpoints
int[] ypoints
int count
Stack<E> tmp
long[] dat_11
long dat_6
byte dat_3
byte status
SAT.Clause[] formula
Individual[] buffer
int currentSize
int numCurrent
int numShuffled
int numElite
Individual[][] eliteIndividuals
int numPrev
Population previousPopulation
SelectionMethod[] selectionMethodPrev
SelectionMethod[] selectionMethodCurrent
Individual[] inds
boolean[] updates
double F
double Cr
int retries
Population previousPopulation
int[] bestSoFarIndex
ParameterDatabase parameters
EvolutionState state
Thread playThread
boolean playing
boolean paused
Object buttonLock
Object cleanupLock
int currentJob
String[] clArgs
JPanel jContentPane
JMenuBar jJMenuBar
JMenu fileMenu
JMenu helpMenu
JMenuItem exitMenuItem
JMenuItem aboutMenuItem
JTabbedPane jTabbedPane
JToolBar jToolBar
JButton playButton
JButton pauseButton
JButton stopButton
JButton stepButton
JMenuItem loadParametersMenuItem
ParametersPanel paramPanel
ControlPanel conPanel
JFrame aboutFrame
boolean threadIsToStop
boolean _step
int result
JMenuItem loadCheckpointMenuItem
JTabbedPane statisticsPane
JTabbedPane inspectionPane
JPanel statusPane
JTextField statusField
Console console
JLabel jLabel
JTextField numGensField
JCheckBox quitOnRunCompleteCheckbox
JLabel jLabel1
JTextField numJobsField
JLabel jLabel2
JLabel jLabel3
JTextField evalThreadsField
JTextField breedThreadsField
JPanel jPanel
JRadioButton seedFileRadioButton
JTextField seedFileField
JButton seedFileButton
JRadioButton randomSeedsRadioButton
JTable seedsTable
JScrollPane jScrollPane
JLabel jLabel6
JCheckBox checkpointCheckBox
JPanel checkpointPanel
JLabel jLabel7
JTextField checkpointModuloField
JLabel jLabel8
JTextField prefixField
JLabel jLabel10
ButtonGroup seedButtonGroup
JButton generateSeedsButton
JRadioButton sequentialSeedsRadioButton
JLabel jLabel5
JTextField jobFilePrefixField
Console console
JScrollPane parameterTreeScrollPane
JTree parameterTree
JScrollPane parameterTableScrollPane
JTable parameterTable
JSplitPane jSplitPane
Console console
int subPopNum
JList<E> individualsList
JScrollPane individualListPane
JSplitPane subpopPane
JSplitPane individualDisplayPane
IndividualPortrayal portrayal
JScrollPane inspectionPane
JTree inspectionTree
JTextPane textPane
CharArrayWriter printIndividualWriter
int[] mu
int[] lambda
Population parentPopulation
byte[] comparison
int[] count
int[] children
int[] parents
Parameter base
ParameterDatabase p_database
ParameterDatabase currentDatabase
int runs
boolean reevaluateIndividuals
Individual[] bestUnderlyingIndividual
Object lock
Object[] domain
boolean setRandom
int countdown
int upperbound
int start
String restartType
Parameter base
InterPopulationExchange.IPEInformation[] exchangeInformation
Individual[][] immigrants
int[] nImmigrants
int nrSources
boolean chatty
private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException
IOExceptionClassNotFoundExceptionprivate void writeObject(ObjectOutputStream out) throws IOException
IOExceptionboolean chatty
Thread serverThread
Parameter base
String serverAddress
int serverPort
int clientPort
boolean iAmServer
String ownId
boolean compressedCommunication
SelectionMethod immigrantsSelectionMethod
SelectionMethod indsToDieSelectionMethod
IslandExchangeMailbox mailbox
Thread mailboxThread
int number_of_destination_islands
boolean synchronous
int modulo
int offset
int size
Socket[] outSockets
DataOutputStream[] outWriters
String[] outgoingIds
boolean[] running
Socket serverSocket
DataOutputStream toServer
DataInputStream fromServer
boolean alreadyReadGoodBye
String message
int associatedTree
String name
int argument
String name
ADFContext context_proto
int onStack
int onSubstack
int inReserve
ADFContext[] stack
ADFContext[] substack
ADFContext[] reserve
private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException
IOExceptionClassNotFoundExceptionprivate void writeObject(ObjectOutputStream out) throws IOException
IOExceptionString name
Hashtable<K,V> nodes_h
GPNode[][] nodes
Hashtable<K,V> nonterminals_h
GPNode[][] nonterminals
Hashtable<K,V> terminals_h
GPNode[][] terminals
Hashtable<K,V> nodesByName
GPNode[][][] nodesByArity
GPNode[][][] nonterminalsUnderArity
GPNode[][][] nonterminalsOverArity
GPTree[] trees
Hashtable<K,V> typeRepository
GPType[] types
int numAtomicTypes
int numSetTypes
Hashtable<K,V> nodeConstraintRepository
GPNodeConstraints[] nodeConstraints
byte numNodeConstraints
Hashtable<K,V> functionSetRepository
Hashtable<K,V> treeConstraintRepository
GPTreeConstraints[] treeConstraints
byte numTreeConstraints
GPNodeParent parent
GPNode[] children
byte argposition
byte constraints
double probabilityOfSelection
byte constraintNumber
GPType returntype
GPType[] childtypes
String name
GPNode[] zeroChildren
GPNode node
GPNode child
GPIndividual owner
byte constraints
int printStyle
boolean printTerminalsAsVariablesInC
boolean printTwoArgumentNonterminalsAsOperatorsInC
String name
byte constraintNumber
GPNodeBuilder init
GPType treetype
GPFunctionSet functionset
String name
int type
GPNodeSelector nodeselect0
GPNodeSelector nodeselect1
int numTries
int maxDepth
int tree1
int tree2
GPNodeSelector nodeselect
int tree
int numTries
int maxDepth
int tree
GPNode demotableNode
GPNodeSelector nodeselect
int tree
GPNodeSelector nodeselect
int tree
int tree
int numTries
GPNode promotableNode
int numTries
int tree
GPNode swappableNode
int numTries
int tree
GPNode rehangableNode
GPNodeSelector nodeselect1
GPNodeSelector nodeselect2
int tree1
int tree2
int numTries
int maxDepth
boolean tossSecondParent
GPIndividual[] parents
boolean homologous
double[][] q_ty
double[][] q_ny
double[][] p_y
int[] arities
boolean aritySetupDone
LinkedList<E> permutations
GPFunctionSet[] functionsets
Hashtable<K,V> _functionsets
Hashtable<K,V> funcnodes
int numfuncnodes
int maxarity
int maxtreesize
BigInteger[][][] _truesizes
double[][][] truesizes
boolean useTrueDistribution
BigInteger[][][] NUMTREESOFTYPE
BigInteger[][][] NUMTREESROOTEDBYNODE
BigInteger[][][][][] NUMCHILDPERMUTATIONS
UniformGPNodeStorage[][][][] ROOT_D
boolean[][][] ROOT_D_ZERO
double[][][][][] CHILD_D
GPProblem problem
GPSpecies gpspecies
HashMap<K,V> ERCBank
GrammarRuleNode[] grammar
int passes
String initScheme
GrammarParser parser_prototype
GrammarParser[] grammarParser
GPNode prototype
HashMap<K,V> rules
GrammarRuleNode root
ArrayList<E> productionRuleList
HashMap<K,V> indexToRule
HashMap<K,V> ruleToIndex
HashMap<K,V> functionHeadToIndex
HashMap<K,V> ruleHeadToIndex
HashMap<K,V> absIndexToRelIndex
HashMap<K,V> ruleToFirstSet
HashMap<K,V> ruleToFollowSet
HashMap<K,V> ruleToPredictSet
int[][] predictiveParseTable
GPNodeSelector nodeselect1
GPNodeSelector nodeselect2
int tree1
int tree2
int numTries
int maxDepth
int maxSize
boolean tossSecondParent
GPIndividual[] parents
double standardizedFitness
int hits
double rootProbability
double terminalProbability
double nonterminalProbability
int nonterminals
int terminals
int nodes
GPNodeSelector nodeselect
GPNodeBuilder builder
int numTries
int maxDepth
int maxSize
boolean equalSize
int tree
GPNode[] dummy
StringBuilder buffer
String[] instructions
PushInstruction[] customInstructions
int[] indices
String value
double[] maxObjective
double[] minObjective
boolean[] maximize
double[] objectives
int size
int size2
double probabilityOfSelection
double probabilityOfSelection2
boolean pickWorst
boolean pickWorst2
boolean doLengthFirst
int neighborhood
double velCoeff
double personalCoeff
double informantCoeff
double globalCoeff
int neighborhoodSize
boolean includeSelf
double[][] globalBest
Fitness[] globalBestFitness
byte constraintNumber
String name
RuleSet[] rulesets
Hashtable<K,V> ruleConstraintRepository
RuleConstraints[] ruleConstraints
byte numRuleConstraints
Hashtable<K,V> ruleSetConstraintRepository
RuleSetConstraints[] ruleSetConstraints
byte numRuleSetConstraints
byte constraints
Rule[] rules
int numRules
int minSize
int maxSize
int resetMinSize
int resetMaxSize
double[] sizeDistribution
double p_add
double p_del
double p_randorder
Rule rulePrototype
byte constraintNumber
String name
boolean tossSecondParent
double ruleCrossProbability
RuleIndividual[] parents
int size
double probabilityOfPickingSizePlusOne
boolean pickWorst
int[] sortedPop
int bestn
double bestnFrac
double[] sortedFitOver
double[] sortedFitUnder
int[] sortedPop
double top_n_percent
double gets_n_percent
SelectionMethod[] selects
int[] indices
double[] fitnesses
boolean shuffle
double offset
int lastIndex
int steps
int[] elite
double[] eliteFrac
boolean[] reevaluateElites
boolean sequentialBreeding
boolean clonePipelineAndPopulation
Population backupPopulation
ThreadPool pool
int numTests
int mergeForm
boolean cloneProblem
Object[] lock
int individualCounter
int subPopCounter
int chunkSize
ThreadPool pool
Population oldpop
int statisticslog
int modulus
boolean doSize
boolean doTime
boolean doSubpops
Individual[] bestSoFar
long[] totalSizeSoFar
long[] totalIndsSoFar
long[] totalIndsThisGen
long[] totalSizeThisGen
double[] totalFitnessThisGen
Individual[] bestOfGeneration
long lastTime
int statisticslog
Individual[] best_of_run
boolean compress
boolean doFinal
boolean doGeneration
boolean doMessage
boolean doDescription
boolean doPerGenerationDescription
Individual ind
int subpop
BreedingPipeline[] bp
SelectionMethod[] deselectors
LinkedList<E> queue
int subpopulationBeingEvaluated
SimpleProblemForm problem
boolean generationBoundary
int generationSize
long evaluations
double replacementProbability
int[] individualCount
HashMap<K,V>[] individualHash
int whichSubpop
boolean firstTime
boolean justCalledPostEvaluationStatistics
boolean silent
File filename
boolean postAnnouncements
LogRestarter restarter
boolean repostAnnouncementsOnRestart
boolean appendOnRestart
boolean isLoggingToSystemOut
private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException
IOExceptionClassNotFoundExceptionprivate void writeObject(ObjectOutputStream out) throws IOException
IOExceptionint[] mt
int mti
int[] mag01
double __nextNextGaussian
boolean __haveNextNextGaussian
String param
Object workersLock
double[] minGene
double[] maxGene
int[] mutationType
double[] gaussMutationStdev
boolean[] mutationIsBounded
boolean mutationIsBoundedDefined
int[] mutationDistributionIndex
boolean[] polynomialIsAlternative
boolean polynomialIsAlternativeDefined
double[] randomWalkProbability
int outOfBoundsRetries
Gene[] genome
Gene genePrototype
long[] minGene
long[] maxGene
int[] mutationType
double[] randomWalkProbability
boolean[] mutationIsBounded
boolean mutationIsBoundedDefined
int[] duplicateRetries
double[] mutationProbability
double crossoverProbability
int crossoverType
int genomeSize
int crossoverDistributionIndex
int genomeResizeAlgorithm
int minInitialSize
int maxInitialSize
double genomeIncreaseProbability
int chunksize
double lineDistance
boolean dynamicInitialSize
boolean tossSecondParent
int crossoverType
int minChildSize
int numTries
double minCrossoverPercentage
double maxCrossoverPercentage
VectorIndividual[] parents
VectorIndividual[] parents
boolean tossSecondParent
VectorIndividual[] parents
Copyright © 2014 Evolutionary Computation Laboratory at George Mason University. All rights reserved.