core

Class AbstractRanking

java.lang.Object

core.AbstractComponent

core.AbstractRanking

Direct Known Subclasses:

AbsoluteRanking, FullTournament, SwissSystem

public abstract class AbstractRanking
extends AbstractComponent

Abstract superclass for ranking/sorting candidates. Rankings are used to sort a list of candidates in a decreasing order of fitness.

AbstractSingleProblems can only use the AbsoluteRanking component while AbstractMultiProblems can use various more sophisticated algorithms.

Author:

Istvan Fehervari

Constructor Summary

Constructors

Constructor and Description
AbstractRanking()

Method Summary

Methods

Modifier and Type	Method and Description
abstract int	sortCandidates(java.util.ArrayList<AbstractRepresentation> representations, ProblemXMLData problem, java.util.Random random) Sorts the given array of representations in a descending order of fitness and returns the number of evaluation that was required for the ranking to finish.

Methods inherited from class core.AbstractComponent

getProperties, getPropertyValue, getTypeOfProperty, getXMLData, setProperties, setXMLData

Methods inherited from class java.lang.Object

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

Constructor Detail

AbstractRanking

public AbstractRanking()

Method Detail

sortCandidates

public abstract int sortCandidates(java.util.ArrayList<AbstractRepresentation> representations,
                 ProblemXMLData problem,
                 java.util.Random random)

Sorts the given array of representations in a descending order of fitness and returns the number of evaluation that was required for the ranking to finish. Evaluation of the candidates is done by the provided problem component.

Parameters:

representations - The population to be sorted.

problem - The problem descriptor to be used for evaluation.

random - The random generator object used for sorting.

Returns:

the number of evaluations that were needed to rank the given set of representations