| 
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Uses of Individual in lio | 
|---|
| Methods in lio with parameters of type Individual | |
|---|---|
abstract  double | 
LiOTask.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
| Uses of Individual in lio.crossover | 
|---|
| Methods in lio.crossover that return Individual | |
|---|---|
 Individual[] | 
Crossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
| Methods in lio.crossover with parameters of type Individual | |
|---|---|
 Individual[] | 
Crossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
| Uses of Individual in lio.crossover.bitchain | 
|---|
| Methods in lio.crossover.bitchain that return Individual | |
|---|---|
 Individual[] | 
UniformCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
TwoPointCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
OnePointCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
HUX.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
| Methods in lio.crossover.bitchain with parameters of type Individual | |
|---|---|
 Individual[] | 
UniformCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
TwoPointCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
OnePointCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
HUX.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
| Uses of Individual in lio.crossover.contchain | 
|---|
| Methods in lio.crossover.contchain that return Individual | |
|---|---|
 Individual[] | 
WrightsHeuristicCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
SimpleCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
LinearCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
FlatCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
ExtendedLineCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
ExtendedIntermediateCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
DiscreteCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
BLXAlphaCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
ArithmeticalCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
| Methods in lio.crossover.contchain with parameters of type Individual | |
|---|---|
 Individual[] | 
WrightsHeuristicCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
SimpleCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
LinearCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
FlatCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
ExtendedLineCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
ExtendedIntermediateCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
DiscreteCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
BLXAlphaCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
ArithmeticalCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
| Uses of Individual in lio.crossover.permutations | 
|---|
| Methods in lio.crossover.permutations that return Individual | |
|---|---|
 Individual[] | 
PMX.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
OrderCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
| Methods in lio.crossover.permutations with parameters of type Individual | |
|---|---|
 Individual[] | 
PMX.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
 Individual[] | 
OrderCrossover.cross(Individual parent1,
      Individual parent2)
Crosses two individuals.  | 
| Uses of Individual in lio.generators | 
|---|
| Methods in lio.generators that return Individual | |
|---|---|
static Individual | 
GreedyConstructor.expandSolution(Individual individual,
               int pNumCandidates)
Performs an step on the solution construction process.  | 
 Individual[] | 
GreedyConstructor.generate(int nIndividuals)
Generates a number of individuals.  | 
 Individual[] | 
Generator.generate(int nIndividuals)
Generates a number of individuals.  | 
static Individual | 
GreedyConstructor.generateSolution(int pNumCandidates)
Generates an individual by means of a greedy construction.  | 
static Individual | 
GreedyConstructor.generateStartingPoint()
Generates the starting point of a solution.  | 
| Methods in lio.generators with parameters of type Individual | |
|---|---|
static Individual | 
GreedyConstructor.expandSolution(Individual individual,
               int pNumCandidates)
Performs an step on the solution construction process.  | 
static boolean | 
GreedyConstructor.isComplete(Individual individual)
Determines whether solution is a complete one or not.  | 
| Uses of Individual in lio.generators.bitchain | 
|---|
| Methods in lio.generators.bitchain that return Individual | |
|---|---|
 Individual[] | 
RandomGenerator.generate(int nIndividuals)
Creates individuals.  | 
 Individual[] | 
PseudoRandomGenerator.generate(int nIndividuals)
Creates individuals.  | 
| Uses of Individual in lio.generators.contchain | 
|---|
| Methods in lio.generators.contchain that return Individual | |
|---|---|
 Individual[] | 
RandomGenerator.generate(int nIndividuals)
Creates individuals.  | 
| Uses of Individual in lio.generators.permutation | 
|---|
| Methods in lio.generators.permutation that return Individual | |
|---|---|
 Individual[] | 
RandomGenerator.generate(int nIndividuals)
Creates individuals.  | 
| Uses of Individual in lio.individuals | 
|---|
| Subclasses of Individual in lio.individuals | |
|---|---|
 class | 
BitChain
This class implements those individuals coded with a chain of bits.  | 
 class | 
ContChain
This class is used to manage individuals represented by an array of double.  | 
 class | 
Permutation
This class is used to manage individuals composed by a chain of binary values.  | 
| Uses of Individual in lio.memetic | 
|---|
| Methods in lio.memetic that return Individual | |
|---|---|
 Individual | 
