update doc with new stuffs
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@496 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
4ed6c756ea
commit
7d6ad66977
397 changed files with 9380 additions and 1569 deletions
|
|
@ -37,6 +37,7 @@
|
|||
<tr><td class="indexkey"><a class="el" href="classmoeoArchive.html">moeoArchive< MOEOT ></a></td><td class="indexvalue">An archive is a secondary population that stores non-dominated solutions </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoArchiveObjectiveVectorSavingUpdater.html">moeoArchiveObjectiveVectorSavingUpdater< MOEOT ></a></td><td class="indexvalue">This class allows to save the objective vectors of the solutions contained in an archive into a file at each generation </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoArchiveUpdater.html">moeoArchiveUpdater< MOEOT ></a></td><td class="indexvalue">This class allows to update the archive at each generation with newly found non-dominated solutions </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoBinaryIndicatorBasedFitnessAssignment.html">moeoBinaryIndicatorBasedFitnessAssignment< MOEOT ></a></td><td class="indexvalue">MoeoIndicatorBasedFitnessAssignment for binary indicators </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoBinaryMetric.html">moeoBinaryMetric< A1, A2, R ></a></td><td class="indexvalue">Base class for binary metrics </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoBinaryMetricSavingUpdater.html">moeoBinaryMetricSavingUpdater< MOEOT ></a></td><td class="indexvalue">This class allows to save the progression of a binary metric comparing the objective vectors of the current population (or archive) with the objective vectors of the population (or archive) of the generation (n-1) into a file </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoBitVector.html">moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity ></a></td><td class="indexvalue">This class is an implementationeo of a simple bit-valued <a class="el" href="classmoeoVector.html">moeoVector</a> </td></tr>
|
||||
|
|
@ -45,7 +46,7 @@
|
|||
<tr><td class="indexkey"><a class="el" href="classmoeoContributionMetric.html">moeoContributionMetric< ObjectiveVector ></a></td><td class="indexvalue">The contribution metric evaluates the proportion of non-dominated solutions given by a Pareto set relatively to another Pareto set (Meunier, Talbi, Reininger: 'A multiobjective genetic algorithm for radio network optimization', in Proc </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoConvertPopToObjectiveVectors.html">moeoConvertPopToObjectiveVectors< MOEOT, ObjectiveVector ></a></td><td class="indexvalue">Functor allowing to get a vector of objective vectors from a population </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoCriterionBasedFitnessAssignment.html">moeoCriterionBasedFitnessAssignment< MOEOT ></a></td><td class="indexvalue">MoeoCriterionBasedFitnessAssignment is a <a class="el" href="classmoeoFitnessAssignment.html">moeoFitnessAssignment</a> for criterion-based strategies </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoCrowdingDistanceDiversityAssignment.html">moeoCrowdingDistanceDiversityAssignment< MOEOT ></a></td><td class="indexvalue">Diversity assignment sheme based on crowding distance proposed in: K </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoCrowdingDiversityAssignment.html">moeoCrowdingDiversityAssignment< MOEOT ></a></td><td class="indexvalue">Diversity assignment sheme based on crowding proposed in: K </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoDetTournamentSelect.html">moeoDetTournamentSelect< MOEOT ></a></td><td class="indexvalue">Selection strategy that selects ONE individual by deterministic tournament </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoDistance.html">moeoDistance< MOEOT, Type ></a></td><td class="indexvalue">The base class for distance computation </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoDistanceMatrix.html">moeoDistanceMatrix< MOEOT, Type ></a></td><td class="indexvalue">A matrix to compute distances between every pair of individuals contained in a population </td></tr>
|
||||
|
|
@ -65,21 +66,25 @@
|
|||
<tr><td class="indexkey"><a class="el" href="classmoeoEnvironmentalReplacement_1_1Cmp.html">moeoEnvironmentalReplacement< MOEOT >::Cmp</a></td><td class="indexvalue">This object is used to compare solutions in order to sort the population </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoEuclideanDistance.html">moeoEuclideanDistance< MOEOT ></a></td><td class="indexvalue">A class allowing to compute an euclidian distance between two solutions in the objective space with normalized objective values (i.e </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoEvalFunc.html">moeoEvalFunc< MOEOT ></a></td><td class="indexvalue"></td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoExpBinaryIndicatorBasedFitnessAssignment.html">moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT ></a></td><td class="indexvalue">Fitness assignment sheme based on an indicator proposed in: E </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoFastNonDominatedSortingFitnessAssignment.html">moeoFastNonDominatedSortingFitnessAssignment< MOEOT ></a></td><td class="indexvalue">Fitness assignment sheme based on Pareto-dominance count proposed in: N </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoFastNonDominatedSortingFitnessAssignment_1_1ObjectiveComparator.html">moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator</a></td><td class="indexvalue">Functor allowing to compare two solutions according to their first objective value, then their second, and so on </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoFitnessAssignment.html">moeoFitnessAssignment< MOEOT ></a></td><td class="indexvalue">Functor that sets the fitness values of a whole population </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoFitnessThenDiversityComparator.html">moeoFitnessThenDiversityComparator< MOEOT ></a></td><td class="indexvalue">Functor allowing to compare two solutions according to their fitness values, then according to their diversity values </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoFrontByFrontCrowdingDistanceDiversityAssignment.html">moeoFrontByFrontCrowdingDistanceDiversityAssignment< MOEOT ></a></td><td class="indexvalue">Diversity assignment sheme based on crowding distance proposed in: K </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoFrontByFrontCrowdingDiversityAssignment.html">moeoFrontByFrontCrowdingDiversityAssignment< MOEOT ></a></td><td class="indexvalue">Diversity assignment sheme based on crowding proposed in: K </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoFrontByFrontSharingDiversityAssignment.html">moeoFrontByFrontSharingDiversityAssignment< MOEOT ></a></td><td class="indexvalue">Sharing assignment scheme on the way it is used in NSGA </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoGDominanceObjectiveVectorComparator.html">moeoGDominanceObjectiveVectorComparator< ObjectiveVector ></a></td><td class="indexvalue">This functor class allows to compare 2 objective vectors according to g-dominance </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoGenerationalReplacement.html">moeoGenerationalReplacement< MOEOT ></a></td><td class="indexvalue">Generational replacement: only the new individuals are preserved </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoHybridLS.html">moeoHybridLS< MOEOT ></a></td><td class="indexvalue">This class allows to apply a multi-objective local search to a number of selected individuals contained in the archive at every generation until a stopping criteria is verified </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoHypervolumeBinaryMetric.html">moeoHypervolumeBinaryMetric< ObjectiveVector ></a></td><td class="indexvalue">Hypervolume binary metric allowing to compare two objective vectors as proposed in Zitzler E., Künzli S </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoIBEA.html">moeoIBEA< MOEOT ></a></td><td class="indexvalue">IBEA (Indicator-Based Evolutionary Algorithm) as described in: E </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoIndicatorBasedFitnessAssignment.html">moeoIndicatorBasedFitnessAssignment< MOEOT ></a></td><td class="indexvalue">Fitness assignment sheme based an Indicator proposed in: E </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoIBMOLS.html">moeoIBMOLS< MOEOT, Move ></a></td><td class="indexvalue">Indicator-Based Multi-Objective Local Search (IBMOLS) as described in Basseur M., Burke K </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoIndicatorBasedFitnessAssignment.html">moeoIndicatorBasedFitnessAssignment< MOEOT ></a></td><td class="indexvalue">MoeoIndicatorBasedFitnessAssignment is a <a class="el" href="classmoeoFitnessAssignment.html">moeoFitnessAssignment</a> for Indicator-based strategies </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoIteratedIBMOLS.html">moeoIteratedIBMOLS< MOEOT, Move ></a></td><td class="indexvalue">Iterated version of IBMOLS as described in Basseur M., Burke K </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoLS.html">moeoLS< MOEOT, Type ></a></td><td class="indexvalue">Abstract class for local searches applied to multi-objective optimization </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoManhattanDistance.html">moeoManhattanDistance< MOEOT ></a></td><td class="indexvalue">A class allowing to compute the Manhattan distance between two solutions in the objective space normalized objective values (i.e </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoMetric.html">moeoMetric</a></td><td class="indexvalue">Base class for performance metrics (also known as quality indicators) </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoMoveIncrEval.html">moeoMoveIncrEval< Move ></a></td><td class="indexvalue"></td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoNormalizedDistance.html">moeoNormalizedDistance< MOEOT, Type ></a></td><td class="indexvalue">The base class for double distance computation with normalized objective values (i.e </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoNormalizedSolutionVsSolutionBinaryMetric.html">moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R ></a></td><td class="indexvalue">Base class for binary metrics dedicated to the performance comparison between two solutions's objective vectors using normalized values </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoNSGA.html">moeoNSGA< MOEOT ></a></td><td class="indexvalue">NSGA (Non-dominated Sorting Genetic Algorithm) as described in: N </td></tr>
|
||||
|
|
@ -87,13 +92,14 @@
|
|||
<tr><td class="indexkey"><a class="el" href="classmoeoObjectiveObjectiveVectorComparator.html">moeoObjectiveObjectiveVectorComparator< ObjectiveVector ></a></td><td class="indexvalue">Functor allowing to compare two objective vectors according to their first objective value, then their second, and so on </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoObjectiveVector.html">moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType ></a></td><td class="indexvalue">Abstract class allowing to represent a solution in the objective space (phenotypic representation) </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoObjectiveVectorComparator.html">moeoObjectiveVectorComparator< ObjectiveVector ></a></td><td class="indexvalue">Abstract class allowing to compare 2 objective vectors </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoObjectiveVectorDouble.html">moeoObjectiveVectorDouble< ObjectiveVectorTraits ></a></td><td class="indexvalue">This class allows to represent a solution in the objective space (phenotypic representation) by a std::vector of doubles, i.e </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoObjectiveVectorTraits.html">moeoObjectiveVectorTraits</a></td><td class="indexvalue">A traits class for <a class="el" href="classmoeoObjectiveVector.html">moeoObjectiveVector</a> to specify the number of objectives and which ones have to be minimized or maximized </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoOneObjectiveComparator.html">moeoOneObjectiveComparator< MOEOT ></a></td><td class="indexvalue">Functor allowing to compare two solutions according to one objective </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoParetoBasedFitnessAssignment.html">moeoParetoBasedFitnessAssignment< MOEOT ></a></td><td class="indexvalue">MoeoParetoBasedFitnessAssignment is a <a class="el" href="classmoeoFitnessAssignment.html">moeoFitnessAssignment</a> for Pareto-based strategies </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoParetoObjectiveVectorComparator.html">moeoParetoObjectiveVectorComparator< ObjectiveVector ></a></td><td class="indexvalue">This functor class allows to compare 2 objective vectors according to Pareto dominance </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoRandomSelect.html">moeoRandomSelect< MOEOT ></a></td><td class="indexvalue">Selection strategy that selects only one element randomly from a whole population </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoRealObjectiveVector.html">moeoRealObjectiveVector< ObjectiveVectorTraits ></a></td><td class="indexvalue">This class allows to represent a solution in the objective space (phenotypic representation) by a std::vector of real values, i.e </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoRealVector.html">moeoRealVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity ></a></td><td class="indexvalue">This class is an implementation of a simple double-valued <a class="el" href="classmoeoVector.html">moeoVector</a> </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoReferencePointIndicatorBasedFitnessAssignment.html">moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT ></a></td><td class="indexvalue">Fitness assignment sheme based a Reference Point and a Quality Indicator </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoReplacement.html">moeoReplacement< MOEOT ></a></td><td class="indexvalue">Replacement strategy for multi-objective optimization </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoRouletteSelect.html">moeoRouletteSelect< MOEOT ></a></td><td class="indexvalue">Selection strategy that selects ONE individual by using roulette wheel process </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoScalarFitnessAssignment.html">moeoScalarFitnessAssignment< MOEOT ></a></td><td class="indexvalue">MoeoScalarFitnessAssignment is a <a class="el" href="classmoeoFitnessAssignment.html">moeoFitnessAssignment</a> for scalar strategies </td></tr>
|
||||
|
|
@ -103,12 +109,13 @@
|
|||
<tr><td class="indexkey"><a class="el" href="classmoeoSolutionUnaryMetric.html">moeoSolutionUnaryMetric< ObjectiveVector, R ></a></td><td class="indexvalue">Base class for unary metrics dedicated to the performance evaluation of a single solution's objective vector </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoSolutionVsSolutionBinaryMetric.html">moeoSolutionVsSolutionBinaryMetric< ObjectiveVector, R ></a></td><td class="indexvalue">Base class for binary metrics dedicated to the performance comparison between two solutions's objective vectors </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoStochTournamentSelect.html">moeoStochTournamentSelect< MOEOT ></a></td><td class="indexvalue">Selection strategy that selects ONE individual by stochastic tournament </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoUnaryIndicatorBasedFitnessAssignment.html">moeoUnaryIndicatorBasedFitnessAssignment< MOEOT ></a></td><td class="indexvalue">MoeoIndicatorBasedFitnessAssignment for unary indicators </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoUnaryMetric.html">moeoUnaryMetric< A, R ></a></td><td class="indexvalue">Base class for unary metrics </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoVector.html">moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType ></a></td><td class="indexvalue">Base class for fixed length chromosomes, just derives from <a class="el" href="classMOEO.html">MOEO</a> and std::vector and redirects the smaller than operator to MOEO (objective vector based comparison) </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoVectorUnaryMetric.html">moeoVectorUnaryMetric< ObjectiveVector, R ></a></td><td class="indexvalue">Base class for unary metrics dedicated to the performance evaluation of a Pareto set (a vector of objective vectors) </td></tr>
|
||||
<tr><td class="indexkey"><a class="el" href="classmoeoVectorVsVectorBinaryMetric.html">moeoVectorVsVectorBinaryMetric< ObjectiveVector, R ></a></td><td class="indexvalue">Base class for binary metrics dedicated to the performance comparison between two Pareto sets (two vectors of objective vectors) </td></tr>
|
||||
</table>
|
||||
<hr size="1"><address style="align: right;"><small>Generated on Tue Jun 26 15:42:07 2007 for ParadisEO-MOEO by
|
||||
<hr size="1"><address style="align: right;"><small>Generated on Mon Jul 2 16:00:16 2007 for ParadisEO-MOEO by
|
||||
<a href="http://www.doxygen.org/index.html">
|
||||
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.7 </small></address>
|
||||
</body>
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue