org.uma.jmetal.algorithm.multiobjective.gde3

Class GDE3

java.lang.Object

org.uma.jmetal.algorithm.impl.AbstractEvolutionaryAlgorithm<DoubleSolution,Result>

org.uma.jmetal.algorithm.impl.AbstractDifferentialEvolution<List<DoubleSolution>>

org.uma.jmetal.algorithm.multiobjective.gde3.GDE3

All Implemented Interfaces:

Serializable, Runnable, Algorithm<List<DoubleSolution>>

public class GDE3
extends AbstractDifferentialEvolution<List<DoubleSolution>>

This class implements the GDE3 algorithm

See Also:

Serialized Form

Field Summary

Fields

Modifier and Type	Field and Description
protected DensityEstimator<DoubleSolution>	crowdingDistance
protected Comparator<DoubleSolution>	dominanceComparator
protected SolutionListEvaluator<DoubleSolution>	evaluator
protected int	iterations
protected int	maxIterations
protected int	populationSize
protected Ranking<DoubleSolution>	ranking

Fields inherited from class org.uma.jmetal.algorithm.impl.AbstractDifferentialEvolution

crossoverOperator, selectionOperator

Constructor Summary

Constructors

Constructor and Description
GDE3(DoubleProblem problem, int populationSize, int maxIterations, DifferentialEvolutionSelection selection, DifferentialEvolutionCrossover crossover, SolutionListEvaluator<DoubleSolution> evaluator) Constructor

Method Summary

Modifier and Type	Method and Description
protected void	addLastRankedSolutionsToPopulation(Ranking<DoubleSolution> ranking, int rank, List<DoubleSolution> population)
protected void	addRankedSolutionsToPopulation(Ranking<DoubleSolution> ranking, int rank, List<DoubleSolution> population)
protected Ranking<DoubleSolution>	computeRanking(List<DoubleSolution> solutionList)
protected List<DoubleSolution>	createInitialPopulation()
protected List<DoubleSolution>	crowdingDistanceSelection(Ranking<DoubleSolution> ranking)
protected List<DoubleSolution>	evaluatePopulation(List<DoubleSolution> population)
protected List<DoubleSolution>	getNonDominatedSolutions(List<DoubleSolution> solutionList)
List<DoubleSolution>	getResult()
protected void	initProgress()
protected boolean	isStoppingConditionReached()
protected boolean	populationIsNotFull(List<DoubleSolution> population)
protected List<DoubleSolution>	replacement(List<DoubleSolution> population, List<DoubleSolution> offspringPopulation)
protected List<DoubleSolution>	reproduction(List<DoubleSolution> matingPopulation)
protected List<DoubleSolution>	selection(List<DoubleSolution> population)
protected boolean	subfrontFillsIntoThePopulation(Ranking<DoubleSolution> ranking, int rank, List<DoubleSolution> population)
protected void	updateProgress()

Methods inherited from class org.uma.jmetal.algorithm.impl.AbstractEvolutionaryAlgorithm

getPopulation, run, setPopulation

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

populationSize

protected int populationSize

maxIterations

protected int maxIterations

iterations

protected int iterations

dominanceComparator

protected Comparator<DoubleSolution> dominanceComparator

ranking

protected Ranking<DoubleSolution> ranking

crowdingDistance

protected DensityEstimator<DoubleSolution> crowdingDistance

evaluator

protected SolutionListEvaluator<DoubleSolution> evaluator

Constructor Detail

GDE3

public GDE3(DoubleProblem problem,
            int populationSize,
            int maxIterations,
            DifferentialEvolutionSelection selection,
            DifferentialEvolutionCrossover crossover,
            SolutionListEvaluator<DoubleSolution> evaluator)

Constructor

Method Detail

initProgress

protected void initProgress()

Specified by:

initProgress in class AbstractEvolutionaryAlgorithm<DoubleSolution,List<DoubleSolution>>

updateProgress

protected void updateProgress()

Specified by:

updateProgress in class AbstractEvolutionaryAlgorithm<DoubleSolution,List<DoubleSolution>>

isStoppingConditionReached

protected boolean isStoppingConditionReached()

Specified by:

isStoppingConditionReached in class AbstractEvolutionaryAlgorithm<DoubleSolution,List<DoubleSolution>>

createInitialPopulation

protected List<DoubleSolution> createInitialPopulation()

Specified by:

createInitialPopulation in class AbstractEvolutionaryAlgorithm<DoubleSolution,List<DoubleSolution>>

evaluatePopulation

protected List<DoubleSolution> evaluatePopulation(List<DoubleSolution> population)

Specified by:

evaluatePopulation in class AbstractEvolutionaryAlgorithm<DoubleSolution,List<DoubleSolution>>

selection

protected List<DoubleSolution> selection(List<DoubleSolution> population)

Specified by:

selection in class AbstractEvolutionaryAlgorithm<DoubleSolution,List<DoubleSolution>>

reproduction

protected List<DoubleSolution> reproduction(List<DoubleSolution> matingPopulation)

Specified by:

reproduction in class AbstractEvolutionaryAlgorithm<DoubleSolution,List<DoubleSolution>>

replacement

protected List<DoubleSolution> replacement(List<DoubleSolution> population,
                                           List<DoubleSolution> offspringPopulation)

Specified by:

replacement in class AbstractEvolutionaryAlgorithm<DoubleSolution,List<DoubleSolution>>

getResult

public List<DoubleSolution> getResult()

Specified by:

getResult in interface Algorithm<List<DoubleSolution>>

Specified by:

getResult in class AbstractEvolutionaryAlgorithm<DoubleSolution,List<DoubleSolution>>

computeRanking

protected Ranking<DoubleSolution> computeRanking(List<DoubleSolution> solutionList)

crowdingDistanceSelection

protected List<DoubleSolution> crowdingDistanceSelection(Ranking<DoubleSolution> ranking)

populationIsNotFull

protected boolean populationIsNotFull(List<DoubleSolution> population)

subfrontFillsIntoThePopulation

protected boolean subfrontFillsIntoThePopulation(Ranking<DoubleSolution> ranking,
                                                 int rank,
                                                 List<DoubleSolution> population)

addRankedSolutionsToPopulation

protected void addRankedSolutionsToPopulation(Ranking<DoubleSolution> ranking,
                                              int rank,
                                              List<DoubleSolution> population)

addLastRankedSolutionsToPopulation

protected void addLastRankedSolutionsToPopulation(Ranking<DoubleSolution> ranking,
                                                  int rank,
                                                  List<DoubleSolution> population)

getNonDominatedSolutions

protected List<DoubleSolution> getNonDominatedSolutions(List<DoubleSolution> solutionList)