HillClimbing.doHillClimbing(Individual individual)
Given an individual, performs a local search and returns the result.  | 
 Individual | 
SimulAnnealing.doTestsNB(Individual individual,
          double T)
 | 
| Methods in lio.memetic with parameters of type Individual | |
|---|---|
 Individual | 
HillClimbing.doHillClimbing(Individual individual)
Given an individual, performs a local search and returns the result.  | 
 Individual | 
SimulAnnealing.doTestsNB(Individual individual,
          double T)
 | 
| Uses of Individual in lio.misc | 
|---|
| Methods in lio.misc that return Individual | |
|---|---|
 Individual | 
Statistics.getBestIndividual()
 | 
| Methods in lio.misc with parameters of type Individual | |
|---|---|
 void | 
Statistics.newEvaluation(Individual individual)
Makes and accounts a new evaluation.  | 
 void | 
Statistics.newEvaluation(Individual individual,
              double value)
Accounts a new evaluation.  | 
| Uses of Individual in lio.mutation | 
|---|
| Methods in lio.mutation with parameters of type Individual | |
|---|---|
 void | 
Mutation.mutate(Individual individual)
Mutate this individual.  | 
 void | 
Mutation.mutate(Individual individual,
       double pMutationProbability)
It mutates individuals with a given probability.  | 
| Uses of Individual in lio.mutation.bitchain | 
|---|
| Methods in lio.mutation.bitchain with parameters of type Individual | |
|---|---|
 void | 
BinaryMutation.mutate(Individual ind)
Applies mutation to one position choosen at random.  | 
 void | 
BinaryMutation.mutate(Individual ind,
       double probability)
Applies mutation to each position depending on the probability.  | 
| Uses of Individual in lio.mutation.contchain | 
|---|
| Methods in lio.mutation.contchain with parameters of type Individual | |
|---|---|
 void | 
RandomMutation.mutate(Individual ind)
Applies mutation to one position choosen at random.  | 
 void | 
MinMaxMutation.mutate(Individual ind)
Applies mutation to one position choosen at random.  | 
 void | 
RandomMutation.mutate(Individual ind,
       double probability)
Applies mutation to each position depending on the probability.  | 
 void | 
MinMaxMutation.mutate(Individual ind,
       double probability)
Applies mutation to each position depending on the probability.  | 
| Uses of Individual in lio.mutation.permutations | 
|---|
| Methods in lio.mutation.permutations with parameters of type Individual | |
|---|---|
 void | 
DisplacementMutation.mutate(Individual individual)
Mutates a parmutation  | 
 void | 
DisplacementMutation.mutate(Individual individual,
       double pMutationProbability)
Applies mutation to the whole individual with a certain probability  | 
| Uses of Individual in lio.neighbourhood | 
|---|
| Methods in lio.neighbourhood that return Individual | |
|---|---|
 Individual[] | 
Neighbourhood.getAllNeighbours(Individual individual)
Returns all neighbours of one individual ordered decreasing .  | 
 Individual[] | 
Neighbourhood.getBestNeighbours(Individual individual,
                  int numNeighbours)
Returns the best neighbours of one individual ordered decrently.  | 
 Individual | 
Neighbourhood.getRandomNeighbour(Individual individual)
Returns the a random neighbour of one individual.  | 
| Methods in lio.neighbourhood with parameters of type Individual | |
|---|---|
 Individual[] | 
Neighbourhood.getAllNeighbours(Individual individual)
Returns all neighbours of one individual ordered decreasing .  | 
 Individual[] | 
Neighbourhood.getBestNeighbours(Individual individual,
                  int numNeighbours)
Returns the best neighbours of one individual ordered decrently.  | 
 Individual | 
Neighbourhood.getRandomNeighbour(Individual individual)
Returns the a random neighbour of one individual.  | 
| Uses of Individual in lio.neighbourhood.bitchain | 
|---|
| Methods in lio.neighbourhood.bitchain that return Individual | |
|---|---|
 Individual[] | 
bitChNeighbourGenerator.getAllNeighbours(Individual individual)
Returns the neighbours of one individual in decreasing order.  | 
 Individual[] | 
bitChNeighbourGenerator.getBestNeighbours(Individual individual,
                  int numNeighbours)
Returns the best neighbours of one individual in decreasing order.  | 
 Individual | 
