List<E> population
List<E> coordinates
SelectionOperator<Source,Result> selectionOperator
CrossoverOperator<S extends Solution<?>> crossoverOperator
MutationOperator<Source extends Solution<?>> mutationOperator
Comparator<T> comparator
int N
int M
double rho
double Fbs
double Fbr
double Fa
double Fd
double Pd
int attemptsToSettle
DifferentialEvolutionCrossover crossoverOperator
DifferentialEvolutionSelection selectionOperator
MutationOperator<Source extends Solution<?>> mutationOperator
int maxPopulationSize
SelectionOperator<Source,Result> selectionOperator
CrossoverOperator<S extends Solution<?>> crossoverOperator
MutationOperator<Source extends Solution<?>> mutationOperator
Object value
long count
Map<K,V> linkedMeasures
CountingMeasure through
CountingMeasure.link(PushMeasure). We use a WeakHashMap to avoid keeping
the measures/listeners in memory if they are not used anymore, allowing
the garbage collection to free the memory properly. When this
CountingMeasure is ready to be freed too, the remaining links are
removed within CountingMeasure.finalize(). This way, the listeners generated can
also be properly freed and the measures will not notify us anymore.long previousRoundsDuration
DurationMeasure.stop() is called, this time is added to this variable, so that
it provides the total time spent during all the previous rounds (total
time minus the time spent in the current round).Long roundStart
null if we are not in a round (if DurationMeasure.start() has not
been called or if DurationMeasure.stop() has been called).Long lastReset
Long time
WeakHashMap<K,V> measureCache
WeakHashMap<K,V> listenerCache
PullMeasure<Value> puller
PullPushMeasure.get() method.PushMeasure<Value> pusher
Measure responsible of the PullPushMeasure.register(MeasureListener)
and PullPushMeasure.unregister(MeasureListener) methods.DescribedEntity reference
PullPushMeasure.getName() and
PullPushMeasure.getDescription() methods, potentially the same than
PullPushMeasure.puller or PullPushMeasure.pusher.Set<E> listeners
SimplePushMeasure.double crossoverProbability
double alpha
RepairDoubleSolution solutionRepair
JMetalRandom randomGenerator
double cr
double f
double k
String variant
DoubleSolution currentSolution
JMetalRandom randomGenerator
double crossoverProbability
JMetalRandom randomGenerator
double distributionIndex
double crossoverProbability
JMetalRandom randomGenerator
double crossoverProbability
JMetalRandom randomGenerator
double distributionIndex
double crossoverProbability
RepairDoubleSolution solutionRepair
JMetalRandom randomGenerator
double crossoverProbability
JMetalRandom randomGenerator
Problem<S extends Solution<?>> problem
Archive<S extends Solution<?>> archive
int improvementRounds
Comparator<T> constraintComparator
Comparator<T> dominanceComparator
MutationOperator<Source extends Solution<?>> mutationOperator
int evaluations
int numberOfImprovements
int numberOfNonComparableSolutions
Problem<S extends Solution<?>> problem
int improvementRounds
Comparator<T> constraintComparator
Comparator<T> comparator
MutationOperator<Source extends Solution<?>> mutationOperator
int evaluations
int numberOfImprovements
JMetalRandom randomGenerator
int numberOfNonComparableSolutions
double mutationProbability
JMetalRandom randomGenerator
double distributionIndex
double mutationProbability
RepairDoubleSolution solutionRepair
JMetalRandom randomGenerator
double perturbation
int maxIterations
double mutationProbability
int currentIteration
JMetalRandom randomGenenerator
double mutationProbability
JMetalRandom randomGenerator
double distributionIndex
double mutationProbability
RepairDoubleSolution solutionRepair
JMetalRandom randomGenerator
double mutationProbability
JMetalRandom randomGenerator
Double perturbation
Double mutationProbability
JMetalRandom randomGenenerator
Comparator<T> comparator
int solutionListIndex
JMetalRandom randomGenerator
JMetalRandom randomGenerator
int numberOfSolutionsToBeReturned
Comparator<T> comparator
int numberOfSolutionsToBeReturned
int solutionsToSelect
Comparator<T> comparator
int numberOfTournaments
int numberOfVariables
int numberOfObjectives
int numberOfConstraints
String name
Front referenceParetoFront
double pow
Front referenceParetoFront
double pow
double[][] matrix
double[][] lambda
Front referenceParetoFront
double offset
Point referencePoint
int numberOfObjectives
double offset
double[] objectives
double[] variables
DoubleProblem problem
Map<K,V> attributes
JMetalRandom randomGenerator
int numberOfDoubleVariables
int numberOfIntegerVariables
int numberOfDoubleVariables
JMetalRandom randomGenerator
NonDominatedSolutionListArchive<S extends Solution<?>> archive
int maxSize
AdaptiveGrid<S extends Solution<?>> grid
Comparator<T> dominanceComparator
Comparator<T> crowdingDistanceComparator
DensityEstimator<S extends Solution<?>> crowdingDistance
Comparator<T> comparator
Hypervolume<S extends Solution<?>> hypervolume
List<E> solutionList
Comparator<T> dominanceComparator
Comparator<T> equalSolutions
int numberOfBits
CrowdingDistance<S extends Solution<?>> crowdingDistance
ConstraintViolationComparator<S extends Solution<?>> constraintViolationComparator
double epsilon
HypervolumeContributionAttribute<S extends Solution<?>> hvContribution
int objectiveId
ObjectiveComparator.Ordering order
Comparator<T> rankComparator
Comparator<T> crowdingDistanceComparator
StrengthRawFitness<S extends Solution<?>> fitnessValue
OverallConstraintViolation<S extends Solution<?>> overallConstraintViolation
double threshold
OverallConstraintViolation<S extends Solution<?>> overallConstraintViolation
NumberOfViolatedConstraints<S extends Solution<?>> numberOfViolatedConstraints
int numberOfThreads
Point[] points
int numberOfPoints
int pointDimensions
int solutionListSize
int numberOfRandomNeighbours
List<E> neighbours
JMetalRandom randomGenerator
int rows
int columns
int[][] neighborhood
int[][] mesh
PseudoRandomGenerator randomGenerator
PseudoRandomGenerator randomGenerator
Random rnd
long seed
org.apache.commons.math3.random.MersenneTwister rnd
long seed
org.apache.commons.math3.random.Well44497b rnd
long seed
Object identifier
Copyright © 2017. All rights reserved.