| Package | Description |
|---|---|
| org.uma.jmetal.algorithm.impl | |
| org.uma.jmetal.operator.impl.localsearch | |
| org.uma.jmetal.operator.impl.mutation |
| Modifier and Type | Field and Description |
|---|---|
protected MutationOperator<S> |
AbstractEvolutionStrategy.mutationOperator |
protected MutationOperator<S> |
AbstractCoralReefsOptimization.mutationOperator |
protected MutationOperator<S> |
AbstractGeneticAlgorithm.mutationOperator |
| Modifier and Type | Method and Description |
|---|---|
MutationOperator<S> |
AbstractEvolutionStrategy.getMutationOperator() |
MutationOperator<S> |
AbstractGeneticAlgorithm.getMutationOperator() |
| Constructor and Description |
|---|
AbstractCoralReefsOptimization(Comparator<S> comparator,
SelectionOperator<List<S>,S> selectionOperator,
CrossoverOperator<S> crossoverOperator,
MutationOperator<S> mutationOperator,
int n,
int m,
double rho,
double fbs,
double fa,
double pd,
int attemptsToSettle)
Constructor
|
| Constructor and Description |
|---|
ArchiveMutationLocalSearch(int improvementRounds,
MutationOperator<S> mutationOperator,
Archive<S> archive,
Problem<S> problem)
Constructor.
|
BasicLocalSearch(int improvementRounds,
MutationOperator<S> mutationOperator,
Comparator<S> comparator,
Problem<S> problem)
Constructor.
|
BasicLocalSearch(int improvementRounds,
MutationOperator<S> mutationOperator,
Comparator<S> comparator,
Problem<S> problem,
RandomGenerator<Double> randomGenerator)
Constructor.
|
| Modifier and Type | Class and Description |
|---|---|
class |
BitFlipMutation |
class |
IntegerPolynomialMutation
This class implements a polynomial mutation operator to be applied to Integer solutions
If the lower and upper bounds of a variable are the same, no mutation is carried out and the
bound value is returned.
|
class |
NonUniformMutation
This class implements a non-uniform mutation operator.
|
class |
NullMutation<S>
This class is intended to perform no mutation.
|
class |
PermutationSwapMutation<T>
This class implements a swap mutation.
|
class |
PolynomialMutation
This class implements a polynomial mutation operator
The implementation is based on the NSGA-II code available in
http://www.iitk.ac.in/kangal/codes.shtml
If the lower and upper bounds of a variable are the same, no mutation is carried out and the
bound value is returned.
|
class |
SimpleRandomMutation
This class implements a random mutation operator for double solutions
|
class |
UniformMutation
This class implements a uniform mutation operator.
|
Copyright © 2018. All rights reserved.