bitChNeighbourGenerator.getRandomNeighbour(Individual individual)
Returns the best neighbour of one individual.  | 
| Methods in lio.neighbourhood.bitchain with parameters of type Individual | |
|---|---|
 Individual[] | 
bitChNeighbourGenerator.getAllNeighbours(Individual individual)
Returns the neighbours of one individual in decreasing order.  | 
 Individual[] | 
bitChNeighbourGenerator.getBestNeighbours(Individual individual,
                  int numNeighbours)
Returns the best neighbours of one individual in decreasing order.  | 
 Individual | 
bitChNeighbourGenerator.getRandomNeighbour(Individual individual)
Returns the best neighbour of one individual.  | 
| Uses of Individual in lio.neighbourhood.permutation | 
|---|
| Methods in lio.neighbourhood.permutation that return Individual | |
|---|---|
 Individual[] | 
permNeighbourGenerator.getAllNeighbours(Individual individual)
Returns the neighbours of one individual ordered decreasingly.  | 
 Individual[] | 
permNeighbourGenerator.getBestNeighbours(Individual individual,
                  int numNeighbours)
Returns the best neighbours of one individual ordered decreasingly.  | 
 Individual | 
permNeighbourGenerator.getRandomNeighbour(Individual individual)
Returns a random neighbour of one individual.  | 
| Methods in lio.neighbourhood.permutation with parameters of type Individual | |
|---|---|
 Individual[] | 
permNeighbourGenerator.getAllNeighbours(Individual individual)
Returns the neighbours of one individual ordered decreasingly.  | 
 Individual[] | 
permNeighbourGenerator.getBestNeighbours(Individual individual,
                  int numNeighbours)
Returns the best neighbours of one individual ordered decreasingly.  | 
 Individual | 
permNeighbourGenerator.getRandomNeighbour(Individual individual)
Returns a random neighbour of one individual.  | 
| Uses of Individual in lio.perturbation | 
|---|
| Methods in lio.perturbation with parameters of type Individual | |
|---|---|
 void | 
Perturbation.perturbate(Individual individual)
Makes changes on the current individual.  | 
 void | 
MutationBasedPerturbation.perturbate(Individual individual)
Makes changes on the current individual.  | 
| Uses of Individual in lio.population | 
|---|
| Methods in lio.population that return Individual | |
|---|---|
 Individual | 
Population.copyElementAt(int position)
Returns a copy of the element at the given position.  | 
 Individual | 
VariablePopulation.elementAt(int position)
Returns a reference to the individual in the given position.  | 
 Individual | 
StaticPopulation.elementAt(int position)
Returns a reference to the individual in the given position.  | 
abstract  Individual | 
Population.elementAt(int position)
Returns a reference to the individual in the given position.  | 
 Individual[] | 
VariablePopulation.individuals()
Returns an array containing all individuals, but not empty spaces.  | 
 Individual[] | 
StaticPopulation.individuals()
Returns an array containing all individuals.  | 
abstract  Individual[] | 
Population.individuals()
Returns an array containing all individuals.  | 
| Methods in lio.population with parameters of type Individual | |
|---|---|
 void | 
VariablePopulation.addElement(Individual individual)
Append the specified individual to the end of the population  | 
 void | 
VariablePopulation.setElementAt(int position,
             Individual individual)
Replaces the element at given position.  | 
 void | 
StaticPopulation.setElementAt(int position,
             Individual individual)
Replaces the element at given position.  | 
abstract  void | 
Population.setElementAt(int position,
             Individual individual)
Replaces the element at given position.  | 
| Constructors in lio.population with parameters of type Individual | |
|---|---|
StaticPopulation(Individual[] pIndividuals)
Constructor Encapsulates an array of individuals into a population.  | 
|
VariablePopulation(Individual[] individuals)
Constructor Encapsulates an array of individuals into a VariablePopulation.  | 
|
| Uses of Individual in lio.population.bitchain | 
|---|
| Constructors in lio.population.bitchain with parameters of type Individual | |
|---|---|
SetAnalysis(Individual[] individuals)
Constructor Builds a set analizer by extracting the references to the elements inside each BitChain in the array passed as parameter.  | 
|
SetAnalysis(Individual[] individuals,
            int pNumIndividuals)
