nojhan/paradiseo
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

regenerated doc because of licence section

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@657 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
legrand 2007-10-08 08:55:53 +00:00
commit f5584011f5
359 changed files with 1769 additions and 1348 deletions
Download patch file Download diff file Expand all files Collapse all files

23
trunk/paradiseo-moeo/doc/html/annotated.html
View file

@ -1,6 +1,6 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>ParadisEO-MOEO: Class List</title>
<title>ParadisEO-MOEOMovingObjects: Class List</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
@ -28,7 +28,15 @@
<li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
<li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
</ul></div>
<h1>ParadisEO-MOEO Class List</h1>Here are the classes, structs, unions and interfaces with brief descriptions:<table>
<h1>ParadisEO-MOEOMovingObjects Class List</h1>Here are the classes, structs, unions and interfaces with brief descriptions:<table>
<tr><td class="indexkey"><a class="el" href="classFlowShop.html">FlowShop</a></td><td class="indexvalue">Structure of the genotype for the flow-shop scheduling problem: a vector of unsigned int int </td></tr>
<tr><td class="indexkey"><a class="el" href="classFlowShopBenchmarkParser.html">FlowShopBenchmarkParser</a></td><td class="indexvalue">Class to handle parameters of a flow-shop instance from a benchmark file </td></tr>
<tr><td class="indexkey"><a class="el" href="classFlowShopEval.html">FlowShopEval</a></td><td class="indexvalue">Evaluation of the objective vector a (multi-objective) <a class="el" href="classFlowShop.html">FlowShop</a> object </td></tr>
<tr><td class="indexkey"><a class="el" href="classFlowShopInit.html">FlowShopInit</a></td><td class="indexvalue">Initialization of a random genotype built by the default constructor of the <a class="el" href="classFlowShop.html">FlowShop</a> class </td></tr>
<tr><td class="indexkey"><a class="el" href="classFlowShopObjectiveVectorTraits.html">FlowShopObjectiveVectorTraits</a></td><td class="indexvalue">Definition of the objective vector traits for multi-objective flow-shop problems </td></tr>
<tr><td class="indexkey"><a class="el" href="classFlowShopOpCrossoverQuad.html">FlowShopOpCrossoverQuad</a></td><td class="indexvalue">Quadratic crossover operator for flow-shop (modify the both genotypes) </td></tr>
<tr><td class="indexkey"><a class="el" href="classFlowShopOpMutationExchange.html">FlowShopOpMutationExchange</a></td><td class="indexvalue">Exchange mutation operator for the flow-shop </td></tr>
<tr><td class="indexkey"><a class="el" href="classFlowShopOpMutationShift.html">FlowShopOpMutationShift</a></td><td class="indexvalue">Shift mutation operator for flow-shop </td></tr>
<tr><td class="indexkey"><a class="el" href="classMOEO.html">MOEO&lt; MOEOObjectiveVector, MOEOFitness, MOEODiversity &gt;</a></td><td class="indexvalue">Base class allowing to represent a solution (an individual) for multi-objective optimization </td></tr>
<tr><td class="indexkey"><a class="el" href="classmoeoAchievementFitnessAssignment.html">moeoAchievementFitnessAssignment&lt; MOEOT &gt;</a></td><td class="indexvalue">Fitness assignment sheme based on the achievement scalarizing function propozed by Wiersbicki (1980) </td></tr>
<tr><td class="indexkey"><a class="el" href="classmoeoAdditiveEpsilonBinaryMetric.html">moeoAdditiveEpsilonBinaryMetric&lt; ObjectiveVector &gt;</a></td><td class="indexvalue">Additive epsilon binary metric allowing to compare two objective vectors as proposed in Zitzler E., Thiele L., Laumanns M., Fonseca C </td></tr>
@ -78,10 +86,14 @@
<tr><td class="indexkey"><a class="el" href="classmoeoHybridLS.html">moeoHybridLS&lt; MOEOT &gt;</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&lt; ObjectiveVector &gt;</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&lt; MOEOT &gt;</a></td><td class="indexvalue">IBEA (Indicator-Based Evolutionary Algorithm) as described in: E </td></tr>
<tr><td class="indexkey"><a class="el" href="classmoeoIBMOLS.html">moeoIBMOLS&lt; MOEOT, Move &gt;</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="classmoeoIBMOLS_1_1OneObjectiveComparator.html">moeoIBMOLS&lt; MOEOT, Move &gt;::OneObjectiveComparator</a></td><td class="indexvalue"></td></tr>
<tr><td class="indexkey"><a class="el" href="classmoeoIndicatorBasedFitnessAssignment.html">moeoIndicatorBasedFitnessAssignment&lt; MOEOT &gt;</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&lt; MOEOT, Move &gt;</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&lt; MOEOT, Type &gt;</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&lt; MOEOT &gt;</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&lt; Move &gt;</a></td><td class="indexvalue"></td></tr>
<tr><td class="indexkey"><a class="el" href="classmoeoNormalizedDistance.html">moeoNormalizedDistance&lt; MOEOT, Type &gt;</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&lt; ObjectiveVector, R &gt;</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&lt; MOEOT &gt;</a></td><td class="indexvalue">NSGA (Non-dominated Sorting Genetic Algorithm) as described in: N </td></tr>
@ -96,6 +108,7 @@
<tr><td class="indexkey"><a class="el" href="classmoeoRandomSelect.html">moeoRandomSelect&lt; MOEOT &gt;</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&lt; ObjectiveVectorTraits &gt;</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&lt; MOEOObjectiveVector, MOEOFitness, MOEODiversity &gt;</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&lt; MOEOT &gt;</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&lt; MOEOT &gt;</a></td><td class="indexvalue">Replacement strategy for multi-objective optimization </td></tr>
<tr><td class="indexkey"><a class="el" href="classmoeoRouletteSelect.html">moeoRouletteSelect&lt; MOEOT &gt;</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&lt; MOEOT &gt;</a></td><td class="indexvalue">MoeoScalarFitnessAssignment is a <a class="el" href="classmoeoFitnessAssignment.html">moeoFitnessAssignment</a> for scalar strategies </td></tr>
@ -110,8 +123,12 @@
<tr><td class="indexkey"><a class="el" href="classmoeoVector.html">moeoVector&lt; MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType &gt;</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&lt; ObjectiveVector, R &gt;</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&lt; ObjectiveVector, R &gt;</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>
<tr><td class="indexkey"><a class="el" href="classpeoEA.html">peoEA&lt; EOT &gt;</a></td><td class="indexvalue">The <a class="el" href="classpeoEA.html">peoEA</a> class offers an elementary evolutionary algorithm implementation </td></tr>
<tr><td class="indexkey"><a class="el" href="classSch1.html">Sch1</a></td><td class="indexvalue"></td></tr>
<tr><td class="indexkey"><a class="el" href="classSch1Eval.html">Sch1Eval</a></td><td class="indexvalue"></td></tr>
<tr><td class="indexkey"><a class="el" href="classSch1ObjectiveVectorTraits.html">Sch1ObjectiveVectorTraits</a></td><td class="indexvalue"></td></tr>
</table>
<hr size="1"><address style="align: right;"><small>Generated on Fri Jul 6 09:41:04 2007 for ParadisEO-MOEO by&nbsp;
<hr size="1"><address style="align: right;"><small>Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by&nbsp;
<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>