public class NSGAII<S extends Solution<?>> extends AbstractGeneticAlgorithm<S,List<S>>
| Modifier and Type | Field and Description |
|---|---|
protected SolutionListEvaluator<S> |
evaluator |
protected int |
iterations |
protected int |
maxIterations |
protected int |
populationSize |
protected Problem<S> |
problem |
crossoverOperator, mutationOperator, selectionOperator| Constructor and Description |
|---|
NSGAII(Problem<S> problem,
int maxIterations,
int populationSize,
CrossoverOperator<S> crossoverOperator,
MutationOperator<S> mutationOperator,
SelectionOperator<List<S>,S> selectionOperator,
SolutionListEvaluator<S> evaluator)
Constructor
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
addLastRankedSolutionsToPopulation(Ranking<S> ranking,
int rank,
List<S> population) |
protected void |
addRankedSolutionsToPopulation(Ranking<S> ranking,
int rank,
List<S> population) |
protected Ranking<S> |
computeRanking(List<S> solutionList) |
protected List<S> |
createInitialPopulation() |
protected List<S> |
crowdingDistanceSelection(Ranking<S> ranking) |
protected List<S> |
evaluatePopulation(List<S> population) |
protected List<S> |
getNonDominatedSolutions(List<S> solutionList) |
List<S> |
getResult() |
protected void |
initProgress() |
protected boolean |
isStoppingConditionReached() |
protected boolean |
populationIsNotFull(List<S> population) |
protected List<S> |
replacement(List<S> population,
List<S> offspringPopulation) |
protected List<S> |
reproduction(List<S> population) |
protected List<S> |
selection(List<S> population) |
protected boolean |
subfrontFillsIntoThePopulation(Ranking<S> ranking,
int rank,
List<S> population) |
protected void |
updateProgress() |
getPopulation, run, setPopulationprotected final int maxIterations
protected final int populationSize
protected final SolutionListEvaluator<S extends Solution<?>> evaluator
protected int iterations
public NSGAII(Problem<S> problem, int maxIterations, int populationSize, CrossoverOperator<S> crossoverOperator, MutationOperator<S> mutationOperator, SelectionOperator<List<S>,S> selectionOperator, SolutionListEvaluator<S> evaluator)
protected void initProgress()
initProgress in class AbstractEvolutionaryAlgorithm<S extends Solution<?>,List<S extends Solution<?>>>protected void updateProgress()
updateProgress in class AbstractEvolutionaryAlgorithm<S extends Solution<?>,List<S extends Solution<?>>>protected boolean isStoppingConditionReached()
isStoppingConditionReached in class AbstractEvolutionaryAlgorithm<S extends Solution<?>,List<S extends Solution<?>>>protected List<S> createInitialPopulation()
createInitialPopulation in class AbstractEvolutionaryAlgorithm<S extends Solution<?>,List<S extends Solution<?>>>protected List<S> evaluatePopulation(List<S> population)
evaluatePopulation in class AbstractEvolutionaryAlgorithm<S extends Solution<?>,List<S extends Solution<?>>>protected List<S> reproduction(List<S> population)
reproduction in class AbstractEvolutionaryAlgorithm<S extends Solution<?>,List<S extends Solution<?>>>protected List<S> replacement(List<S> population, List<S> offspringPopulation)
replacement in class AbstractEvolutionaryAlgorithm<S extends Solution<?>,List<S extends Solution<?>>>protected boolean subfrontFillsIntoThePopulation(Ranking<S> ranking, int rank, List<S> population)
protected void addRankedSolutionsToPopulation(Ranking<S> ranking, int rank, List<S> population)
protected void addLastRankedSolutionsToPopulation(Ranking<S> ranking, int rank, List<S> population)
Copyright © 2015. All rights reserved.