Constructor Builds a set analizer by extracting the references to the elements inside each BitChain in the array as parameter.  | 
|
| Uses of Individual in lio.population.contchain | 
|---|
| Constructors in lio.population.contchain with parameters of type Individual | |
|---|---|
SetAnalysis(Individual[] individuals)
Constructor Builds a set analizer by extracting the references to the elements inside each ContChain in the array passed as parameter.  | 
|
SetAnalysis(Individual[] individuals,
            int pNumIndividuals)
Constructor Builds a set analizer by extracting the references to the elements inside each ContChain in the array as parameter.  | 
|
| Uses of Individual in lio.probdistributions | 
|---|
| Methods in lio.probdistributions that return Individual | |
|---|---|
 Individual[] | 
ProbDistribution.sample(int nIndividuals)
Samples some individuals from a probability distribution  | 
| Methods in lio.probdistributions with parameters of type Individual | |
|---|---|
abstract  double | 
Network.getProbability(int X,
               Individual configuration)
 | 
 void | 
ProbDistribution.learn(Individual[] individuals)
Learns a probability distribution from a set of data  | 
abstract  void | 
Network.setData(Individual[] individuals)
 | 
| Uses of Individual in lio.probdistributions.bitchain | 
|---|
| Methods in lio.probdistributions.bitchain that return Individual | |
|---|---|
static Individual[] | 
MarginalProbabilityVector.sample(double[] pMarginals,
       int nIndividuals)
Samples a population from a vector of marginal probabilities  | 
 Individual[] | 
MarginalProducts.sample(int nIndividuals)
Samples some individuals from a probability distribution  | 
 Individual[] | 
DependencyNetworkProbDistribution.sample(int nIndividuals)
 | 
 Individual[] | 
BivariateProbDistribution.sample(int nIndividuals)
Samples some individuals from a probability distribution  | 
 Individual[] | 
MarginalProbabilityVector.sample(int nIndividuals)
Samples some individuals from a probability distribution  | 
| Methods in lio.probdistributions.bitchain with parameters of type Individual | |
|---|---|
 double | 
MultivariateModel.getProbability(int X,
               Individual configuration)
 | 
 void | 
Chain.learn(Individual[] individuals)
Learns a probability distribution from a set of data  | 
 void | 
MarginalProducts.learn(Individual[] individuals)
Learns a probability distribution from a set of data  | 
 void | 
MultivariateMI_DN.learn(Individual[] individuals)
 | 
 void | 
Tree.learn(Individual[] individuals)
 | 
 void | 
MarginalProbabilityVector.learn(Individual[] individuals)
Learns a probability distribution from a set of data  | 
 void | 
MultivariateModel.setData(Individual[] individuals)
 | 
| Uses of Individual in lio.probdistributions.contchain | 
|---|
| Methods in lio.probdistributions.contchain that return Individual | |
|---|---|
 Individual[] | 
MarginalProbabilityVector.sample(int nIndividuals)
Samples a population from the probability distribution.  | 
| Methods in lio.probdistributions.contchain with parameters of type Individual | |
|---|---|
 void | 
MarginalProbabilityVector.learn(Individual[] individuals)
Learns a probability distribution from a set of data  | 
| Uses of Individual in lio.replacement | 
|---|
| Methods in lio.replacement that return Individual | |
|---|---|
 Individual[] | 
SelectionReplacement.replace(Population current,
        Population former)
Generates a new population from the current and the former one.  | 
 Individual[] | 
Replacement.replace(Population current,
        Population former)
Generates a new population from the current and the former one.  | 
 Individual[] | 
ElitistReplacement.replace(Population current,
        Population former)
Generates a new population from the current and the former one.  | 
| Uses of Individual in lio.search.local.greedy | 
|---|
| Fields in lio.search.local.greedy declared as Individual | |
|---|---|
(package private)  Individual | 
GRASP.currentIndividual
 | 
| Methods in lio.search.local.greedy that return Individual | |
|---|---|
abstract  Individual[] | 
LiOGreedyTask.genCandidateSteps(Individual pSolution,
                  int nCandidates)
Returns the best partial solutions that could be built in one step from the given one.  | 
abstract  Individual | 
LiOGreedyTask.generateStartingPoint()
Generates a minimum partial solution randomly.  | 
| Methods in lio.search.local.greedy with parameters of type Individual | |
|---|---|
abstract  Individual[] | 
LiOGreedyTask.genCandidateSteps(Individual pSolution,
                  int nCandidates)
Returns the best partial solutions that could be built in one step from the given one.  | 
abstract  boolean | 
LiOGreedyTask.isComplete(Individual pSolution)
Determines whether solution is a complete one or not.  | 
| Uses of Individual in lio.search.pso | 
|---|
| Fields in lio.search.pso declared as Individual | |
|---|---|
protected  Individual | 
Particle.bestPosition
Best position and fitness of the particle  | 
protected  Individual | 
Particle.currentPosition
Current position and fitness of the particle  | 
| Methods in lio.search.pso that return Individual | |
|---|---|
 Individual | 
Particle.getBestPosition()
 | 
 Individual | 
Particle.getCurrentPosition()
 | 
| Methods in lio.search.pso with parameters of type Individual | |
|---|---|
 void | 
Particle.setBestPosition(Individual bestPosition)
 | 
 void | 
Particle.setCurrentPosition(Individual currentPosition)
 | 
| Uses of Individual in lio.selectors | 
|---|
| Methods in lio.selectors that return Individual | |
|---|---|
 Individual[] | 
TruncationSelection.select(Individual[] individuals,
       int number)
Returns an array of individuals selected from those passed as parameter.  | 
 Individual[] | 
Selector.select(Individual[] individuals,
       int number)
Returns an array of individuals selected from those passed as parameter.  | 
 Individual[] | 
RouleteWheelSelector.select(Individual[] individuals,
       int number)
Returns an array of individuals selected from those passed as parameter.  | 
 Individual[] | 
KTournament.select(Individual[] individuals,
       int number)
Returns an array of individuals selected from those passed as parameter.  | 
| Methods in lio.selectors with parameters of type Individual | |
|---|---|
 double[] | 
RouleteWheelSelector.rankingSelection(Individual[] individuals)
Returns a vector containing probabilities for each individual assigned by ranking  | 
 Individual[] | 
TruncationSelection.select(Individual[] individuals,
       int number)
Returns an array of individuals selected from those passed as parameter.  | 
 Individual[] | 
Selector.select(Individual[] individuals,
       int number)
Returns an array of individuals selected from those passed as parameter.  | 
 Individual[] | 
RouleteWheelSelector.select(Individual[] individuals,
       int number)
Returns an array of individuals selected from those passed as parameter.  | 
 Individual[] | 
KTournament.select(Individual[] individuals,
       int number)
Returns an array of individuals selected from those passed as parameter.  | 
| Uses of Individual in problems.bitchain | 
|---|
| Methods in problems.bitchain with parameters of type Individual | |
|---|---|
 double | 
SixPeaks.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
Schwefel.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
Rosenbrock.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
Rastrigin.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
Powell.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
Plateau.evaluate(Individual individual)
 | 
 double | 
OneMax.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
MMDP.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
Griewangk.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
FC5.evaluate(Individual individual)
 | 
 double | 
FC4.evaluate(Individual individual)
 | 
 double | 
FC3.evaluate(Individual individual)
 | 
 double | 
FC2.evaluate(Individual individual)
 | 
 double | 
EqualProducts.evaluate(Individual individual)
 | 
 double | 
DecomposableProblem.evaluate(Individual individual)
 | 
 double | 
Colville.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
CheckerBoard.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
Ackley.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
| Uses of Individual in problems.contchain | 
|---|
| Methods in problems.contchain with parameters of type Individual | |
|---|---|
 double | 
SumCan.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
Schwefel.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
Rosenbrock.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
Rastrigin.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
Powell.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
OneMax.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
Griewangk.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
Colville.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
Ackley.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
| Uses of Individual in problems.permutation | 
|---|
| Methods in problems.permutation that return Individual | |
|---|---|
 Individual[] | 
SymmetricTSP.genCandidateSteps(Individual pSolution,
                  int pNCandidates)
 | 
 Individual | 
SymmetricTSP.generateStartingPoint()
 | 
| Methods in problems.permutation with parameters of type Individual | |
|---|---|
 double | 
SymmetricTSP.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 double | 
PermutationExample.evaluate(Individual individual)
Evaluates an individual and returns its fitness.  | 
 Individual[] | 
SymmetricTSP.genCandidateSteps(Individual pSolution,
                  int pNCandidates)
 | 
 boolean | 
SymmetricTSP.isComplete(Individual pSolution)
 | 
  | 
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||