00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // MOEO.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEO_H_ +00014 #define MOEO_H_ +00015 +00016 #include <iostream> +00017 #include <stdexcept> +00018 #include <string> +00019 #include <EO.h> +00020 +00033 template < class MOEOObjectiveVector, class MOEOFitness, class MOEODiversity > +00034 class MOEO : public EO < MOEOObjectiveVector > +00035 { +00036 public: +00037 +00039 typedef MOEOObjectiveVector ObjectiveVector; +00040 +00042 typedef MOEOFitness Fitness; +00043 +00045 typedef MOEODiversity Diversity; +00046 +00047 +00051 MOEO() +00052 { +00053 // default values for every parameters +00054 objectiveVectorValue = ObjectiveVector(); +00055 fitnessValue = Fitness(); +00056 diversityValue = Diversity(); +00057 // invalidate all +00058 invalidate(); +00059 } +00060 +00061 +00065 virtual ~MOEO() {}; +00066 +00067 +00071 ObjectiveVector objectiveVector() const +00072 { +00073 if ( invalidObjectiveVector() ) +00074 { +00075 throw std::runtime_error("invalid objective vector in MOEO"); +00076 } +00077 return objectiveVectorValue; +00078 } +00079 +00080 +00085 void objectiveVector(const ObjectiveVector & _objectiveVectorValue) +00086 { +00087 objectiveVectorValue = _objectiveVectorValue; +00088 invalidObjectiveVectorValue = false; +00089 } +00090 +00091 +00095 void invalidateObjectiveVector() +00096 { +00097 invalidObjectiveVectorValue = true; +00098 } +00099 +00100 +00104 bool invalidObjectiveVector() const +00105 { +00106 return invalidObjectiveVectorValue; +00107 } +00108 +00109 +00113 Fitness fitness() const +00114 { +00115 if ( invalidFitness() ) +00116 { +00117 throw std::runtime_error("invalid fitness in MOEO"); +00118 } +00119 return fitnessValue; +00120 } +00121 +00122 +00127 void fitness(const Fitness & _fitnessValue) +00128 { +00129 fitnessValue = _fitnessValue; +00130 invalidFitnessValue = false; +00131 } +00132 +00133 +00137 void invalidateFitness() +00138 { +00139 invalidFitnessValue = true; +00140 } +00141 +00142 +00146 bool invalidFitness() const +00147 { +00148 return invalidFitnessValue; +00149 } +00150 +00151 +00155 Diversity diversity() const +00156 { +00157 if ( invalidDiversity() ) +00158 { +00159 throw std::runtime_error("invalid diversity in MOEO"); +00160 } +00161 return diversityValue; +00162 } +00163 +00164 +00169 void diversity(const Diversity & _diversityValue) +00170 { +00171 diversityValue = _diversityValue; +00172 invalidDiversityValue = false; +00173 } +00174 +00175 +00179 void invalidateDiversity() +00180 { +00181 invalidDiversityValue = true; +00182 } +00183 +00184 +00188 bool invalidDiversity() const +00189 { +00190 return invalidDiversityValue; +00191 } +00192 +00193 +00197 void invalidate() +00198 { +00199 invalidateObjectiveVector(); +00200 invalidateFitness(); +00201 invalidateDiversity(); +00202 } +00203 +00204 +00208 bool invalid() const +00209 { +00210 return invalidObjectiveVector(); +00211 } +00212 +00213 +00220 bool operator<(const MOEO & _other) const +00221 { +00222 return objectiveVector() < _other.objectiveVector(); +00223 } +00224 +00225 +00229 virtual std::string className() const +00230 { +00231 return "MOEO"; +00232 } +00233 +00234 +00239 virtual void printOn(std::ostream & _os) const +00240 { +00241 if ( invalidObjectiveVector() ) +00242 { +00243 _os << "INVALID\t"; +00244 } +00245 else +00246 { +00247 _os << objectiveVectorValue << '\t'; +00248 } +00249 } +00250 +00251 +00256 virtual void readFrom(std::istream & _is) +00257 { +00258 std::string objectiveVector_str; +00259 int pos = _is.tellg(); +00260 _is >> objectiveVector_str; +00261 if (objectiveVector_str == "INVALID") +00262 { +00263 invalidateObjectiveVector(); +00264 } +00265 else +00266 { +00267 invalidObjectiveVectorValue = false; +00268 _is.seekg(pos); // rewind +00269 _is >> objectiveVectorValue; +00270 } +00271 } +00272 +00273 +00274 private: +00275 +00277 ObjectiveVector objectiveVectorValue; +00279 bool invalidObjectiveVectorValue; +00281 Fitness fitnessValue; +00283 bool invalidFitnessValue; +00285 Diversity diversityValue; +00287 bool invalidDiversityValue; +00288 +00289 }; +00290 +00291 #endif /*MOEO_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/annotated.html b/trunk/paradiseo-moeo/doc/html/annotated.html
new file mode 100644
index 000000000..73b99087e
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/annotated.html
@@ -0,0 +1,118 @@
+
+
+| MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | Base class allowing to represent a solution (an individual) for multi-objective optimization |
| moeoAchievementFitnessAssignment< MOEOT > | Fitness assignment sheme based on the achievement scalarizing function propozed by Wiersbicki (1980) |
| moeoAdditiveEpsilonBinaryMetric< ObjectiveVector > | Additive epsilon binary metric allowing to compare two objective vectors as proposed in Zitzler E., Thiele L., Laumanns M., Fonseca C |
| moeoAggregativeComparator< MOEOT > | Functor allowing to compare two solutions according to their fitness and diversity values, each according to its aggregative value |
| moeoAlgo | Abstract class for multi-objective algorithms |
| moeoArchive< MOEOT > | An archive is a secondary population that stores non-dominated solutions |
| moeoArchiveObjectiveVectorSavingUpdater< MOEOT > | This class allows to save the objective vectors of the solutions contained in an archive into a file at each generation |
| moeoArchiveUpdater< MOEOT > | This class allows to update the archive at each generation with newly found non-dominated solutions |
| moeoBinaryIndicatorBasedFitnessAssignment< MOEOT > | MoeoIndicatorBasedFitnessAssignment for binary indicators |
| moeoBinaryMetric< A1, A2, R > | Base class for binary metrics |
| moeoBinaryMetricSavingUpdater< MOEOT > | 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 |
| moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | This class is an implementationeo of a simple bit-valued moeoVector |
| moeoCombinedLS< MOEOT, Type > | This class allows to embed a set of local searches that are sequentially applied, and so working and updating the same archive of non-dominated solutions |
| moeoComparator< MOEOT > | Functor allowing to compare two solutions |
| moeoContributionMetric< ObjectiveVector > | 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 |
| moeoConvertPopToObjectiveVectors< MOEOT, ObjectiveVector > | Functor allowing to get a vector of objective vectors from a population |
| moeoCriterionBasedFitnessAssignment< MOEOT > | MoeoCriterionBasedFitnessAssignment is a moeoFitnessAssignment for criterion-based strategies |
| moeoCrowdingDiversityAssignment< MOEOT > | Diversity assignment sheme based on crowding proposed in: K |
| moeoDetTournamentSelect< MOEOT > | Selection strategy that selects ONE individual by deterministic tournament |
| moeoDistance< MOEOT, Type > | The base class for distance computation |
| moeoDistanceMatrix< MOEOT, Type > | A matrix to compute distances between every pair of individuals contained in a population |
| moeoDiversityAssignment< MOEOT > | Functor that sets the diversity values of a whole population |
| moeoDiversityThenFitnessComparator< MOEOT > | Functor allowing to compare two solutions according to their diversity values, then according to their fitness values |
| moeoDummyDiversityAssignment< MOEOT > | MoeoDummyDiversityAssignment is a moeoDiversityAssignment that gives the value '0' as the individual's diversity for a whole population if it is invalid |
| moeoDummyFitnessAssignment< MOEOT > | MoeoDummyFitnessAssignment is a moeoFitnessAssignment that gives the value '0' as the individual's fitness for a whole population if it is invalid |
| moeoEA< MOEOT > | Abstract class for multi-objective evolutionary algorithms |
| moeoEasyEA< MOEOT > | An easy class to design multi-objective evolutionary algorithms |
| moeoEasyEA< MOEOT >::eoDummyEval | Dummy eval |
| moeoEasyEA< MOEOT >::eoDummySelect | Dummy select |
| moeoEasyEA< MOEOT >::eoDummyTransform | Dummy transform |
| moeoElitistReplacement< MOEOT > | Elitist replacement strategy that consists in keeping the N best individuals |
| moeoElitistReplacement< MOEOT >::Cmp | This object is used to compare solutions in order to sort the population |
| moeoEntropyMetric< ObjectiveVector > | The entropy gives an idea of the diversity of a Pareto set relatively to another (Basseur, Seynhaeve, Talbi: 'Design of Multi-objective Evolutionary Algorithms: Application to the Flow-shop Scheduling Problem', in Proc |
| moeoEnvironmentalReplacement< MOEOT > | Environmental replacement strategy that consists in keeping the N best individuals by deleting individuals 1 by 1 and by updating the fitness and diversity values after each deletion |
| moeoEnvironmentalReplacement< MOEOT >::Cmp | This object is used to compare solutions in order to sort the population |
| moeoEuclideanDistance< MOEOT > | A class allowing to compute an euclidian distance between two solutions in the objective space with normalized objective values (i.e |
| moeoEvalFunc< MOEOT > | |
| moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT > | Fitness assignment sheme based on an indicator proposed in: E |
| moeoFastNonDominatedSortingFitnessAssignment< MOEOT > | Fitness assignment sheme based on Pareto-dominance count proposed in: N |
| moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator | Functor allowing to compare two solutions according to their first objective value, then their second, and so on |
| moeoFitnessAssignment< MOEOT > | Functor that sets the fitness values of a whole population |
| moeoFitnessThenDiversityComparator< MOEOT > | Functor allowing to compare two solutions according to their fitness values, then according to their diversity values |
| moeoFrontByFrontCrowdingDiversityAssignment< MOEOT > | Diversity assignment sheme based on crowding proposed in: K |
| moeoFrontByFrontSharingDiversityAssignment< MOEOT > | Sharing assignment scheme on the way it is used in NSGA |
| moeoGDominanceObjectiveVectorComparator< ObjectiveVector > | This functor class allows to compare 2 objective vectors according to g-dominance |
| moeoGenerationalReplacement< MOEOT > | Generational replacement: only the new individuals are preserved |
| moeoHybridLS< MOEOT > | 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 |
| moeoHypervolumeBinaryMetric< ObjectiveVector > | Hypervolume binary metric allowing to compare two objective vectors as proposed in Zitzler E., Künzli S |
| moeoIBEA< MOEOT > | IBEA (Indicator-Based Evolutionary Algorithm) as described in: E |
| moeoIndicatorBasedFitnessAssignment< MOEOT > | MoeoIndicatorBasedFitnessAssignment is a moeoFitnessAssignment for Indicator-based strategies |
| moeoLS< MOEOT, Type > | Abstract class for local searches applied to multi-objective optimization |
| moeoManhattanDistance< MOEOT > | A class allowing to compute the Manhattan distance between two solutions in the objective space normalized objective values (i.e |
| moeoMetric | Base class for performance metrics (also known as quality indicators) |
| moeoNormalizedDistance< MOEOT, Type > | The base class for double distance computation with normalized objective values (i.e |
| moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R > | Base class for binary metrics dedicated to the performance comparison between two solutions's objective vectors using normalized values |
| moeoNSGA< MOEOT > | NSGA (Non-dominated Sorting Genetic Algorithm) as described in: N |
| moeoNSGAII< MOEOT > | NSGA-II (Non-dominated Sorting Genetic Algorithm II) as described in: Deb, K., S |
| moeoObjectiveObjectiveVectorComparator< ObjectiveVector > | Functor allowing to compare two objective vectors according to their first objective value, then their second, and so on |
| moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType > | Abstract class allowing to represent a solution in the objective space (phenotypic representation) |
| moeoObjectiveVectorComparator< ObjectiveVector > | Abstract class allowing to compare 2 objective vectors |
| moeoObjectiveVectorTraits | A traits class for moeoObjectiveVector to specify the number of objectives and which ones have to be minimized or maximized |
| moeoOneObjectiveComparator< MOEOT > | Functor allowing to compare two solutions according to one objective |
| moeoParetoBasedFitnessAssignment< MOEOT > | MoeoParetoBasedFitnessAssignment is a moeoFitnessAssignment for Pareto-based strategies |
| moeoParetoObjectiveVectorComparator< ObjectiveVector > | This functor class allows to compare 2 objective vectors according to Pareto dominance |
| moeoRandomSelect< MOEOT > | Selection strategy that selects only one element randomly from a whole population |
| moeoRealObjectiveVector< ObjectiveVectorTraits > | This class allows to represent a solution in the objective space (phenotypic representation) by a std::vector of real values, i.e |
| moeoRealVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | This class is an implementation of a simple double-valued moeoVector |
| moeoReplacement< MOEOT > | Replacement strategy for multi-objective optimization |
| moeoRouletteSelect< MOEOT > | Selection strategy that selects ONE individual by using roulette wheel process |
| moeoScalarFitnessAssignment< MOEOT > | MoeoScalarFitnessAssignment is a moeoFitnessAssignment for scalar strategies |
| moeoSelectFromPopAndArch< MOEOT > | Elitist selection process that consists in choosing individuals in the archive as well as in the current population |
| moeoSelectOne< MOEOT > | Selection strategy for multi-objective optimization that selects only one element from a whole population |
| moeoSharingDiversityAssignment< MOEOT > | Sharing assignment scheme originally porposed by: D |
| moeoSolutionUnaryMetric< ObjectiveVector, R > | Base class for unary metrics dedicated to the performance evaluation of a single solution's objective vector |
| moeoSolutionVsSolutionBinaryMetric< ObjectiveVector, R > | Base class for binary metrics dedicated to the performance comparison between two solutions's objective vectors |
| moeoStochTournamentSelect< MOEOT > | Selection strategy that selects ONE individual by stochastic tournament |
| moeoUnaryIndicatorBasedFitnessAssignment< MOEOT > | MoeoIndicatorBasedFitnessAssignment for unary indicators |
| moeoUnaryMetric< A, R > | Base class for unary metrics |
| moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType > | Base class for fixed length chromosomes, just derives from MOEO and std::vector and redirects the smaller than operator to MOEO (objective vector based comparison) |
| moeoVectorUnaryMetric< ObjectiveVector, R > | Base class for unary metrics dedicated to the performance evaluation of a Pareto set (a vector of objective vectors) |
| moeoVectorVsVectorBinaryMetric< ObjectiveVector, R > | Base class for binary metrics dedicated to the performance comparison between two Pareto sets (two vectors of objective vectors) |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classMOEO-members.html b/trunk/paradiseo-moeo/doc/html/classMOEO-members.html
new file mode 100644
index 000000000..280cb7bc1
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classMOEO-members.html
@@ -0,0 +1,86 @@
+
+
+ 1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classMOEO.html b/trunk/paradiseo-moeo/doc/html/classMOEO.html
new file mode 100644
index 000000000..6ea3ef3ca
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classMOEO.html
@@ -0,0 +1,388 @@
+
+
+
+#include <MOEO.h>
+
+
Inheritance diagram for MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >: +
Public Types | |
| +typedef MOEOObjectiveVector | ObjectiveVector |
| the objective vector type of a solution | |
| +typedef MOEOFitness | Fitness |
| the fitness type of a solution | |
| +typedef MOEODiversity | Diversity |
| the diversity type of a solution | |
Public Member Functions | |
| + | MOEO () |
| Ctor. | |
| +virtual | ~MOEO () |
| Virtual dtor. | |
| +ObjectiveVector | objectiveVector () const |
| Returns the objective vector of the current solution. | |
| void | objectiveVector (const ObjectiveVector &_objectiveVectorValue) |
| Sets the objective vector of the current solution. | |
| +void | invalidateObjectiveVector () |
| Sets the objective vector as invalid. | |
| +bool | invalidObjectiveVector () const |
| Returns true if the objective vector is invalid, false otherwise. | |
| +Fitness | fitness () const |
| Returns the fitness value of the current solution. | |
| void | fitness (const Fitness &_fitnessValue) |
| Sets the fitness value of the current solution. | |
| +void | invalidateFitness () |
| Sets the fitness value as invalid. | |
| +bool | invalidFitness () const |
| Returns true if the fitness value is invalid, false otherwise. | |
| +Diversity | diversity () const |
| Returns the diversity value of the current solution. | |
| void | diversity (const Diversity &_diversityValue) |
| Sets the diversity value of the current solution. | |
| +void | invalidateDiversity () |
| Sets the diversity value as invalid. | |
| +bool | invalidDiversity () const |
| Returns true if the diversity value is invalid, false otherwise. | |
| +void | invalidate () |
| Sets the objective vector, the fitness value and the diversity value as invalid. | |
| +bool | invalid () const |
| Returns true if the fitness value is invalid, false otherwise. | |
| bool | operator< (const MOEO &_other) const |
| Returns true if the objective vector of the current solution is smaller than the objective vector of _other on the first objective, then on the second, and so on (can be usefull for sorting/printing). | |
| +virtual std::string | className () const |
| Return the class id (the class name as a std::string). | |
| virtual void | printOn (std::ostream &_os) const |
| Writing object. | |
| virtual void | readFrom (std::istream &_is) |
| Reading object. | |
Private Attributes | |
| +ObjectiveVector | objectiveVectorValue |
| the objective vector of this solution | |
| +bool | invalidObjectiveVectorValue |
| true if the objective vector is invalid | |
| +Fitness | fitnessValue |
| the fitness value of this solution | |
| +bool | invalidFitnessValue |
| true if the fitness value is invalid | |
| +Diversity | diversityValue |
| the diversity value of this solution | |
| +bool | invalidDiversityValue |
| true if the diversity value is invalid | |
+The template argument MOEOObjectiveVector allows to represent the solution in the objective space (it can be a moeoObjectiveVector object). The template argument MOEOFitness is an object reflecting the quality of the solution in term of convergence (the fitness of a solution is always to be maximized). The template argument MOEODiversity is an object reflecting the quality of the solution in term of diversity (the diversity of a solution is always to be maximized). All template arguments must have a void and a copy constructor. Using some specific representations, you will have to define a copy constructor if the default one is not what you want. In the same cases, you will also have to define the affectation operator (operator=). Then, you will explicitly have to call the parent copy constructor and the parent affectation operator at the beginning of the corresponding implementation. Besides, note that, contrary to the mono-objective case (and to EO) where the fitness value of a solution is confused with its objective value, the fitness value differs of the objectives values in the multi-objective case. +
+ +
+Definition at line 34 of file MOEO.h.
| void MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::objectiveVector | +( | +const ObjectiveVector & | +_objectiveVectorValue | +) | + [inline] |
+
+Sets the objective vector of the current solution. +
+
| _objectiveVectorValue | the new objective vector |
+Definition at line 85 of file MOEO.h. +
+References MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::invalidObjectiveVectorValue, and MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::objectiveVectorValue. +
| void MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::fitness | +( | +const Fitness & | +_fitnessValue | +) | + [inline] |
+
+Sets the fitness value of the current solution. +
+
| _fitnessValue | the new fitness value |
+Definition at line 127 of file MOEO.h. +
+References MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::fitnessValue, and MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::invalidFitnessValue. +
| void MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::diversity | +( | +const Diversity & | +_diversityValue | +) | + [inline] |
+
+Sets the diversity value of the current solution. +
+
| _diversityValue | the new diversity value |
+Definition at line 169 of file MOEO.h. +
+References MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::diversityValue, and MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::invalidDiversityValue. +
| bool MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::operator< | +( | +const MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > & | +_other | +) | + const [inline] |
+
+Returns true if the objective vector of the current solution is smaller than the objective vector of _other on the first objective, then on the second, and so on (can be usefull for sorting/printing). +
+You should implement another function in the sub-class of MOEO to have another sorting mecanism.
| _other | the other MOEO object to compare with |
+Definition at line 220 of file MOEO.h. +
+References MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::objectiveVector(). +
| virtual void MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::printOn | +( | +std::ostream & | +_os | +) | + const [inline, virtual] |
+
+Writing object. +
+
| _os | output stream |
+Reimplemented from EO< MOEOObjectiveVector >. +
+Reimplemented in moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >, moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >, moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool >, and moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, double >. +
+Definition at line 239 of file MOEO.h. +
+References MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::invalidObjectiveVector(), and MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::objectiveVectorValue. +
| virtual void MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::readFrom | +( | +std::istream & | +_is | +) | + [inline, virtual] |
+
+Reading object. +
+
| _is | input stream |
+Reimplemented from EO< MOEOObjectiveVector >. +
+Reimplemented in moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >, moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >, moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool >, and moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, double >. +
+Definition at line 256 of file MOEO.h. +
+References MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::invalidateObjectiveVector(), MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::invalidObjectiveVectorValue, and MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::objectiveVectorValue. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classes.html b/trunk/paradiseo-moeo/doc/html/classes.html
new file mode 100644
index 000000000..4808f75de
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classes.html
@@ -0,0 +1,56 @@
+
+
++
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoAchievementFitnessAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoAchievementFitnessAssignment-members.html
new file mode 100644
index 000000000..53c7bc27f
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoAchievementFitnessAssignment-members.html
@@ -0,0 +1,51 @@
+
+
+| compute(MOEOT &_moeo) | moeoAchievementFitnessAssignment< MOEOT > | [inline, private] |
| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| inf() const | moeoAchievementFitnessAssignment< MOEOT > | [inline, private] |
| lambdas | moeoAchievementFitnessAssignment< MOEOT > | [private] |
| moeoAchievementFitnessAssignment(ObjectiveVector &_reference, std::vector< double > &_lambdas, double _spn=0.0001) | moeoAchievementFitnessAssignment< MOEOT > | [inline] |
| moeoAchievementFitnessAssignment(ObjectiveVector &_reference, double _spn=0.0001) | moeoAchievementFitnessAssignment< MOEOT > | [inline] |
| ObjectiveVector typedef | moeoAchievementFitnessAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &_pop) | moeoAchievementFitnessAssignment< MOEOT > | [inline, virtual] |
| reference | moeoAchievementFitnessAssignment< MOEOT > | [private] |
| setReference(const ObjectiveVector &_reference) | moeoAchievementFitnessAssignment< MOEOT > | [inline] |
| spn | moeoAchievementFitnessAssignment< MOEOT > | [private] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) | moeoAchievementFitnessAssignment< MOEOT > | [inline, virtual] |
| moeoScalarFitnessAssignment::updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoFitnessAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoAchievementFitnessAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoAchievementFitnessAssignment.html
new file mode 100644
index 000000000..55b5e7f03
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoAchievementFitnessAssignment.html
@@ -0,0 +1,344 @@
+
+
+
+#include <moeoAchievementFitnessAssignment.h>
+
+
Inheritance diagram for moeoAchievementFitnessAssignment< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| the objective vector type of the solutions | |
Public Member Functions | |
| moeoAchievementFitnessAssignment (ObjectiveVector &_reference, std::vector< double > &_lambdas, double _spn=0.0001) | |
| Default ctor. | |
| moeoAchievementFitnessAssignment (ObjectiveVector &_reference, double _spn=0.0001) | |
| Ctor with default values for lambdas (1/nObjectives). | |
| virtual void | operator() (eoPop< MOEOT > &_pop) |
| Sets the fitness values for every solution contained in the population _pop. | |
| void | updateByDeleting (eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) |
| Updates the fitness values of the whole population _pop by taking the deletion of the objective vector _objVec into account (nothing to do). | |
| void | setReference (const ObjectiveVector &_reference) |
| Sets the reference point. | |
Private Member Functions | |
| +double | inf () const |
| Returns a big value (regarded as infinite). | |
| void | compute (MOEOT &_moeo) |
| Computes the fitness value for a solution. | |
Private Attributes | |
| +ObjectiveVector | reference |
| the reference point | |
| +std::vector< double > | lambdas |
| the weighted coefficients vector | |
| +double | spn |
| an arbitrary small positive number (0 < _spn << 1) | |
+ +
+Definition at line 24 of file moeoAchievementFitnessAssignment.h.
| moeoAchievementFitnessAssignment< MOEOT >::moeoAchievementFitnessAssignment | +( | +ObjectiveVector & | +_reference, | +|
| + | + | std::vector< double > & | +_lambdas, | +|
| + | + | double | + _spn = 0.0001 | + |
| + | ) | + [inline] |
+
+Default ctor. +
+
| _reference | reference point vector | |
| _lambdas | weighted coefficients vector | |
| _spn | arbitrary small positive number (0 < _spn << 1) |
+Definition at line 38 of file moeoAchievementFitnessAssignment.h. +
+References moeoAchievementFitnessAssignment< MOEOT >::spn. +
| moeoAchievementFitnessAssignment< MOEOT >::moeoAchievementFitnessAssignment | +( | +ObjectiveVector & | +_reference, | +|
| + | + | double | + _spn = 0.0001 | + |
| + | ) | + [inline] |
+
+Ctor with default values for lambdas (1/nObjectives). +
+
| _reference | reference point vector | |
| _spn | arbitrary small positive number (0 < _spn << 1) |
+Definition at line 54 of file moeoAchievementFitnessAssignment.h. +
+References moeoAchievementFitnessAssignment< MOEOT >::lambdas, and moeoAchievementFitnessAssignment< MOEOT >::spn. +
+
| virtual void moeoAchievementFitnessAssignment< MOEOT >::operator() | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, virtual] |
+
+Sets the fitness values for every solution contained in the population _pop. +
+
| _pop | the population |
+Implements eoUF< eoPop< MOEOT > &, void >. +
+Definition at line 75 of file moeoAchievementFitnessAssignment.h. +
+References moeoAchievementFitnessAssignment< MOEOT >::compute(). +
| void moeoAchievementFitnessAssignment< MOEOT >::updateByDeleting | +( | +eoPop< MOEOT > & | +_pop, | +|
| + | + | ObjectiveVector & | +_objVec | + |
| + | ) | + [inline, virtual] |
+
+Updates the fitness values of the whole population _pop by taking the deletion of the objective vector _objVec into account (nothing to do). +
+
| _pop | the population | |
| _objVec | the objective vector |
+Implements moeoFitnessAssignment< MOEOT >. +
+Definition at line 89 of file moeoAchievementFitnessAssignment.h. +
| void moeoAchievementFitnessAssignment< MOEOT >::setReference | +( | +const ObjectiveVector & | +_reference | +) | + [inline] |
+
+Sets the reference point. +
+
| _reference | the new reference point |
+Definition at line 99 of file moeoAchievementFitnessAssignment.h. +
+References moeoAchievementFitnessAssignment< MOEOT >::reference. +
| void moeoAchievementFitnessAssignment< MOEOT >::compute | +( | +MOEOT & | +_moeo | +) | + [inline, private] |
+
+Computes the fitness value for a solution. +
+
| _moeo | the solution |
+Definition at line 128 of file moeoAchievementFitnessAssignment.h. +
+References moeoAchievementFitnessAssignment< MOEOT >::inf(), moeoAchievementFitnessAssignment< MOEOT >::lambdas, moeoAchievementFitnessAssignment< MOEOT >::reference, and moeoAchievementFitnessAssignment< MOEOT >::spn. +
+Referenced by moeoAchievementFitnessAssignment< MOEOT >::operator()(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoAdditiveEpsilonBinaryMetric-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoAdditiveEpsilonBinaryMetric-members.html
new file mode 100644
index 000000000..6fc2bb828
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoAdditiveEpsilonBinaryMetric-members.html
@@ -0,0 +1,47 @@
+
+
+| bounds | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > | [protected] |
| epsilon(const ObjectiveVector &_o1, const ObjectiveVector &_o2, const unsigned int _obj) | moeoAdditiveEpsilonBinaryMetric< ObjectiveVector > | [inline, private] |
| functor_category() | eoBF< A1, A2, R > | [static] |
| moeoNormalizedSolutionVsSolutionBinaryMetric() | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > | [inline] |
| operator()(const ObjectiveVector &_o1, const ObjectiveVector &_o2) | moeoAdditiveEpsilonBinaryMetric< ObjectiveVector > | [inline] |
| moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double >::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| setup(double _min, double _max, unsigned int _obj) | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > | [inline] |
| setup(eoRealInterval _realInterval, unsigned int _obj) | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > | [inline, virtual] |
| tiny() | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > | [inline, static] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoAdditiveEpsilonBinaryMetric.html b/trunk/paradiseo-moeo/doc/html/classmoeoAdditiveEpsilonBinaryMetric.html
new file mode 100644
index 000000000..d34a8f5e9
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoAdditiveEpsilonBinaryMetric.html
@@ -0,0 +1,171 @@
+
+
+
+#include <moeoAdditiveEpsilonBinaryMetric.h>
+
+
Inheritance diagram for moeoAdditiveEpsilonBinaryMetric< ObjectiveVector >: +
Public Member Functions | |
| double | operator() (const ObjectiveVector &_o1, const ObjectiveVector &_o2) |
| Returns the minimal distance by which the objective vector _o1 must be translated in all objectives so that it weakly dominates the objective vector _o2. | |
Private Member Functions | |
| double | epsilon (const ObjectiveVector &_o1, const ObjectiveVector &_o2, const unsigned int _obj) |
| Returns the epsilon value by which the objective vector _o1 must be translated in the objective _obj so that it dominates the objective vector _o2. | |
+M., Grunert da Fonseca V.: Performance Assessment of Multiobjective Optimizers: An Analysis and Review. IEEE Transactions on Evolutionary Computation 7(2), pp.117–132 (2003). +
+ +
+Definition at line 24 of file moeoAdditiveEpsilonBinaryMetric.h.
| double moeoAdditiveEpsilonBinaryMetric< ObjectiveVector >::operator() | +( | +const ObjectiveVector & | +_o1, | +|
| + | + | const ObjectiveVector & | +_o2 | + |
| + | ) | + [inline] |
+
+Returns the minimal distance by which the objective vector _o1 must be translated in all objectives so that it weakly dominates the objective vector _o2. +
+
| _o1 | the first objective vector | |
| _o2 | the second objective vector |
+Definition at line 35 of file moeoAdditiveEpsilonBinaryMetric.h. +
+References moeoAdditiveEpsilonBinaryMetric< ObjectiveVector >::epsilon(). +
| double moeoAdditiveEpsilonBinaryMetric< ObjectiveVector >::epsilon | +( | +const ObjectiveVector & | +_o1, | +|
| + | + | const ObjectiveVector & | +_o2, | +|
| + | + | const unsigned int | +_obj | + |
| + | ) | + [inline, private] |
+
+Returns the epsilon value by which the objective vector _o1 must be translated in the objective _obj so that it dominates the objective vector _o2. +
+
| _o1 | the first objective vector | |
| _o2 | the second objective vector | |
| _obj | the index of the objective |
+Definition at line 64 of file moeoAdditiveEpsilonBinaryMetric.h. +
+References moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double >::bounds. +
+Referenced by moeoAdditiveEpsilonBinaryMetric< ObjectiveVector >::operator()(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoAggregativeComparator-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoAggregativeComparator-members.html
new file mode 100644
index 000000000..89040b5cd
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoAggregativeComparator-members.html
@@ -0,0 +1,44 @@
+
+
+| functor_category() | eoBF< A1, A2, R > | [static] |
| moeoAggregativeComparator(double _weightFitness=1.0, double _weightDiversity=1.0) | moeoAggregativeComparator< MOEOT > | [inline] |
| operator()(const MOEOT &_moeo1, const MOEOT &_moeo2) | moeoAggregativeComparator< MOEOT > | [inline] |
| moeoComparator::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| weightDiversity | moeoAggregativeComparator< MOEOT > | [private] |
| weightFitness | moeoAggregativeComparator< MOEOT > | [private] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoAggregativeComparator.html b/trunk/paradiseo-moeo/doc/html/classmoeoAggregativeComparator.html
new file mode 100644
index 000000000..5302340ad
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoAggregativeComparator.html
@@ -0,0 +1,162 @@
+
+
+
+#include <moeoAggregativeComparator.h>
+
+
Inheritance diagram for moeoAggregativeComparator< MOEOT >: +
Public Member Functions | |
| moeoAggregativeComparator (double _weightFitness=1.0, double _weightDiversity=1.0) | |
| Ctor. | |
| const bool | operator() (const MOEOT &_moeo1, const MOEOT &_moeo2) |
| Returns true if _moeo1 < _moeo2 according to the aggregation of their fitness and diversity values. | |
Private Attributes | |
| +double | weightFitness |
| the weight for fitness | |
| +double | weightDiversity |
| the weight for diversity | |
+ +
+Definition at line 22 of file moeoAggregativeComparator.h.
| moeoAggregativeComparator< MOEOT >::moeoAggregativeComparator | +( | +double | + _weightFitness = 1.0, |
+ |
| + | + | double | + _weightDiversity = 1.0 | + |
| + | ) | + [inline] |
+
+Ctor. +
+
| _weightFitness | the weight for fitness | |
| _weightDiversity | the weight for diversity |
+Definition at line 31 of file moeoAggregativeComparator.h. +
+
| const bool moeoAggregativeComparator< MOEOT >::operator() | +( | +const MOEOT & | +_moeo1, | +|
| + | + | const MOEOT & | +_moeo2 | + |
| + | ) | + [inline] |
+
+Returns true if _moeo1 < _moeo2 according to the aggregation of their fitness and diversity values. +
+
| _moeo1 | the first solution | |
| _moeo2 | the second solution |
+Definition at line 40 of file moeoAggregativeComparator.h. +
+References moeoAggregativeComparator< MOEOT >::weightDiversity, and moeoAggregativeComparator< MOEOT >::weightFitness. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoAlgo.html b/trunk/paradiseo-moeo/doc/html/classmoeoAlgo.html
new file mode 100644
index 000000000..80fae86d1
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoAlgo.html
@@ -0,0 +1,61 @@
+
+
+
+#include <moeoAlgo.h>
+
+
Inheritance diagram for moeoAlgo: +
+ +
+Definition at line 19 of file moeoAlgo.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoAlgo.png b/trunk/paradiseo-moeo/doc/html/classmoeoAlgo.png
new file mode 100644
index 000000000..464a61acd
Binary files /dev/null and b/trunk/paradiseo-moeo/doc/html/classmoeoAlgo.png differ
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoArchive-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoArchive-members.html
new file mode 100644
index 000000000..4cdbe9541
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoArchive-members.html
@@ -0,0 +1,80 @@
+
+
+| append(unsigned _newPopSize, eoInit< MOEOT > &_chromInit) | eoPop< MOEOT > | |
| best_element() const | eoPop< MOEOT > | |
| className() const | eoPop< MOEOT > | [virtual] |
| comparator | moeoArchive< MOEOT > | [private] |
| contains(const ObjectiveVector &_objectiveVector) const | moeoArchive< MOEOT > | [inline] |
| dominates(const ObjectiveVector &_objectiveVector) const | moeoArchive< MOEOT > | [inline] |
| eoPop() | eoPop< MOEOT > | |
| eoPop(unsigned _popSize, eoInit< MOEOT > &_chromInit) | eoPop< MOEOT > | |
| eoPop(std::istream &_is) | eoPop< MOEOT > | |
| eoPop(void) | eoPop< MOEOT > | |
| equals(const moeoArchive< MOEOT > &_arch) | moeoArchive< MOEOT > | [inline] |
| Fitness typedef | eoPop< MOEOT > | |
| fitness_traits typedef | eoPop< MOEOT > | |
| getPerf2Worth() | eoPop< MOEOT > | |
| invalidate() | eoPop< MOEOT > | [virtual] |
| it_best_element() | eoPop< MOEOT > | |
| it_worse_element() | eoPop< MOEOT > | |
| moeoArchive() | moeoArchive< MOEOT > | [inline] |
| moeoArchive(moeoObjectiveVectorComparator< ObjectiveVector > &_comparator) | moeoArchive< MOEOT > | [inline] |
| nth_element(int nth) | eoPop< MOEOT > | |
| nth_element(int which, std::vector< const MOEOT * > &result) const | eoPop< MOEOT > | |
| nth_element_fitness(int which) const | eoPop< MOEOT > | |
| ObjectiveVector typedef | moeoArchive< MOEOT > | |
| paretoComparator | moeoArchive< MOEOT > | [private] |
| printOn(std::ostream &_os) const | eoPop< MOEOT > | [virtual] |
| readFrom(std::istream &_is) | eoPop< MOEOT > | [virtual] |
| scale() | eoPop< MOEOT > | |
| setPerf2Worth(eoPerf2Worth< MOEOT > &_p2w) | eoPop< MOEOT > | |
| setPerf2Worth(eoPerf2Worth< MOEOT > *_p2w) | eoPop< MOEOT > | |
| shuffle(void) | eoPop< MOEOT > | |
| shuffle(std::vector< const MOEOT * > &result) const | eoPop< MOEOT > | |
| sort(void) | eoPop< MOEOT > | |
| sort(std::vector< const MOEOT * > &result) const | eoPop< MOEOT > | |
| sort() | eoPop< MOEOT > | |
| sortedPrintOn(std::ostream &_os) const | eoPop< MOEOT > | [virtual] |
| swap(eoPop< MOEOT > &other) | eoPop< MOEOT > | |
| swap(eoPop< MOEOT > &other) | eoPop< MOEOT > | |
| update(const MOEOT &_moeo) | moeoArchive< MOEOT > | [inline] |
| update(const eoPop< MOEOT > &_pop) | moeoArchive< MOEOT > | [inline] |
| worse_element() const | eoPop< MOEOT > | |
| ~eoObject() | eoObject | [virtual] |
| ~eoPersistent() | eoPersistent | [virtual] |
| ~eoPop() | eoPop< MOEOT > | [virtual] |
| ~eoPrintable() | eoPrintable | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoArchive.html b/trunk/paradiseo-moeo/doc/html/classmoeoArchive.html
new file mode 100644
index 000000000..2f8f566bc
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoArchive.html
@@ -0,0 +1,324 @@
+
+
+
+#include <moeoArchive.h>
+
+
Inheritance diagram for moeoArchive< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| The type of an objective vector for a solution. | |
Public Member Functions | |
| moeoArchive () | |
| Default ctor. | |
| moeoArchive (moeoObjectiveVectorComparator< ObjectiveVector > &_comparator) | |
| Ctor. | |
| bool | dominates (const ObjectiveVector &_objectiveVector) const |
| Returns true if the current archive dominates _objectiveVector according to the moeoObjectiveVectorComparator given in the constructor. | |
| bool | contains (const ObjectiveVector &_objectiveVector) const |
| Returns true if the current archive already contains a solution with the same objective values than _objectiveVector. | |
| void | update (const MOEOT &_moeo) |
| Updates the archive with a given individual _moeo. | |
| void | update (const eoPop< MOEOT > &_pop) |
| Updates the archive with a given population _pop. | |
| bool | equals (const moeoArchive< MOEOT > &_arch) |
| Returns true if the current archive contains the same objective vectors than the given archive _arch. | |
Private Attributes | |
|
+moeoObjectiveVectorComparator< + ObjectiveVector > & | comparator |
| The moeoObjectiveVectorComparator used to compare solutions. | |
|
+moeoParetoObjectiveVectorComparator< + ObjectiveVector > | paretoComparator |
| A moeoObjectiveVectorComparator based on Pareto dominance (used as default). | |
+ +
+Definition at line 24 of file moeoArchive.h.
| moeoArchive< MOEOT >::moeoArchive | +( | ++ | ) | + [inline] |
+
+Default ctor. +
+The moeoObjectiveVectorComparator used to compare solutions is based on Pareto dominance +
+Definition at line 44 of file moeoArchive.h. +
| moeoArchive< MOEOT >::moeoArchive | +( | +moeoObjectiveVectorComparator< ObjectiveVector > & | +_comparator | +) | + [inline] |
+
+Ctor. +
+
| _comparator | the moeoObjectiveVectorComparator used to compare solutions |
+Definition at line 52 of file moeoArchive.h. +
+
| bool moeoArchive< MOEOT >::dominates | +( | +const ObjectiveVector & | +_objectiveVector | +) | + const [inline] |
+
+Returns true if the current archive dominates _objectiveVector according to the moeoObjectiveVectorComparator given in the constructor. +
+
| _objectiveVector | the objective vector to compare with the current archive |
+Definition at line 60 of file moeoArchive.h. +
+References moeoArchive< MOEOT >::comparator. +
| bool moeoArchive< MOEOT >::contains | +( | +const ObjectiveVector & | +_objectiveVector | +) | + const [inline] |
+
+Returns true if the current archive already contains a solution with the same objective values than _objectiveVector. +
+
| _objectiveVector | the objective vector to compare with the current archive |
+Definition at line 78 of file moeoArchive.h. +
+Referenced by moeoArchive< MOEOT >::equals(). +
| void moeoArchive< MOEOT >::update | +( | +const MOEOT & | +_moeo | +) | + [inline] |
+
+Updates the archive with a given individual _moeo. +
+
| _moeo | the given individual |
+Definition at line 95 of file moeoArchive.h. +
+References moeoArchive< MOEOT >::comparator. +
+Referenced by moeoArchive< MOEOT >::update(). +
| void moeoArchive< MOEOT >::update | +( | +const eoPop< MOEOT > & | +_pop | +) | + [inline] |
+
+Updates the archive with a given population _pop. +
+
| _pop | the given population |
+Definition at line 138 of file moeoArchive.h. +
+References moeoArchive< MOEOT >::update(). +
| bool moeoArchive< MOEOT >::equals | +( | +const moeoArchive< MOEOT > & | +_arch | +) | + [inline] |
+
+Returns true if the current archive contains the same objective vectors than the given archive _arch. +
+
| _arch | the given archive |
+Definition at line 151 of file moeoArchive.h. +
+References moeoArchive< MOEOT >::contains(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoArchiveObjectiveVectorSavingUpdater-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoArchiveObjectiveVectorSavingUpdater-members.html
new file mode 100644
index 000000000..95896c6f2
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoArchiveObjectiveVectorSavingUpdater-members.html
@@ -0,0 +1,49 @@
+
+
+| arch | moeoArchiveObjectiveVectorSavingUpdater< MOEOT > | [private] |
| className(void) const | eoUpdater | [virtual] |
| count | moeoArchiveObjectiveVectorSavingUpdater< MOEOT > | [private] |
| counter | moeoArchiveObjectiveVectorSavingUpdater< MOEOT > | [private] |
| filename | moeoArchiveObjectiveVectorSavingUpdater< MOEOT > | [private] |
| functor_category() | eoF< void > | [static] |
| id | moeoArchiveObjectiveVectorSavingUpdater< MOEOT > | [private] |
| lastCall() | eoUpdater | [virtual] |
| moeoArchiveObjectiveVectorSavingUpdater(moeoArchive< MOEOT > &_arch, const std::string &_filename, bool _count=false, int _id=-1) | moeoArchiveObjectiveVectorSavingUpdater< MOEOT > | [inline] |
| operator()() | moeoArchiveObjectiveVectorSavingUpdater< MOEOT > | [inline, virtual] |
| result_type typedef | eoF< void > | |
| ~eoF() | eoF< void > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoArchiveObjectiveVectorSavingUpdater.html b/trunk/paradiseo-moeo/doc/html/classmoeoArchiveObjectiveVectorSavingUpdater.html
new file mode 100644
index 000000000..01b9e930c
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoArchiveObjectiveVectorSavingUpdater.html
@@ -0,0 +1,145 @@
+
+
+
+#include <moeoArchiveObjectiveVectorSavingUpdater.h>
+
+
Inheritance diagram for moeoArchiveObjectiveVectorSavingUpdater< MOEOT >: +
Public Member Functions | |
| moeoArchiveObjectiveVectorSavingUpdater (moeoArchive< MOEOT > &_arch, const std::string &_filename, bool _count=false, int _id=-1) | |
| Ctor. | |
| +void | operator() () |
| Saves the fitness of the archive's members into the file. | |
Private Attributes | |
| +moeoArchive< MOEOT > & | arch |
| local archive | |
| +std::string | filename |
| target filename | |
| +bool | count |
| this variable is set to true if a new file have to be created each time () is called and to false if the file only HAVE to be updated | |
| +unsigned int | counter |
| counter | |
| +int | id |
| own ID | |
+ +
+Definition at line 28 of file moeoArchiveObjectiveVectorSavingUpdater.h.
| moeoArchiveObjectiveVectorSavingUpdater< MOEOT >::moeoArchiveObjectiveVectorSavingUpdater | +( | +moeoArchive< MOEOT > & | +_arch, | +|
| + | + | const std::string & | +_filename, | +|
| + | + | bool | + _count = false, |
+ |
| + | + | int | + _id = -1 | + |
| + | ) | + [inline] |
+
+Ctor. +
+
| _arch | local archive | |
| _filename | target filename | |
| _count | put this variable to true if you want a new file to be created each time () is called and to false if you only want the file to be updated | |
| _id | own ID |
+Definition at line 39 of file moeoArchiveObjectiveVectorSavingUpdater.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoArchiveUpdater-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoArchiveUpdater-members.html
new file mode 100644
index 000000000..c3453744e
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoArchiveUpdater-members.html
@@ -0,0 +1,46 @@
+
+
+| arch | moeoArchiveUpdater< MOEOT > | [private] |
| className(void) const | eoUpdater | [virtual] |
| functor_category() | eoF< void > | [static] |
| lastCall() | eoUpdater | [virtual] |
| moeoArchiveUpdater(moeoArchive< MOEOT > &_arch, const eoPop< MOEOT > &_pop) | moeoArchiveUpdater< MOEOT > | [inline] |
| operator()() | moeoArchiveUpdater< MOEOT > | [inline, virtual] |
| pop | moeoArchiveUpdater< MOEOT > | [private] |
| result_type typedef | eoF< void > | |
| ~eoF() | eoF< void > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoArchiveUpdater.html b/trunk/paradiseo-moeo/doc/html/classmoeoArchiveUpdater.html
new file mode 100644
index 000000000..03c24eb6e
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoArchiveUpdater.html
@@ -0,0 +1,119 @@
+
+
+
+#include <moeoArchiveUpdater.h>
+
+
Inheritance diagram for moeoArchiveUpdater< MOEOT >: +
Public Member Functions | |
| moeoArchiveUpdater (moeoArchive< MOEOT > &_arch, const eoPop< MOEOT > &_pop) | |
| Ctor. | |
| +void | operator() () |
| Updates the archive with newly found non-dominated solutions contained in the main population. | |
Private Attributes | |
| +moeoArchive< MOEOT > & | arch |
| the archive of non-dominated solutions | |
| +const eoPop< MOEOT > & | pop |
| the main population | |
+ +
+Definition at line 24 of file moeoArchiveUpdater.h.
| moeoArchiveUpdater< MOEOT >::moeoArchiveUpdater | +( | +moeoArchive< MOEOT > & | +_arch, | +|
| + | + | const eoPop< MOEOT > & | +_pop | + |
| + | ) | + [inline] |
+
+Ctor. +
+
| _arch | an archive of non-dominated solutions | |
| _pop | the main population |
+Definition at line 33 of file moeoArchiveUpdater.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoBinaryIndicatorBasedFitnessAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoBinaryIndicatorBasedFitnessAssignment-members.html
new file mode 100644
index 000000000..119bf1fcd
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoBinaryIndicatorBasedFitnessAssignment-members.html
@@ -0,0 +1,43 @@
+
+
+| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| ObjectiveVector typedef | moeoFitnessAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &)=0 | eoUF< eoPop< MOEOT > &, void > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec)=0 | moeoFitnessAssignment< MOEOT > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoFitnessAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoBinaryIndicatorBasedFitnessAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoBinaryIndicatorBasedFitnessAssignment.html
new file mode 100644
index 000000000..17bc02d89
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoBinaryIndicatorBasedFitnessAssignment.html
@@ -0,0 +1,62 @@
+
+
+
+#include <moeoBinaryIndicatorBasedFitnessAssignment.h>
+
+
Inheritance diagram for moeoBinaryIndicatorBasedFitnessAssignment< MOEOT >: +
+ +
+Definition at line 22 of file moeoBinaryIndicatorBasedFitnessAssignment.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoBinaryMetric-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoBinaryMetric-members.html
new file mode 100644
index 000000000..d2739e9ae
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoBinaryMetric-members.html
@@ -0,0 +1,40 @@
+
+
+| functor_category() | eoBF< A1, A2, R > | [static] |
| operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoBinaryMetric.html b/trunk/paradiseo-moeo/doc/html/classmoeoBinaryMetric.html
new file mode 100644
index 000000000..1a29da515
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoBinaryMetric.html
@@ -0,0 +1,71 @@
+
+
+
+#include <moeoMetric.h>
+
+
Inheritance diagram for moeoBinaryMetric< A1, A2, R >: +
+ +
+Definition at line 36 of file moeoMetric.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoBinaryMetricSavingUpdater-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoBinaryMetricSavingUpdater-members.html
new file mode 100644
index 000000000..cbe92c360
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoBinaryMetricSavingUpdater-members.html
@@ -0,0 +1,51 @@
+
+
+| className(void) const | eoUpdater | [virtual] |
| counter | moeoBinaryMetricSavingUpdater< MOEOT > | [private] |
| filename | moeoBinaryMetricSavingUpdater< MOEOT > | [private] |
| firstGen | moeoBinaryMetricSavingUpdater< MOEOT > | [private] |
| functor_category() | eoF< void > | [static] |
| lastCall() | eoUpdater | [virtual] |
| metric | moeoBinaryMetricSavingUpdater< MOEOT > | [private] |
| moeoBinaryMetricSavingUpdater(moeoVectorVsVectorBinaryMetric< ObjectiveVector, double > &_metric, const eoPop< MOEOT > &_pop, std::string _filename) | moeoBinaryMetricSavingUpdater< MOEOT > | [inline] |
| ObjectiveVector typedef | moeoBinaryMetricSavingUpdater< MOEOT > | |
| oldPop | moeoBinaryMetricSavingUpdater< MOEOT > | [private] |
| operator()() | moeoBinaryMetricSavingUpdater< MOEOT > | [inline, virtual] |
| pop | moeoBinaryMetricSavingUpdater< MOEOT > | [private] |
| result_type typedef | eoF< void > | |
| ~eoF() | eoF< void > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoBinaryMetricSavingUpdater.html b/trunk/paradiseo-moeo/doc/html/classmoeoBinaryMetricSavingUpdater.html
new file mode 100644
index 000000000..92f8df196
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoBinaryMetricSavingUpdater.html
@@ -0,0 +1,148 @@
+
+
+
+#include <moeoBinaryMetricSavingUpdater.h>
+
+
Inheritance diagram for moeoBinaryMetricSavingUpdater< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| The objective vector type of a solution. | |
Public Member Functions | |
| moeoBinaryMetricSavingUpdater (moeoVectorVsVectorBinaryMetric< ObjectiveVector, double > &_metric, const eoPop< MOEOT > &_pop, std::string _filename) | |
| Ctor. | |
| +void | operator() () |
| Saves the metric's value for the current generation. | |
Private Attributes | |
|
+moeoVectorVsVectorBinaryMetric< + ObjectiveVector, double > & | metric |
| binary metric comparing two Pareto sets | |
| +const eoPop< MOEOT > & | pop |
| main population | |
| +eoPop< MOEOT > | oldPop |
| (n-1) population | |
| +std::string | filename |
| target filename | |
| +bool | firstGen |
| is it the first generation ? | |
| +unsigned int | counter |
| counter | |
+ +
+Definition at line 28 of file moeoBinaryMetricSavingUpdater.h.
| moeoBinaryMetricSavingUpdater< MOEOT >::moeoBinaryMetricSavingUpdater | +( | +moeoVectorVsVectorBinaryMetric< ObjectiveVector, double > & | +_metric, | +|
| + | + | const eoPop< MOEOT > & | +_pop, | +|
| + | + | std::string | +_filename | + |
| + | ) | + [inline] |
+
+Ctor. +
+
| _metric | the binary metric comparing two Pareto sets | |
| _pop | the main population | |
| _filename | the target filename |
+Definition at line 42 of file moeoBinaryMetricSavingUpdater.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoBitVector-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoBitVector-members.html
new file mode 100644
index 000000000..9b0c2a61c
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoBitVector-members.html
@@ -0,0 +1,86 @@
+
+
+| AtomType typedef | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool > | |
| className() const | moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline, virtual] |
| ContainerType typedef | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool > | |
| Diversity typedef | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | |
| diversity() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| diversity(const Diversity &_diversityValue) | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| EO() | EO< MOEOObjectiveVector > | |
| EO() | EO< MOEOObjectiveVector > | |
| Fitness typedef | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | |
| fitness() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| fitness(const Fitness &_fitnessValue) | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| EO< MOEOObjectiveVector >::fitness(const Fitness &_fitness) | EO< MOEOObjectiveVector > | |
| EO< MOEOObjectiveVector >::fitness(performance_type perf) | EO< MOEOObjectiveVector > | |
| fitness_traits typedef | EO< MOEOObjectiveVector > | |
| invalid() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidate() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidate_worth(void) | EO< MOEOObjectiveVector > | |
| invalidateDiversity() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidateFitness() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidateObjectiveVector() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidDiversity() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidFitness() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidObjectiveVector() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| MOEO() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| moeoBitVector(unsigned int _size=0, bool _value=false) | moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| moeoVector(unsigned int _size=0, bool_value=bool()) | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool > | [inline] |
| ObjectiveVector typedef | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | |
| objectiveVector() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| objectiveVector(const ObjectiveVector &_objectiveVectorValue) | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| operator<(const moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool > &_moeo) const | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool > | [inline] |
| MOEO::operator<(const MOEO &_other) const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| EO< MOEOObjectiveVector >::operator<(const EO &_eo2) const | EO< MOEOObjectiveVector > | |
| EO< MOEOObjectiveVector >::operator<(const EO< Fitness, Traits > &other) const | EO< MOEOObjectiveVector > | |
| operator>(const EO &_eo2) const | EO< MOEOObjectiveVector > | |
| operator>(const EO< Fitness, Traits > &other) const | EO< MOEOObjectiveVector > | |
| performance(performance_type perf) | EO< MOEOObjectiveVector > | |
| performance(void) const | EO< MOEOObjectiveVector > | |
| performance_type typedef | EO< MOEOObjectiveVector > | |
| printOn(std::ostream &_os) const | moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline, virtual] |
| readFrom(std::istream &_is) | moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline, virtual] |
| storage_type typedef | EO< MOEOObjectiveVector > | |
| value(const std::vector< bool > &_v) | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool > | [inline] |
| worth(worth_type worth) | EO< MOEOObjectiveVector > | |
| worth(void) const | EO< MOEOObjectiveVector > | |
| worth_type typedef | EO< MOEOObjectiveVector > | |
| ~EO() | EO< MOEOObjectiveVector > | [virtual] |
| ~eoObject() | eoObject | [virtual] |
| ~eoPersistent() | eoPersistent | [virtual] |
| ~eoPrintable() | eoPrintable | [virtual] |
| ~MOEO() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline, virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoBitVector.html b/trunk/paradiseo-moeo/doc/html/classmoeoBitVector.html
new file mode 100644
index 000000000..faa59cf96
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoBitVector.html
@@ -0,0 +1,186 @@
+
+
+
+#include <moeoBitVector.h>
+
+
Inheritance diagram for moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >: +
Public Member Functions | |
| moeoBitVector (unsigned int _size=0, bool _value=false) | |
| Ctor. | |
| +virtual std::string | className () const |
| Returns the class name as a std::string. | |
| virtual void | printOn (std::ostream &_os) const |
| Writing object. | |
| virtual void | readFrom (std::istream &_is) |
| Reading object. | |
+ +
+Definition at line 22 of file moeoBitVector.h.
| moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::moeoBitVector | +( | +unsigned int | + _size = 0, |
+ |
| + | + | bool | + _value = false | + |
| + | ) | + [inline] |
+
+Ctor. +
+
| _size | Length of vector (default is 0) | |
| _value | Initial value of all elements (default is default value of type GeneType) |
+Definition at line 37 of file moeoBitVector.h. +
+
| virtual void moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::printOn | +( | +std::ostream & | +_os | +) | + const [inline, virtual] |
+
+Writing object. +
+
| _os | output stream |
+Reimplemented from moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool >. +
+Definition at line 54 of file moeoBitVector.h. +
| virtual void moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::readFrom | +( | +std::istream & | +_is | +) | + [inline, virtual] |
+
+Reading object. +
+
| _is | input stream |
+Reimplemented from moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool >. +
+Definition at line 67 of file moeoBitVector.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoCombinedLS-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoCombinedLS-members.html
new file mode 100644
index 000000000..2bf9ed354
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoCombinedLS-members.html
@@ -0,0 +1,43 @@
+
+
+| add(moeoLS< MOEOT, Type > &_mols) | moeoCombinedLS< MOEOT, Type > | [inline] |
| combinedLS | moeoCombinedLS< MOEOT, Type > | [private] |
| functor_category() | eoBF< Type, moeoArchive< MOEOT > &, void > | [static] |
| moeoCombinedLS(moeoLS< MOEOT, Type > &_first_mols) | moeoCombinedLS< MOEOT, Type > | [inline] |
| operator()(Type _type, moeoArchive< MOEOT > &_arch) | moeoCombinedLS< MOEOT, Type > | [inline, virtual] |
| ~eoBF() | eoBF< Type, moeoArchive< MOEOT > &, void > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoCombinedLS.html b/trunk/paradiseo-moeo/doc/html/classmoeoCombinedLS.html
new file mode 100644
index 000000000..3f121f4dd
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoCombinedLS.html
@@ -0,0 +1,190 @@
+
+
+
+#include <moeoCombinedLS.h>
+
+
Inheritance diagram for moeoCombinedLS< MOEOT, Type >: +
Public Member Functions | |
| moeoCombinedLS (moeoLS< MOEOT, Type > &_first_mols) | |
| Ctor. | |
| void | add (moeoLS< MOEOT, Type > &_mols) |
| Adds a new local search to combine. | |
| void | operator() (Type _type, moeoArchive< MOEOT > &_arch) |
| Gives a new solution in order to explore the neigborhood. | |
Private Attributes | |
|
+std::vector< moeoLS< MOEOT, + Type > * > | combinedLS |
| the vector that contains the combined LS | |
+ +
+Definition at line 25 of file moeoCombinedLS.h.
| moeoCombinedLS< MOEOT, Type >::moeoCombinedLS | +( | +moeoLS< MOEOT, Type > & | +_first_mols | +) | + [inline] |
+
+Ctor. +
+
| _first_mols | the first multi-objective local search to add |
+Definition at line 33 of file moeoCombinedLS.h. +
+References moeoCombinedLS< MOEOT, Type >::combinedLS. +
+
| void moeoCombinedLS< MOEOT, Type >::add | +( | +moeoLS< MOEOT, Type > & | +_mols | +) | + [inline] |
+
+Adds a new local search to combine. +
+
| _mols | the multi-objective local search to add |
+Definition at line 42 of file moeoCombinedLS.h. +
+References moeoCombinedLS< MOEOT, Type >::combinedLS. +
| void moeoCombinedLS< MOEOT, Type >::operator() | +( | +Type | +_type, | +|
| + | + | moeoArchive< MOEOT > & | +_arch | + |
| + | ) | + [inline, virtual] |
+
+Gives a new solution in order to explore the neigborhood. +
+The new non-dominated solutions are added to the archive
| _type | the object to apply the local search to | |
| _arch | the archive of non-dominated solutions |
+Implements eoBF< Type, moeoArchive< MOEOT > &, void >. +
+Definition at line 53 of file moeoCombinedLS.h. +
+References moeoCombinedLS< MOEOT, Type >::combinedLS. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoComparator-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoComparator-members.html
new file mode 100644
index 000000000..759e4be06
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoComparator-members.html
@@ -0,0 +1,40 @@
+
+
+| functor_category() | eoBF< A1, A2, R > | [static] |
| operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoComparator.html b/trunk/paradiseo-moeo/doc/html/classmoeoComparator.html
new file mode 100644
index 000000000..c838e15b8
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoComparator.html
@@ -0,0 +1,64 @@
+
+
+
+#include <moeoComparator.h>
+
+
Inheritance diagram for moeoComparator< MOEOT >: +
+ +
+Definition at line 22 of file moeoComparator.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoContributionMetric-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoContributionMetric-members.html
new file mode 100644
index 000000000..3e26e19e0
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoContributionMetric-members.html
@@ -0,0 +1,45 @@
+
+
+| card_C(const std::vector< ObjectiveVector > &_set1, const std::vector< ObjectiveVector > &_set2) | moeoContributionMetric< ObjectiveVector > | [inline, private] |
| card_N(const std::vector< ObjectiveVector > &_set1, const std::vector< ObjectiveVector > &_set2) | moeoContributionMetric< ObjectiveVector > | [inline, private] |
| card_W(const std::vector< ObjectiveVector > &_set1, const std::vector< ObjectiveVector > &_set2) | moeoContributionMetric< ObjectiveVector > | [inline, private] |
| functor_category() | eoBF< A1, A2, R > | [static] |
| operator()(const std::vector< ObjectiveVector > &_set1, const std::vector< ObjectiveVector > &_set2) | moeoContributionMetric< ObjectiveVector > | [inline] |
| moeoVectorVsVectorBinaryMetric< ObjectiveVector, double >::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| paretoComparator | moeoContributionMetric< ObjectiveVector > | [private] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoContributionMetric.html b/trunk/paradiseo-moeo/doc/html/classmoeoContributionMetric.html
new file mode 100644
index 000000000..4d9c5e728
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoContributionMetric.html
@@ -0,0 +1,262 @@
+
+
+
+#include <moeoContributionMetric.h>
+
+
Inheritance diagram for moeoContributionMetric< ObjectiveVector >: +
Public Member Functions | |
| double | operator() (const std::vector< ObjectiveVector > &_set1, const std::vector< ObjectiveVector > &_set2) |
| Returns the contribution of the Pareto set '_set1' relatively to the Pareto set '_set2'. | |
Private Member Functions | |
| unsigned int | card_C (const std::vector< ObjectiveVector > &_set1, const std::vector< ObjectiveVector > &_set2) |
| Returns the number of solutions both in '_set1' and '_set2'. | |
| unsigned int | card_W (const std::vector< ObjectiveVector > &_set1, const std::vector< ObjectiveVector > &_set2) |
| Returns the number of solutions in '_set1' dominating at least one solution of '_set2'. | |
| unsigned int | card_N (const std::vector< ObjectiveVector > &_set1, const std::vector< ObjectiveVector > &_set2) |
| Returns the number of solutions in '_set1' having no relation of dominance with those from '_set2'. | |
Private Attributes | |
|
+moeoParetoObjectiveVectorComparator< + ObjectiveVector > | paretoComparator |
| Functor to compare two objective vectors according to Pareto dominance relation. | |
+of the 2000 Congress on Evolutionary Computation, IEEE Press, pp. 317-324) +
+ +
+Definition at line 24 of file moeoContributionMetric.h.
| double moeoContributionMetric< ObjectiveVector >::operator() | +( | +const std::vector< ObjectiveVector > & | +_set1, | +|
| + | + | const std::vector< ObjectiveVector > & | +_set2 | + |
| + | ) | + [inline] |
+
+Returns the contribution of the Pareto set '_set1' relatively to the Pareto set '_set2'. +
+
| _set1 | the first Pareto set | |
| _set2 | the second Pareto set |
+Definition at line 33 of file moeoContributionMetric.h. +
+References moeoContributionMetric< ObjectiveVector >::card_C(), moeoContributionMetric< ObjectiveVector >::card_N(), and moeoContributionMetric< ObjectiveVector >::card_W(). +
| unsigned int moeoContributionMetric< ObjectiveVector >::card_C | +( | +const std::vector< ObjectiveVector > & | +_set1, | +|
| + | + | const std::vector< ObjectiveVector > & | +_set2 | + |
| + | ) | + [inline, private] |
+
+Returns the number of solutions both in '_set1' and '_set2'. +
+
| _set1 | the first Pareto set | |
| _set2 | the second Pareto set |
+Definition at line 54 of file moeoContributionMetric.h. +
+Referenced by moeoContributionMetric< ObjectiveVector >::operator()(). +
| unsigned int moeoContributionMetric< ObjectiveVector >::card_W | +( | +const std::vector< ObjectiveVector > & | +_set1, | +|
| + | + | const std::vector< ObjectiveVector > & | +_set2 | + |
| + | ) | + [inline, private] |
+
+Returns the number of solutions in '_set1' dominating at least one solution of '_set2'. +
+
| _set1 | the first Pareto set | |
| _set2 | the second Pareto set |
+Definition at line 71 of file moeoContributionMetric.h. +
+References moeoContributionMetric< ObjectiveVector >::paretoComparator. +
+Referenced by moeoContributionMetric< ObjectiveVector >::operator()(). +
| unsigned int moeoContributionMetric< ObjectiveVector >::card_N | +( | +const std::vector< ObjectiveVector > & | +_set1, | +|
| + | + | const std::vector< ObjectiveVector > & | +_set2 | + |
| + | ) | + [inline, private] |
+
+Returns the number of solutions in '_set1' having no relation of dominance with those from '_set2'. +
+
| _set1 | the first Pareto set | |
| _set2 | the second Pareto set |
+Definition at line 89 of file moeoContributionMetric.h. +
+References moeoContributionMetric< ObjectiveVector >::paretoComparator. +
+Referenced by moeoContributionMetric< ObjectiveVector >::operator()(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoConvertPopToObjectiveVectors-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoConvertPopToObjectiveVectors-members.html
new file mode 100644
index 000000000..068191b12
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoConvertPopToObjectiveVectors-members.html
@@ -0,0 +1,41 @@
+
+
+| functor_category() | eoUF< A1, R > | [static] |
| operator()(const eoPop< MOEOT > _pop) | moeoConvertPopToObjectiveVectors< MOEOT, ObjectiveVector > | [inline] |
| eoUF::operator()(A1)=0 | eoUF< A1, R > | [pure virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A1, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoConvertPopToObjectiveVectors.html b/trunk/paradiseo-moeo/doc/html/classmoeoConvertPopToObjectiveVectors.html
new file mode 100644
index 000000000..e1f1258e8
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoConvertPopToObjectiveVectors.html
@@ -0,0 +1,95 @@
+
+
+
+#include <moeoConvertPopToObjectiveVectors.h>
+
+
Inheritance diagram for moeoConvertPopToObjectiveVectors< MOEOT, ObjectiveVector >: +
Public Member Functions | |
| const std::vector< ObjectiveVector > | operator() (const eoPop< MOEOT > _pop) |
| Returns a vector of the objective vectors from the population _pop. | |
+ +
+Definition at line 23 of file moeoConvertPopToObjectiveVectors.h.
| const std::vector< ObjectiveVector > moeoConvertPopToObjectiveVectors< MOEOT, ObjectiveVector >::operator() | +( | +const eoPop< MOEOT > | +_pop | +) | + [inline] |
+
+Returns a vector of the objective vectors from the population _pop. +
+
| _pop | the population |
+Definition at line 31 of file moeoConvertPopToObjectiveVectors.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoCriterionBasedFitnessAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoCriterionBasedFitnessAssignment-members.html
new file mode 100644
index 000000000..3a28bb1f1
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoCriterionBasedFitnessAssignment-members.html
@@ -0,0 +1,43 @@
+
+
+| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| ObjectiveVector typedef | moeoFitnessAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &)=0 | eoUF< eoPop< MOEOT > &, void > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec)=0 | moeoFitnessAssignment< MOEOT > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoFitnessAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoCriterionBasedFitnessAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoCriterionBasedFitnessAssignment.html
new file mode 100644
index 000000000..72dedcae3
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoCriterionBasedFitnessAssignment.html
@@ -0,0 +1,60 @@
+
+
+
+#include <moeoCriterionBasedFitnessAssignment.h>
+
+
Inheritance diagram for moeoCriterionBasedFitnessAssignment< MOEOT >: +
+ +
+Definition at line 22 of file moeoCriterionBasedFitnessAssignment.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoCrowdingDiversityAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoCrowdingDiversityAssignment-members.html
new file mode 100644
index 000000000..984d2f515
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoCrowdingDiversityAssignment-members.html
@@ -0,0 +1,46 @@
+
+
+| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| inf() const | moeoCrowdingDiversityAssignment< MOEOT > | [inline] |
| ObjectiveVector typedef | moeoCrowdingDiversityAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &_pop) | moeoCrowdingDiversityAssignment< MOEOT > | [inline, virtual] |
| setDistances(eoPop< MOEOT > &_pop) | moeoCrowdingDiversityAssignment< MOEOT > | [inline, protected, virtual] |
| tiny() const | moeoCrowdingDiversityAssignment< MOEOT > | [inline] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) | moeoCrowdingDiversityAssignment< MOEOT > | [inline, virtual] |
| moeoDiversityAssignment::updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoDiversityAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoCrowdingDiversityAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoCrowdingDiversityAssignment.html
new file mode 100644
index 000000000..a5a546767
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoCrowdingDiversityAssignment.html
@@ -0,0 +1,204 @@
+
+
+
+#include <moeoCrowdingDiversityAssignment.h>
+
+
Inheritance diagram for moeoCrowdingDiversityAssignment< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| the objective vector type of the solutions | |
Public Member Functions | |
| +double | inf () const |
| Returns a big value (regarded as infinite). | |
| +double | tiny () const |
| Returns a very small value that can be used to avoid extreme cases (where the min bound == the max bound). | |
| void | operator() (eoPop< MOEOT > &_pop) |
| Computes diversity values for every solution contained in the population _pop. | |
| void | updateByDeleting (eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) |
Protected Member Functions | |
| virtual void | setDistances (eoPop< MOEOT > &_pop) |
| Sets the distance values. | |
+Deb, A. Pratap, S. Agarwal, T. Meyarivan, "A Fast and Elitist Multi-Objective Genetic Algorithm: NSGA-II", IEEE Transactions on Evolutionary Computation, vol. 6, no. 2 (2002). +
+ +
+Definition at line 25 of file moeoCrowdingDiversityAssignment.h.
| void moeoCrowdingDiversityAssignment< MOEOT >::operator() | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, virtual] |
+
+Computes diversity values for every solution contained in the population _pop. +
+
| _pop | the population |
+Implements eoUF< eoPop< MOEOT > &, void >. +
+Definition at line 55 of file moeoCrowdingDiversityAssignment.h. +
+References moeoCrowdingDiversityAssignment< MOEOT >::inf(), and moeoCrowdingDiversityAssignment< MOEOT >::setDistances(). +
| void moeoCrowdingDiversityAssignment< MOEOT >::updateByDeleting | +( | +eoPop< MOEOT > & | +_pop, | +|
| + | + | ObjectiveVector & | +_objVec | + |
| + | ) | + [inline, virtual] |
+
+
| _pop | the population | |
| _objVec | the objective vector |
+Implements moeoDiversityAssignment< MOEOT >. +
+Reimplemented in moeoFrontByFrontCrowdingDiversityAssignment< MOEOT >. +
+Definition at line 78 of file moeoCrowdingDiversityAssignment.h. +
| virtual void moeoCrowdingDiversityAssignment< MOEOT >::setDistances | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, protected, virtual] |
+
+Sets the distance values. +
+
| _pop | the population |
+Reimplemented in moeoFrontByFrontCrowdingDiversityAssignment< MOEOT >. +
+Definition at line 90 of file moeoCrowdingDiversityAssignment.h. +
+References moeoCrowdingDiversityAssignment< MOEOT >::inf(). +
+Referenced by moeoCrowdingDiversityAssignment< MOEOT >::operator()(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoDetTournamentSelect-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoDetTournamentSelect-members.html
new file mode 100644
index 000000000..1954595cd
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoDetTournamentSelect-members.html
@@ -0,0 +1,47 @@
+
+
+| comparator | moeoDetTournamentSelect< MOEOT > | [protected] |
| defaultComparator | moeoDetTournamentSelect< MOEOT > | [protected] |
| functor_category() | eoUF< A1, R > | [static] |
| moeoDetTournamentSelect(moeoComparator< MOEOT > &_comparator, unsigned int _tSize=2) | moeoDetTournamentSelect< MOEOT > | [inline] |
| moeoDetTournamentSelect(unsigned int _tSize=2) | moeoDetTournamentSelect< MOEOT > | [inline] |
| operator()(const eoPop< MOEOT > &_pop) | moeoDetTournamentSelect< MOEOT > | [inline] |
| moeoSelectOne::operator()(A1)=0 | eoUF< A1, R > | [pure virtual] |
| setup(const eoPop< MOEOT > &_pop) | eoSelectOne< MOEOT > | [virtual] |
| tSize | moeoDetTournamentSelect< MOEOT > | [protected] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A1, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoDetTournamentSelect.html b/trunk/paradiseo-moeo/doc/html/classmoeoDetTournamentSelect.html
new file mode 100644
index 000000000..5433842e6
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoDetTournamentSelect.html
@@ -0,0 +1,196 @@
+
+
+
+#include <moeoDetTournamentSelect.h>
+
+
Inheritance diagram for moeoDetTournamentSelect< MOEOT >: +
Public Member Functions | |
| moeoDetTournamentSelect (moeoComparator< MOEOT > &_comparator, unsigned int _tSize=2) | |
| Full Ctor. | |
| moeoDetTournamentSelect (unsigned int _tSize=2) | |
| Ctor without comparator. | |
| const MOEOT & | operator() (const eoPop< MOEOT > &_pop) |
| Apply the tournament to the given population. | |
Protected Attributes | |
| +moeoComparator< MOEOT > & | comparator |
| the comparator (used to compare 2 individuals) | |
|
+moeoFitnessThenDiversityComparator< + MOEOT > | defaultComparator |
| a fitness then diversity comparator can be used as default | |
| +unsigned int | tSize |
| the number of individuals in the tournament | |
+ +
+Definition at line 24 of file moeoDetTournamentSelect.h.
| moeoDetTournamentSelect< MOEOT >::moeoDetTournamentSelect | +( | +moeoComparator< MOEOT > & | +_comparator, | +|
| + | + | unsigned int | + _tSize = 2 | + |
| + | ) | + [inline] |
+
+Full Ctor. +
+
| _comparator | the comparator (used to compare 2 individuals) | |
| _tSize | the number of individuals in the tournament (default: 2) |
+Definition at line 33 of file moeoDetTournamentSelect.h. +
+References moeoDetTournamentSelect< MOEOT >::tSize. +
| moeoDetTournamentSelect< MOEOT >::moeoDetTournamentSelect | +( | +unsigned int | + _tSize = 2 |
+ ) | + [inline] |
+
+Ctor without comparator. +
+A moeoFitnessThenDiversityComparator is used as default.
| _tSize | the number of individuals in the tournament (default: 2) |
+Definition at line 49 of file moeoDetTournamentSelect.h. +
+References moeoDetTournamentSelect< MOEOT >::tSize. +
+
| const MOEOT& moeoDetTournamentSelect< MOEOT >::operator() | +( | +const eoPop< MOEOT > & | +_pop | +) | + [inline] |
+
+Apply the tournament to the given population. +
+
| _pop | the population |
+Definition at line 65 of file moeoDetTournamentSelect.h. +
+References moeoDetTournamentSelect< MOEOT >::comparator, and moeoDetTournamentSelect< MOEOT >::tSize. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoDistance-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoDistance-members.html
new file mode 100644
index 000000000..14d9f7c80
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoDistance-members.html
@@ -0,0 +1,43 @@
+
+
+| functor_category() | eoBF< A1, A2, R > | [static] |
| operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| setup(const eoPop< MOEOT > &_pop) | moeoDistance< MOEOT, Type > | [inline, virtual] |
| setup(double _min, double _max, unsigned int _obj) | moeoDistance< MOEOT, Type > | [inline, virtual] |
| setup(eoRealInterval _realInterval, unsigned int _obj) | moeoDistance< MOEOT, Type > | [inline, virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoDistance.html b/trunk/paradiseo-moeo/doc/html/classmoeoDistance.html
new file mode 100644
index 000000000..a456b3748
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoDistance.html
@@ -0,0 +1,197 @@
+
+
+
+#include <moeoDistance.h>
+
+
Inheritance diagram for moeoDistance< MOEOT, Type >: +
Public Member Functions | |
| virtual void | setup (const eoPop< MOEOT > &_pop) |
| Nothing to do. | |
| virtual void | setup (double _min, double _max, unsigned int _obj) |
| Nothing to do. | |
| virtual void | setup (eoRealInterval _realInterval, unsigned int _obj) |
| Nothing to do. | |
+ +
+Definition at line 22 of file moeoDistance.h.
| virtual void moeoDistance< MOEOT, Type >::setup | +( | +const eoPop< MOEOT > & | +_pop | +) | + [inline, virtual] |
+
+Nothing to do. +
+
| _pop | the population |
+Reimplemented in moeoNormalizedDistance< MOEOT, Type >, and moeoNormalizedDistance< MOEOT >. +
+Definition at line 30 of file moeoDistance.h. +
| virtual void moeoDistance< MOEOT, Type >::setup | +( | +double | +_min, | +|
| + | + | double | +_max, | +|
| + | + | unsigned int | +_obj | + |
| + | ) | + [inline, virtual] |
+
+Nothing to do. +
+
| _min | lower bound | |
| _max | upper bound | |
| _obj | the objective index |
+Reimplemented in moeoNormalizedDistance< MOEOT, Type >, and moeoNormalizedDistance< MOEOT >. +
+Definition at line 40 of file moeoDistance.h. +
| virtual void moeoDistance< MOEOT, Type >::setup | +( | +eoRealInterval | +_realInterval, | +|
| + | + | unsigned int | +_obj | + |
| + | ) | + [inline, virtual] |
+
+Nothing to do. +
+
| _realInterval | the eoRealInterval object | |
| _obj | the objective index |
+Reimplemented in moeoNormalizedDistance< MOEOT, Type >, and moeoNormalizedDistance< MOEOT >. +
+Definition at line 49 of file moeoDistance.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoDistanceMatrix-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoDistanceMatrix-members.html
new file mode 100644
index 000000000..81372c174
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoDistanceMatrix-members.html
@@ -0,0 +1,42 @@
+
+
+| distance | moeoDistanceMatrix< MOEOT, Type > | [private] |
| functor_category() | eoUF< const eoPop< MOEOT > &, void > | [static] |
| moeoDistanceMatrix(unsigned int _size, moeoDistance< MOEOT, Type > &_distance) | moeoDistanceMatrix< MOEOT, Type > | [inline] |
| operator()(const eoPop< MOEOT > &_pop) | moeoDistanceMatrix< MOEOT, Type > | [inline, virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< const eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoDistanceMatrix.html b/trunk/paradiseo-moeo/doc/html/classmoeoDistanceMatrix.html
new file mode 100644
index 000000000..bc32ee702
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoDistanceMatrix.html
@@ -0,0 +1,149 @@
+
+
+
+#include <moeoDistanceMatrix.h>
+
+
Inheritance diagram for moeoDistanceMatrix< MOEOT, Type >: +
Public Member Functions | |
| moeoDistanceMatrix (unsigned int _size, moeoDistance< MOEOT, Type > &_distance) | |
| Ctor. | |
| void | operator() (const eoPop< MOEOT > &_pop) |
| Sets the distance between every pair of individuals contained in the population _pop. | |
Private Attributes | |
| +moeoDistance< MOEOT, Type > & | distance |
| the distance to use | |
+ +
+Definition at line 24 of file moeoDistanceMatrix.h.
| moeoDistanceMatrix< MOEOT, Type >::moeoDistanceMatrix | +( | +unsigned int | +_size, | +|
| + | + | moeoDistance< MOEOT, Type > & | +_distance | + |
| + | ) | + [inline] |
+
+Ctor. +
+
| _size | size for every dimension of the matrix | |
| _distance | the distance to use |
+Definition at line 37 of file moeoDistanceMatrix.h. +
+
| void moeoDistanceMatrix< MOEOT, Type >::operator() | +( | +const eoPop< MOEOT > & | +_pop | +) | + [inline, virtual] |
+
+Sets the distance between every pair of individuals contained in the population _pop. +
+
| _pop | the population |
+Implements eoUF< const eoPop< MOEOT > &, void >. +
+Definition at line 51 of file moeoDistanceMatrix.h. +
+References moeoDistanceMatrix< MOEOT, Type >::distance. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoDiversityAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoDiversityAssignment-members.html
new file mode 100644
index 000000000..874af6ce5
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoDiversityAssignment-members.html
@@ -0,0 +1,43 @@
+
+
+| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| ObjectiveVector typedef | moeoDiversityAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &)=0 | eoUF< eoPop< MOEOT > &, void > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec)=0 | moeoDiversityAssignment< MOEOT > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoDiversityAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoDiversityAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoDiversityAssignment.html
new file mode 100644
index 000000000..6edd8467d
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoDiversityAssignment.html
@@ -0,0 +1,163 @@
+
+
+
+#include <moeoDiversityAssignment.h>
+
+
Inheritance diagram for moeoDiversityAssignment< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| The type for objective vector. | |
Public Member Functions | |
| virtual void | updateByDeleting (eoPop< MOEOT > &_pop, ObjectiveVector &_objVec)=0 |
| Updates the diversity values of the whole population _pop by taking the deletion of the objective vector _objVec into account. | |
| void | updateByDeleting (eoPop< MOEOT > &_pop, MOEOT &_moeo) |
| Updates the diversity values of the whole population _pop by taking the deletion of the individual _moeo into account. | |
+ +
+Definition at line 23 of file moeoDiversityAssignment.h.
| virtual void moeoDiversityAssignment< MOEOT >::updateByDeleting | +( | +eoPop< MOEOT > & | +_pop, | +|
| + | + | ObjectiveVector & | +_objVec | + |
| + | ) | + [pure virtual] |
+
+Updates the diversity values of the whole population _pop by taking the deletion of the objective vector _objVec into account. +
+
| _pop | the population | |
| _objVec | the objective vector |
+Implemented in moeoCrowdingDiversityAssignment< MOEOT >, moeoDummyDiversityAssignment< MOEOT >, moeoFrontByFrontCrowdingDiversityAssignment< MOEOT >, moeoFrontByFrontSharingDiversityAssignment< MOEOT >, and moeoSharingDiversityAssignment< MOEOT >. +
+Referenced by moeoDiversityAssignment< MOEOT >::updateByDeleting(). +
| void moeoDiversityAssignment< MOEOT >::updateByDeleting | +( | +eoPop< MOEOT > & | +_pop, | +|
| + | + | MOEOT & | +_moeo | + |
| + | ) | + [inline] |
+
+Updates the diversity values of the whole population _pop by taking the deletion of the individual _moeo into account. +
+
| _pop | the population | |
| _moeo | the individual |
+Definition at line 44 of file moeoDiversityAssignment.h. +
+References moeoDiversityAssignment< MOEOT >::updateByDeleting(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoDiversityThenFitnessComparator-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoDiversityThenFitnessComparator-members.html
new file mode 100644
index 000000000..8d0b1088a
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoDiversityThenFitnessComparator-members.html
@@ -0,0 +1,41 @@
+
+
+| functor_category() | eoBF< A1, A2, R > | [static] |
| operator()(const MOEOT &_moeo1, const MOEOT &_moeo2) | moeoDiversityThenFitnessComparator< MOEOT > | [inline] |
| moeoComparator::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoDiversityThenFitnessComparator.html b/trunk/paradiseo-moeo/doc/html/classmoeoDiversityThenFitnessComparator.html
new file mode 100644
index 000000000..a4afa2048
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoDiversityThenFitnessComparator.html
@@ -0,0 +1,106 @@
+
+
+
+#include <moeoDiversityThenFitnessComparator.h>
+
+
Inheritance diagram for moeoDiversityThenFitnessComparator< MOEOT >: +
Public Member Functions | |
| const bool | operator() (const MOEOT &_moeo1, const MOEOT &_moeo2) |
| Returns true if _moeo1 < _moeo2 according to their diversity values, then according to their fitness values. | |
+ +
+Definition at line 22 of file moeoDiversityThenFitnessComparator.h.
| const bool moeoDiversityThenFitnessComparator< MOEOT >::operator() | +( | +const MOEOT & | +_moeo1, | +|
| + | + | const MOEOT & | +_moeo2 | + |
| + | ) | + [inline] |
+
+Returns true if _moeo1 < _moeo2 according to their diversity values, then according to their fitness values. +
+
| _moeo1 | the first solution | |
| _moeo2 | the second solution |
+Definition at line 31 of file moeoDiversityThenFitnessComparator.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoDummyDiversityAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoDummyDiversityAssignment-members.html
new file mode 100644
index 000000000..b813f5a4a
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoDummyDiversityAssignment-members.html
@@ -0,0 +1,43 @@
+
+
+| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| ObjectiveVector typedef | moeoDummyDiversityAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &_pop) | moeoDummyDiversityAssignment< MOEOT > | [inline, virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) | moeoDummyDiversityAssignment< MOEOT > | [inline, virtual] |
| moeoDiversityAssignment::updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoDiversityAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoDummyDiversityAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoDummyDiversityAssignment.html
new file mode 100644
index 000000000..b0c40bb84
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoDummyDiversityAssignment.html
@@ -0,0 +1,149 @@
+
+
+
+#include <moeoDummyDiversityAssignment.h>
+
+
Inheritance diagram for moeoDummyDiversityAssignment< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| The type for objective vector. | |
Public Member Functions | |
| void | operator() (eoPop< MOEOT > &_pop) |
| Sets the diversity to '0' for every individuals of the population _pop if it is invalid. | |
| void | updateByDeleting (eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) |
| Updates the diversity values of the whole population _pop by taking the deletion of the objective vector _objVec into account. | |
+ +
+Definition at line 22 of file moeoDummyDiversityAssignment.h.
| void moeoDummyDiversityAssignment< MOEOT >::operator() | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, virtual] |
+
+Sets the diversity to '0' for every individuals of the population _pop if it is invalid. +
+
| _pop | the population |
+Implements eoUF< eoPop< MOEOT > &, void >. +
+Definition at line 34 of file moeoDummyDiversityAssignment.h. +
| void moeoDummyDiversityAssignment< MOEOT >::updateByDeleting | +( | +eoPop< MOEOT > & | +_pop, | +|
| + | + | ObjectiveVector & | +_objVec | + |
| + | ) | + [inline, virtual] |
+
+Updates the diversity values of the whole population _pop by taking the deletion of the objective vector _objVec into account. +
+
| _pop | the population | |
| _objVec | the objective vector |
+Implements moeoDiversityAssignment< MOEOT >. +
+Definition at line 52 of file moeoDummyDiversityAssignment.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoDummyFitnessAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoDummyFitnessAssignment-members.html
new file mode 100644
index 000000000..d2a7fcc86
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoDummyFitnessAssignment-members.html
@@ -0,0 +1,43 @@
+
+
+| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| ObjectiveVector typedef | moeoDummyFitnessAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &_pop) | moeoDummyFitnessAssignment< MOEOT > | [inline, virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) | moeoDummyFitnessAssignment< MOEOT > | [inline, virtual] |
| moeoFitnessAssignment::updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoFitnessAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoDummyFitnessAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoDummyFitnessAssignment.html
new file mode 100644
index 000000000..27c35b370
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoDummyFitnessAssignment.html
@@ -0,0 +1,149 @@
+
+
+
+#include <moeoDummyFitnessAssignment.h>
+
+
Inheritance diagram for moeoDummyFitnessAssignment< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| The type for objective vector. | |
Public Member Functions | |
| void | operator() (eoPop< MOEOT > &_pop) |
| Sets the fitness to '0' for every individuals of the population _pop if it is invalid. | |
| void | updateByDeleting (eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) |
| Updates the fitness values of the whole population _pop by taking the deletion of the objective vector _objVec into account. | |
+ +
+Definition at line 22 of file moeoDummyFitnessAssignment.h.
| void moeoDummyFitnessAssignment< MOEOT >::operator() | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, virtual] |
+
+Sets the fitness to '0' for every individuals of the population _pop if it is invalid. +
+
| _pop | the population |
+Implements eoUF< eoPop< MOEOT > &, void >. +
+Definition at line 34 of file moeoDummyFitnessAssignment.h. +
| void moeoDummyFitnessAssignment< MOEOT >::updateByDeleting | +( | +eoPop< MOEOT > & | +_pop, | +|
| + | + | ObjectiveVector & | +_objVec | + |
| + | ) | + [inline, virtual] |
+
+Updates the fitness values of the whole population _pop by taking the deletion of the objective vector _objVec into account. +
+
| _pop | the population | |
| _objVec | the objective vector |
+Implements moeoFitnessAssignment< MOEOT >. +
+Definition at line 52 of file moeoDummyFitnessAssignment.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEA-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoEA-members.html
new file mode 100644
index 000000000..b972ee60f
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEA-members.html
@@ -0,0 +1,40 @@
+
+
+| functor_category() | eoUF< A1, R > | [static] |
| operator()(A1)=0 | eoUF< A1, R > | [pure virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A1, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEA.html b/trunk/paradiseo-moeo/doc/html/classmoeoEA.html
new file mode 100644
index 000000000..ede0ed58f
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEA.html
@@ -0,0 +1,65 @@
+
+
+
+#include <moeoEA.h>
+
+
Inheritance diagram for moeoEA< MOEOT >: +
+ +
+Definition at line 23 of file moeoEA.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA-members.html
new file mode 100644
index 000000000..c82249e33
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA-members.html
@@ -0,0 +1,62 @@
+
+
+| breed | moeoEasyEA< MOEOT > | [protected] |
| continuator | moeoEasyEA< MOEOT > | [protected] |
| diversityEval | moeoEasyEA< MOEOT > | [protected] |
| dummyEval | moeoEasyEA< MOEOT > | [protected] |
| dummyMerge | moeoEasyEA< MOEOT > | [protected] |
| dummyReduce | moeoEasyEA< MOEOT > | [protected] |
| dummySelect | moeoEasyEA< MOEOT > | [protected] |
| dummyTransform | moeoEasyEA< MOEOT > | [protected] |
| eval | moeoEasyEA< MOEOT > | [protected] |
| evalFitAndDivBeforeSelection | moeoEasyEA< MOEOT > | [protected] |
| fitnessEval | moeoEasyEA< MOEOT > | [protected] |
| functor_category() | eoUF< A1, R > | [static] |
| loopEval | moeoEasyEA< MOEOT > | [protected] |
| mergeReduce | moeoEasyEA< MOEOT > | [protected] |
| moeoEasyEA(eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoBreed< MOEOT > &_breed, moeoReplacement< MOEOT > &_replace, moeoFitnessAssignment< MOEOT > &_fitnessEval, moeoDiversityAssignment< MOEOT > &_diversityEval, bool _evalFitAndDivBeforeSelection=false) | moeoEasyEA< MOEOT > | [inline] |
| moeoEasyEA(eoContinue< MOEOT > &_continuator, eoPopEvalFunc< MOEOT > &_popEval, eoBreed< MOEOT > &_breed, moeoReplacement< MOEOT > &_replace, moeoFitnessAssignment< MOEOT > &_fitnessEval, moeoDiversityAssignment< MOEOT > &_diversityEval, bool _evalFitAndDivBeforeSelection=false) | moeoEasyEA< MOEOT > | [inline] |
| moeoEasyEA(eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoBreed< MOEOT > &_breed, eoMerge< MOEOT > &_merge, eoReduce< MOEOT > &_reduce, moeoFitnessAssignment< MOEOT > &_fitnessEval, moeoDiversityAssignment< MOEOT > &_diversityEval, bool _evalFitAndDivBeforeSelection=false) | moeoEasyEA< MOEOT > | [inline] |
| moeoEasyEA(eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoSelect< MOEOT > &_select, eoTransform< MOEOT > &_transform, moeoReplacement< MOEOT > &_replace, moeoFitnessAssignment< MOEOT > &_fitnessEval, moeoDiversityAssignment< MOEOT > &_diversityEval, bool _evalFitAndDivBeforeSelection=false) | moeoEasyEA< MOEOT > | [inline] |
| moeoEasyEA(eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoSelect< MOEOT > &_select, eoTransform< MOEOT > &_transform, eoMerge< MOEOT > &_merge, eoReduce< MOEOT > &_reduce, moeoFitnessAssignment< MOEOT > &_fitnessEval, moeoDiversityAssignment< MOEOT > &_diversityEval, bool _evalFitAndDivBeforeSelection=false) | moeoEasyEA< MOEOT > | [inline] |
| operator()(eoPop< MOEOT > &_pop) | moeoEasyEA< MOEOT > | [inline, virtual] |
| moeoEA::operator()(A1)=0 | eoUF< A1, R > | [pure virtual] |
| popEval | moeoEasyEA< MOEOT > | [protected] |
| replace | moeoEasyEA< MOEOT > | [protected] |
| selectTransform | moeoEasyEA< MOEOT > | [protected] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A1, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA.html b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA.html
new file mode 100644
index 000000000..a5b20cb74
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA.html
@@ -0,0 +1,599 @@
+
+
+
+#include <moeoEasyEA.h>
+
+
Inheritance diagram for moeoEasyEA< MOEOT >: +
Public Member Functions | |
| moeoEasyEA (eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoBreed< MOEOT > &_breed, moeoReplacement< MOEOT > &_replace, moeoFitnessAssignment< MOEOT > &_fitnessEval, moeoDiversityAssignment< MOEOT > &_diversityEval, bool _evalFitAndDivBeforeSelection=false) | |
| Ctor taking a breed and merge. | |
| moeoEasyEA (eoContinue< MOEOT > &_continuator, eoPopEvalFunc< MOEOT > &_popEval, eoBreed< MOEOT > &_breed, moeoReplacement< MOEOT > &_replace, moeoFitnessAssignment< MOEOT > &_fitnessEval, moeoDiversityAssignment< MOEOT > &_diversityEval, bool _evalFitAndDivBeforeSelection=false) | |
| Ctor taking a breed, a merge and a eoPopEval. | |
| moeoEasyEA (eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoBreed< MOEOT > &_breed, eoMerge< MOEOT > &_merge, eoReduce< MOEOT > &_reduce, moeoFitnessAssignment< MOEOT > &_fitnessEval, moeoDiversityAssignment< MOEOT > &_diversityEval, bool _evalFitAndDivBeforeSelection=false) | |
| Ctor taking a breed, a merge and a reduce. | |
| moeoEasyEA (eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoSelect< MOEOT > &_select, eoTransform< MOEOT > &_transform, moeoReplacement< MOEOT > &_replace, moeoFitnessAssignment< MOEOT > &_fitnessEval, moeoDiversityAssignment< MOEOT > &_diversityEval, bool _evalFitAndDivBeforeSelection=false) | |
| Ctor taking a select, a transform and a replacement. | |
| moeoEasyEA (eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoSelect< MOEOT > &_select, eoTransform< MOEOT > &_transform, eoMerge< MOEOT > &_merge, eoReduce< MOEOT > &_reduce, moeoFitnessAssignment< MOEOT > &_fitnessEval, moeoDiversityAssignment< MOEOT > &_diversityEval, bool _evalFitAndDivBeforeSelection=false) | |
| Ctor taking a select, a transform, a merge and a reduce. | |
| virtual void | operator() (eoPop< MOEOT > &_pop) |
| Applies a few generation of evolution to the population _pop. | |
Protected Attributes | |
| +eoContinue< MOEOT > & | continuator |
| the stopping criteria | |
| +eoEvalFunc< MOEOT > & | eval |
| the evaluation functions | |
| +eoPopLoopEval< MOEOT > | loopEval |
| to evaluate the whole population | |
| +eoPopEvalFunc< MOEOT > & | popEval |
| to evaluate the whole population | |
| +eoSelectTransform< MOEOT > | selectTransform |
| breed: a select followed by a transform | |
| +eoBreed< MOEOT > & | breed |
| the breeder | |
| +eoMergeReduce< MOEOT > | mergeReduce |
| replacement: a merge followed by a reduce | |
| +moeoReplacement< MOEOT > & | replace |
| the replacment strategy | |
| +moeoFitnessAssignment< MOEOT > & | fitnessEval |
| the fitness assignment strategy | |
| +moeoDiversityAssignment< MOEOT > & | diversityEval |
| the diversity assignment strategy | |
| +bool | evalFitAndDivBeforeSelection |
| if this parameter is set to 'true', the fitness and the diversity of the whole population will be re-evaluated before the selection process | |
| +moeoEasyEA::eoDummyEval | dummyEval |
| a dummy eval | |
| +moeoEasyEA::eoDummySelect | dummySelect |
| a dummy select | |
| +moeoEasyEA::eoDummyTransform | dummyTransform |
| a dummy transform | |
| +eoNoElitism< MOEOT > | dummyMerge |
| a dummy merge | |
| +eoTruncate< MOEOT > | dummyReduce |
| a dummy reduce | |
Classes | |
| class | eoDummyEval |
| a dummy eval More... | |
| class | eoDummySelect |
| a dummy select More... | |
| class | eoDummyTransform |
| a dummy transform More... | |
+ +
+Definition at line 33 of file moeoEasyEA.h.
| moeoEasyEA< MOEOT >::moeoEasyEA | +( | +eoContinue< MOEOT > & | +_continuator, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoBreed< MOEOT > & | +_breed, | +|
| + | + | moeoReplacement< MOEOT > & | +_replace, | +|
| + | + | moeoFitnessAssignment< MOEOT > & | +_fitnessEval, | +|
| + | + | moeoDiversityAssignment< MOEOT > & | +_diversityEval, | +|
| + | + | bool | + _evalFitAndDivBeforeSelection = false | + |
| + | ) | + [inline] |
+
+Ctor taking a breed and merge. +
+
| _continuator | the stopping criteria | |
| _eval | the evaluation functions | |
| _breed | the breeder | |
| _replace | the replacement strategy | |
| _fitnessEval | the fitness evaluation scheme | |
| _diversityEval | the diversity evaluation scheme | |
| _evalFitAndDivBeforeSelection | put this parameter to 'true' if you want to re-evalue the fitness and the diversity of the population before the selection process |
+Definition at line 47 of file moeoEasyEA.h. +
| moeoEasyEA< MOEOT >::moeoEasyEA | +( | +eoContinue< MOEOT > & | +_continuator, | +|
| + | + | eoPopEvalFunc< MOEOT > & | +_popEval, | +|
| + | + | eoBreed< MOEOT > & | +_breed, | +|
| + | + | moeoReplacement< MOEOT > & | +_replace, | +|
| + | + | moeoFitnessAssignment< MOEOT > & | +_fitnessEval, | +|
| + | + | moeoDiversityAssignment< MOEOT > & | +_diversityEval, | +|
| + | + | bool | + _evalFitAndDivBeforeSelection = false | + |
| + | ) | + [inline] |
+
+Ctor taking a breed, a merge and a eoPopEval. +
+
| _continuator | the stopping criteria | |
| _popEval | the evaluation functions for the whole population | |
| _breed | the breeder | |
| _replace | the replacement strategy | |
| _fitnessEval | the fitness evaluation scheme | |
| _diversityEval | the diversity evaluation scheme | |
| _evalFitAndDivBeforeSelection | put this parameter to 'true' if you want to re-evalue the fitness and the diversity of the population before the selection process |
+Definition at line 65 of file moeoEasyEA.h. +
| moeoEasyEA< MOEOT >::moeoEasyEA | +( | +eoContinue< MOEOT > & | +_continuator, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoBreed< MOEOT > & | +_breed, | +|
| + | + | eoMerge< MOEOT > & | +_merge, | +|
| + | + | eoReduce< MOEOT > & | +_reduce, | +|
| + | + | moeoFitnessAssignment< MOEOT > & | +_fitnessEval, | +|
| + | + | moeoDiversityAssignment< MOEOT > & | +_diversityEval, | +|
| + | + | bool | + _evalFitAndDivBeforeSelection = false | + |
| + | ) | + [inline] |
+
+Ctor taking a breed, a merge and a reduce. +
+
| _continuator | the stopping criteria | |
| _eval | the evaluation functions | |
| _breed | the breeder | |
| _merge | the merge scheme | |
| _reduce | the reduce scheme | |
| _fitnessEval | the fitness evaluation scheme | |
| _diversityEval | the diversity evaluation scheme | |
| _evalFitAndDivBeforeSelection | put this parameter to 'true' if you want to re-evalue the fitness and the diversity of the population before the selection process |
+Definition at line 84 of file moeoEasyEA.h. +
| moeoEasyEA< MOEOT >::moeoEasyEA | +( | +eoContinue< MOEOT > & | +_continuator, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoSelect< MOEOT > & | +_select, | +|
| + | + | eoTransform< MOEOT > & | +_transform, | +|
| + | + | moeoReplacement< MOEOT > & | +_replace, | +|
| + | + | moeoFitnessAssignment< MOEOT > & | +_fitnessEval, | +|
| + | + | moeoDiversityAssignment< MOEOT > & | +_diversityEval, | +|
| + | + | bool | + _evalFitAndDivBeforeSelection = false | + |
| + | ) | + [inline] |
+
+Ctor taking a select, a transform and a replacement. +
+
| _continuator | the stopping criteria | |
| _eval | the evaluation functions | |
| _select | the selection scheme | |
| _transform | the tranformation scheme | |
| _replace | the replacement strategy | |
| _fitnessEval | the fitness evaluation scheme | |
| _diversityEval | the diversity evaluation scheme | |
| _evalFitAndDivBeforeSelection | put this parameter to 'true' if you want to re-evalue the fitness and the diversity of the population before the selection process |
+Definition at line 103 of file moeoEasyEA.h. +
| moeoEasyEA< MOEOT >::moeoEasyEA | +( | +eoContinue< MOEOT > & | +_continuator, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoSelect< MOEOT > & | +_select, | +|
| + | + | eoTransform< MOEOT > & | +_transform, | +|
| + | + | eoMerge< MOEOT > & | +_merge, | +|
| + | + | eoReduce< MOEOT > & | +_reduce, | +|
| + | + | moeoFitnessAssignment< MOEOT > & | +_fitnessEval, | +|
| + | + | moeoDiversityAssignment< MOEOT > & | +_diversityEval, | +|
| + | + | bool | + _evalFitAndDivBeforeSelection = false | + |
| + | ) | + [inline] |
+
+Ctor taking a select, a transform, a merge and a reduce. +
+
| _continuator | the stopping criteria | |
| _eval | the evaluation functions | |
| _select | the selection scheme | |
| _transform | the tranformation scheme | |
| _merge | the merge scheme | |
| _reduce | the reduce scheme | |
| _fitnessEval | the fitness evaluation scheme | |
| _diversityEval | the diversity evaluation scheme | |
| _evalFitAndDivBeforeSelection | put this parameter to 'true' if you want to re-evalue the fitness and the diversity of the population before the selection process |
+Definition at line 123 of file moeoEasyEA.h. +
+
| virtual void moeoEasyEA< MOEOT >::operator() | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, virtual] |
+
+Applies a few generation of evolution to the population _pop. +
+
| _pop | the population |
+Definition at line 135 of file moeoEasyEA.h. +
+References moeoEasyEA< MOEOT >::breed, moeoEasyEA< MOEOT >::continuator, moeoEasyEA< MOEOT >::diversityEval, moeoEasyEA< MOEOT >::evalFitAndDivBeforeSelection, moeoEasyEA< MOEOT >::fitnessEval, moeoEasyEA< MOEOT >::popEval, and moeoEasyEA< MOEOT >::replace. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummyEval-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummyEval-members.html
new file mode 100644
index 000000000..a5be3cbc3
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummyEval-members.html
@@ -0,0 +1,43 @@
+
+
+| EOFitT typedef | eoEvalFunc< MOEOT > | |
| EOType typedef | eoEvalFunc< MOEOT > | |
| functor_category() | eoUF< A1, R > | [static] |
| operator()(MOEOT &) | moeoEasyEA< MOEOT >::eoDummyEval | [inline] |
| eoEvalFunc< MOEOT >::operator()(A1)=0 | eoUF< A1, R > | [pure virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A1, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummyEval.html b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummyEval.html
new file mode 100644
index 000000000..9eb253588
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummyEval.html
@@ -0,0 +1,67 @@
+
+
+
+#include <moeoEasyEA.h>
+
+
Inheritance diagram for moeoEasyEA< MOEOT >::eoDummyEval: +
Public Member Functions | |
| +void | operator() (MOEOT &) |
| the dummy functor | |
+ +
+Definition at line 200 of file moeoEasyEA.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummySelect-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummySelect-members.html
new file mode 100644
index 000000000..a18c61ed4
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummySelect-members.html
@@ -0,0 +1,41 @@
+
+
+| functor_category() | eoBF< A1, A2, R > | [static] |
| operator()(const eoPop< MOEOT > &, eoPop< MOEOT > &) | moeoEasyEA< MOEOT >::eoDummySelect | [inline] |
| eoSelect< MOEOT >::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummySelect.html b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummySelect.html
new file mode 100644
index 000000000..64f1e88ae
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummySelect.html
@@ -0,0 +1,67 @@
+
+
+
+#include <moeoEasyEA.h>
+
+
Inheritance diagram for moeoEasyEA< MOEOT >::eoDummySelect: +
Public Member Functions | |
| +void | operator() (const eoPop< MOEOT > &, eoPop< MOEOT > &) |
| the dummy functor | |
+ +
+Definition at line 204 of file moeoEasyEA.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummyTransform-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummyTransform-members.html
new file mode 100644
index 000000000..1f64ed548
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummyTransform-members.html
@@ -0,0 +1,41 @@
+
+
+| functor_category() | eoUF< A1, R > | [static] |
| operator()(eoPop< MOEOT > &) | moeoEasyEA< MOEOT >::eoDummyTransform | [inline] |
| eoTransform< MOEOT >::operator()(A1)=0 | eoUF< A1, R > | [pure virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A1, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummyTransform.html b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummyTransform.html
new file mode 100644
index 000000000..5d56bc596
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEasyEA_1_1eoDummyTransform.html
@@ -0,0 +1,67 @@
+
+
+
+#include <moeoEasyEA.h>
+
+
Inheritance diagram for moeoEasyEA< MOEOT >::eoDummyTransform: +
Public Member Functions | |
| +void | operator() (eoPop< MOEOT > &) |
| the dummy functor | |
+ +
+Definition at line 208 of file moeoEasyEA.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoElitistReplacement-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoElitistReplacement-members.html
new file mode 100644
index 000000000..a248fc546
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoElitistReplacement-members.html
@@ -0,0 +1,50 @@
+
+
+| comparator | moeoElitistReplacement< MOEOT > | [protected] |
| defaultComparator | moeoElitistReplacement< MOEOT > | [protected] |
| defaultDiversity | moeoElitistReplacement< MOEOT > | [protected] |
| diversityAssignment | moeoElitistReplacement< MOEOT > | [protected] |
| fitnessAssignment | moeoElitistReplacement< MOEOT > | [protected] |
| functor_category() | eoBF< A1, A2, R > | [static] |
| moeoElitistReplacement(moeoFitnessAssignment< MOEOT > &_fitnessAssignment, moeoDiversityAssignment< MOEOT > &_diversityAssignment, moeoComparator< MOEOT > &_comparator) | moeoElitistReplacement< MOEOT > | [inline] |
| moeoElitistReplacement(moeoFitnessAssignment< MOEOT > &_fitnessAssignment, moeoDiversityAssignment< MOEOT > &_diversityAssignment) | moeoElitistReplacement< MOEOT > | [inline] |
| moeoElitistReplacement(moeoFitnessAssignment< MOEOT > &_fitnessAssignment, moeoComparator< MOEOT > &_comparator) | moeoElitistReplacement< MOEOT > | [inline] |
| moeoElitistReplacement(moeoFitnessAssignment< MOEOT > &_fitnessAssignment) | moeoElitistReplacement< MOEOT > | [inline] |
| operator()(eoPop< MOEOT > &_parents, eoPop< MOEOT > &_offspring) | moeoElitistReplacement< MOEOT > | [inline] |
| moeoReplacement::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoElitistReplacement.html b/trunk/paradiseo-moeo/doc/html/classmoeoElitistReplacement.html
new file mode 100644
index 000000000..ea7e3cd70
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoElitistReplacement.html
@@ -0,0 +1,310 @@
+
+
+
+#include <moeoElitistReplacement.h>
+
+
Inheritance diagram for moeoElitistReplacement< MOEOT >: +
Public Member Functions | |
| moeoElitistReplacement (moeoFitnessAssignment< MOEOT > &_fitnessAssignment, moeoDiversityAssignment< MOEOT > &_diversityAssignment, moeoComparator< MOEOT > &_comparator) | |
| Full constructor. | |
| moeoElitistReplacement (moeoFitnessAssignment< MOEOT > &_fitnessAssignment, moeoDiversityAssignment< MOEOT > &_diversityAssignment) | |
| Constructor without comparator. | |
| moeoElitistReplacement (moeoFitnessAssignment< MOEOT > &_fitnessAssignment, moeoComparator< MOEOT > &_comparator) | |
| Constructor without moeoDiversityAssignement. | |
| moeoElitistReplacement (moeoFitnessAssignment< MOEOT > &_fitnessAssignment) | |
| Constructor without moeoDiversityAssignement nor moeoComparator. | |
| void | operator() (eoPop< MOEOT > &_parents, eoPop< MOEOT > &_offspring) |
| Replaces the first population by adding the individuals of the second one, sorting with a moeoComparator and resizing the whole population obtained. | |
Protected Attributes | |
| +moeoFitnessAssignment< MOEOT > & | fitnessAssignment |
| the fitness assignment strategy | |
| +moeoDiversityAssignment< MOEOT > & | diversityAssignment |
| the diversity assignment strategy | |
|
+moeoDummyDiversityAssignment< + MOEOT > | defaultDiversity |
| a dummy diversity assignment can be used as default | |
|
+moeoFitnessThenDiversityComparator< + MOEOT > | defaultComparator |
| a fitness then diversity comparator can be used as default | |
| +moeoElitistReplacement::Cmp | comparator |
| this object is used to compare solutions in order to sort the population | |
Classes | |
| class | Cmp |
| this object is used to compare solutions in order to sort the population More... | |
+ +
+Definition at line 26 of file moeoElitistReplacement.h.
| moeoElitistReplacement< MOEOT >::moeoElitistReplacement | +( | +moeoFitnessAssignment< MOEOT > & | +_fitnessAssignment, | +|
| + | + | moeoDiversityAssignment< MOEOT > & | +_diversityAssignment, | +|
| + | + | moeoComparator< MOEOT > & | +_comparator | + |
| + | ) | + [inline] |
+
+Full constructor. +
+
| _fitnessAssignment | the fitness assignment strategy | |
| _diversityAssignment | the diversity assignment strategy | |
| _comparator | the comparator (used to compare 2 individuals) |
+Definition at line 36 of file moeoElitistReplacement.h. +
| moeoElitistReplacement< MOEOT >::moeoElitistReplacement | +( | +moeoFitnessAssignment< MOEOT > & | +_fitnessAssignment, | +|
| + | + | moeoDiversityAssignment< MOEOT > & | +_diversityAssignment | + |
| + | ) | + [inline] |
+
+Constructor without comparator. +
+A moeoFitThenDivComparator is used as default.
| _fitnessAssignment | the fitness assignment strategy | |
| _diversityAssignment | the diversity assignment strategy |
+Definition at line 46 of file moeoElitistReplacement.h. +
| moeoElitistReplacement< MOEOT >::moeoElitistReplacement | +( | +moeoFitnessAssignment< MOEOT > & | +_fitnessAssignment, | +|
| + | + | moeoComparator< MOEOT > & | +_comparator | + |
| + | ) | + [inline] |
+
+Constructor without moeoDiversityAssignement. +
+A dummy diversity is used as default.
| _fitnessAssignment | the fitness assignment strategy | |
| _comparator | the comparator (used to compare 2 individuals) |
+Definition at line 56 of file moeoElitistReplacement.h. +
| moeoElitistReplacement< MOEOT >::moeoElitistReplacement | +( | +moeoFitnessAssignment< MOEOT > & | +_fitnessAssignment | +) | + [inline] |
+
+Constructor without moeoDiversityAssignement nor moeoComparator. +
+A moeoFitThenDivComparator and a dummy diversity are used as default.
| _fitnessAssignment | the fitness assignment strategy |
+Definition at line 66 of file moeoElitistReplacement.h. +
+
| void moeoElitistReplacement< MOEOT >::operator() | +( | +eoPop< MOEOT > & | +_parents, | +|
| + | + | eoPop< MOEOT > & | +_offspring | + |
| + | ) | + [inline] |
+
+Replaces the first population by adding the individuals of the second one, sorting with a moeoComparator and resizing the whole population obtained. +
+
| _parents | the population composed of the parents (the population you want to replace) | |
| _offspring | the offspring population |
+Definition at line 76 of file moeoElitistReplacement.h. +
+References moeoElitistReplacement< MOEOT >::comparator, moeoElitistReplacement< MOEOT >::diversityAssignment, and moeoElitistReplacement< MOEOT >::fitnessAssignment. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoElitistReplacement_1_1Cmp-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoElitistReplacement_1_1Cmp-members.html
new file mode 100644
index 000000000..ec258e961
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoElitistReplacement_1_1Cmp-members.html
@@ -0,0 +1,39 @@
+
+
+| Cmp(moeoComparator< MOEOT > &_comp) | moeoElitistReplacement< MOEOT >::Cmp | [inline] |
| comp | moeoElitistReplacement< MOEOT >::Cmp | [private] |
| operator()(const MOEOT &_moeo1, const MOEOT &_moeo2) | moeoElitistReplacement< MOEOT >::Cmp | [inline] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoElitistReplacement_1_1Cmp.html b/trunk/paradiseo-moeo/doc/html/classmoeoElitistReplacement_1_1Cmp.html
new file mode 100644
index 000000000..4ff66cc1f
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoElitistReplacement_1_1Cmp.html
@@ -0,0 +1,100 @@
+
+
+
+#include <moeoElitistReplacement.h>
+
Public Member Functions | |
| Cmp (moeoComparator< MOEOT > &_comp) | |
| Ctor. | |
| +bool | operator() (const MOEOT &_moeo1, const MOEOT &_moeo2) |
| Returns true if _moeo1 is greater than _moeo2 according to the comparator _moeo1 the first individual _moeo2 the first individual. | |
Private Attributes | |
| +moeoComparator< MOEOT > & | comp |
| the comparator | |
+ +
+Definition at line 105 of file moeoElitistReplacement.h.
| moeoElitistReplacement< MOEOT >::Cmp::Cmp | +( | +moeoComparator< MOEOT > & | +_comp | +) | + [inline] |
+
+Ctor. +
+
| _comp | the comparator |
+Definition at line 112 of file moeoElitistReplacement.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEntropyMetric-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoEntropyMetric-members.html
new file mode 100644
index 000000000..80753910f
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEntropyMetric-members.html
@@ -0,0 +1,50 @@
+
+
+| computeUnion(const std::vector< ObjectiveVector > &_f1, const std::vector< ObjectiveVector > &_f2, std::vector< ObjectiveVector > &_f) | moeoEntropyMetric< ObjectiveVector > | [inline, private] |
| euclidianDistance(const ObjectiveVector &_set1, const ObjectiveVector &_to, unsigned int _deg=2) | moeoEntropyMetric< ObjectiveVector > | [inline, private] |
| functor_category() | eoBF< A1, A2, R > | [static] |
| howManyInNicheOf(const std::vector< ObjectiveVector > &_f, const ObjectiveVector &_s, unsigned int _size) | moeoEntropyMetric< ObjectiveVector > | [inline, private] |
| normalize(std::vector< ObjectiveVector > &_f) | moeoEntropyMetric< ObjectiveVector > | [inline, private] |
| operator()(const std::vector< ObjectiveVector > &_set1, const std::vector< ObjectiveVector > &_set2) | moeoEntropyMetric< ObjectiveVector > | [inline] |
| moeoVectorVsVectorBinaryMetric< ObjectiveVector, double >::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| paretoComparator | moeoEntropyMetric< ObjectiveVector > | [private] |
| prenormalize(const std::vector< ObjectiveVector > &_f) | moeoEntropyMetric< ObjectiveVector > | [inline, private] |
| removeDominated(std::vector< ObjectiveVector > &_f) | moeoEntropyMetric< ObjectiveVector > | [inline, private] |
| vect_max_val | moeoEntropyMetric< ObjectiveVector > | [private] |
| vect_min_val | moeoEntropyMetric< ObjectiveVector > | [private] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEntropyMetric.html b/trunk/paradiseo-moeo/doc/html/classmoeoEntropyMetric.html
new file mode 100644
index 000000000..b183dd0e3
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEntropyMetric.html
@@ -0,0 +1,303 @@
+
+
+
+#include <moeoEntropyMetric.h>
+
+
Inheritance diagram for moeoEntropyMetric< ObjectiveVector >: +
Public Member Functions | |
| double | operator() (const std::vector< ObjectiveVector > &_set1, const std::vector< ObjectiveVector > &_set2) |
| Returns the entropy of the Pareto set '_set1' relatively to the Pareto set '_set2'. | |
Private Member Functions | |
| void | removeDominated (std::vector< ObjectiveVector > &_f) |
| Removes the dominated individuals contained in _f. | |
| void | prenormalize (const std::vector< ObjectiveVector > &_f) |
| Prenormalization. | |
| void | normalize (std::vector< ObjectiveVector > &_f) |
| Normalization. | |
| void | computeUnion (const std::vector< ObjectiveVector > &_f1, const std::vector< ObjectiveVector > &_f2, std::vector< ObjectiveVector > &_f) |
| Computation of the union of _f1 and _f2 in _f. | |
| +unsigned int | howManyInNicheOf (const std::vector< ObjectiveVector > &_f, const ObjectiveVector &_s, unsigned int _size) |
| How many in niche. | |
| +double | euclidianDistance (const ObjectiveVector &_set1, const ObjectiveVector &_to, unsigned int _deg=2) |
| Euclidian distance. | |
Private Attributes | |
| +std::vector< double > | vect_min_val |
| vector of min values | |
| +std::vector< double > | vect_max_val |
| vector of max values | |
|
+moeoParetoObjectiveVectorComparator< + ObjectiveVector > | paretoComparator |
| Functor to compare two objective vectors according to Pareto dominance relation. | |
+of the 2002 Congress on Evolutionary Computation, IEEE Press, pp. 1155-1156) +
+ +
+Definition at line 25 of file moeoEntropyMetric.h.
| double moeoEntropyMetric< ObjectiveVector >::operator() | +( | +const std::vector< ObjectiveVector > & | +_set1, | +|
| + | + | const std::vector< ObjectiveVector > & | +_set2 | + |
| + | ) | + [inline] |
+
+Returns the entropy of the Pareto set '_set1' relatively to the Pareto set '_set2'. +
+
| _set1 | the first Pareto set | |
| _set2 | the second Pareto set |
+Definition at line 34 of file moeoEntropyMetric.h. +
+References moeoEntropyMetric< ObjectiveVector >::computeUnion(), moeoEntropyMetric< ObjectiveVector >::howManyInNicheOf(), moeoEntropyMetric< ObjectiveVector >::normalize(), moeoEntropyMetric< ObjectiveVector >::prenormalize(), and moeoEntropyMetric< ObjectiveVector >::removeDominated(). +
| void moeoEntropyMetric< ObjectiveVector >::removeDominated | +( | +std::vector< ObjectiveVector > & | +_f | +) | + [inline, private] |
+
+Removes the dominated individuals contained in _f. +
+
| _f | a Pareto set |
+Definition at line 85 of file moeoEntropyMetric.h. +
+References moeoEntropyMetric< ObjectiveVector >::paretoComparator. +
+Referenced by moeoEntropyMetric< ObjectiveVector >::operator()(). +
| void moeoEntropyMetric< ObjectiveVector >::prenormalize | +( | +const std::vector< ObjectiveVector > & | +_f | +) | + [inline, private] |
+
+Prenormalization. +
+
| _f | a Pareto set |
+Definition at line 107 of file moeoEntropyMetric.h. +
+References moeoEntropyMetric< ObjectiveVector >::vect_max_val, and moeoEntropyMetric< ObjectiveVector >::vect_min_val. +
+Referenced by moeoEntropyMetric< ObjectiveVector >::operator()(). +
| void moeoEntropyMetric< ObjectiveVector >::normalize | +( | +std::vector< ObjectiveVector > & | +_f | +) | + [inline, private] |
+
+Normalization. +
+
| _f | a Pareto set |
+Definition at line 129 of file moeoEntropyMetric.h. +
+References moeoEntropyMetric< ObjectiveVector >::vect_max_val, and moeoEntropyMetric< ObjectiveVector >::vect_min_val. +
+Referenced by moeoEntropyMetric< ObjectiveVector >::operator()(). +
| void moeoEntropyMetric< ObjectiveVector >::computeUnion | +( | +const std::vector< ObjectiveVector > & | +_f1, | +|
| + | + | const std::vector< ObjectiveVector > & | +_f2, | +|
| + | + | std::vector< ObjectiveVector > & | +_f | + |
| + | ) | + [inline, private] |
+
+Computation of the union of _f1 and _f2 in _f. +
+
| _f1 | the first Pareto set | |
| _f2 | the second Pareto set | |
| _f | the final Pareto set |
+Definition at line 142 of file moeoEntropyMetric.h. +
+Referenced by moeoEntropyMetric< ObjectiveVector >::operator()(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEnvironmentalReplacement-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoEnvironmentalReplacement-members.html
new file mode 100644
index 000000000..7c0575ed8
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEnvironmentalReplacement-members.html
@@ -0,0 +1,51 @@
+
+
+| comparator | moeoEnvironmentalReplacement< MOEOT > | [protected] |
| defaultComparator | moeoEnvironmentalReplacement< MOEOT > | [protected] |
| defaultDiversity | moeoEnvironmentalReplacement< MOEOT > | [protected] |
| diversityAssignment | moeoEnvironmentalReplacement< MOEOT > | [protected] |
| fitnessAssignment | moeoEnvironmentalReplacement< MOEOT > | [protected] |
| functor_category() | eoBF< A1, A2, R > | [static] |
| moeoEnvironmentalReplacement(moeoFitnessAssignment< MOEOT > &_fitnessAssignment, moeoDiversityAssignment< MOEOT > &_diversityAssignment, moeoComparator< MOEOT > &_comparator) | moeoEnvironmentalReplacement< MOEOT > | [inline] |
| moeoEnvironmentalReplacement(moeoFitnessAssignment< MOEOT > &_fitnessAssignment, moeoDiversityAssignment< MOEOT > &_diversityAssignment) | moeoEnvironmentalReplacement< MOEOT > | [inline] |
| moeoEnvironmentalReplacement(moeoFitnessAssignment< MOEOT > &_fitnessAssignment, moeoComparator< MOEOT > &_comparator) | moeoEnvironmentalReplacement< MOEOT > | [inline] |
| moeoEnvironmentalReplacement(moeoFitnessAssignment< MOEOT > &_fitnessAssignment) | moeoEnvironmentalReplacement< MOEOT > | [inline] |
| ObjectiveVector typedef | moeoEnvironmentalReplacement< MOEOT > | |
| operator()(eoPop< MOEOT > &_parents, eoPop< MOEOT > &_offspring) | moeoEnvironmentalReplacement< MOEOT > | [inline] |
| moeoReplacement::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEnvironmentalReplacement.html b/trunk/paradiseo-moeo/doc/html/classmoeoEnvironmentalReplacement.html
new file mode 100644
index 000000000..70ba80b14
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEnvironmentalReplacement.html
@@ -0,0 +1,315 @@
+
+
+
+#include <moeoEnvironmentalReplacement.h>
+
+
Inheritance diagram for moeoEnvironmentalReplacement< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| The type for objective vector. | |
Public Member Functions | |
| moeoEnvironmentalReplacement (moeoFitnessAssignment< MOEOT > &_fitnessAssignment, moeoDiversityAssignment< MOEOT > &_diversityAssignment, moeoComparator< MOEOT > &_comparator) | |
| Full constructor. | |
| moeoEnvironmentalReplacement (moeoFitnessAssignment< MOEOT > &_fitnessAssignment, moeoDiversityAssignment< MOEOT > &_diversityAssignment) | |
| Constructor without comparator. | |
| moeoEnvironmentalReplacement (moeoFitnessAssignment< MOEOT > &_fitnessAssignment, moeoComparator< MOEOT > &_comparator) | |
| Constructor without moeoDiversityAssignement. | |
| moeoEnvironmentalReplacement (moeoFitnessAssignment< MOEOT > &_fitnessAssignment) | |
| Constructor without moeoDiversityAssignement nor moeoComparator. | |
| void | operator() (eoPop< MOEOT > &_parents, eoPop< MOEOT > &_offspring) |
| Replaces the first population by adding the individuals of the second one, sorting with a moeoComparator and resizing the whole population obtained. | |
Protected Attributes | |
| +moeoFitnessAssignment< MOEOT > & | fitnessAssignment |
| the fitness assignment strategy | |
| +moeoDiversityAssignment< MOEOT > & | diversityAssignment |
| the diversity assignment strategy | |
|
+moeoDummyDiversityAssignment< + MOEOT > | defaultDiversity |
| a dummy diversity assignment can be used as default | |
|
+moeoFitnessThenDiversityComparator< + MOEOT > | defaultComparator |
| a fitness then diversity comparator can be used as default | |
| +moeoEnvironmentalReplacement::Cmp | comparator |
| this object is used to compare solutions in order to sort the population | |
Classes | |
| class | Cmp |
| this object is used to compare solutions in order to sort the population More... | |
+ +
+Definition at line 26 of file moeoEnvironmentalReplacement.h.
| moeoEnvironmentalReplacement< MOEOT >::moeoEnvironmentalReplacement | +( | +moeoFitnessAssignment< MOEOT > & | +_fitnessAssignment, | +|
| + | + | moeoDiversityAssignment< MOEOT > & | +_diversityAssignment, | +|
| + | + | moeoComparator< MOEOT > & | +_comparator | + |
| + | ) | + [inline] |
+
+Full constructor. +
+
| _fitnessAssignment | the fitness assignment strategy | |
| _diversityAssignment | the diversity assignment strategy | |
| _comparator | the comparator (used to compare 2 individuals) |
+Definition at line 40 of file moeoEnvironmentalReplacement.h. +
| moeoEnvironmentalReplacement< MOEOT >::moeoEnvironmentalReplacement | +( | +moeoFitnessAssignment< MOEOT > & | +_fitnessAssignment, | +|
| + | + | moeoDiversityAssignment< MOEOT > & | +_diversityAssignment | + |
| + | ) | + [inline] |
+
+Constructor without comparator. +
+A moeoFitThenDivComparator is used as default.
| _fitnessAssignment | the fitness assignment strategy | |
| _diversityAssignment | the diversity assignment strategy |
+Definition at line 50 of file moeoEnvironmentalReplacement.h. +
| moeoEnvironmentalReplacement< MOEOT >::moeoEnvironmentalReplacement | +( | +moeoFitnessAssignment< MOEOT > & | +_fitnessAssignment, | +|
| + | + | moeoComparator< MOEOT > & | +_comparator | + |
| + | ) | + [inline] |
+
+Constructor without moeoDiversityAssignement. +
+A dummy diversity is used as default.
| _fitnessAssignment | the fitness assignment strategy | |
| _comparator | the comparator (used to compare 2 individuals) |
+Definition at line 60 of file moeoEnvironmentalReplacement.h. +
| moeoEnvironmentalReplacement< MOEOT >::moeoEnvironmentalReplacement | +( | +moeoFitnessAssignment< MOEOT > & | +_fitnessAssignment | +) | + [inline] |
+
+Constructor without moeoDiversityAssignement nor moeoComparator. +
+A moeoFitThenDivComparator and a dummy diversity are used as default.
| _fitnessAssignment | the fitness assignment strategy |
+Definition at line 70 of file moeoEnvironmentalReplacement.h. +
+
| void moeoEnvironmentalReplacement< MOEOT >::operator() | +( | +eoPop< MOEOT > & | +_parents, | +|
| + | + | eoPop< MOEOT > & | +_offspring | + |
| + | ) | + [inline] |
+
+Replaces the first population by adding the individuals of the second one, sorting with a moeoComparator and resizing the whole population obtained. +
+
| _parents | the population composed of the parents (the population you want to replace) | |
| _offspring | the offspring population |
+Definition at line 80 of file moeoEnvironmentalReplacement.h. +
+References moeoEnvironmentalReplacement< MOEOT >::comparator, moeoEnvironmentalReplacement< MOEOT >::diversityAssignment, and moeoEnvironmentalReplacement< MOEOT >::fitnessAssignment. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEnvironmentalReplacement_1_1Cmp-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoEnvironmentalReplacement_1_1Cmp-members.html
new file mode 100644
index 000000000..c6494b0f6
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEnvironmentalReplacement_1_1Cmp-members.html
@@ -0,0 +1,39 @@
+
+
+| Cmp(moeoComparator< MOEOT > &_comp) | moeoEnvironmentalReplacement< MOEOT >::Cmp | [inline] |
| comp | moeoEnvironmentalReplacement< MOEOT >::Cmp | [private] |
| operator()(const MOEOT &_moeo1, const MOEOT &_moeo2) | moeoEnvironmentalReplacement< MOEOT >::Cmp | [inline] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEnvironmentalReplacement_1_1Cmp.html b/trunk/paradiseo-moeo/doc/html/classmoeoEnvironmentalReplacement_1_1Cmp.html
new file mode 100644
index 000000000..2665fc10d
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEnvironmentalReplacement_1_1Cmp.html
@@ -0,0 +1,100 @@
+
+
+
+#include <moeoEnvironmentalReplacement.h>
+
Public Member Functions | |
| Cmp (moeoComparator< MOEOT > &_comp) | |
| Ctor. | |
| +bool | operator() (const MOEOT &_moeo1, const MOEOT &_moeo2) |
| Returns true if _moeo1 is greater than _moeo2 according to the comparator _moeo1 the first individual _moeo2 the first individual. | |
Private Attributes | |
| +moeoComparator< MOEOT > & | comp |
| the comparator | |
+ +
+Definition at line 121 of file moeoEnvironmentalReplacement.h.
| moeoEnvironmentalReplacement< MOEOT >::Cmp::Cmp | +( | +moeoComparator< MOEOT > & | +_comp | +) | + [inline] |
+
+Ctor. +
+
| _comp | the comparator |
+Definition at line 128 of file moeoEnvironmentalReplacement.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEuclideanDistance-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoEuclideanDistance-members.html
new file mode 100644
index 000000000..14fad514c
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEuclideanDistance-members.html
@@ -0,0 +1,48 @@
+
+
+| bounds | moeoNormalizedDistance< MOEOT > | [protected] |
| functor_category() | eoBF< A1, A2, R > | [static] |
| moeoNormalizedDistance() | moeoNormalizedDistance< MOEOT > | [inline] |
| ObjectiveVector typedef | moeoEuclideanDistance< MOEOT > | |
| operator()(const MOEOT &_moeo1, const MOEOT &_moeo2) | moeoEuclideanDistance< MOEOT > | [inline] |
| moeoNormalizedDistance< MOEOT >::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| setup(const eoPop< MOEOT > &_pop) | moeoNormalizedDistance< MOEOT > | [inline, virtual] |
| setup(double _min, double _max, unsigned int _obj) | moeoNormalizedDistance< MOEOT > | [inline, virtual] |
| setup(eoRealInterval _realInterval, unsigned int _obj) | moeoNormalizedDistance< MOEOT > | [inline, virtual] |
| tiny() | moeoNormalizedDistance< MOEOT > | [inline, static] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEuclideanDistance.html b/trunk/paradiseo-moeo/doc/html/classmoeoEuclideanDistance.html
new file mode 100644
index 000000000..937382f6e
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEuclideanDistance.html
@@ -0,0 +1,116 @@
+
+
+
+#include <moeoEuclideanDistance.h>
+
+
Inheritance diagram for moeoEuclideanDistance< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| the objective vector type of the solutions | |
Public Member Functions | |
| const double | operator() (const MOEOT &_moeo1, const MOEOT &_moeo2) |
| Returns the euclidian distance between _moeo1 and _moeo2 in the objective space. | |
+between 0 and 1). A distance value then lies between 0 and sqrt(nObjectives). +
+ +
+Definition at line 24 of file moeoEuclideanDistance.h.
| const double moeoEuclideanDistance< MOEOT >::operator() | +( | +const MOEOT & | +_moeo1, | +|
| + | + | const MOEOT & | +_moeo2 | + |
| + | ) | + [inline] |
+
+Returns the euclidian distance between _moeo1 and _moeo2 in the objective space. +
+
| _moeo1 | the first solution | |
| _moeo2 | the second solution |
+Definition at line 37 of file moeoEuclideanDistance.h. +
+References moeoNormalizedDistance< MOEOT >::bounds. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEvalFunc-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoEvalFunc-members.html
new file mode 100644
index 000000000..541d2d43d
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEvalFunc-members.html
@@ -0,0 +1,42 @@
+
+
+| EOFitT typedef | eoEvalFunc< MOEOT > | |
| EOType typedef | eoEvalFunc< MOEOT > | |
| functor_category() | eoUF< A1, R > | [static] |
| operator()(A1)=0 | eoUF< A1, R > | [pure virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A1, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoEvalFunc.html b/trunk/paradiseo-moeo/doc/html/classmoeoEvalFunc.html
new file mode 100644
index 000000000..8bf2b9582
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoEvalFunc.html
@@ -0,0 +1,55 @@
+
+
+Inheritance diagram for moeoEvalFunc< MOEOT >: +
+ +
+Definition at line 22 of file moeoEvalFunc.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoExpBinaryIndicatorBasedFitnessAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoExpBinaryIndicatorBasedFitnessAssignment-members.html
new file mode 100644
index 000000000..3e356238c
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoExpBinaryIndicatorBasedFitnessAssignment-members.html
@@ -0,0 +1,52 @@
+
+
+| computeFitness(const unsigned int _idx) | moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT > | [inline, protected] |
| computeValues(const eoPop< MOEOT > &_pop) | moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT > | [inline, protected] |
| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| kappa | moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT > | [protected] |
| metric | moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT > | [protected] |
| moeoExpBinaryIndicatorBasedFitnessAssignment(moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > &_metric, const double _kappa=0.05) | moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT > | [inline] |
| ObjectiveVector typedef | moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &_pop) | moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT > | [inline, virtual] |
| setFitnesses(eoPop< MOEOT > &_pop) | moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT > | [inline, protected] |
| setup(const eoPop< MOEOT > &_pop) | moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT > | [inline, protected] |
| updateByAdding(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) | moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT > | [inline] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) | moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT > | [inline, virtual] |
| moeoBinaryIndicatorBasedFitnessAssignment::updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoFitnessAssignment< MOEOT > | [inline] |
| values | moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT > | [protected] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoExpBinaryIndicatorBasedFitnessAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoExpBinaryIndicatorBasedFitnessAssignment.html
new file mode 100644
index 000000000..0f2e3aacc
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoExpBinaryIndicatorBasedFitnessAssignment.html
@@ -0,0 +1,416 @@
+
+
+
+#include <moeoExpBinaryIndicatorBasedFitnessAssignment.h>
+
+
Inheritance diagram for moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| The type of objective vector. | |
Public Member Functions | |
| moeoExpBinaryIndicatorBasedFitnessAssignment (moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > &_metric, const double _kappa=0.05) | |
| Ctor. | |
| void | operator() (eoPop< MOEOT > &_pop) |
| Sets the fitness values for every solution contained in the population _pop. | |
| void | updateByDeleting (eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) |
| Updates the fitness values of the whole population _pop by taking the deletion of the objective vector _objVec into account. | |
| double | updateByAdding (eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) |
| Updates the fitness values of the whole population _pop by taking the adding of the objective vector _objVec into account and returns the fitness value of _objVec. | |
Protected Member Functions | |
| void | setup (const eoPop< MOEOT > &_pop) |
| Sets the bounds for every objective using the min and the max value for every objective vector of _pop. | |
| void | computeValues (const eoPop< MOEOT > &_pop) |
| Compute every indicator value in values (values[i] = I(_v[i], _o)). | |
| void | setFitnesses (eoPop< MOEOT > &_pop) |
| Sets the fitness value of the whple population. | |
| double | computeFitness (const unsigned int _idx) |
| Returns the fitness value of the _idx th individual of the population. | |
Protected Attributes | |
|
+moeoNormalizedSolutionVsSolutionBinaryMetric< + ObjectiveVector, double > & | metric |
| the quality indicator | |
| +double | kappa |
| the scaling factor | |
|
+std::vector< std::vector< + double > > | values |
| the computed indicator values | |
+Zitzler, S. Künzli, "Indicator-Based Selection in Multiobjective Search", Proc. 8th International Conference on Parallel Problem Solving from Nature (PPSN VIII), pp. 832-842, Birmingham, UK (2004). This strategy is, for instance, used in IBEA. +
+ +
+Definition at line 29 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h.
| moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::moeoExpBinaryIndicatorBasedFitnessAssignment | +( | +moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > & | +_metric, | +|
| + | + | const double | + _kappa = 0.05 | + |
| + | ) | + [inline] |
+
+Ctor. +
+
| _metric | the quality indicator | |
| _kappa | the scaling factor |
+Definition at line 42 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +
+
| void moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::operator() | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, virtual] |
+
+Sets the fitness values for every solution contained in the population _pop. +
+
| _pop | the population |
+Implements eoUF< eoPop< MOEOT > &, void >. +
+Definition at line 50 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +
+References moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::computeValues(), moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::setFitnesses(), and moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::setup(). +
| void moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::updateByDeleting | +( | +eoPop< MOEOT > & | +_pop, | +|
| + | + | ObjectiveVector & | +_objVec | + |
| + | ) | + [inline, virtual] |
+
+Updates the fitness values of the whole population _pop by taking the deletion of the objective vector _objVec into account. +
+
| _pop | the population | |
| _objVec | the objective vector |
+Implements moeoFitnessAssignment< MOEOT >. +
+Definition at line 66 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +
+References moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::kappa, and moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::metric. +
| double moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::updateByAdding | +( | +eoPop< MOEOT > & | +_pop, | +|
| + | + | ObjectiveVector & | +_objVec | + |
| + | ) | + [inline] |
+
+Updates the fitness values of the whole population _pop by taking the adding of the objective vector _objVec into account and returns the fitness value of _objVec. +
+
| _pop | the population | |
| _objVec | the objective vector |
+Definition at line 87 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +
+References moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::kappa, and moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::metric. +
| void moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::setup | +( | +const eoPop< MOEOT > & | +_pop | +) | + [inline, protected] |
+
+Sets the bounds for every objective using the min and the max value for every objective vector of _pop. +
+
| _pop | the population |
+Definition at line 130 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +
+References moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::metric, and moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R >::setup(). +
+Referenced by moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::operator()(). +
| void moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::computeValues | +( | +const eoPop< MOEOT > & | +_pop | +) | + [inline, protected] |
+
+Compute every indicator value in values (values[i] = I(_v[i], _o)). +
+
| _pop | the population |
+Definition at line 152 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +
+References moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::metric, and moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::values. +
+Referenced by moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::operator()(). +
| void moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::setFitnesses | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, protected] |
+
+Sets the fitness value of the whple population. +
+
| _pop | the population |
+Definition at line 174 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +
+References moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::computeFitness(). +
+Referenced by moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::operator()(). +
| double moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::computeFitness | +( | +const unsigned int | +_idx | +) | + [inline, protected] |
+
+Returns the fitness value of the _idx th individual of the population. +
+
| _idx | the index |
+Definition at line 187 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +
+References moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::kappa, and moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::values. +
+Referenced by moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::setFitnesses(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoFastNonDominatedSortingFitnessAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoFastNonDominatedSortingFitnessAssignment-members.html
new file mode 100644
index 000000000..ecd81a6d2
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoFastNonDominatedSortingFitnessAssignment-members.html
@@ -0,0 +1,51 @@
+
+
+| comparator | moeoFastNonDominatedSortingFitnessAssignment< MOEOT > | [private] |
| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| mObjectives(eoPop< MOEOT > &_pop) | moeoFastNonDominatedSortingFitnessAssignment< MOEOT > | [inline, private] |
| moeoFastNonDominatedSortingFitnessAssignment() | moeoFastNonDominatedSortingFitnessAssignment< MOEOT > | [inline] |
| moeoFastNonDominatedSortingFitnessAssignment(moeoObjectiveVectorComparator< ObjectiveVector > &_comparator) | moeoFastNonDominatedSortingFitnessAssignment< MOEOT > | [inline] |
| objComparator | moeoFastNonDominatedSortingFitnessAssignment< MOEOT > | [private] |
| ObjectiveVector typedef | moeoFastNonDominatedSortingFitnessAssignment< MOEOT > | |
| oneObjective(eoPop< MOEOT > &_pop) | moeoFastNonDominatedSortingFitnessAssignment< MOEOT > | [inline, private] |
| operator()(eoPop< MOEOT > &_pop) | moeoFastNonDominatedSortingFitnessAssignment< MOEOT > | [inline, virtual] |
| paretoComparator | moeoFastNonDominatedSortingFitnessAssignment< MOEOT > | [private] |
| twoObjectives(eoPop< MOEOT > &_pop) | moeoFastNonDominatedSortingFitnessAssignment< MOEOT > | [inline, private] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) | moeoFastNonDominatedSortingFitnessAssignment< MOEOT > | [inline, virtual] |
| moeoParetoBasedFitnessAssignment::updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoFitnessAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoFastNonDominatedSortingFitnessAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoFastNonDominatedSortingFitnessAssignment.html
new file mode 100644
index 000000000..439ee1774
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoFastNonDominatedSortingFitnessAssignment.html
@@ -0,0 +1,325 @@
+
+
+
+#include <moeoFastNonDominatedSortingFitnessAssignment.h>
+
+
Inheritance diagram for moeoFastNonDominatedSortingFitnessAssignment< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| the objective vector type of the solutions | |
Public Member Functions | |
| + | moeoFastNonDominatedSortingFitnessAssignment () |
| Default ctor. | |
| moeoFastNonDominatedSortingFitnessAssignment (moeoObjectiveVectorComparator< ObjectiveVector > &_comparator) | |
| Ctor where you can choose your own way to compare objective vectors. | |
| void | operator() (eoPop< MOEOT > &_pop) |
| Sets the fitness values for every solution contained in the population _pop. | |
| void | updateByDeleting (eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) |
| Updates the fitness values of the whole population _pop by taking the deletion of the objective vector _objVec into account. | |
Private Member Functions | |
| void | oneObjective (eoPop< MOEOT > &_pop) |
| Sets the fitness values for mono-objective problems. | |
| void | twoObjectives (eoPop< MOEOT > &_pop) |
| Sets the fitness values for bi-objective problems with a complexity of O(n log n), where n stands for the population size. | |
| void | mObjectives (eoPop< MOEOT > &_pop) |
| Sets the fitness values for problems with more than two objectives with a complexity of O(n² log n), where n stands for the population size. | |
Private Attributes | |
|
+moeoObjectiveVectorComparator< + ObjectiveVector > & | comparator |
| Functor to compare two objective vectors. | |
|
+moeoParetoObjectiveVectorComparator< + ObjectiveVector > | paretoComparator |
| Functor to compare two objective vectors according to Pareto dominance relation. | |
| +moeoFastNonDominatedSortingFitnessAssignment::ObjectiveComparator | objComparator |
| Functor allowing to compare two solutions according to their first objective value, then their second, and so on. | |
Classes | |
| class | ObjectiveComparator |
| Functor allowing to compare two solutions according to their first objective value, then their second, and so on. More... | |
+Srinivas, K. Deb, "Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms", Evolutionary Computation vol. 2, no. 3, pp. 221-248 (1994) and in: K. Deb, A. Pratap, S. Agarwal, T. Meyarivan, "A Fast and Elitist Multi-Objective Genetic Algorithm: NSGA-II", IEEE Transactions on Evolutionary Computation, vol. 6, no. 2 (2002). This strategy is, for instance, used in NSGA and NSGA-II. +
+ +
+Definition at line 32 of file moeoFastNonDominatedSortingFitnessAssignment.h.
| moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::moeoFastNonDominatedSortingFitnessAssignment | +( | +moeoObjectiveVectorComparator< ObjectiveVector > & | +_comparator | +) | + [inline] |
+
+Ctor where you can choose your own way to compare objective vectors. +
+
| _comparator | the functor used to compare objective vectors |
+Definition at line 51 of file moeoFastNonDominatedSortingFitnessAssignment.h. +
+
| void moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::operator() | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, virtual] |
+
+Sets the fitness values for every solution contained in the population _pop. +
+
| _pop | the population |
+Implements eoUF< eoPop< MOEOT > &, void >. +
+Definition at line 59 of file moeoFastNonDominatedSortingFitnessAssignment.h. +
+References moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::mObjectives(), and moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::oneObjective(). +
| void moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::updateByDeleting | +( | +eoPop< MOEOT > & | +_pop, | +|
| + | + | ObjectiveVector & | +_objVec | + |
| + | ) | + [inline, virtual] |
+
+Updates the fitness values of the whole population _pop by taking the deletion of the objective vector _objVec into account. +
+
| _pop | the population | |
| _objVec | the objective vector |
+Implements moeoFitnessAssignment< MOEOT >. +
+Definition at line 101 of file moeoFastNonDominatedSortingFitnessAssignment.h. +
+References moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::comparator. +
| void moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::oneObjective | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, private] |
+
+Sets the fitness values for mono-objective problems. +
+
| _pop | the population |
+Definition at line 143 of file moeoFastNonDominatedSortingFitnessAssignment.h. +
+References moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::objComparator. +
+Referenced by moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::operator()(). +
| void moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::twoObjectives | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, private] |
+
+Sets the fitness values for bi-objective problems with a complexity of O(n log n), where n stands for the population size. +
+
| _pop | the population |
+Definition at line 165 of file moeoFastNonDominatedSortingFitnessAssignment.h. +
| void moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::mObjectives | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, private] |
+
+Sets the fitness values for problems with more than two objectives with a complexity of O(n² log n), where n stands for the population size. +
+
| _pop | the population |
+Definition at line 175 of file moeoFastNonDominatedSortingFitnessAssignment.h. +
+References moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::comparator. +
+Referenced by moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::operator()(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoFastNonDominatedSortingFitnessAssignment_1_1ObjectiveComparator-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoFastNonDominatedSortingFitnessAssignment_1_1ObjectiveComparator-members.html
new file mode 100644
index 000000000..2ae9a8310
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoFastNonDominatedSortingFitnessAssignment_1_1ObjectiveComparator-members.html
@@ -0,0 +1,42 @@
+
+
+| cmp | moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator | [private] |
| functor_category() | eoBF< A1, A2, R > | [static] |
| operator()(const MOEOT &_moeo1, const MOEOT &_moeo2) | moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator | [inline] |
| moeoComparator::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoFastNonDominatedSortingFitnessAssignment_1_1ObjectiveComparator.html b/trunk/paradiseo-moeo/doc/html/classmoeoFastNonDominatedSortingFitnessAssignment_1_1ObjectiveComparator.html
new file mode 100644
index 000000000..b3fd37932
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoFastNonDominatedSortingFitnessAssignment_1_1ObjectiveComparator.html
@@ -0,0 +1,114 @@
+
+
++
Inheritance diagram for moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator: +
Public Member Functions | |
| const bool | operator() (const MOEOT &_moeo1, const MOEOT &_moeo2) |
| Returns true if _moeo1 < _moeo2 on the first objective, then on the second, and so on. | |
Private Attributes | |
|
+moeoObjectiveObjectiveVectorComparator< + ObjectiveVector > | cmp |
| the corresponding comparator for objective vectors | |
+ +
+Definition at line 121 of file moeoFastNonDominatedSortingFitnessAssignment.h.
| const bool moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator::operator() | +( | +const MOEOT & | +_moeo1, | +|
| + | + | const MOEOT & | +_moeo2 | + |
| + | ) | + [inline] |
+
+Returns true if _moeo1 < _moeo2 on the first objective, then on the second, and so on. +
+
| _moeo1 | the first solution | |
| _moeo2 | the second solution |
+Definition at line 129 of file moeoFastNonDominatedSortingFitnessAssignment.h. +
+References moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator::cmp. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoFitnessAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoFitnessAssignment-members.html
new file mode 100644
index 000000000..2c6fcac80
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoFitnessAssignment-members.html
@@ -0,0 +1,43 @@
+
+
+| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| ObjectiveVector typedef | moeoFitnessAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &)=0 | eoUF< eoPop< MOEOT > &, void > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec)=0 | moeoFitnessAssignment< MOEOT > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoFitnessAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoFitnessAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoFitnessAssignment.html
new file mode 100644
index 000000000..6163e7bba
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoFitnessAssignment.html
@@ -0,0 +1,168 @@
+
+
+
+#include <moeoFitnessAssignment.h>
+
+
Inheritance diagram for moeoFitnessAssignment< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| The type for objective vector. | |
Public Member Functions | |
| virtual void | updateByDeleting (eoPop< MOEOT > &_pop, ObjectiveVector &_objVec)=0 |
| Updates the fitness values of the whole population _pop by taking the deletion of the objective vector _objVec into account. | |
| void | updateByDeleting (eoPop< MOEOT > &_pop, MOEOT &_moeo) |
| Updates the fitness values of the whole population _pop by taking the deletion of the individual _moeo into account. | |
+ +
+Definition at line 23 of file moeoFitnessAssignment.h.
| virtual void moeoFitnessAssignment< MOEOT >::updateByDeleting | +( | +eoPop< MOEOT > & | +_pop, | +|
| + | + | ObjectiveVector & | +_objVec | + |
| + | ) | + [pure virtual] |
+
+Updates the fitness values of the whole population _pop by taking the deletion of the objective vector _objVec into account. +
+
| _pop | the population | |
| _objVec | the objective vector |
+Implemented in moeoAchievementFitnessAssignment< MOEOT >, moeoDummyFitnessAssignment< MOEOT >, moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >, and moeoFastNonDominatedSortingFitnessAssignment< MOEOT >. +
+Referenced by moeoFitnessAssignment< MOEOT >::updateByDeleting(). +
| void moeoFitnessAssignment< MOEOT >::updateByDeleting | +( | +eoPop< MOEOT > & | +_pop, | +|
| + | + | MOEOT & | +_moeo | + |
| + | ) | + [inline] |
+
+Updates the fitness values of the whole population _pop by taking the deletion of the individual _moeo into account. +
+
| _pop | the population | |
| _moeo | the individual |
+Definition at line 44 of file moeoFitnessAssignment.h. +
+References moeoFitnessAssignment< MOEOT >::updateByDeleting(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoFitnessAssignment.png b/trunk/paradiseo-moeo/doc/html/classmoeoFitnessAssignment.png
new file mode 100644
index 000000000..2e0cd207d
Binary files /dev/null and b/trunk/paradiseo-moeo/doc/html/classmoeoFitnessAssignment.png differ
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoFitnessThenDiversityComparator-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoFitnessThenDiversityComparator-members.html
new file mode 100644
index 000000000..1be7077df
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoFitnessThenDiversityComparator-members.html
@@ -0,0 +1,41 @@
+
+
+| functor_category() | eoBF< A1, A2, R > | [static] |
| operator()(const MOEOT &_moeo1, const MOEOT &_moeo2) | moeoFitnessThenDiversityComparator< MOEOT > | [inline] |
| moeoComparator::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoFitnessThenDiversityComparator.html b/trunk/paradiseo-moeo/doc/html/classmoeoFitnessThenDiversityComparator.html
new file mode 100644
index 000000000..344dfc5c1
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoFitnessThenDiversityComparator.html
@@ -0,0 +1,106 @@
+
+
+
+#include <moeoFitnessThenDiversityComparator.h>
+
+
Inheritance diagram for moeoFitnessThenDiversityComparator< MOEOT >: +
Public Member Functions | |
| const bool | operator() (const MOEOT &_moeo1, const MOEOT &_moeo2) |
| Returns true if _moeo1 < _moeo2 according to their fitness values, then according to their diversity values. | |
+ +
+Definition at line 22 of file moeoFitnessThenDiversityComparator.h.
| const bool moeoFitnessThenDiversityComparator< MOEOT >::operator() | +( | +const MOEOT & | +_moeo1, | +|
| + | + | const MOEOT & | +_moeo2 | + |
| + | ) | + [inline] |
+
+Returns true if _moeo1 < _moeo2 according to their fitness values, then according to their diversity values. +
+
| _moeo1 | the first solution | |
| _moeo2 | the second solution |
+Definition at line 31 of file moeoFitnessThenDiversityComparator.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoFrontByFrontCrowdingDiversityAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoFrontByFrontCrowdingDiversityAssignment-members.html
new file mode 100644
index 000000000..68567cc0b
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoFrontByFrontCrowdingDiversityAssignment-members.html
@@ -0,0 +1,47 @@
+
+
+| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| inf() const | moeoCrowdingDiversityAssignment< MOEOT > | [inline] |
| lastIndex(eoPop< MOEOT > &_pop, unsigned int _start) | moeoFrontByFrontCrowdingDiversityAssignment< MOEOT > | [inline, private] |
| ObjectiveVector typedef | moeoFrontByFrontCrowdingDiversityAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &_pop) | moeoCrowdingDiversityAssignment< MOEOT > | [inline, virtual] |
| setDistances(eoPop< MOEOT > &_pop) | moeoFrontByFrontCrowdingDiversityAssignment< MOEOT > | [inline, private, virtual] |
| tiny() const | moeoCrowdingDiversityAssignment< MOEOT > | [inline] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) | moeoFrontByFrontCrowdingDiversityAssignment< MOEOT > | [inline, virtual] |
| moeoDiversityAssignment::updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoDiversityAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoFrontByFrontCrowdingDiversityAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoFrontByFrontCrowdingDiversityAssignment.html
new file mode 100644
index 000000000..c5971dd1b
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoFrontByFrontCrowdingDiversityAssignment.html
@@ -0,0 +1,200 @@
+
+
+
+#include <moeoFrontByFrontCrowdingDiversityAssignment.h>
+
+
Inheritance diagram for moeoFrontByFrontCrowdingDiversityAssignment< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| the objective vector type of the solutions | |
Public Member Functions | |
| void | updateByDeleting (eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) |
Private Member Functions | |
| void | setDistances (eoPop< MOEOT > &_pop) |
| Sets the distance values. | |
| unsigned int | lastIndex (eoPop< MOEOT > &_pop, unsigned int _start) |
| Returns the index of the last individual having the same fitness value than _pop[_start]. | |
+Deb, A. Pratap, S. Agarwal, T. Meyarivan, "A Fast and Elitist Multi-Objective Genetic Algorithm: NSGA-II", IEEE Transactions on Evolutionary Computation, vol. 6, no. 2 (2002). Tis strategy assigns diversity values FRONT BY FRONT. It is, for instance, used in NSGA-II. +
+ +
+Definition at line 25 of file moeoFrontByFrontCrowdingDiversityAssignment.h.
| void moeoFrontByFrontCrowdingDiversityAssignment< MOEOT >::updateByDeleting | +( | +eoPop< MOEOT > & | +_pop, | +|
| + | + | ObjectiveVector & | +_objVec | + |
| + | ) | + [inline, virtual] |
+
+
| _pop | the population | |
| _objVec | the objective vector |
+Reimplemented from moeoCrowdingDiversityAssignment< MOEOT >. +
+Definition at line 40 of file moeoFrontByFrontCrowdingDiversityAssignment.h. +
| void moeoFrontByFrontCrowdingDiversityAssignment< MOEOT >::setDistances | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, private, virtual] |
+
+Sets the distance values. +
+
| _pop | the population |
+Reimplemented from moeoCrowdingDiversityAssignment< MOEOT >. +
+Definition at line 55 of file moeoFrontByFrontCrowdingDiversityAssignment.h. +
+References moeoCrowdingDiversityAssignment< MOEOT >::inf(), moeoFrontByFrontCrowdingDiversityAssignment< MOEOT >::lastIndex(), and moeoCrowdingDiversityAssignment< MOEOT >::tiny(). +
| unsigned int moeoFrontByFrontCrowdingDiversityAssignment< MOEOT >::lastIndex | +( | +eoPop< MOEOT > & | +_pop, | +|
| + | + | unsigned int | +_start | + |
| + | ) | + [inline, private] |
+
+Returns the index of the last individual having the same fitness value than _pop[_start]. +
+
| _pop | the population | |
| _start | the index to start from |
+Definition at line 121 of file moeoFrontByFrontCrowdingDiversityAssignment.h. +
+Referenced by moeoFrontByFrontCrowdingDiversityAssignment< MOEOT >::setDistances(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoFrontByFrontSharingDiversityAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoFrontByFrontSharingDiversityAssignment-members.html
new file mode 100644
index 000000000..0a1235145
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoFrontByFrontSharingDiversityAssignment-members.html
@@ -0,0 +1,53 @@
+
+
+| alpha | moeoSharingDiversityAssignment< MOEOT > | [protected] |
| defaultDistance | moeoSharingDiversityAssignment< MOEOT > | [protected] |
| distance | moeoSharingDiversityAssignment< MOEOT > | [protected] |
| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| moeoFrontByFrontSharingDiversityAssignment(moeoDistance< MOEOT, double > &_distance, double _nicheSize=0.5, double _alpha=2.0) | moeoFrontByFrontSharingDiversityAssignment< MOEOT > | [inline] |
| moeoFrontByFrontSharingDiversityAssignment(double _nicheSize=0.5, double _alpha=2.0) | moeoFrontByFrontSharingDiversityAssignment< MOEOT > | [inline] |
| moeoSharingDiversityAssignment(moeoDistance< MOEOT, double > &_distance, double _nicheSize=0.5, double _alpha=1.0) | moeoSharingDiversityAssignment< MOEOT > | [inline] |
| moeoSharingDiversityAssignment(double _nicheSize=0.5, double _alpha=1.0) | moeoSharingDiversityAssignment< MOEOT > | [inline] |
| nicheSize | moeoSharingDiversityAssignment< MOEOT > | [protected] |
| ObjectiveVector typedef | moeoFrontByFrontSharingDiversityAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &_pop) | moeoSharingDiversityAssignment< MOEOT > | [inline, virtual] |
| setSimilarities(eoPop< MOEOT > &_pop) | moeoFrontByFrontSharingDiversityAssignment< MOEOT > | [inline, private, virtual] |
| sh(double _dist) | moeoSharingDiversityAssignment< MOEOT > | [inline, protected] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) | moeoFrontByFrontSharingDiversityAssignment< MOEOT > | [inline, virtual] |
| moeoDiversityAssignment::updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoDiversityAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoFrontByFrontSharingDiversityAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoFrontByFrontSharingDiversityAssignment.html
new file mode 100644
index 000000000..3e4cb17b2
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoFrontByFrontSharingDiversityAssignment.html
@@ -0,0 +1,248 @@
+
+
+
+#include <moeoFrontByFrontSharingDiversityAssignment.h>
+
+
Inheritance diagram for moeoFrontByFrontSharingDiversityAssignment< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| the objective vector type of the solutions | |
Public Member Functions | |
| moeoFrontByFrontSharingDiversityAssignment (moeoDistance< MOEOT, double > &_distance, double _nicheSize=0.5, double _alpha=2.0) | |
| Ctor. | |
| moeoFrontByFrontSharingDiversityAssignment (double _nicheSize=0.5, double _alpha=2.0) | |
| Ctor with an euclidean distance (with normalized objective values) in the objective space is used as default. | |
| void | updateByDeleting (eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) |
Private Member Functions | |
| void | setSimilarities (eoPop< MOEOT > &_pop) |
| Sets similarities FRONT BY FRONT for every solution contained in the population _pop. | |
+ +
+Definition at line 22 of file moeoFrontByFrontSharingDiversityAssignment.h.
| moeoFrontByFrontSharingDiversityAssignment< MOEOT >::moeoFrontByFrontSharingDiversityAssignment | +( | +moeoDistance< MOEOT, double > & | +_distance, | +|
| + | + | double | + _nicheSize = 0.5, |
+ |
| + | + | double | + _alpha = 2.0 | + |
| + | ) | + [inline] |
+
+Ctor. +
+
| _distance | the distance used to compute the neighborhood of solutions (can be related to the decision space or the objective space) | |
| _nicheSize | neighborhood size in terms of radius distance (closely related to the way the distances are computed) | |
| _alpha | parameter used to regulate the shape of the sharing function |
+Definition at line 36 of file moeoFrontByFrontSharingDiversityAssignment.h. +
| moeoFrontByFrontSharingDiversityAssignment< MOEOT >::moeoFrontByFrontSharingDiversityAssignment | +( | +double | + _nicheSize = 0.5, |
+ |
| + | + | double | + _alpha = 2.0 | + |
| + | ) | + [inline] |
+
+Ctor with an euclidean distance (with normalized objective values) in the objective space is used as default. +
+
| _nicheSize | neighborhood size in terms of radius distance (closely related to the way the distances are computed) | |
| _alpha | parameter used to regulate the shape of the sharing function |
+Definition at line 45 of file moeoFrontByFrontSharingDiversityAssignment.h. +
+
| void moeoFrontByFrontSharingDiversityAssignment< MOEOT >::updateByDeleting | +( | +eoPop< MOEOT > & | +_pop, | +|
| + | + | ObjectiveVector & | +_objVec | + |
| + | ) | + [inline, virtual] |
+
+
| _pop | the population | |
| _objVec | the objective vector |
+Reimplemented from moeoSharingDiversityAssignment< MOEOT >. +
+Definition at line 56 of file moeoFrontByFrontSharingDiversityAssignment.h. +
| void moeoFrontByFrontSharingDiversityAssignment< MOEOT >::setSimilarities | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, private, virtual] |
+
+Sets similarities FRONT BY FRONT for every solution contained in the population _pop. +
+
| _pop | the population |
+Reimplemented from moeoSharingDiversityAssignment< MOEOT >. +
+Definition at line 74 of file moeoFrontByFrontSharingDiversityAssignment.h. +
+References moeoSharingDiversityAssignment< MOEOT >::distance, moeoSharingDiversityAssignment< MOEOT >::nicheSize, and moeoSharingDiversityAssignment< MOEOT >::sh(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoGDominanceObjectiveVectorComparator-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoGDominanceObjectiveVectorComparator-members.html
new file mode 100644
index 000000000..72bc8ef61
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoGDominanceObjectiveVectorComparator-members.html
@@ -0,0 +1,45 @@
+
+
+| flag(const ObjectiveVector &_objectiveVector) | moeoGDominanceObjectiveVectorComparator< ObjectiveVector > | [inline, private] |
| functor_category() | eoBF< A1, A2, R > | [static] |
| moeoGDominanceObjectiveVectorComparator(ObjectiveVector &_ref) | moeoGDominanceObjectiveVectorComparator< ObjectiveVector > | [inline] |
| operator()(const ObjectiveVector &_objectiveVector1, const ObjectiveVector &_objectiveVector2) | moeoGDominanceObjectiveVectorComparator< ObjectiveVector > | [inline] |
| moeoObjectiveVectorComparator::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| paretoComparator | moeoGDominanceObjectiveVectorComparator< ObjectiveVector > | [private] |
| ref | moeoGDominanceObjectiveVectorComparator< ObjectiveVector > | [private] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoGDominanceObjectiveVectorComparator.html b/trunk/paradiseo-moeo/doc/html/classmoeoGDominanceObjectiveVectorComparator.html
new file mode 100644
index 000000000..c4b67ad10
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoGDominanceObjectiveVectorComparator.html
@@ -0,0 +1,194 @@
+
+
+
+#include <moeoGDominanceObjectiveVectorComparator.h>
+
+
Inheritance diagram for moeoGDominanceObjectiveVectorComparator< ObjectiveVector >: +
Public Member Functions | |
| moeoGDominanceObjectiveVectorComparator (ObjectiveVector &_ref) | |
| Ctor. | |
| const bool | operator() (const ObjectiveVector &_objectiveVector1, const ObjectiveVector &_objectiveVector2) |
| Returns true if _objectiveVector1 is g-dominated by _objectiveVector2. | |
Private Member Functions | |
| unsigned int | flag (const ObjectiveVector &_objectiveVector) |
| Returns the flag of _objectiveVector according to the reference point. | |
Private Attributes | |
| +ObjectiveVector & | ref |
| the reference point | |
|
+moeoParetoObjectiveVectorComparator< + ObjectiveVector > | paretoComparator |
| Pareto comparator. | |
+The concept of g-dominance as been introduced in: J. Molina, L. V. Santana, A. G. Hernandez-Diaz, C. A. Coello Coello, R. Caballero, "g-dominance: Reference point based dominance" (2007) +
+ +
+Definition at line 25 of file moeoGDominanceObjectiveVectorComparator.h.
| moeoGDominanceObjectiveVectorComparator< ObjectiveVector >::moeoGDominanceObjectiveVectorComparator | +( | +ObjectiveVector & | +_ref | +) | + [inline] |
+
+Ctor. +
+
| _ref | the reference point |
+Definition at line 33 of file moeoGDominanceObjectiveVectorComparator.h. +
+
| const bool moeoGDominanceObjectiveVectorComparator< ObjectiveVector >::operator() | +( | +const ObjectiveVector & | +_objectiveVector1, | +|
| + | + | const ObjectiveVector & | +_objectiveVector2 | + |
| + | ) | + [inline] |
+
+Returns true if _objectiveVector1 is g-dominated by _objectiveVector2. +
+
| _objectiveVector1 | the first objective vector | |
| _objectiveVector2 | the second objective vector |
+Definition at line 42 of file moeoGDominanceObjectiveVectorComparator.h. +
+References moeoGDominanceObjectiveVectorComparator< ObjectiveVector >::flag(), and moeoGDominanceObjectiveVectorComparator< ObjectiveVector >::paretoComparator. +
| unsigned int moeoGDominanceObjectiveVectorComparator< ObjectiveVector >::flag | +( | +const ObjectiveVector & | +_objectiveVector | +) | + [inline, private] |
+
+Returns the flag of _objectiveVector according to the reference point. +
+
| _objectiveVector | the first objective vector |
+Definition at line 76 of file moeoGDominanceObjectiveVectorComparator.h. +
+References moeoGDominanceObjectiveVectorComparator< ObjectiveVector >::ref. +
+Referenced by moeoGDominanceObjectiveVectorComparator< ObjectiveVector >::operator()(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoGenerationalReplacement-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoGenerationalReplacement-members.html
new file mode 100644
index 000000000..985b3ed02
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoGenerationalReplacement-members.html
@@ -0,0 +1,42 @@
+
+
+| moeoReplacement::functor_category() | eoBF< A1, A2, R > | [static] |
| eoGenerationalReplacement< MOEOT >::functor_category() | eoBF< A1, A2, R > | [static] |
| operator()(eoPop< MOEOT > &_parents, eoPop< MOEOT > &_offspring) | moeoGenerationalReplacement< MOEOT > | [inline] |
| moeoReplacement::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoGenerationalReplacement.html b/trunk/paradiseo-moeo/doc/html/classmoeoGenerationalReplacement.html
new file mode 100644
index 000000000..5760008fa
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoGenerationalReplacement.html
@@ -0,0 +1,113 @@
+
+
+
+#include <moeoGenerationalReplacement.h>
+
+
Inheritance diagram for moeoGenerationalReplacement< MOEOT >: +
Public Member Functions | |
| void | operator() (eoPop< MOEOT > &_parents, eoPop< MOEOT > &_offspring) |
| Swaps _parents and _offspring. | |
+ +
+Definition at line 23 of file moeoGenerationalReplacement.h.
| void moeoGenerationalReplacement< MOEOT >::operator() | +( | +eoPop< MOEOT > & | +_parents, | +|
| + | + | eoPop< MOEOT > & | +_offspring | + |
| + | ) | + [inline] |
+
+Swaps _parents and _offspring. +
+
| _parents | the parents population | |
| _offspring | the offspring population |
+Reimplemented from eoGenerationalReplacement< MOEOT >. +
+Definition at line 32 of file moeoGenerationalReplacement.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoHybridLS-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoHybridLS-members.html
new file mode 100644
index 000000000..a0a5dd65c
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoHybridLS-members.html
@@ -0,0 +1,48 @@
+
+
+| arch | moeoHybridLS< MOEOT > | [private] |
| className(void) const | eoUpdater | [virtual] |
| functor_category() | eoF< void > | [static] |
| lastCall() | eoUpdater | [virtual] |
| moeoHybridLS(eoContinue< MOEOT > &_term, eoSelect< MOEOT > &_select, moeoLS< MOEOT, MOEOT > &_mols, moeoArchive< MOEOT > &_arch) | moeoHybridLS< MOEOT > | [inline] |
| mols | moeoHybridLS< MOEOT > | [private] |
| operator()() | moeoHybridLS< MOEOT > | [inline, virtual] |
| result_type typedef | eoF< void > | |
| select | moeoHybridLS< MOEOT > | [private] |
| term | moeoHybridLS< MOEOT > | [private] |
| ~eoF() | eoF< void > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoHybridLS.html b/trunk/paradiseo-moeo/doc/html/classmoeoHybridLS.html
new file mode 100644
index 000000000..6db802157
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoHybridLS.html
@@ -0,0 +1,141 @@
+
+
+
+#include <moeoHybridLS.h>
+
+
Inheritance diagram for moeoHybridLS< MOEOT >: +
Public Member Functions | |
| moeoHybridLS (eoContinue< MOEOT > &_term, eoSelect< MOEOT > &_select, moeoLS< MOEOT, MOEOT > &_mols, moeoArchive< MOEOT > &_arch) | |
| Ctor. | |
| +void | operator() () |
| Applies the multi-objective local search to selected individuals contained in the archive if the stopping criteria is not verified. | |
Private Attributes | |
| +eoContinue< MOEOT > & | term |
| stopping criteria | |
| +eoSelect< MOEOT > & | select |
| selector | |
| +moeoLS< MOEOT, MOEOT > & | mols |
| multi-objective local search | |
| +moeoArchive< MOEOT > & | arch |
| archive | |
+ +
+Definition at line 28 of file moeoHybridLS.h.
| moeoHybridLS< MOEOT >::moeoHybridLS | +( | +eoContinue< MOEOT > & | +_term, | +|
| + | + | eoSelect< MOEOT > & | +_select, | +|
| + | + | moeoLS< MOEOT, MOEOT > & | +_mols, | +|
| + | + | moeoArchive< MOEOT > & | +_arch | + |
| + | ) | + [inline] |
+
+Ctor. +
+
| _term | stopping criteria | |
| _select | selector | |
| _mols | a multi-objective local search | |
| _arch | the archive |
+Definition at line 39 of file moeoHybridLS.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoHypervolumeBinaryMetric-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoHypervolumeBinaryMetric-members.html
new file mode 100644
index 000000000..a8d7da3d6
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoHypervolumeBinaryMetric-members.html
@@ -0,0 +1,50 @@
+
+
+| bounds | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > | [protected] |
| functor_category() | eoBF< A1, A2, R > | [static] |
| hypervolume(const ObjectiveVector &_o1, const ObjectiveVector &_o2, const unsigned int _obj, const bool _flag=false) | moeoHypervolumeBinaryMetric< ObjectiveVector > | [inline, private] |
| moeoHypervolumeBinaryMetric(double _rho=1.1) | moeoHypervolumeBinaryMetric< ObjectiveVector > | [inline] |
| moeoNormalizedSolutionVsSolutionBinaryMetric() | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > | [inline] |
| operator()(const ObjectiveVector &_o1, const ObjectiveVector &_o2) | moeoHypervolumeBinaryMetric< ObjectiveVector > | [inline] |
| moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double >::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| paretoComparator | moeoHypervolumeBinaryMetric< ObjectiveVector > | [private] |
| rho | moeoHypervolumeBinaryMetric< ObjectiveVector > | [private] |
| setup(double _min, double _max, unsigned int _obj) | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > | [inline] |
| setup(eoRealInterval _realInterval, unsigned int _obj) | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > | [inline, virtual] |
| tiny() | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > | [inline, static] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoHypervolumeBinaryMetric.html b/trunk/paradiseo-moeo/doc/html/classmoeoHypervolumeBinaryMetric.html
new file mode 100644
index 000000000..c097c0f8d
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoHypervolumeBinaryMetric.html
@@ -0,0 +1,225 @@
+
+
+
+#include <moeoHypervolumeBinaryMetric.h>
+
+
Inheritance diagram for moeoHypervolumeBinaryMetric< ObjectiveVector >: +
Public Member Functions | |
| moeoHypervolumeBinaryMetric (double _rho=1.1) | |
| Ctor. | |
| double | operator() (const ObjectiveVector &_o1, const ObjectiveVector &_o2) |
| Returns the volume of the space that is dominated by _o2 but not by _o1 with respect to a reference point computed using rho. | |
Private Member Functions | |
| double | hypervolume (const ObjectiveVector &_o1, const ObjectiveVector &_o2, const unsigned int _obj, const bool _flag=false) |
| Returns the volume of the space that is dominated by _o2 but not by _o1 with respect to a reference point computed using rho for the objective _obj. | |
Private Attributes | |
| +double | rho |
| value used to compute the reference point from the worst values for each objective | |
|
+moeoParetoObjectiveVectorComparator< + ObjectiveVector > | paretoComparator |
| Functor to compare two objective vectors according to Pareto dominance relation. | |
+: Indicator-Based Selection in Multiobjective Search. In Parallel Problem Solving from Nature (PPSN VIII). Lecture Notes in Computer Science 3242, Springer, Birmingham, UK pp.832–842 (2004). This indicator is based on the hypervolume concept introduced in Zitzler, E., Thiele, L.: Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study. Parallel Problem Solving from Nature (PPSN-V), pp.292-301 (1998). +
+ +
+Definition at line 29 of file moeoHypervolumeBinaryMetric.h.
| moeoHypervolumeBinaryMetric< ObjectiveVector >::moeoHypervolumeBinaryMetric | +( | +double | + _rho = 1.1 |
+ ) | + [inline] |
+
+Ctor. +
+
| _rho | value used to compute the reference point from the worst values for each objective (default : 1.1) |
+Definition at line 37 of file moeoHypervolumeBinaryMetric.h. +
+References moeoHypervolumeBinaryMetric< ObjectiveVector >::rho. +
+
| double moeoHypervolumeBinaryMetric< ObjectiveVector >::operator() | +( | +const ObjectiveVector & | +_o1, | +|
| + | + | const ObjectiveVector & | +_o2 | + |
| + | ) | + [inline] |
+
+Returns the volume of the space that is dominated by _o2 but not by _o1 with respect to a reference point computed using rho. +
+
| _o1 | the first objective vector | |
| _o2 | the second objective vector |
+Definition at line 63 of file moeoHypervolumeBinaryMetric.h. +
+References moeoHypervolumeBinaryMetric< ObjectiveVector >::hypervolume(), and moeoHypervolumeBinaryMetric< ObjectiveVector >::paretoComparator. +
| double moeoHypervolumeBinaryMetric< ObjectiveVector >::hypervolume | +( | +const ObjectiveVector & | +_o1, | +|
| + | + | const ObjectiveVector & | +_o2, | +|
| + | + | const unsigned int | +_obj, | +|
| + | + | const bool | + _flag = false | + |
| + | ) | + [inline, private] |
+
+Returns the volume of the space that is dominated by _o2 but not by _o1 with respect to a reference point computed using rho for the objective _obj. +
+
| _o1 | the first objective vector | |
| _o2 | the second objective vector | |
| _obj | the objective index | |
| _flag | used for iteration, if _flag=true _o2 is not talen into account (default : false) |
+Definition at line 96 of file moeoHypervolumeBinaryMetric.h. +
+References moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double >::bounds, and moeoHypervolumeBinaryMetric< ObjectiveVector >::rho. +
+Referenced by moeoHypervolumeBinaryMetric< ObjectiveVector >::operator()(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoIBEA-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoIBEA-members.html
new file mode 100644
index 000000000..da35a5483
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoIBEA-members.html
@@ -0,0 +1,57 @@
+
+
+| breed | moeoIBEA< MOEOT > | [protected] |
| continuator | moeoIBEA< MOEOT > | [protected] |
| defaultGenContinuator | moeoIBEA< MOEOT > | [protected] |
| defaultSGAGenOp | moeoIBEA< MOEOT > | [protected] |
| dummyDiversityAssignment | moeoIBEA< MOEOT > | [protected] |
| fitnessAssignment | moeoIBEA< MOEOT > | [protected] |
| functor_category() | eoUF< A1, R > | [static] |
| genBreed | moeoIBEA< MOEOT > | [protected] |
| moeoIBEA(unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoGenOp< MOEOT > &_op, moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > &_metric, const double _kappa=0.05) | moeoIBEA< MOEOT > | [inline] |
| moeoIBEA(unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoTransform< MOEOT > &_op, moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > &_metric, const double _kappa=0.05) | moeoIBEA< MOEOT > | [inline] |
| moeoIBEA(unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoQuadOp< MOEOT > &_crossover, double _pCross, eoMonOp< MOEOT > &_mutation, double _pMut, moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > &_metric, const double _kappa=0.05) | moeoIBEA< MOEOT > | [inline] |
| moeoIBEA(eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoGenOp< MOEOT > &_op, moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > &_metric, const double _kappa=0.05) | moeoIBEA< MOEOT > | [inline] |
| moeoIBEA(eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoTransform< MOEOT > &_op, moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > &_metric, const double _kappa=0.05) | moeoIBEA< MOEOT > | [inline] |
| ObjectiveVector typedef | moeoIBEA< MOEOT > | |
| operator()(eoPop< MOEOT > &_pop) | moeoIBEA< MOEOT > | [inline, virtual] |
| moeoEA::operator()(A1)=0 | eoUF< A1, R > | [pure virtual] |
| popEval | moeoIBEA< MOEOT > | [protected] |
| replace | moeoIBEA< MOEOT > | [protected] |
| select | moeoIBEA< MOEOT > | [protected] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A1, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoIBEA.html b/trunk/paradiseo-moeo/doc/html/classmoeoIBEA.html
new file mode 100644
index 000000000..6df4e33c9
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoIBEA.html
@@ -0,0 +1,498 @@
+
+
+
+#include <moeoIBEA.h>
+
+
Inheritance diagram for moeoIBEA< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| The type of objective vector. | |
Public Member Functions | |
| moeoIBEA (unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoGenOp< MOEOT > &_op, moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > &_metric, const double _kappa=0.05) | |
| Simple ctor with a eoGenOp. | |
| moeoIBEA (unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoTransform< MOEOT > &_op, moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > &_metric, const double _kappa=0.05) | |
| Simple ctor with a eoTransform. | |
| moeoIBEA (unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoQuadOp< MOEOT > &_crossover, double _pCross, eoMonOp< MOEOT > &_mutation, double _pMut, moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > &_metric, const double _kappa=0.05) | |
| Ctor with a crossover, a mutation and their corresponding rates. | |
| moeoIBEA (eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoGenOp< MOEOT > &_op, moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > &_metric, const double _kappa=0.05) | |
| Ctor with a continuator (instead of _maxGen) and a eoGenOp. | |
| moeoIBEA (eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoTransform< MOEOT > &_op, moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > &_metric, const double _kappa=0.05) | |
| Ctor with a continuator (instead of _maxGen) and a eoTransform. | |
| virtual void | operator() (eoPop< MOEOT > &_pop) |
| Apply a few generation of evolution to the population _pop until the stopping criteria is verified. | |
Protected Attributes | |
| +eoGenContinue< MOEOT > | defaultGenContinuator |
| a continuator based on the number of generations (used as default) | |
| +eoContinue< MOEOT > & | continuator |
| stopping criteria | |
| +eoPopLoopEval< MOEOT > | popEval |
| evaluation function used to evaluate the whole population | |
| +moeoDetTournamentSelect< MOEOT > | select |
| binary tournament selection | |
|
+moeoIndicatorBasedFitnessAssignment< + MOEOT > | fitnessAssignment |
| fitness assignment used in IBEA | |
|
+moeoDummyDiversityAssignment< + MOEOT > | dummyDiversityAssignment |
| dummy diversity assignment | |
|
+moeoEnvironmentalReplacement< + MOEOT > | replace |
| elitist replacement | |
| +eoSGAGenOp< MOEOT > | defaultSGAGenOp |
| an object for genetic operators (used as default) | |
| +eoGeneralBreeder< MOEOT > | genBreed |
| general breeder | |
| +eoBreed< MOEOT > & | breed |
| breeder | |
+Zitzler, S. Künzli, "Indicator-Based Selection in Multiobjective Search", Proc. 8th International Conference on Parallel Problem Solving from Nature (PPSN VIII), pp. 832-842, Birmingham, UK (2004). This class builds the IBEA algorithm only by using the fine-grained components of the ParadisEO-MOEO framework. +
+ +
+Definition at line 38 of file moeoIBEA.h.
| moeoIBEA< MOEOT >::moeoIBEA | +( | +unsigned int | +_maxGen, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoGenOp< MOEOT > & | +_op, | +|
| + | + | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > & | +_metric, | +|
| + | + | const double | + _kappa = 0.05 | + |
| + | ) | + [inline] |
+
+Simple ctor with a eoGenOp. +
+
| _maxGen | number of generations before stopping | |
| _eval | evaluation function | |
| _op | variation operator | |
| _metric | metric | |
| _kappa | scaling factor kappa |
+Definition at line 54 of file moeoIBEA.h. +
| moeoIBEA< MOEOT >::moeoIBEA | +( | +unsigned int | +_maxGen, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoTransform< MOEOT > & | +_op, | +|
| + | + | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > & | +_metric, | +|
| + | + | const double | + _kappa = 0.05 | + |
| + | ) | + [inline] |
+
+Simple ctor with a eoTransform. +
+
| _maxGen | number of generations before stopping | |
| _eval | evaluation function | |
| _op | variation operator | |
| _metric | metric | |
| _kappa | scaling factor kappa |
+Definition at line 68 of file moeoIBEA.h. +
| moeoIBEA< MOEOT >::moeoIBEA | +( | +unsigned int | +_maxGen, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoQuadOp< MOEOT > & | +_crossover, | +|
| + | + | double | +_pCross, | +|
| + | + | eoMonOp< MOEOT > & | +_mutation, | +|
| + | + | double | +_pMut, | +|
| + | + | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > & | +_metric, | +|
| + | + | const double | + _kappa = 0.05 | + |
| + | ) | + [inline] |
+
+Ctor with a crossover, a mutation and their corresponding rates. +
+
| _maxGen | number of generations before stopping | |
| _eval | evaluation function | |
| _crossover | crossover | |
| _pCross | crossover probability | |
| _mutation | mutation | |
| _pMut | mutation probability | |
| _metric | metric | |
| _kappa | scaling factor kappa |
+Definition at line 85 of file moeoIBEA.h. +
| moeoIBEA< MOEOT >::moeoIBEA | +( | +eoContinue< MOEOT > & | +_continuator, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoGenOp< MOEOT > & | +_op, | +|
| + | + | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > & | +_metric, | +|
| + | + | const double | + _kappa = 0.05 | + |
| + | ) | + [inline] |
+
+Ctor with a continuator (instead of _maxGen) and a eoGenOp. +
+
| _continuator | stopping criteria | |
| _eval | evaluation function | |
| _op | variation operator | |
| _metric | metric | |
| _kappa | scaling factor kappa |
+Definition at line 100 of file moeoIBEA.h. +
| moeoIBEA< MOEOT >::moeoIBEA | +( | +eoContinue< MOEOT > & | +_continuator, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoTransform< MOEOT > & | +_op, | +|
| + | + | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double > & | +_metric, | +|
| + | + | const double | + _kappa = 0.05 | + |
| + | ) | + [inline] |
+
+Ctor with a continuator (instead of _maxGen) and a eoTransform. +
+
| _continuator | stopping criteria | |
| _eval | evaluation function | |
| _op | variation operator | |
| _metric | metric | |
| _kappa | scaling factor kappa |
+Definition at line 114 of file moeoIBEA.h. +
+
| virtual void moeoIBEA< MOEOT >::operator() | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, virtual] |
+
+Apply a few generation of evolution to the population _pop until the stopping criteria is verified. +
+
| _pop | the population |
+Definition at line 124 of file moeoIBEA.h. +
+References moeoIBEA< MOEOT >::breed, moeoIBEA< MOEOT >::continuator, moeoIBEA< MOEOT >::dummyDiversityAssignment, moeoIBEA< MOEOT >::fitnessAssignment, moeoIBEA< MOEOT >::popEval, and moeoIBEA< MOEOT >::replace. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoIndicatorBasedFitnessAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoIndicatorBasedFitnessAssignment-members.html
new file mode 100644
index 000000000..2593bed79
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoIndicatorBasedFitnessAssignment-members.html
@@ -0,0 +1,43 @@
+
+
+| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| ObjectiveVector typedef | moeoFitnessAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &)=0 | eoUF< eoPop< MOEOT > &, void > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec)=0 | moeoFitnessAssignment< MOEOT > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoFitnessAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoIndicatorBasedFitnessAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoIndicatorBasedFitnessAssignment.html
new file mode 100644
index 000000000..5e71e5e3c
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoIndicatorBasedFitnessAssignment.html
@@ -0,0 +1,63 @@
+
+
+
+#include <moeoIndicatorBasedFitnessAssignment.h>
+
+
Inheritance diagram for moeoIndicatorBasedFitnessAssignment< MOEOT >: +
+ +
+Definition at line 22 of file moeoIndicatorBasedFitnessAssignment.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoLS-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoLS-members.html
new file mode 100644
index 000000000..9a049df00
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoLS-members.html
@@ -0,0 +1,40 @@
+
+
+| functor_category() | eoBF< Type, moeoArchive< MOEOT > &, void > | [static] |
| operator()(Type, moeoArchive< MOEOT > &)=0 | eoBF< Type, moeoArchive< MOEOT > &, void > | [pure virtual] |
| ~eoBF() | eoBF< Type, moeoArchive< MOEOT > &, void > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoLS.html b/trunk/paradiseo-moeo/doc/html/classmoeoLS.html
new file mode 100644
index 000000000..195478eb1
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoLS.html
@@ -0,0 +1,63 @@
+
+
+
+#include <moeoLS.h>
+
+
Inheritance diagram for moeoLS< MOEOT, Type >: +
+Starting from a Type (i.e.: an individual, a pop, an archive...), it produces a set of new non-dominated solutions. +
+ +
+Definition at line 25 of file moeoLS.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoManhattanDistance-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoManhattanDistance-members.html
new file mode 100644
index 000000000..50c4c242b
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoManhattanDistance-members.html
@@ -0,0 +1,48 @@
+
+
+| bounds | moeoNormalizedDistance< MOEOT > | [protected] |
| functor_category() | eoBF< A1, A2, R > | [static] |
| moeoNormalizedDistance() | moeoNormalizedDistance< MOEOT > | [inline] |
| ObjectiveVector typedef | moeoManhattanDistance< MOEOT > | |
| operator()(const MOEOT &_moeo1, const MOEOT &_moeo2) | moeoManhattanDistance< MOEOT > | [inline] |
| moeoNormalizedDistance< MOEOT >::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| setup(const eoPop< MOEOT > &_pop) | moeoNormalizedDistance< MOEOT > | [inline, virtual] |
| setup(double _min, double _max, unsigned int _obj) | moeoNormalizedDistance< MOEOT > | [inline, virtual] |
| setup(eoRealInterval _realInterval, unsigned int _obj) | moeoNormalizedDistance< MOEOT > | [inline, virtual] |
| tiny() | moeoNormalizedDistance< MOEOT > | [inline, static] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoManhattanDistance.html b/trunk/paradiseo-moeo/doc/html/classmoeoManhattanDistance.html
new file mode 100644
index 000000000..8892b1051
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoManhattanDistance.html
@@ -0,0 +1,116 @@
+
+
+
+#include <moeoManhattanDistance.h>
+
+
Inheritance diagram for moeoManhattanDistance< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| the objective vector type of the solutions | |
Public Member Functions | |
| const double | operator() (const MOEOT &_moeo1, const MOEOT &_moeo2) |
| Returns the Manhattan distance between _moeo1 and _moeo2 in the objective space. | |
+between 0 and 1). A distance value then lies between 0 and nObjectives. +
+ +
+Definition at line 24 of file moeoManhattanDistance.h.
| const double moeoManhattanDistance< MOEOT >::operator() | +( | +const MOEOT & | +_moeo1, | +|
| + | + | const MOEOT & | +_moeo2 | + |
| + | ) | + [inline] |
+
+Returns the Manhattan distance between _moeo1 and _moeo2 in the objective space. +
+
| _moeo1 | the first solution | |
| _moeo2 | the second solution |
+Definition at line 37 of file moeoManhattanDistance.h. +
+References moeoNormalizedDistance< MOEOT >::bounds. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoMetric-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoMetric-members.html
new file mode 100644
index 000000000..60181ef98
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoMetric-members.html
@@ -0,0 +1,37 @@
+
+
+| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoMetric.html b/trunk/paradiseo-moeo/doc/html/classmoeoMetric.html
new file mode 100644
index 000000000..2fb3334e5
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoMetric.html
@@ -0,0 +1,63 @@
+
+
+
+#include <moeoMetric.h>
+
+
Inheritance diagram for moeoMetric: +
+ +
+Definition at line 22 of file moeoMetric.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoNSGA-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoNSGA-members.html
new file mode 100644
index 000000000..a529d568b
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoNSGA-members.html
@@ -0,0 +1,56 @@
+
+
+| breed | moeoNSGA< MOEOT > | [protected] |
| continuator | moeoNSGA< MOEOT > | [protected] |
| defaultGenContinuator | moeoNSGA< MOEOT > | [protected] |
| defaultSGAGenOp | moeoNSGA< MOEOT > | [protected] |
| diversityAssignment | moeoNSGA< MOEOT > | [protected] |
| fitnessAssignment | moeoNSGA< MOEOT > | [protected] |
| functor_category() | eoUF< A1, R > | [static] |
| genBreed | moeoNSGA< MOEOT > | [protected] |
| moeoNSGA(unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoGenOp< MOEOT > &_op, double _nicheSize=0.5) | moeoNSGA< MOEOT > | [inline] |
| moeoNSGA(unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoTransform< MOEOT > &_op, double _nicheSize=0.5) | moeoNSGA< MOEOT > | [inline] |
| moeoNSGA(unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoQuadOp< MOEOT > &_crossover, double _pCross, eoMonOp< MOEOT > &_mutation, double _pMut, double _nicheSize=0.5) | moeoNSGA< MOEOT > | [inline] |
| moeoNSGA(eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoGenOp< MOEOT > &_op, double _nicheSize=0.5) | moeoNSGA< MOEOT > | [inline] |
| moeoNSGA(eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoTransform< MOEOT > &_op, double _nicheSize=0.5) | moeoNSGA< MOEOT > | [inline] |
| operator()(eoPop< MOEOT > &_pop) | moeoNSGA< MOEOT > | [inline, virtual] |
| moeoEA::operator()(A1)=0 | eoUF< A1, R > | [pure virtual] |
| popEval | moeoNSGA< MOEOT > | [protected] |
| replace | moeoNSGA< MOEOT > | [protected] |
| select | moeoNSGA< MOEOT > | [protected] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A1, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoNSGA.html b/trunk/paradiseo-moeo/doc/html/classmoeoNSGA.html
new file mode 100644
index 000000000..959ccf0f2
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoNSGA.html
@@ -0,0 +1,457 @@
+
+
+
+#include <moeoNSGA.h>
+
+
Inheritance diagram for moeoNSGA< MOEOT >: +
Public Member Functions | |
| moeoNSGA (unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoGenOp< MOEOT > &_op, double _nicheSize=0.5) | |
| Simple ctor with a eoGenOp. | |
| moeoNSGA (unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoTransform< MOEOT > &_op, double _nicheSize=0.5) | |
| Simple ctor with a eoTransform. | |
| moeoNSGA (unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoQuadOp< MOEOT > &_crossover, double _pCross, eoMonOp< MOEOT > &_mutation, double _pMut, double _nicheSize=0.5) | |
| Ctor with a crossover, a mutation and their corresponding rates. | |
| moeoNSGA (eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoGenOp< MOEOT > &_op, double _nicheSize=0.5) | |
| Ctor with a continuator (instead of _maxGen) and a eoGenOp. | |
| moeoNSGA (eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoTransform< MOEOT > &_op, double _nicheSize=0.5) | |
| Ctor with a continuator (instead of _maxGen) and a eoTransform. | |
| virtual void | operator() (eoPop< MOEOT > &_pop) |
| Apply a few generation of evolution to the population _pop until the stopping criteria is verified. | |
Protected Attributes | |
| +eoGenContinue< MOEOT > | defaultGenContinuator |
| a continuator based on the number of generations (used as default) | |
| +eoContinue< MOEOT > & | continuator |
| stopping criteria | |
| +eoPopLoopEval< MOEOT > | popEval |
| evaluation function used to evaluate the whole population | |
| +moeoDetTournamentSelect< MOEOT > | select |
| binary tournament selection | |
|
+moeoFastNonDominatedSortingFitnessAssignment< + MOEOT > | fitnessAssignment |
| fitness assignment used in NSGA-II | |
|
+moeoFrontByFrontSharingDiversityAssignment< + MOEOT > | diversityAssignment |
| diversity assignment used in NSGA-II | |
| +moeoElitistReplacement< MOEOT > | replace |
| elitist replacement | |
| +eoSGAGenOp< MOEOT > | defaultSGAGenOp |
| an object for genetic operators (used as default) | |
| +eoGeneralBreeder< MOEOT > | genBreed |
| general breeder | |
| +eoBreed< MOEOT > & | breed |
| breeder | |
+Srinivas, K. Deb, "Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms". Evolutionary Computation, Vol. 2(3), No 2, pp. 221-248 (1994). This class builds the NSGA algorithm only by using the fine-grained components of the ParadisEO-MOEO framework. +
+ +
+Definition at line 37 of file moeoNSGA.h.
| moeoNSGA< MOEOT >::moeoNSGA | +( | +unsigned int | +_maxGen, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoGenOp< MOEOT > & | +_op, | +|
| + | + | double | + _nicheSize = 0.5 | + |
| + | ) | + [inline] |
+
+Simple ctor with a eoGenOp. +
+
| _maxGen | number of generations before stopping | |
| _eval | evaluation function | |
| _op | variation operator | |
| _nicheSize | niche size |
+Definition at line 48 of file moeoNSGA.h. +
| moeoNSGA< MOEOT >::moeoNSGA | +( | +unsigned int | +_maxGen, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoTransform< MOEOT > & | +_op, | +|
| + | + | double | + _nicheSize = 0.5 | + |
| + | ) | + [inline] |
+
+Simple ctor with a eoTransform. +
+
| _maxGen | number of generations before stopping | |
| _eval | evaluation function | |
| _op | variation operator | |
| _nicheSize | niche size |
+Definition at line 61 of file moeoNSGA.h. +
| moeoNSGA< MOEOT >::moeoNSGA | +( | +unsigned int | +_maxGen, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoQuadOp< MOEOT > & | +_crossover, | +|
| + | + | double | +_pCross, | +|
| + | + | eoMonOp< MOEOT > & | +_mutation, | +|
| + | + | double | +_pMut, | +|
| + | + | double | + _nicheSize = 0.5 | + |
| + | ) | + [inline] |
+
+Ctor with a crossover, a mutation and their corresponding rates. +
+
| _maxGen | number of generations before stopping | |
| _eval | evaluation function | |
| _crossover | crossover | |
| _pCross | crossover probability | |
| _mutation | mutation | |
| _pMut | mutation probability | |
| _nicheSize | niche size |
+Definition at line 77 of file moeoNSGA.h. +
| moeoNSGA< MOEOT >::moeoNSGA | +( | +eoContinue< MOEOT > & | +_continuator, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoGenOp< MOEOT > & | +_op, | +|
| + | + | double | + _nicheSize = 0.5 | + |
| + | ) | + [inline] |
+
+Ctor with a continuator (instead of _maxGen) and a eoGenOp. +
+
| _continuator | stopping criteria | |
| _eval | evaluation function | |
| _op | variation operator | |
| _nicheSize | niche size |
+Definition at line 91 of file moeoNSGA.h. +
| moeoNSGA< MOEOT >::moeoNSGA | +( | +eoContinue< MOEOT > & | +_continuator, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoTransform< MOEOT > & | +_op, | +|
| + | + | double | + _nicheSize = 0.5 | + |
| + | ) | + [inline] |
+
+Ctor with a continuator (instead of _maxGen) and a eoTransform. +
+
| _continuator | stopping criteria | |
| _eval | evaluation function | |
| _op | variation operator | |
| _nicheSize | niche size |
+Definition at line 104 of file moeoNSGA.h. +
+
| virtual void moeoNSGA< MOEOT >::operator() | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, virtual] |
+
+Apply a few generation of evolution to the population _pop until the stopping criteria is verified. +
+
| _pop | the population |
+Definition at line 114 of file moeoNSGA.h. +
+References moeoNSGA< MOEOT >::breed, moeoNSGA< MOEOT >::continuator, moeoNSGA< MOEOT >::diversityAssignment, moeoNSGA< MOEOT >::fitnessAssignment, moeoNSGA< MOEOT >::popEval, and moeoNSGA< MOEOT >::replace. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoNSGAII-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoNSGAII-members.html
new file mode 100644
index 000000000..a40939bdb
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoNSGAII-members.html
@@ -0,0 +1,56 @@
+
+
+| breed | moeoNSGAII< MOEOT > | [protected] |
| continuator | moeoNSGAII< MOEOT > | [protected] |
| defaultGenContinuator | moeoNSGAII< MOEOT > | [protected] |
| defaultSGAGenOp | moeoNSGAII< MOEOT > | [protected] |
| diversityAssignment | moeoNSGAII< MOEOT > | [protected] |
| fitnessAssignment | moeoNSGAII< MOEOT > | [protected] |
| functor_category() | eoUF< A1, R > | [static] |
| genBreed | moeoNSGAII< MOEOT > | [protected] |
| moeoNSGAII(unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoGenOp< MOEOT > &_op) | moeoNSGAII< MOEOT > | [inline] |
| moeoNSGAII(unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoTransform< MOEOT > &_op) | moeoNSGAII< MOEOT > | [inline] |
| moeoNSGAII(unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoQuadOp< MOEOT > &_crossover, double _pCross, eoMonOp< MOEOT > &_mutation, double _pMut) | moeoNSGAII< MOEOT > | [inline] |
| moeoNSGAII(eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoGenOp< MOEOT > &_op) | moeoNSGAII< MOEOT > | [inline] |
| moeoNSGAII(eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoTransform< MOEOT > &_op) | moeoNSGAII< MOEOT > | [inline] |
| operator()(eoPop< MOEOT > &_pop) | moeoNSGAII< MOEOT > | [inline, virtual] |
| moeoEA::operator()(A1)=0 | eoUF< A1, R > | [pure virtual] |
| popEval | moeoNSGAII< MOEOT > | [protected] |
| replace | moeoNSGAII< MOEOT > | [protected] |
| select | moeoNSGAII< MOEOT > | [protected] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A1, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoNSGAII.html b/trunk/paradiseo-moeo/doc/html/classmoeoNSGAII.html
new file mode 100644
index 000000000..4c0292be9
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoNSGAII.html
@@ -0,0 +1,422 @@
+
+
+
+#include <moeoNSGAII.h>
+
+
Inheritance diagram for moeoNSGAII< MOEOT >: +
Public Member Functions | |
| moeoNSGAII (unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoGenOp< MOEOT > &_op) | |
| Simple ctor with a eoGenOp. | |
| moeoNSGAII (unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoTransform< MOEOT > &_op) | |
| Simple ctor with a eoTransform. | |
| moeoNSGAII (unsigned int _maxGen, eoEvalFunc< MOEOT > &_eval, eoQuadOp< MOEOT > &_crossover, double _pCross, eoMonOp< MOEOT > &_mutation, double _pMut) | |
| Ctor with a crossover, a mutation and their corresponding rates. | |
| moeoNSGAII (eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoGenOp< MOEOT > &_op) | |
| Ctor with a continuator (instead of _maxGen) and a eoGenOp. | |
| moeoNSGAII (eoContinue< MOEOT > &_continuator, eoEvalFunc< MOEOT > &_eval, eoTransform< MOEOT > &_op) | |
| Ctor with a continuator (instead of _maxGen) and a eoTransform. | |
| virtual void | operator() (eoPop< MOEOT > &_pop) |
| Apply a few generation of evolution to the population _pop until the stopping criteria is verified. | |
Protected Attributes | |
| +eoGenContinue< MOEOT > | defaultGenContinuator |
| a continuator based on the number of generations (used as default) | |
| +eoContinue< MOEOT > & | continuator |
| stopping criteria | |
| +eoPopLoopEval< MOEOT > | popEval |
| evaluation function used to evaluate the whole population | |
| +moeoDetTournamentSelect< MOEOT > | select |
| binary tournament selection | |
|
+moeoFastNonDominatedSortingFitnessAssignment< + MOEOT > | fitnessAssignment |
| fitness assignment used in NSGA-II | |
|
+moeoFrontByFrontCrowdingDiversityAssignment< + MOEOT > | diversityAssignment |
| diversity assignment used in NSGA-II | |
| +moeoElitistReplacement< MOEOT > | replace |
| elitist replacement | |
| +eoSGAGenOp< MOEOT > | defaultSGAGenOp |
| an object for genetic operators (used as default) | |
| +eoGeneralBreeder< MOEOT > | genBreed |
| general breeder | |
| +eoBreed< MOEOT > & | breed |
| breeder | |
+Agrawal, A. Pratap, and T. Meyarivan : "A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II". In IEEE Transactions on Evolutionary Computation, Vol. 6, No 2, pp 182-197 (April 2002). This class builds the NSGA-II algorithm only by using the fine-grained components of the ParadisEO-MOEO framework. +
+ +
+Definition at line 37 of file moeoNSGAII.h.
| moeoNSGAII< MOEOT >::moeoNSGAII | +( | +unsigned int | +_maxGen, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoGenOp< MOEOT > & | +_op | + |
| + | ) | + [inline] |
+
+Simple ctor with a eoGenOp. +
+
| _maxGen | number of generations before stopping | |
| _eval | evaluation function | |
| _op | variation operator |
+Definition at line 47 of file moeoNSGAII.h. +
| moeoNSGAII< MOEOT >::moeoNSGAII | +( | +unsigned int | +_maxGen, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoTransform< MOEOT > & | +_op | + |
| + | ) | + [inline] |
+
+Simple ctor with a eoTransform. +
+
| _maxGen | number of generations before stopping | |
| _eval | evaluation function | |
| _op | variation operator |
+Definition at line 59 of file moeoNSGAII.h. +
| moeoNSGAII< MOEOT >::moeoNSGAII | +( | +unsigned int | +_maxGen, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoQuadOp< MOEOT > & | +_crossover, | +|
| + | + | double | +_pCross, | +|
| + | + | eoMonOp< MOEOT > & | +_mutation, | +|
| + | + | double | +_pMut | + |
| + | ) | + [inline] |
+
+Ctor with a crossover, a mutation and their corresponding rates. +
+
| _maxGen | number of generations before stopping | |
| _eval | evaluation function | |
| _crossover | crossover | |
| _pCross | crossover probability | |
| _mutation | mutation | |
| _pMut | mutation probability |
+Definition at line 74 of file moeoNSGAII.h. +
| moeoNSGAII< MOEOT >::moeoNSGAII | +( | +eoContinue< MOEOT > & | +_continuator, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoGenOp< MOEOT > & | +_op | + |
| + | ) | + [inline] |
+
+Ctor with a continuator (instead of _maxGen) and a eoGenOp. +
+
| _continuator | stopping criteria | |
| _eval | evaluation function | |
| _op | variation operator |
+Definition at line 87 of file moeoNSGAII.h. +
| moeoNSGAII< MOEOT >::moeoNSGAII | +( | +eoContinue< MOEOT > & | +_continuator, | +|
| + | + | eoEvalFunc< MOEOT > & | +_eval, | +|
| + | + | eoTransform< MOEOT > & | +_op | + |
| + | ) | + [inline] |
+
+Ctor with a continuator (instead of _maxGen) and a eoTransform. +
+
| _continuator | stopping criteria | |
| _eval | evaluation function | |
| _op | variation operator |
+Definition at line 99 of file moeoNSGAII.h. +
+
| virtual void moeoNSGAII< MOEOT >::operator() | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, virtual] |
+
+Apply a few generation of evolution to the population _pop until the stopping criteria is verified. +
+
| _pop | the population |
+Definition at line 109 of file moeoNSGAII.h. +
+References moeoNSGAII< MOEOT >::breed, moeoNSGAII< MOEOT >::continuator, moeoNSGAII< MOEOT >::diversityAssignment, moeoNSGAII< MOEOT >::fitnessAssignment, moeoNSGAII< MOEOT >::popEval, and moeoNSGAII< MOEOT >::replace. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoNormalizedDistance-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoNormalizedDistance-members.html
new file mode 100644
index 000000000..40b6f3c67
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoNormalizedDistance-members.html
@@ -0,0 +1,47 @@
+
+
+| bounds | moeoNormalizedDistance< MOEOT, Type > | [protected] |
| functor_category() | eoBF< A1, A2, R > | [static] |
| moeoNormalizedDistance() | moeoNormalizedDistance< MOEOT, Type > | [inline] |
| ObjectiveVector typedef | moeoNormalizedDistance< MOEOT, Type > | |
| operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| setup(const eoPop< MOEOT > &_pop) | moeoNormalizedDistance< MOEOT, Type > | [inline, virtual] |
| setup(double _min, double _max, unsigned int _obj) | moeoNormalizedDistance< MOEOT, Type > | [inline, virtual] |
| setup(eoRealInterval _realInterval, unsigned int _obj) | moeoNormalizedDistance< MOEOT, Type > | [inline, virtual] |
| tiny() | moeoNormalizedDistance< MOEOT, Type > | [inline, static] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoNormalizedDistance.html b/trunk/paradiseo-moeo/doc/html/classmoeoNormalizedDistance.html
new file mode 100644
index 000000000..52d5101a2
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoNormalizedDistance.html
@@ -0,0 +1,220 @@
+
+
+
+#include <moeoNormalizedDistance.h>
+
+
Inheritance diagram for moeoNormalizedDistance< MOEOT, Type >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| the objective vector type of the solutions | |
Public Member Functions | |
| + | moeoNormalizedDistance () |
| Default ctr. | |
| virtual void | setup (const eoPop< MOEOT > &_pop) |
| Sets the lower and the upper bounds for every objective using extremes values for solutions contained in the population _pop. | |
| virtual void | setup (double _min, double _max, unsigned int _obj) |
| Sets the lower bound (_min) and the upper bound (_max) for the objective _obj. | |
| virtual void | setup (eoRealInterval _realInterval, unsigned int _obj) |
| Sets the lower bound and the upper bound for the objective _obj using a eoRealInterval object. | |
Static Public Member Functions | |
| +static double | tiny () |
| Returns a very small value that can be used to avoid extreme cases (where the min bound == the max bound). | |
Protected Attributes | |
| +std::vector< eoRealInterval > | bounds |
| the bounds for every objective (bounds[i] = bounds for the objective i) | |
+between 0 and 1). +
+ +
+Definition at line 24 of file moeoNormalizedDistance.h.
| virtual void moeoNormalizedDistance< MOEOT, Type >::setup | +( | +const eoPop< MOEOT > & | +_pop | +) | + [inline, virtual] |
+
+Sets the lower and the upper bounds for every objective using extremes values for solutions contained in the population _pop. +
+
| _pop | the population |
+Reimplemented from moeoDistance< MOEOT, Type >. +
+Definition at line 59 of file moeoNormalizedDistance.h. +
+Referenced by moeoNormalizedDistance< MOEOT >::setup(). +
| virtual void moeoNormalizedDistance< MOEOT, Type >::setup | +( | +double | +_min, | +|
| + | + | double | +_max, | +|
| + | + | unsigned int | +_obj | + |
| + | ) | + [inline, virtual] |
+
+Sets the lower bound (_min) and the upper bound (_max) for the objective _obj. +
+
| _min | lower bound | |
| _max | upper bound | |
| _obj | the objective index |
+Reimplemented from moeoDistance< MOEOT, Type >. +
+Definition at line 83 of file moeoNormalizedDistance.h. +
| virtual void moeoNormalizedDistance< MOEOT, Type >::setup | +( | +eoRealInterval | +_realInterval, | +|
| + | + | unsigned int | +_obj | + |
| + | ) | + [inline, virtual] |
+
+Sets the lower bound and the upper bound for the objective _obj using a eoRealInterval object. +
+
| _realInterval | the eoRealInterval object | |
| _obj | the objective index |
+Reimplemented from moeoDistance< MOEOT, Type >. +
+Definition at line 99 of file moeoNormalizedDistance.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoNormalizedSolutionVsSolutionBinaryMetric-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoNormalizedSolutionVsSolutionBinaryMetric-members.html
new file mode 100644
index 000000000..64acc36eb
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoNormalizedSolutionVsSolutionBinaryMetric-members.html
@@ -0,0 +1,45 @@
+
+
+| bounds | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R > | [protected] |
| functor_category() | eoBF< A1, A2, R > | [static] |
| moeoNormalizedSolutionVsSolutionBinaryMetric() | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R > | [inline] |
| operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| setup(double _min, double _max, unsigned int _obj) | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R > | [inline] |
| setup(eoRealInterval _realInterval, unsigned int _obj) | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R > | [inline, virtual] |
| tiny() | moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R > | [inline, static] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoNormalizedSolutionVsSolutionBinaryMetric.html b/trunk/paradiseo-moeo/doc/html/classmoeoNormalizedSolutionVsSolutionBinaryMetric.html
new file mode 100644
index 000000000..47443cf50
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoNormalizedSolutionVsSolutionBinaryMetric.html
@@ -0,0 +1,178 @@
+
+
+
+#include <moeoNormalizedSolutionVsSolutionBinaryMetric.h>
+
+
Inheritance diagram for moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R >: +
Public Member Functions | |
| + | moeoNormalizedSolutionVsSolutionBinaryMetric () |
| Default ctr for any moeoNormalizedSolutionVsSolutionBinaryMetric object. | |
| void | setup (double _min, double _max, unsigned int _obj) |
| Sets the lower bound (_min) and the upper bound (_max) for the objective _obj. | |
| virtual void | setup (eoRealInterval _realInterval, unsigned int _obj) |
| Sets the lower bound and the upper bound for the objective _obj using a eoRealInterval object. | |
Static Public Member Functions | |
| +static double | tiny () |
| Returns a very small value that can be used to avoid extreme cases (where the min bound == the max bound). | |
Protected Attributes | |
| +std::vector< eoRealInterval > | bounds |
| the bounds for every objective (bounds[i] = bounds for the objective i) | |
+Then, indicator values lie in the interval [-1,1]. Note that you have to set the bounds for every objective before using the operator(). +
+ +
+Definition at line 26 of file moeoNormalizedSolutionVsSolutionBinaryMetric.h.
| void moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R >::setup | +( | +double | +_min, | +|
| + | + | double | +_max, | +|
| + | + | unsigned int | +_obj | + |
| + | ) | + [inline] |
+
+Sets the lower bound (_min) and the upper bound (_max) for the objective _obj. +
+
| _min | lower bound | |
| _max | upper bound | |
| _obj | the objective index |
+Definition at line 50 of file moeoNormalizedSolutionVsSolutionBinaryMetric.h. +
+Referenced by moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::setup(). +
| virtual void moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R >::setup | +( | +eoRealInterval | +_realInterval, | +|
| + | + | unsigned int | +_obj | + |
| + | ) | + [inline, virtual] |
+
+Sets the lower bound and the upper bound for the objective _obj using a eoRealInterval object. +
+
| _realInterval | the eoRealInterval object | |
| _obj | the objective index |
+Definition at line 66 of file moeoNormalizedSolutionVsSolutionBinaryMetric.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveObjectiveVectorComparator-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveObjectiveVectorComparator-members.html
new file mode 100644
index 000000000..a864b9f19
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveObjectiveVectorComparator-members.html
@@ -0,0 +1,41 @@
+
+
+| functor_category() | eoBF< A1, A2, R > | [static] |
| operator()(const ObjectiveVector &_objectiveVector1, const ObjectiveVector &_objectiveVector2) | moeoObjectiveObjectiveVectorComparator< ObjectiveVector > | [inline] |
| moeoObjectiveVectorComparator::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveObjectiveVectorComparator.html b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveObjectiveVectorComparator.html
new file mode 100644
index 000000000..e68d1e22f
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveObjectiveVectorComparator.html
@@ -0,0 +1,106 @@
+
+
+
+#include <moeoObjectiveObjectiveVectorComparator.h>
+
+
Inheritance diagram for moeoObjectiveObjectiveVectorComparator< ObjectiveVector >: +
Public Member Functions | |
| const bool | operator() (const ObjectiveVector &_objectiveVector1, const ObjectiveVector &_objectiveVector2) |
| Returns true if _objectiveVector1 < _objectiveVector2 on the first objective, then on the second, and so on. | |
+ +
+Definition at line 22 of file moeoObjectiveObjectiveVectorComparator.h.
| const bool moeoObjectiveObjectiveVectorComparator< ObjectiveVector >::operator() | +( | +const ObjectiveVector & | +_objectiveVector1, | +|
| + | + | const ObjectiveVector & | +_objectiveVector2 | + |
| + | ) | + [inline] |
+
+Returns true if _objectiveVector1 < _objectiveVector2 on the first objective, then on the second, and so on. +
+
| _objectiveVector1 | the first objective vector | |
| _objectiveVector2 | the second objective vector |
+Definition at line 31 of file moeoObjectiveObjectiveVectorComparator.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVector-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVector-members.html
new file mode 100644
index 000000000..e41216f17
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVector-members.html
@@ -0,0 +1,44 @@
+
+
+| maximizing(unsigned int _i) | moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType > | [inline, static] |
| minimizing(unsigned int _i) | moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType > | [inline, static] |
| moeoObjectiveVector(Type _value=Type()) | moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType > | [inline] |
| moeoObjectiveVector(std::vector< Type > &_v) | moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType > | [inline] |
| nObjectives() | moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType > | [inline, static] |
| setup(unsigned int _nObjectives, std::vector< bool > &_bObjectives) | moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType > | [inline, static] |
| Traits typedef | moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType > | |
| Type typedef | moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType > |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVector.html b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVector.html
new file mode 100644
index 000000000..adbc0ebba
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVector.html
@@ -0,0 +1,222 @@
+
+
+
+#include <moeoObjectiveVector.h>
+
Public Types | |
| +typedef ObjectiveVectorTraits | Traits |
| The traits of objective vectors. | |
| +typedef ObjectiveVectorType | Type |
| The type of an objective value. | |
Public Member Functions | |
| + | moeoObjectiveVector (Type _value=Type()) |
| Ctor. | |
| moeoObjectiveVector (std::vector< Type > &_v) | |
| Ctor from a vector of Type. | |
Static Public Member Functions | |
| static void | setup (unsigned int _nObjectives, std::vector< bool > &_bObjectives) |
| Parameters setting (for the objective vector of any solution). | |
| +static unsigned int | nObjectives () |
| Returns the number of objectives. | |
| static bool | minimizing (unsigned int _i) |
| Returns true if the _ith objective have to be minimized. | |
| static bool | maximizing (unsigned int _i) |
| Returns true if the _ith objective have to be maximized. | |
+The template argument ObjectiveVectorTraits defaults to moeoObjectiveVectorTraits, but it can be replaced at will by any other class that implements the static functions defined therein. Some static funtions to access to the traits characteristics are re-defined in order not to write a lot of typedef's. +
+ +
+Definition at line 25 of file moeoObjectiveVector.h.
| moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType >::moeoObjectiveVector | +( | +std::vector< Type > & | +_v | +) | + [inline] |
+
+Ctor from a vector of Type. +
+
| _v | the std::vector < Type > |
+Definition at line 46 of file moeoObjectiveVector.h. +
+
| static void moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType >::setup | +( | +unsigned int | +_nObjectives, | +|
| + | + | std::vector< bool > & | +_bObjectives | + |
| + | ) | + [inline, static] |
+
+Parameters setting (for the objective vector of any solution). +
+
| _nObjectives | the number of objectives | |
| _bObjectives | the min/max vector (true = min / false = max) |
+Definition at line 55 of file moeoObjectiveVector.h. +
| static bool moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType >::minimizing | +( | +unsigned int | +_i | +) | + [inline, static] |
+
+Returns true if the _ith objective have to be minimized. +
+
| _i | the index |
+Definition at line 74 of file moeoObjectiveVector.h. +
| static bool moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType >::maximizing | +( | +unsigned int | +_i | +) | + [inline, static] |
+
+Returns true if the _ith objective have to be maximized. +
+
| _i | the index |
+Definition at line 84 of file moeoObjectiveVector.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVectorComparator-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVectorComparator-members.html
new file mode 100644
index 000000000..02c63836a
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVectorComparator-members.html
@@ -0,0 +1,40 @@
+
+
+| functor_category() | eoBF< A1, A2, R > | [static] |
| operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVectorComparator.html b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVectorComparator.html
new file mode 100644
index 000000000..cdb75e255
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVectorComparator.html
@@ -0,0 +1,64 @@
+
+
+
+#include <moeoObjectiveVectorComparator.h>
+
+
Inheritance diagram for moeoObjectiveVectorComparator< ObjectiveVector >: +
+The template argument ObjectiveVector have to be a moeoObjectiveVector. +
+ +
+Definition at line 24 of file moeoObjectiveVectorComparator.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVectorTraits-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVectorTraits-members.html
new file mode 100644
index 000000000..68f8d35ce
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVectorTraits-members.html
@@ -0,0 +1,43 @@
+
+
+| bObj | moeoObjectiveVectorTraits | [private, static] |
| maximizing(unsigned int _i) | moeoObjectiveVectorTraits | [inline, static] |
| minimizing(unsigned int _i) | moeoObjectiveVectorTraits | [inline, static] |
| nObj | moeoObjectiveVectorTraits | [private, static] |
| nObjectives() | moeoObjectiveVectorTraits | [inline, static] |
| setup(unsigned int _nObjectives, std::vector< bool > &_bObjectives) | moeoObjectiveVectorTraits | [inline, static] |
| tolerance() | moeoObjectiveVectorTraits | [inline, static] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVectorTraits.html b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVectorTraits.html
new file mode 100644
index 000000000..b7b9c30bd
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoObjectiveVectorTraits.html
@@ -0,0 +1,183 @@
+
+
+
+#include <moeoObjectiveVectorTraits.h>
+
Static Public Member Functions | |
| static void | setup (unsigned int _nObjectives, std::vector< bool > &_bObjectives) |
| Parameters setting. | |
| +static unsigned int | nObjectives () |
| Returns the number of objectives. | |
| static bool | minimizing (unsigned int _i) |
| Returns true if the _ith objective have to be minimized. | |
| static bool | maximizing (unsigned int _i) |
| Returns true if the _ith objective have to be maximized. | |
| +static double | tolerance () |
| Returns the tolerance value (to compare solutions). | |
Static Private Attributes | |
| +static unsigned int | nObj |
| The number of objectives. | |
| +static std::vector< bool > | bObj |
| The min/max vector. | |
+ +
+Definition at line 23 of file moeoObjectiveVectorTraits.h.
| static void moeoObjectiveVectorTraits::setup | +( | +unsigned int | +_nObjectives, | +|
| + | + | std::vector< bool > & | +_bObjectives | + |
| + | ) | + [inline, static] |
+
+Parameters setting. +
+
| _nObjectives | the number of objectives | |
| _bObjectives | the min/max vector (true = min / false = max) |
+Definition at line 32 of file moeoObjectiveVectorTraits.h. +
| static bool moeoObjectiveVectorTraits::minimizing | +( | +unsigned int | +_i | +) | + [inline, static] |
+
+Returns true if the _ith objective have to be minimized. +
+
| _i | the index |
+Definition at line 67 of file moeoObjectiveVectorTraits.h. +
+References bObj. +
+Referenced by maximizing(). +
| static bool moeoObjectiveVectorTraits::maximizing | +( | +unsigned int | +_i | +) | + [inline, static] |
+
+Returns true if the _ith objective have to be maximized. +
+
| _i | the index |
+Definition at line 80 of file moeoObjectiveVectorTraits.h. +
+References minimizing(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoOneObjectiveComparator-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoOneObjectiveComparator-members.html
new file mode 100644
index 000000000..abc7ac6fd
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoOneObjectiveComparator-members.html
@@ -0,0 +1,43 @@
+
+
+| functor_category() | eoBF< A1, A2, R > | [static] |
| moeoOneObjectiveComparator(unsigned int _obj) | moeoOneObjectiveComparator< MOEOT > | [inline] |
| obj | moeoOneObjectiveComparator< MOEOT > | [private] |
| operator()(const MOEOT &_moeo1, const MOEOT &_moeo2) | moeoOneObjectiveComparator< MOEOT > | [inline] |
| moeoComparator::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoOneObjectiveComparator.html b/trunk/paradiseo-moeo/doc/html/classmoeoOneObjectiveComparator.html
new file mode 100644
index 000000000..29443eaf1
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoOneObjectiveComparator.html
@@ -0,0 +1,150 @@
+
+
+
+#include <moeoOneObjectiveComparator.h>
+
+
Inheritance diagram for moeoOneObjectiveComparator< MOEOT >: +
Public Member Functions | |
| moeoOneObjectiveComparator (unsigned int _obj) | |
| Ctor. | |
| const bool | operator() (const MOEOT &_moeo1, const MOEOT &_moeo2) |
| Returns true if _moeo1 < _moeo2 on the obj objective. | |
Private Attributes | |
| +unsigned int | obj |
| the index of objective | |
+ +
+Definition at line 22 of file moeoOneObjectiveComparator.h.
| moeoOneObjectiveComparator< MOEOT >::moeoOneObjectiveComparator | +( | +unsigned int | +_obj | +) | + [inline] |
+
+Ctor. +
+
| _obj | the index of objective |
+Definition at line 30 of file moeoOneObjectiveComparator.h. +
+References moeoOneObjectiveComparator< MOEOT >::obj. +
+
| const bool moeoOneObjectiveComparator< MOEOT >::operator() | +( | +const MOEOT & | +_moeo1, | +|
| + | + | const MOEOT & | +_moeo2 | + |
| + | ) | + [inline] |
+
+Returns true if _moeo1 < _moeo2 on the obj objective. +
+
| _moeo1 | the first solution | |
| _moeo2 | the second solution |
+Definition at line 44 of file moeoOneObjectiveComparator.h. +
+References moeoOneObjectiveComparator< MOEOT >::obj. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoParetoBasedFitnessAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoParetoBasedFitnessAssignment-members.html
new file mode 100644
index 000000000..f805aef87
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoParetoBasedFitnessAssignment-members.html
@@ -0,0 +1,43 @@
+
+
+| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| ObjectiveVector typedef | moeoFitnessAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &)=0 | eoUF< eoPop< MOEOT > &, void > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec)=0 | moeoFitnessAssignment< MOEOT > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoFitnessAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoParetoBasedFitnessAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoParetoBasedFitnessAssignment.html
new file mode 100644
index 000000000..5f7957d10
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoParetoBasedFitnessAssignment.html
@@ -0,0 +1,61 @@
+
+
+
+#include <moeoParetoBasedFitnessAssignment.h>
+
+
Inheritance diagram for moeoParetoBasedFitnessAssignment< MOEOT >: +
+ +
+Definition at line 22 of file moeoParetoBasedFitnessAssignment.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoParetoObjectiveVectorComparator-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoParetoObjectiveVectorComparator-members.html
new file mode 100644
index 000000000..f9a332d23
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoParetoObjectiveVectorComparator-members.html
@@ -0,0 +1,41 @@
+
+
+| functor_category() | eoBF< A1, A2, R > | [static] |
| operator()(const ObjectiveVector &_objectiveVector1, const ObjectiveVector &_objectiveVector2) | moeoParetoObjectiveVectorComparator< ObjectiveVector > | [inline] |
| moeoObjectiveVectorComparator::operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoParetoObjectiveVectorComparator.html b/trunk/paradiseo-moeo/doc/html/classmoeoParetoObjectiveVectorComparator.html
new file mode 100644
index 000000000..dc4151149
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoParetoObjectiveVectorComparator.html
@@ -0,0 +1,106 @@
+
+
+
+#include <moeoParetoObjectiveVectorComparator.h>
+
+
Inheritance diagram for moeoParetoObjectiveVectorComparator< ObjectiveVector >: +
Public Member Functions | |
| const bool | operator() (const ObjectiveVector &_objectiveVector1, const ObjectiveVector &_objectiveVector2) |
| Returns true if _objectiveVector1 is dominated by _objectiveVector2. | |
+ +
+Definition at line 22 of file moeoParetoObjectiveVectorComparator.h.
| const bool moeoParetoObjectiveVectorComparator< ObjectiveVector >::operator() | +( | +const ObjectiveVector & | +_objectiveVector1, | +|
| + | + | const ObjectiveVector & | +_objectiveVector2 | + |
| + | ) | + [inline] |
+
+Returns true if _objectiveVector1 is dominated by _objectiveVector2. +
+
| _objectiveVector1 | the first objective vector | |
| _objectiveVector2 | the second objective vector |
+Definition at line 31 of file moeoParetoObjectiveVectorComparator.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoRandomSelect-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoRandomSelect-members.html
new file mode 100644
index 000000000..f0284ed4b
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoRandomSelect-members.html
@@ -0,0 +1,45 @@
+
+
+| moeoSelectOne::functor_category() | eoUF< A1, R > | [static] |
| eoRandomSelect< MOEOT >::functor_category() | eoUF< A1, R > | [static] |
| moeoRandomSelect() | moeoRandomSelect< MOEOT > | [inline] |
| operator()(const eoPop< MOEOT > &_pop) | moeoRandomSelect< MOEOT > | [inline, virtual] |
| moeoSelectOne::operator()(A1)=0 | eoUF< A1, R > | [pure virtual] |
| moeoSelectOne::setup(const eoPop< MOEOT > &_pop) | eoSelectOne< MOEOT > | [virtual] |
| eoRandomSelect< MOEOT >::setup(const eoPop< EOT > &_pop) | eoSelectOne< EOT, WorthT > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A1, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoRandomSelect.html b/trunk/paradiseo-moeo/doc/html/classmoeoRandomSelect.html
new file mode 100644
index 000000000..f2e8b999b
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoRandomSelect.html
@@ -0,0 +1,74 @@
+
+
+
+#include <moeoRandomSelect.h>
+
+
Inheritance diagram for moeoRandomSelect< MOEOT >: +
Public Member Functions | |
| + | moeoRandomSelect () |
| Ctor. | |
| +const MOEOT & | operator() (const eoPop< MOEOT > &_pop) |
| Return one individual at random by using an eoRandomSelect. | |
+ +
+Definition at line 23 of file moeoRandomSelect.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoRealObjectiveVector-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoRealObjectiveVector-members.html
new file mode 100644
index 000000000..700d5a659
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoRealObjectiveVector-members.html
@@ -0,0 +1,53 @@
+
+
+| dominates(const moeoRealObjectiveVector< ObjectiveVectorTraits > &_other) const | moeoRealObjectiveVector< ObjectiveVectorTraits > | [inline] |
| maximizing(unsigned int _i) | moeoObjectiveVector< ObjectiveVectorTraits, double > | [inline, static] |
| minimizing(unsigned int _i) | moeoObjectiveVector< ObjectiveVectorTraits, double > | [inline, static] |
| moeoObjectiveVector(Type _value=Type()) | moeoObjectiveVector< ObjectiveVectorTraits, double > | [inline] |
| moeoObjectiveVector(std::vector< Type > &_v) | moeoObjectiveVector< ObjectiveVectorTraits, double > | [inline] |
| moeoRealObjectiveVector(double _value=0.0) | moeoRealObjectiveVector< ObjectiveVectorTraits > | [inline] |
| moeoRealObjectiveVector(std::vector< double > &_v) | moeoRealObjectiveVector< ObjectiveVectorTraits > | [inline] |
| nObjectives() | moeoObjectiveVector< ObjectiveVectorTraits, double > | [inline, static] |
| operator!=(const moeoRealObjectiveVector< ObjectiveVectorTraits > &_other) const | moeoRealObjectiveVector< ObjectiveVectorTraits > | [inline] |
| operator<(const moeoRealObjectiveVector< ObjectiveVectorTraits > &_other) const | moeoRealObjectiveVector< ObjectiveVectorTraits > | [inline] |
| operator<=(const moeoRealObjectiveVector< ObjectiveVectorTraits > &_other) const | moeoRealObjectiveVector< ObjectiveVectorTraits > | [inline] |
| operator==(const moeoRealObjectiveVector< ObjectiveVectorTraits > &_other) const | moeoRealObjectiveVector< ObjectiveVectorTraits > | [inline] |
| operator>(const moeoRealObjectiveVector< ObjectiveVectorTraits > &_other) const | moeoRealObjectiveVector< ObjectiveVectorTraits > | [inline] |
| operator>=(const moeoRealObjectiveVector< ObjectiveVectorTraits > &_other) const | moeoRealObjectiveVector< ObjectiveVectorTraits > | [inline] |
| setup(unsigned int _nObjectives, std::vector< bool > &_bObjectives) | moeoObjectiveVector< ObjectiveVectorTraits, double > | [inline, static] |
| Traits typedef | moeoObjectiveVector< ObjectiveVectorTraits, double > | |
| Type typedef | moeoObjectiveVector< ObjectiveVectorTraits, double > |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoRealObjectiveVector.html b/trunk/paradiseo-moeo/doc/html/classmoeoRealObjectiveVector.html
new file mode 100644
index 000000000..f61075220
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoRealObjectiveVector.html
@@ -0,0 +1,351 @@
+
+
+
+#include <moeoRealObjectiveVector.h>
+
+
Inheritance diagram for moeoRealObjectiveVector< ObjectiveVectorTraits >: +
Public Member Functions | |
| + | moeoRealObjectiveVector (double _value=0.0) |
| Ctor. | |
| moeoRealObjectiveVector (std::vector< double > &_v) | |
| Ctor from a vector of doubles. | |
| bool | dominates (const moeoRealObjectiveVector< ObjectiveVectorTraits > &_other) const |
| Returns true if the current objective vector dominates _other according to the Pareto dominance relation (but it's better to use a moeoObjectiveVectorComparator object to compare solutions). | |
| bool | operator== (const moeoRealObjectiveVector< ObjectiveVectorTraits > &_other) const |
| Returns true if the current objective vector is equal to _other (according to a tolerance value). | |
| bool | operator!= (const moeoRealObjectiveVector< ObjectiveVectorTraits > &_other) const |
| Returns true if the current objective vector is different than _other (according to a tolerance value). | |
| bool | operator< (const moeoRealObjectiveVector< ObjectiveVectorTraits > &_other) const |
| Returns true if the current objective vector is smaller than _other on the first objective, then on the second, and so on (can be usefull for sorting/printing). | |
| bool | operator> (const moeoRealObjectiveVector< ObjectiveVectorTraits > &_other) const |
| Returns true if the current objective vector is greater than _other on the first objective, then on the second, and so on (can be usefull for sorting/printing). | |
| bool | operator<= (const moeoRealObjectiveVector< ObjectiveVectorTraits > &_other) const |
| Returns true if the current objective vector is smaller than or equal to _other on the first objective, then on the second, and so on (can be usefull for sorting/printing). | |
| bool | operator>= (const moeoRealObjectiveVector< ObjectiveVectorTraits > &_other) const |
| Returns true if the current objective vector is greater than or equal to _other on the first objective, then on the second, and so on (can be usefull for sorting/printing). | |
+that an objective value is represented using a double, and this for any objective. +
+ +
+Definition at line 27 of file moeoRealObjectiveVector.h.
| moeoRealObjectiveVector< ObjectiveVectorTraits >::moeoRealObjectiveVector | +( | +std::vector< double > & | +_v | +) | + [inline] |
+
+Ctor from a vector of doubles. +
+
| _v | the std::vector < double > |
+Definition at line 45 of file moeoRealObjectiveVector.h. +
+
| bool moeoRealObjectiveVector< ObjectiveVectorTraits >::dominates | +( | +const moeoRealObjectiveVector< ObjectiveVectorTraits > & | +_other | +) | + const [inline] |
+
+Returns true if the current objective vector dominates _other according to the Pareto dominance relation (but it's better to use a moeoObjectiveVectorComparator object to compare solutions). +
+
| _other | the other moeoRealObjectiveVector object to compare with |
+Definition at line 54 of file moeoRealObjectiveVector.h. +
| bool moeoRealObjectiveVector< ObjectiveVectorTraits >::operator== | +( | +const moeoRealObjectiveVector< ObjectiveVectorTraits > & | +_other | +) | + const [inline] |
+
+Returns true if the current objective vector is equal to _other (according to a tolerance value). +
+
| _other | the other moeoRealObjectiveVector object to compare with |
+Definition at line 65 of file moeoRealObjectiveVector.h. +
+Referenced by moeoRealObjectiveVector< ObjectiveVectorTraits >::operator!=(), and moeoRealObjectiveVector< ObjectiveVectorTraits >::operator>=(). +
| bool moeoRealObjectiveVector< ObjectiveVectorTraits >::operator!= | +( | +const moeoRealObjectiveVector< ObjectiveVectorTraits > & | +_other | +) | + const [inline] |
+
+Returns true if the current objective vector is different than _other (according to a tolerance value). +
+
| _other | the other moeoRealObjectiveVector object to compare with |
+Definition at line 82 of file moeoRealObjectiveVector.h. +
+References moeoRealObjectiveVector< ObjectiveVectorTraits >::operator==(). +
| bool moeoRealObjectiveVector< ObjectiveVectorTraits >::operator< | +( | +const moeoRealObjectiveVector< ObjectiveVectorTraits > & | +_other | +) | + const [inline] |
+
+Returns true if the current objective vector is smaller than _other on the first objective, then on the second, and so on (can be usefull for sorting/printing). +
+
| _other | the other moeoRealObjectiveVector object to compare with |
+Definition at line 93 of file moeoRealObjectiveVector.h. +
+Referenced by moeoRealObjectiveVector< ObjectiveVectorTraits >::operator<=(). +
| bool moeoRealObjectiveVector< ObjectiveVectorTraits >::operator> | +( | +const moeoRealObjectiveVector< ObjectiveVectorTraits > & | +_other | +) | + const [inline] |
+
+Returns true if the current objective vector is greater than _other on the first objective, then on the second, and so on (can be usefull for sorting/printing). +
+
| _other | the other moeoRealObjectiveVector object to compare with |
+Definition at line 105 of file moeoRealObjectiveVector.h. +
+Referenced by moeoRealObjectiveVector< ObjectiveVectorTraits >::operator>=(). +
| bool moeoRealObjectiveVector< ObjectiveVectorTraits >::operator<= | +( | +const moeoRealObjectiveVector< ObjectiveVectorTraits > & | +_other | +) | + const [inline] |
+
+Returns true if the current objective vector is smaller than or equal to _other on the first objective, then on the second, and so on (can be usefull for sorting/printing). +
+
| _other | the other moeoRealObjectiveVector object to compare with |
+Definition at line 116 of file moeoRealObjectiveVector.h. +
+References moeoRealObjectiveVector< ObjectiveVectorTraits >::operator<(). +
| bool moeoRealObjectiveVector< ObjectiveVectorTraits >::operator>= | +( | +const moeoRealObjectiveVector< ObjectiveVectorTraits > & | +_other | +) | + const [inline] |
+
+Returns true if the current objective vector is greater than or equal to _other on the first objective, then on the second, and so on (can be usefull for sorting/printing). +
+
| _other | the other moeoRealObjectiveVector object to compare with |
+Definition at line 127 of file moeoRealObjectiveVector.h. +
+References moeoRealObjectiveVector< ObjectiveVectorTraits >::operator==(), and moeoRealObjectiveVector< ObjectiveVectorTraits >::operator>(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoRealVector-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoRealVector-members.html
new file mode 100644
index 000000000..3c32ff25d
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoRealVector-members.html
@@ -0,0 +1,86 @@
+
+
+| AtomType typedef | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, double > | |
| className() const | moeoRealVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline, virtual] |
| ContainerType typedef | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, double > | |
| Diversity typedef | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | |
| diversity() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| diversity(const Diversity &_diversityValue) | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| EO() | EO< MOEOObjectiveVector > | |
| EO() | EO< MOEOObjectiveVector > | |
| Fitness typedef | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | |
| fitness() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| fitness(const Fitness &_fitnessValue) | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| EO< MOEOObjectiveVector >::fitness(const Fitness &_fitness) | EO< MOEOObjectiveVector > | |
| EO< MOEOObjectiveVector >::fitness(performance_type perf) | EO< MOEOObjectiveVector > | |
| fitness_traits typedef | EO< MOEOObjectiveVector > | |
| invalid() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidate() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidate_worth(void) | EO< MOEOObjectiveVector > | |
| invalidateDiversity() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidateFitness() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidateObjectiveVector() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidDiversity() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidFitness() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidObjectiveVector() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| MOEO() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| moeoRealVector(unsigned int _size=0, double _value=0.0) | moeoRealVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| moeoVector(unsigned int _size=0, double_value=double()) | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, double > | [inline] |
| ObjectiveVector typedef | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | |
| objectiveVector() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| objectiveVector(const ObjectiveVector &_objectiveVectorValue) | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| operator<(const moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, double > &_moeo) const | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, double > | [inline] |
| MOEO::operator<(const MOEO &_other) const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| EO< MOEOObjectiveVector >::operator<(const EO &_eo2) const | EO< MOEOObjectiveVector > | |
| EO< MOEOObjectiveVector >::operator<(const EO< Fitness, Traits > &other) const | EO< MOEOObjectiveVector > | |
| operator>(const EO &_eo2) const | EO< MOEOObjectiveVector > | |
| operator>(const EO< Fitness, Traits > &other) const | EO< MOEOObjectiveVector > | |
| performance(performance_type perf) | EO< MOEOObjectiveVector > | |
| performance(void) const | EO< MOEOObjectiveVector > | |
| performance_type typedef | EO< MOEOObjectiveVector > | |
| printOn(std::ostream &_os) const | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, double > | [inline, virtual] |
| readFrom(std::istream &_is) | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, double > | [inline, virtual] |
| storage_type typedef | EO< MOEOObjectiveVector > | |
| value(const std::vector< double > &_v) | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, double > | [inline] |
| worth(worth_type worth) | EO< MOEOObjectiveVector > | |
| worth(void) const | EO< MOEOObjectiveVector > | |
| worth_type typedef | EO< MOEOObjectiveVector > | |
| ~EO() | EO< MOEOObjectiveVector > | [virtual] |
| ~eoObject() | eoObject | [virtual] |
| ~eoPersistent() | eoPersistent | [virtual] |
| ~eoPrintable() | eoPrintable | [virtual] |
| ~MOEO() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline, virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoRealVector.html b/trunk/paradiseo-moeo/doc/html/classmoeoRealVector.html
new file mode 100644
index 000000000..e4079cec7
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoRealVector.html
@@ -0,0 +1,113 @@
+
+
+
+#include <moeoRealVector.h>
+
+
Inheritance diagram for moeoRealVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >: +
Public Member Functions | |
| moeoRealVector (unsigned int _size=0, double _value=0.0) | |
| Ctor. | |
| +virtual std::string | className () const |
| Returns the class name as a std::string. | |
+ +
+Definition at line 22 of file moeoRealVector.h.
| moeoRealVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::moeoRealVector | +( | +unsigned int | + _size = 0, |
+ |
| + | + | double | + _value = 0.0 | + |
| + | ) | + [inline] |
+
+Ctor. +
+
| _size | Length of vector (default is 0) | |
| _value | Initial value of all elements (default is default value of type GeneType) |
+Definition at line 31 of file moeoRealVector.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoReplacement-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoReplacement-members.html
new file mode 100644
index 000000000..39672b9b8
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoReplacement-members.html
@@ -0,0 +1,40 @@
+
+
+| functor_category() | eoBF< A1, A2, R > | [static] |
| operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoReplacement.html b/trunk/paradiseo-moeo/doc/html/classmoeoReplacement.html
new file mode 100644
index 000000000..46b1b631a
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoReplacement.html
@@ -0,0 +1,63 @@
+
+
+
+#include <moeoReplacement.h>
+
+
Inheritance diagram for moeoReplacement< MOEOT >: +
+ +
+Definition at line 22 of file moeoReplacement.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoRouletteSelect-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoRouletteSelect-members.html
new file mode 100644
index 000000000..4eef5aee5
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoRouletteSelect-members.html
@@ -0,0 +1,44 @@
+
+
+| functor_category() | eoUF< A1, R > | [static] |
| moeoRouletteSelect(unsigned int _tSize=2) | moeoRouletteSelect< MOEOT > | [inline] |
| operator()(const eoPop< MOEOT > &_pop) | moeoRouletteSelect< MOEOT > | [inline] |
| moeoSelectOne::operator()(A1)=0 | eoUF< A1, R > | [pure virtual] |
| setup(const eoPop< MOEOT > &_pop) | eoSelectOne< MOEOT > | [virtual] |
| tSize | moeoRouletteSelect< MOEOT > | [protected] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A1, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoRouletteSelect.html b/trunk/paradiseo-moeo/doc/html/classmoeoRouletteSelect.html
new file mode 100644
index 000000000..4c05d956e
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoRouletteSelect.html
@@ -0,0 +1,144 @@
+
+
+
+#include <moeoRouletteSelect.h>
+
+
Inheritance diagram for moeoRouletteSelect< MOEOT >: +
Public Member Functions | |
| moeoRouletteSelect (unsigned int _tSize=2) | |
| Ctor. | |
| const MOEOT & | operator() (const eoPop< MOEOT > &_pop) |
| Apply the tournament to the given population. | |
Protected Attributes | |
| +double & | tSize |
| size | |
+
+ +
+Definition at line 24 of file moeoRouletteSelect.h.
| moeoRouletteSelect< MOEOT >::moeoRouletteSelect | +( | +unsigned int | + _tSize = 2 |
+ ) | + [inline] |
+
+Ctor. +
+
| _tSize | the number of individuals in the tournament (default: 2) |
+Definition at line 32 of file moeoRouletteSelect.h. +
+References moeoRouletteSelect< MOEOT >::tSize. +
+
| const MOEOT& moeoRouletteSelect< MOEOT >::operator() | +( | +const eoPop< MOEOT > & | +_pop | +) | + [inline] |
+
+Apply the tournament to the given population. +
+
| _pop | the population |
+Definition at line 48 of file moeoRouletteSelect.h. +
+References moeoRouletteSelect< MOEOT >::tSize. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoScalarFitnessAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoScalarFitnessAssignment-members.html
new file mode 100644
index 000000000..958aa3543
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoScalarFitnessAssignment-members.html
@@ -0,0 +1,43 @@
+
+
+| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| ObjectiveVector typedef | moeoFitnessAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &)=0 | eoUF< eoPop< MOEOT > &, void > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec)=0 | moeoFitnessAssignment< MOEOT > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoFitnessAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoScalarFitnessAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoScalarFitnessAssignment.html
new file mode 100644
index 000000000..331fec59f
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoScalarFitnessAssignment.html
@@ -0,0 +1,61 @@
+
+
+
+#include <moeoScalarFitnessAssignment.h>
+
+
Inheritance diagram for moeoScalarFitnessAssignment< MOEOT >: +
+ +
+Definition at line 22 of file moeoScalarFitnessAssignment.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoSelectFromPopAndArch-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoSelectFromPopAndArch-members.html
new file mode 100644
index 000000000..4a9e4b4f1
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoSelectFromPopAndArch-members.html
@@ -0,0 +1,49 @@
+
+
+| arch | moeoSelectFromPopAndArch< MOEOT > | [private] |
| archSelectOne | moeoSelectFromPopAndArch< MOEOT > | [private] |
| functor_category() | eoUF< A1, R > | [static] |
| moeoSelectFromPopAndArch(moeoSelectOne< MOEOT > &_popSelectOne, moeoSelectOne< MOEOT > _archSelectOne, moeoArchive< MOEOT > &_arch, double _ratioFromPop=0.5) | moeoSelectFromPopAndArch< MOEOT > | [inline] |
| moeoSelectFromPopAndArch(moeoSelectOne< MOEOT > &_popSelectOne, moeoArchive< MOEOT > &_arch, double _ratioFromPop=0.5) | moeoSelectFromPopAndArch< MOEOT > | [inline] |
| operator()(const eoPop< MOEOT > &pop) | moeoSelectFromPopAndArch< MOEOT > | [inline, virtual] |
| moeoSelectOne::operator()(A1)=0 | eoUF< A1, R > | [pure virtual] |
| popSelectOne | moeoSelectFromPopAndArch< MOEOT > | [private] |
| randomSelectOne | moeoSelectFromPopAndArch< MOEOT > | [private] |
| ratioFromPop | moeoSelectFromPopAndArch< MOEOT > | [private] |
| setup(const eoPop< MOEOT > &_pop) | moeoSelectFromPopAndArch< MOEOT > | [inline, virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A1, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoSelectFromPopAndArch.html b/trunk/paradiseo-moeo/doc/html/classmoeoSelectFromPopAndArch.html
new file mode 100644
index 000000000..a87825bca
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoSelectFromPopAndArch.html
@@ -0,0 +1,201 @@
+
+
+
+#include <moeoSelectFromPopAndArch.h>
+
+
Inheritance diagram for moeoSelectFromPopAndArch< MOEOT >: +
Public Member Functions | |
| moeoSelectFromPopAndArch (moeoSelectOne< MOEOT > &_popSelectOne, moeoSelectOne< MOEOT > _archSelectOne, moeoArchive< MOEOT > &_arch, double _ratioFromPop=0.5) | |
| Ctor. | |
| moeoSelectFromPopAndArch (moeoSelectOne< MOEOT > &_popSelectOne, moeoArchive< MOEOT > &_arch, double _ratioFromPop=0.5) | |
| Defaulr ctor - the archive's selection operator is a random selector. | |
| +virtual const MOEOT & | operator() (const eoPop< MOEOT > &pop) |
| The selection process. | |
| +virtual void | setup (const eoPop< MOEOT > &_pop) |
| Setups some population stats. | |
Private Attributes | |
| +moeoSelectOne< MOEOT > & | popSelectOne |
| The population's selection operator. | |
| +moeoSelectOne< MOEOT > & | archSelectOne |
| The archive's selection operator. | |
| +moeoArchive< MOEOT > & | arch |
| The archive. | |
| +double | ratioFromPop |
| The ratio of selected individuals from the population. | |
| +moeoRandomSelect< MOEOT > | randomSelectOne |
| A random selection operator (used as default for archSelectOne). | |
+ +
+Definition at line 26 of file moeoSelectFromPopAndArch.h.
| moeoSelectFromPopAndArch< MOEOT >::moeoSelectFromPopAndArch | +( | +moeoSelectOne< MOEOT > & | +_popSelectOne, | +|
| + | + | moeoSelectOne< MOEOT > | +_archSelectOne, | +|
| + | + | moeoArchive< MOEOT > & | +_arch, | +|
| + | + | double | + _ratioFromPop = 0.5 | + |
| + | ) | + [inline] |
+
+Ctor. +
+
| _popSelectOne | the population's selection operator | |
| _archSelectOne | the archive's selection operator | |
| _arch | the archive | |
| _ratioFromPop | the ratio of selected individuals from the population |
+Definition at line 37 of file moeoSelectFromPopAndArch.h. +
| moeoSelectFromPopAndArch< MOEOT >::moeoSelectFromPopAndArch | +( | +moeoSelectOne< MOEOT > & | +_popSelectOne, | +|
| + | + | moeoArchive< MOEOT > & | +_arch, | +|
| + | + | double | + _ratioFromPop = 0.5 | + |
| + | ) | + [inline] |
+
+Defaulr ctor - the archive's selection operator is a random selector. +
+
| _popSelectOne | the population's selection operator | |
| _arch | the archive | |
| _ratioFromPop | the ratio of selected individuals from the population |
+Definition at line 48 of file moeoSelectFromPopAndArch.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoSelectOne-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoSelectOne-members.html
new file mode 100644
index 000000000..8fa35bbdb
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoSelectOne-members.html
@@ -0,0 +1,41 @@
+
+
+| functor_category() | eoUF< A1, R > | [static] |
| operator()(A1)=0 | eoUF< A1, R > | [pure virtual] |
| setup(const eoPop< MOEOT > &_pop) | eoSelectOne< MOEOT > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A1, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoSelectOne.html b/trunk/paradiseo-moeo/doc/html/classmoeoSelectOne.html
new file mode 100644
index 000000000..c0eee6266
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoSelectOne.html
@@ -0,0 +1,65 @@
+
+
+
+#include <moeoSelectOne.h>
+
+
Inheritance diagram for moeoSelectOne< MOEOT >: +
+ +
+Definition at line 22 of file moeoSelectOne.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoSharingDiversityAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoSharingDiversityAssignment-members.html
new file mode 100644
index 000000000..66efca3da
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoSharingDiversityAssignment-members.html
@@ -0,0 +1,51 @@
+
+
+| alpha | moeoSharingDiversityAssignment< MOEOT > | [protected] |
| defaultDistance | moeoSharingDiversityAssignment< MOEOT > | [protected] |
| distance | moeoSharingDiversityAssignment< MOEOT > | [protected] |
| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| moeoSharingDiversityAssignment(moeoDistance< MOEOT, double > &_distance, double _nicheSize=0.5, double _alpha=1.0) | moeoSharingDiversityAssignment< MOEOT > | [inline] |
| moeoSharingDiversityAssignment(double _nicheSize=0.5, double _alpha=1.0) | moeoSharingDiversityAssignment< MOEOT > | [inline] |
| nicheSize | moeoSharingDiversityAssignment< MOEOT > | [protected] |
| ObjectiveVector typedef | moeoSharingDiversityAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &_pop) | moeoSharingDiversityAssignment< MOEOT > | [inline, virtual] |
| setSimilarities(eoPop< MOEOT > &_pop) | moeoSharingDiversityAssignment< MOEOT > | [inline, protected, virtual] |
| sh(double _dist) | moeoSharingDiversityAssignment< MOEOT > | [inline, protected] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) | moeoSharingDiversityAssignment< MOEOT > | [inline, virtual] |
| moeoDiversityAssignment::updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoDiversityAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoSharingDiversityAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoSharingDiversityAssignment.html
new file mode 100644
index 000000000..35618d489
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoSharingDiversityAssignment.html
@@ -0,0 +1,347 @@
+
+
+
+#include <moeoSharingDiversityAssignment.h>
+
+
Inheritance diagram for moeoSharingDiversityAssignment< MOEOT >: +
Public Types | |
| +typedef MOEOT::ObjectiveVector | ObjectiveVector |
| the objective vector type of the solutions | |
Public Member Functions | |
| moeoSharingDiversityAssignment (moeoDistance< MOEOT, double > &_distance, double _nicheSize=0.5, double _alpha=1.0) | |
| Ctor. | |
| moeoSharingDiversityAssignment (double _nicheSize=0.5, double _alpha=1.0) | |
| Ctor with an euclidean distance (with normalized objective values) in the objective space is used as default. | |
| void | operator() (eoPop< MOEOT > &_pop) |
| Sets diversity values for every solution contained in the population _pop. | |
| void | updateByDeleting (eoPop< MOEOT > &_pop, ObjectiveVector &_objVec) |
Protected Member Functions | |
| virtual void | setSimilarities (eoPop< MOEOT > &_pop) |
| Sets similarities for every solution contained in the population _pop. | |
| double | sh (double _dist) |
| Sharing function. | |
Protected Attributes | |
| +moeoDistance< MOEOT, double > & | distance |
| the distance used to compute the neighborhood of solutions | |
| +moeoEuclideanDistance< MOEOT > | defaultDistance |
| euclidean distancein the objective space (can be used as default) | |
| +double | nicheSize |
| neighborhood size in terms of radius distance | |
| +double | alpha |
| parameter used to regulate the shape of the sharing function | |
+E. Goldberg, "Genetic Algorithms in Search, Optimization and Machine Learning", Addision-Wesley, MA, USA (1989). +
+ +
+Definition at line 28 of file moeoSharingDiversityAssignment.h.
| moeoSharingDiversityAssignment< MOEOT >::moeoSharingDiversityAssignment | +( | +moeoDistance< MOEOT, double > & | +_distance, | +|
| + | + | double | + _nicheSize = 0.5, |
+ |
| + | + | double | + _alpha = 1.0 | + |
| + | ) | + [inline] |
+
+Ctor. +
+
| _distance | the distance used to compute the neighborhood of solutions (can be related to the decision space or the objective space) | |
| _nicheSize | neighborhood size in terms of radius distance (closely related to the way the distances are computed) | |
| _alpha | parameter used to regulate the shape of the sharing function |
+Definition at line 42 of file moeoSharingDiversityAssignment.h. +
| moeoSharingDiversityAssignment< MOEOT >::moeoSharingDiversityAssignment | +( | +double | + _nicheSize = 0.5, |
+ |
| + | + | double | + _alpha = 1.0 | + |
| + | ) | + [inline] |
+
+Ctor with an euclidean distance (with normalized objective values) in the objective space is used as default. +
+
| _nicheSize | neighborhood size in terms of radius distance (closely related to the way the distances are computed) | |
| _alpha | parameter used to regulate the shape of the sharing function |
+Definition at line 51 of file moeoSharingDiversityAssignment.h. +
+
| void moeoSharingDiversityAssignment< MOEOT >::operator() | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, virtual] |
+
+Sets diversity values for every solution contained in the population _pop. +
+
| _pop | the population |
+Implements eoUF< eoPop< MOEOT > &, void >. +
+Definition at line 59 of file moeoSharingDiversityAssignment.h. +
+References moeoSharingDiversityAssignment< MOEOT >::setSimilarities(). +
| void moeoSharingDiversityAssignment< MOEOT >::updateByDeleting | +( | +eoPop< MOEOT > & | +_pop, | +|
| + | + | ObjectiveVector & | +_objVec | + |
| + | ) | + [inline, virtual] |
+
+
| _pop | the population | |
| _objVec | the objective vector |
+Implements moeoDiversityAssignment< MOEOT >. +
+Reimplemented in moeoFrontByFrontSharingDiversityAssignment< MOEOT >. +
+Definition at line 80 of file moeoSharingDiversityAssignment.h. +
| virtual void moeoSharingDiversityAssignment< MOEOT >::setSimilarities | +( | +eoPop< MOEOT > & | +_pop | +) | + [inline, protected, virtual] |
+
+Sets similarities for every solution contained in the population _pop. +
+
| _pop | the population |
+Reimplemented in moeoFrontByFrontSharingDiversityAssignment< MOEOT >. +
+Definition at line 102 of file moeoSharingDiversityAssignment.h. +
+References moeoSharingDiversityAssignment< MOEOT >::distance, and moeoSharingDiversityAssignment< MOEOT >::sh(). +
+Referenced by moeoSharingDiversityAssignment< MOEOT >::operator()(). +
| double moeoSharingDiversityAssignment< MOEOT >::sh | +( | +double | +_dist | +) | + [inline, protected] |
+
+Sharing function. +
+
| _dist | the distance value |
+Definition at line 125 of file moeoSharingDiversityAssignment.h. +
+References moeoSharingDiversityAssignment< MOEOT >::alpha, and moeoSharingDiversityAssignment< MOEOT >::nicheSize. +
+Referenced by moeoSharingDiversityAssignment< MOEOT >::setSimilarities(), and moeoFrontByFrontSharingDiversityAssignment< MOEOT >::setSimilarities(). +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoSolutionUnaryMetric-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoSolutionUnaryMetric-members.html
new file mode 100644
index 000000000..87ba01980
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoSolutionUnaryMetric-members.html
@@ -0,0 +1,40 @@
+
+
+| functor_category() | eoUF< const ObjectiveVector &, R > | [static] |
| operator()(const ObjectiveVector &)=0 | eoUF< const ObjectiveVector &, R > | [pure virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< const ObjectiveVector &, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoSolutionUnaryMetric.html b/trunk/paradiseo-moeo/doc/html/classmoeoSolutionUnaryMetric.html
new file mode 100644
index 000000000..cc84291e6
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoSolutionUnaryMetric.html
@@ -0,0 +1,62 @@
+
+
+
+#include <moeoMetric.h>
+
+
Inheritance diagram for moeoSolutionUnaryMetric< ObjectiveVector, R >: +
+ +
+Definition at line 43 of file moeoMetric.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoSolutionVsSolutionBinaryMetric-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoSolutionVsSolutionBinaryMetric-members.html
new file mode 100644
index 000000000..94739374d
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoSolutionVsSolutionBinaryMetric-members.html
@@ -0,0 +1,40 @@
+
+
+| functor_category() | eoBF< A1, A2, R > | [static] |
| operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoSolutionVsSolutionBinaryMetric.html b/trunk/paradiseo-moeo/doc/html/classmoeoSolutionVsSolutionBinaryMetric.html
new file mode 100644
index 000000000..7fa734085
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoSolutionVsSolutionBinaryMetric.html
@@ -0,0 +1,63 @@
+
+
+
+#include <moeoMetric.h>
+
+
Inheritance diagram for moeoSolutionVsSolutionBinaryMetric< ObjectiveVector, R >: +
+ +
+Definition at line 57 of file moeoMetric.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoStochTournamentSelect-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoStochTournamentSelect-members.html
new file mode 100644
index 000000000..addcdd002
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoStochTournamentSelect-members.html
@@ -0,0 +1,47 @@
+
+
+| comparator | moeoStochTournamentSelect< MOEOT > | [protected] |
| defaultComparator | moeoStochTournamentSelect< MOEOT > | [protected] |
| functor_category() | eoUF< A1, R > | [static] |
| moeoStochTournamentSelect(moeoComparator< MOEOT > &_comparator, double _tRate=1.0) | moeoStochTournamentSelect< MOEOT > | [inline] |
| moeoStochTournamentSelect(double _tRate=1.0) | moeoStochTournamentSelect< MOEOT > | [inline] |
| operator()(const eoPop< MOEOT > &_pop) | moeoStochTournamentSelect< MOEOT > | [inline] |
| moeoSelectOne::operator()(A1)=0 | eoUF< A1, R > | [pure virtual] |
| setup(const eoPop< MOEOT > &_pop) | eoSelectOne< MOEOT > | [virtual] |
| tRate | moeoStochTournamentSelect< MOEOT > | [protected] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A1, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoStochTournamentSelect.html b/trunk/paradiseo-moeo/doc/html/classmoeoStochTournamentSelect.html
new file mode 100644
index 000000000..9c8ea2f57
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoStochTournamentSelect.html
@@ -0,0 +1,196 @@
+
+
+
+#include <moeoStochTournamentSelect.h>
+
+
Inheritance diagram for moeoStochTournamentSelect< MOEOT >: +
Public Member Functions | |
| moeoStochTournamentSelect (moeoComparator< MOEOT > &_comparator, double _tRate=1.0) | |
| Full Ctor. | |
| moeoStochTournamentSelect (double _tRate=1.0) | |
| Ctor without comparator. | |
| const MOEOT & | operator() (const eoPop< MOEOT > &_pop) |
| Apply the tournament to the given population. | |
Protected Attributes | |
| +moeoComparator< MOEOT > & | comparator |
| the comparator (used to compare 2 individuals) | |
|
+moeoFitnessThenDiversityComparator< + MOEOT > | defaultComparator |
| a fitness then diversity comparator can be used as default | |
| +double | tRate |
| the tournament rate | |
+ +
+Definition at line 24 of file moeoStochTournamentSelect.h.
| moeoStochTournamentSelect< MOEOT >::moeoStochTournamentSelect | +( | +moeoComparator< MOEOT > & | +_comparator, | +|
| + | + | double | + _tRate = 1.0 | + |
| + | ) | + [inline] |
+
+Full Ctor. +
+
| _comparator | the comparator (used to compare 2 individuals) | |
| _tRate | the tournament rate |
+Definition at line 33 of file moeoStochTournamentSelect.h. +
+References moeoStochTournamentSelect< MOEOT >::tRate. +
| moeoStochTournamentSelect< MOEOT >::moeoStochTournamentSelect | +( | +double | + _tRate = 1.0 |
+ ) | + [inline] |
+
+Ctor without comparator. +
+A moeoFitnessThenDiversityComparator is used as default.
| _tRate | the tournament rate |
+Definition at line 53 of file moeoStochTournamentSelect.h. +
+References moeoStochTournamentSelect< MOEOT >::tRate. +
+
| const MOEOT& moeoStochTournamentSelect< MOEOT >::operator() | +( | +const eoPop< MOEOT > & | +_pop | +) | + [inline] |
+
+Apply the tournament to the given population. +
+
| _pop | the population |
+Definition at line 73 of file moeoStochTournamentSelect.h. +
+References moeoStochTournamentSelect< MOEOT >::comparator, and moeoStochTournamentSelect< MOEOT >::tRate. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoUnaryIndicatorBasedFitnessAssignment-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoUnaryIndicatorBasedFitnessAssignment-members.html
new file mode 100644
index 000000000..6cb05bb45
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoUnaryIndicatorBasedFitnessAssignment-members.html
@@ -0,0 +1,43 @@
+
+
+| functor_category() | eoUF< eoPop< MOEOT > &, void > | [static] |
| ObjectiveVector typedef | moeoFitnessAssignment< MOEOT > | |
| operator()(eoPop< MOEOT > &)=0 | eoUF< eoPop< MOEOT > &, void > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, ObjectiveVector &_objVec)=0 | moeoFitnessAssignment< MOEOT > | [pure virtual] |
| updateByDeleting(eoPop< MOEOT > &_pop, MOEOT &_moeo) | moeoFitnessAssignment< MOEOT > | [inline] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< eoPop< MOEOT > &, void > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoUnaryIndicatorBasedFitnessAssignment.html b/trunk/paradiseo-moeo/doc/html/classmoeoUnaryIndicatorBasedFitnessAssignment.html
new file mode 100644
index 000000000..668a21cdd
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoUnaryIndicatorBasedFitnessAssignment.html
@@ -0,0 +1,61 @@
+
+
+
+#include <moeoUnaryIndicatorBasedFitnessAssignment.h>
+
+
Inheritance diagram for moeoUnaryIndicatorBasedFitnessAssignment< MOEOT >: +
+ +
+Definition at line 22 of file moeoUnaryIndicatorBasedFitnessAssignment.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoUnaryMetric-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoUnaryMetric-members.html
new file mode 100644
index 000000000..8ff634b84
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoUnaryMetric-members.html
@@ -0,0 +1,40 @@
+
+
+| functor_category() | eoUF< A, R > | [static] |
| operator()(A)=0 | eoUF< A, R > | [pure virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< A, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoUnaryMetric.html b/trunk/paradiseo-moeo/doc/html/classmoeoUnaryMetric.html
new file mode 100644
index 000000000..b495ff314
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoUnaryMetric.html
@@ -0,0 +1,61 @@
+
+
+
+#include <moeoMetric.h>
+
+
Inheritance diagram for moeoUnaryMetric< A, R >: +
+ +
+Definition at line 29 of file moeoMetric.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoVector-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoVector-members.html
new file mode 100644
index 000000000..7709943ad
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoVector-members.html
@@ -0,0 +1,85 @@
+
+
+| AtomType typedef | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType > | |
| className() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline, virtual] |
| ContainerType typedef | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType > | |
| Diversity typedef | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | |
| diversity() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| diversity(const Diversity &_diversityValue) | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| EO() | EO< MOEOObjectiveVector > | |
| EO() | EO< MOEOObjectiveVector > | |
| Fitness typedef | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | |
| fitness() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| fitness(const Fitness &_fitnessValue) | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| EO< MOEOObjectiveVector >::fitness(const Fitness &_fitness) | EO< MOEOObjectiveVector > | |
| EO< MOEOObjectiveVector >::fitness(performance_type perf) | EO< MOEOObjectiveVector > | |
| fitness_traits typedef | EO< MOEOObjectiveVector > | |
| invalid() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidate() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidate_worth(void) | EO< MOEOObjectiveVector > | |
| invalidateDiversity() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidateFitness() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidateObjectiveVector() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidDiversity() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidFitness() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| invalidObjectiveVector() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| MOEO() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| moeoVector(unsigned int _size=0, GeneType _value=GeneType()) | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType > | [inline] |
| ObjectiveVector typedef | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | |
| objectiveVector() const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| objectiveVector(const ObjectiveVector &_objectiveVectorValue) | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| operator<(const moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType > &_moeo) const | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType > | [inline] |
| MOEO::operator<(const MOEO &_other) const | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline] |
| EO< MOEOObjectiveVector >::operator<(const EO &_eo2) const | EO< MOEOObjectiveVector > | |
| EO< MOEOObjectiveVector >::operator<(const EO< Fitness, Traits > &other) const | EO< MOEOObjectiveVector > | |
| operator>(const EO &_eo2) const | EO< MOEOObjectiveVector > | |
| operator>(const EO< Fitness, Traits > &other) const | EO< MOEOObjectiveVector > | |
| performance(performance_type perf) | EO< MOEOObjectiveVector > | |
| performance(void) const | EO< MOEOObjectiveVector > | |
| performance_type typedef | EO< MOEOObjectiveVector > | |
| printOn(std::ostream &_os) const | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType > | [inline, virtual] |
| readFrom(std::istream &_is) | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType > | [inline, virtual] |
| storage_type typedef | EO< MOEOObjectiveVector > | |
| value(const std::vector< GeneType > &_v) | moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType > | [inline] |
| worth(worth_type worth) | EO< MOEOObjectiveVector > | |
| worth(void) const | EO< MOEOObjectiveVector > | |
| worth_type typedef | EO< MOEOObjectiveVector > | |
| ~EO() | EO< MOEOObjectiveVector > | [virtual] |
| ~eoObject() | eoObject | [virtual] |
| ~eoPersistent() | eoPersistent | [virtual] |
| ~eoPrintable() | eoPrintable | [virtual] |
| ~MOEO() | MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > | [inline, virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoVector.html b/trunk/paradiseo-moeo/doc/html/classmoeoVector.html
new file mode 100644
index 000000000..926a3b7a2
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoVector.html
@@ -0,0 +1,264 @@
+
+
+
+#include <moeoVector.h>
+
+
Inheritance diagram for moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >: +
Public Types | |
| +typedef GeneType | AtomType |
| the atomic type | |
| +typedef std::vector< GeneType > | ContainerType |
| the container type | |
Public Member Functions | |
| moeoVector (unsigned int _size=0, GeneType _value=GeneType()) | |
| Default ctor. | |
| void | value (const std::vector< GeneType > &_v) |
| We can't have a Ctor from a std::vector as it would create ambiguity with the copy Ctor. | |
| bool | operator< (const moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType > &_moeo) const |
| To avoid conflicts between MOEO::operator< and std::vector<GeneType>::operator<. | |
| virtual void | printOn (std::ostream &_os) const |
| Writing object. | |
| virtual void | readFrom (std::istream &_is) |
| Reading object. | |
+GeneType must have the following methods: void ctor (needed for the std::vector<>), copy ctor. +
+ +
+Definition at line 25 of file moeoVector.h.
| moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >::moeoVector | +( | +unsigned int | + _size = 0, |
+ |
| + | + | GeneType | + _value = GeneType() | + |
| + | ) | + [inline] |
+
+Default ctor. +
+
| _size | Length of vector (default is 0) | |
| _value | Initial value of all elements (default is default value of type GeneType) |
+Definition at line 47 of file moeoVector.h. +
+
| void moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >::value | +( | +const std::vector< GeneType > & | +_v | +) | + [inline] |
+
+We can't have a Ctor from a std::vector as it would create ambiguity with the copy Ctor. +
+
| _v | a vector of GeneType |
+Definition at line 56 of file moeoVector.h. +
| bool moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >::operator< | +( | +const moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType > & | +_moeo | +) | + const [inline] |
+
+To avoid conflicts between MOEO::operator< and std::vector<GeneType>::operator<. +
+
| _moeo | the object to compare with |
+Definition at line 79 of file moeoVector.h. +
| virtual void moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >::printOn | +( | +std::ostream & | +_os | +) | + const [inline, virtual] |
+
+Writing object. +
+
| _os | output stream |
+Reimplemented from MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >. +
+Reimplemented in moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >. +
+Definition at line 89 of file moeoVector.h. +
| virtual void moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >::readFrom | +( | +std::istream & | +_is | +) | + [inline, virtual] |
+
+Reading object. +
+
| _is | input stream |
+Reimplemented from MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >. +
+Reimplemented in moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >. +
+Definition at line 102 of file moeoVector.h. +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoVectorUnaryMetric-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoVectorUnaryMetric-members.html
new file mode 100644
index 000000000..af0346dcb
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoVectorUnaryMetric-members.html
@@ -0,0 +1,40 @@
+
+
+| functor_category() | eoUF< const std::vector< ObjectiveVector > &, R > | [static] |
| operator()(const std::vector< ObjectiveVector > &)=0 | eoUF< const std::vector< ObjectiveVector > &, R > | [pure virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
| ~eoUF() | eoUF< const std::vector< ObjectiveVector > &, R > | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoVectorUnaryMetric.html b/trunk/paradiseo-moeo/doc/html/classmoeoVectorUnaryMetric.html
new file mode 100644
index 000000000..bee13e6ab
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoVectorUnaryMetric.html
@@ -0,0 +1,62 @@
+
+
+
+#include <moeoMetric.h>
+
+
Inheritance diagram for moeoVectorUnaryMetric< ObjectiveVector, R >: +
+ +
+Definition at line 50 of file moeoMetric.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoVectorVsVectorBinaryMetric-members.html b/trunk/paradiseo-moeo/doc/html/classmoeoVectorVsVectorBinaryMetric-members.html
new file mode 100644
index 000000000..6f2d2def6
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoVectorVsVectorBinaryMetric-members.html
@@ -0,0 +1,40 @@
+
+
+| functor_category() | eoBF< A1, A2, R > | [static] |
| operator()(A1, A2)=0 | eoBF< A1, A2, R > | [pure virtual] |
| ~eoBF() | eoBF< A1, A2, R > | [virtual] |
| ~eoFunctorBase() | eoFunctorBase | [virtual] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/classmoeoVectorVsVectorBinaryMetric.html b/trunk/paradiseo-moeo/doc/html/classmoeoVectorVsVectorBinaryMetric.html
new file mode 100644
index 000000000..8c764d10a
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/classmoeoVectorVsVectorBinaryMetric.html
@@ -0,0 +1,62 @@
+
+
+
+#include <moeoMetric.h>
+
+
Inheritance diagram for moeoVectorVsVectorBinaryMetric< ObjectiveVector, R >: +
+ +
+Definition at line 64 of file moeoMetric.h.
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/files.html b/trunk/paradiseo-moeo/doc/html/files.html
new file mode 100644
index 000000000..8d08ec70b
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/files.html
@@ -0,0 +1,105 @@
+
+
+| index.h [code] | |
| make_checkpoint_moeo.h [code] | |
| make_continue_moeo.h [code] | |
| make_ea_moeo.h [code] | |
| MOEO.h [code] | |
| moeoAchievementFitnessAssignment.h [code] | |
| moeoAdditiveEpsilonBinaryMetric.h [code] | |
| moeoAggregativeComparator.h [code] | |
| moeoAlgo.h [code] | |
| moeoArchive.h [code] | |
| moeoArchiveObjectiveVectorSavingUpdater.h [code] | |
| moeoArchiveUpdater.h [code] | |
| moeoBinaryIndicatorBasedFitnessAssignment.h [code] | |
| moeoBinaryMetricSavingUpdater.h [code] | |
| moeoBitVector.h [code] | |
| moeoCombinedLS.h [code] | |
| moeoComparator.h [code] | |
| moeoContributionMetric.h [code] | |
| moeoConvertPopToObjectiveVectors.h [code] | |
| moeoCriterionBasedFitnessAssignment.h [code] | |
| moeoCrowdingDiversityAssignment.h [code] | |
| moeoDetTournamentSelect.h [code] | |
| moeoDistance.h [code] | |
| moeoDistanceMatrix.h [code] | |
| moeoDiversityAssignment.h [code] | |
| moeoDiversityThenFitnessComparator.h [code] | |
| moeoDummyDiversityAssignment.h [code] | |
| moeoDummyFitnessAssignment.h [code] | |
| moeoEA.h [code] | |
| moeoEasyEA.h [code] | |
| moeoElitistReplacement.h [code] | |
| moeoEntropyMetric.h [code] | |
| moeoEnvironmentalReplacement.h [code] | |
| moeoEuclideanDistance.h [code] | |
| moeoEvalFunc.h [code] | |
| moeoExpBinaryIndicatorBasedFitnessAssignment.h [code] | |
| moeoFastNonDominatedSortingFitnessAssignment.h [code] | |
| moeoFitnessAssignment.h [code] | |
| moeoFitnessThenDiversityComparator.h [code] | |
| moeoFrontByFrontCrowdingDiversityAssignment.h [code] | |
| moeoFrontByFrontSharingDiversityAssignment.h [code] | |
| moeoGDominanceObjectiveVectorComparator.h [code] | |
| moeoGenerationalReplacement.h [code] | |
| moeoHybridLS.h [code] | |
| moeoHypervolumeBinaryMetric.h [code] | |
| moeoIBEA.h [code] | |
| moeoIndicatorBasedFitnessAssignment.h [code] | |
| moeoLS.h [code] | |
| moeoManhattanDistance.h [code] | |
| moeoMetric.h [code] | |
| moeoNormalizedDistance.h [code] | |
| moeoNormalizedSolutionVsSolutionBinaryMetric.h [code] | |
| moeoNSGA.h [code] | |
| moeoNSGAII.h [code] | |
| moeoObjectiveObjectiveVectorComparator.h [code] | |
| moeoObjectiveVector.h [code] | |
| moeoObjectiveVectorComparator.h [code] | |
| moeoObjectiveVectorTraits.cpp [code] | |
| moeoObjectiveVectorTraits.h [code] | |
| moeoOneObjectiveComparator.h [code] | |
| moeoParetoBasedFitnessAssignment.h [code] | |
| moeoParetoObjectiveVectorComparator.h [code] | |
| moeoRandomSelect.h [code] | |
| moeoRealObjectiveVector.h [code] | |
| moeoRealVector.h [code] | |
| moeoReplacement.h [code] | |
| moeoRouletteSelect.h [code] | |
| moeoScalarFitnessAssignment.h [code] | |
| moeoSelectFromPopAndArch.h [code] | |
| moeoSelectOne.h [code] | |
| moeoSelectors.h [code] | |
| moeoSharingDiversityAssignment.h [code] | |
| moeoStochTournamentSelect.h [code] | |
| moeoUnaryIndicatorBasedFitnessAssignment.h [code] | |
| moeoVector.h [code] |
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/functions.html b/trunk/paradiseo-moeo/doc/html/functions.html
new file mode 100644
index 000000000..7a6cc06f9
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/functions.html
@@ -0,0 +1,294 @@
+
+
++Here is a list of all documented class members with links to the class documentation for each member: +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/functions_func.html b/trunk/paradiseo-moeo/doc/html/functions_func.html
new file mode 100644
index 000000000..6b7de00b2
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/functions_func.html
@@ -0,0 +1,202 @@
+
+
++ +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/functions_type.html b/trunk/paradiseo-moeo/doc/html/functions_type.html
new file mode 100644
index 000000000..7e87abf29
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/functions_type.html
@@ -0,0 +1,54 @@
+
+
++
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/functions_vars.html b/trunk/paradiseo-moeo/doc/html/functions_vars.html
new file mode 100644
index 000000000..88b21508e
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/functions_vars.html
@@ -0,0 +1,181 @@
+
+
++ +
+
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/hierarchy.html b/trunk/paradiseo-moeo/doc/html/hierarchy.html
new file mode 100644
index 000000000..4025ed5c6
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/hierarchy.html
@@ -0,0 +1,296 @@
+
+
+ [external] [external] [external] [external]
+ [external]
+ [external]
+ [external]
+ [external]
+ [external]
+ [external]
+ [external]
+ [external]
+ [external] [external]
+ [external]
+ [external] [external]
+ [external]
+ [external]
+ [external]
+ [external]
+ [external]
+ [external]
+ [external]
+ [external] [external]
+ [external]
+ [external] [external] [external] [external] 1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/index_8h-source.html b/trunk/paradiseo-moeo/doc/html/index_8h-source.html
new file mode 100644
index 000000000..6bc7a2a0e
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/index_8h-source.html
@@ -0,0 +1,29 @@
+
+
+ 1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/main.html b/trunk/paradiseo-moeo/doc/html/main.html
new file mode 100644
index 000000000..fcedc961e
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/main.html
@@ -0,0 +1,38 @@
+
+
++
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/make__checkpoint__moeo_8h-source.html b/trunk/paradiseo-moeo/doc/html/make__checkpoint__moeo_8h-source.html
new file mode 100644
index 000000000..a4b0a34d4
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/make__checkpoint__moeo_8h-source.html
@@ -0,0 +1,189 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // make_checkpoint_moeo.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MAKE_CHECKPOINT_MOEO_H_ +00014 #define MAKE_CHECKPOINT_MOEO_H_ +00015 +00016 #include <stdlib.h> +00017 #include <sstream> +00018 #include <eoContinue.h> +00019 #include <eoEvalFuncCounter.h> +00020 #include <utils/checkpointing> +00021 #include <utils/selectors.h> +00022 #include <utils/eoParser.h> +00023 #include <utils/eoState.h> +00024 #include <metric/moeoContributionMetric.h> +00025 #include <metric/moeoEntropyMetric.h> +00026 #include <utils/moeoArchiveUpdater.h> +00027 #include <utils/moeoArchiveObjectiveVectorSavingUpdater.h> +00028 #include <utils/moeoBinaryMetricSavingUpdater.h> +00029 +00030 bool testDirRes(std::string _dirName, bool _erase); +00031 +00041 template < class MOEOT > +00042 eoCheckPoint < MOEOT > & do_make_checkpoint_moeo (eoParser & _parser, eoState & _state, eoEvalFuncCounter < MOEOT > & _eval, eoContinue < MOEOT > & _continue, eoPop < MOEOT > & _pop, moeoArchive < MOEOT > & _archive) +00043 { +00044 eoCheckPoint < MOEOT > & checkpoint = _state.storeFunctor(new eoCheckPoint < MOEOT > (_continue)); +00045 /* the objective vector type */ +00046 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00047 +00049 // Counters +00051 // is nb Eval to be used as counter? +00052 //bool useEval = _parser.getORcreateParam(true, "useEval", "Use nb of eval. as counter (vs nb of gen.)", '\0', "Output").value(); +00053 // Create anyway a generation-counter parameter +00054 eoValueParam<unsigned int> *generationCounter = new eoValueParam<unsigned int>(0, "Gen."); +00055 // Create an incrementor (sub-class of eoUpdater). +00056 eoIncrementor<unsigned int> & increment = _state.storeFunctor( new eoIncrementor<unsigned int>(generationCounter->value()) ); +00057 // Add it to the checkpoint +00058 checkpoint.add(increment); +00059 // dir for DISK output +00060 std::string & dirName = _parser.getORcreateParam(std::string("Res"), "resDir", "Directory to store DISK outputs", '\0', "Output").value(); +00061 // shoudl we empty it if exists +00062 eoValueParam<bool>& eraseParam = _parser.getORcreateParam(true, "eraseDir", "erase files in dirName if any", '\0', "Output"); +00063 bool dirOK = false; // not tested yet +00064 +00065 // Dump of the whole population +00066 //----------------------------- +00067 bool printPop = _parser.getORcreateParam(false, "printPop", "Print sorted pop. every gen.", '\0', "Output").value(); +00068 eoSortedPopStat<MOEOT> * popStat; +00069 if ( printPop ) // we do want pop dump +00070 { +00071 popStat = & _state.storeFunctor(new eoSortedPopStat<MOEOT>); +00072 checkpoint.add(*popStat); +00073 } +00074 +00076 // State savers +00078 // feed the state to state savers +00079 // save state every N generation +00080 eoValueParam<unsigned int>& saveFrequencyParam = _parser.createParam((unsigned int)(0), "saveFrequency", "Save every F generation (0 = only final state, absent = never)", '\0', "Persistence" ); +00081 if (_parser.isItThere(saveFrequencyParam)) +00082 { +00083 // first make sure dirName is OK +00084 if (! dirOK ) +00085 dirOK = testDirRes(dirName, eraseParam.value()); // TRUE +00086 unsigned int freq = (saveFrequencyParam.value()>0 ? saveFrequencyParam.value() : UINT_MAX ); +00087 #ifdef _MSVC +00088 std::string stmp = dirName + "\generations"; +00089 #else +00090 std::string stmp = dirName + "/generations"; +00091 #endif +00092 eoCountedStateSaver *stateSaver1 = new eoCountedStateSaver(freq, _state, stmp); +00093 _state.storeFunctor(stateSaver1); +00094 checkpoint.add(*stateSaver1); +00095 } +00096 // save state every T seconds +00097 eoValueParam<unsigned int>& saveTimeIntervalParam = _parser.getORcreateParam((unsigned int)(0), "saveTimeInterval", "Save every T seconds (0 or absent = never)", '\0',"Persistence" ); +00098 if (_parser.isItThere(saveTimeIntervalParam) && saveTimeIntervalParam.value()>0) +00099 { +00100 // first make sure dirName is OK +00101 if (! dirOK ) +00102 dirOK = testDirRes(dirName, eraseParam.value()); // TRUE +00103 #ifdef _MSVC +00104 std::string stmp = dirName + "\time"; +00105 #else +00106 std::string stmp = dirName + "/time"; +00107 #endif +00108 eoTimedStateSaver *stateSaver2 = new eoTimedStateSaver(saveTimeIntervalParam.value(), _state, stmp); +00109 _state.storeFunctor(stateSaver2); +00110 checkpoint.add(*stateSaver2); +00111 } +00112 +00114 // Archive +00116 // update the archive every generation +00117 bool updateArch = _parser.getORcreateParam(true, "updateArch", "Update the archive at each gen.", '\0', "Evolution Engine").value(); +00118 if (updateArch) +00119 { +00120 moeoArchiveUpdater < MOEOT > * updater = new moeoArchiveUpdater < MOEOT > (_archive, _pop); +00121 _state.storeFunctor(updater); +00122 checkpoint.add(*updater); +00123 } +00124 // store the objective vectors contained in the archive every generation +00125 bool storeArch = _parser.getORcreateParam(false, "storeArch", "Store the archive's objective vectors at each gen.", '\0', "Output").value(); +00126 if (storeArch) +00127 { +00128 if (! dirOK ) +00129 dirOK = testDirRes(dirName, eraseParam.value()); // TRUE +00130 #ifdef _MSVC +00131 std::string stmp = dirName + "\arch"; +00132 #else +00133 std::string stmp = dirName + "/arch"; +00134 #endif +00135 moeoArchiveObjectiveVectorSavingUpdater < MOEOT > * save_updater = new moeoArchiveObjectiveVectorSavingUpdater < MOEOT > (_archive, stmp); +00136 _state.storeFunctor(save_updater); +00137 checkpoint.add(*save_updater); +00138 } +00139 // store the contribution of the non-dominated solutions +00140 bool cont = _parser.getORcreateParam(false, "contribution", "Store the contribution of the archive at each gen.", '\0', "Output").value(); +00141 if (cont) +00142 { +00143 if (! dirOK ) +00144 dirOK = testDirRes(dirName, eraseParam.value()); // TRUE +00145 #ifdef _MSVC +00146 std::string stmp = dirName + "\contribution"; +00147 #else +00148 std::string stmp = dirName + "/contribution"; +00149 #endif +00150 moeoContributionMetric < ObjectiveVector > * contribution = new moeoContributionMetric < ObjectiveVector >; +00151 moeoBinaryMetricSavingUpdater < MOEOT > * contribution_updater = new moeoBinaryMetricSavingUpdater < MOEOT > (*contribution, _archive, stmp); +00152 _state.storeFunctor(contribution_updater); +00153 checkpoint.add(*contribution_updater); +00154 } +00155 // store the entropy of the non-dominated solutions +00156 bool ent = _parser.getORcreateParam(false, "entropy", "Store the entropy of the archive at each gen.", '\0', "Output").value(); +00157 if (ent) +00158 { +00159 if (! dirOK ) +00160 dirOK = testDirRes(dirName, eraseParam.value()); // TRUE +00161 #ifdef _MSVC +00162 std::string stmp = dirName + "\entropy"; +00163 #else +00164 std::string stmp = dirName + "/entropy"; +00165 #endif +00166 moeoEntropyMetric < ObjectiveVector > * entropy = new moeoEntropyMetric < ObjectiveVector >; +00167 moeoBinaryMetricSavingUpdater < MOEOT > * entropy_updater = new moeoBinaryMetricSavingUpdater < MOEOT > (*entropy, _archive, stmp); +00168 _state.storeFunctor(entropy_updater); +00169 checkpoint.add(*entropy_updater); +00170 } +00171 +00172 // and that's it for the (control and) output +00173 return checkpoint; +00174 } +00175 +00176 #endif /*MAKE_CHECKPOINT_MOEO_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/make__continue__moeo_8h-source.html b/trunk/paradiseo-moeo/doc/html/make__continue__moeo_8h-source.html
new file mode 100644
index 000000000..af0a53b81
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/make__continue__moeo_8h-source.html
@@ -0,0 +1,123 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // make_continue_moeo.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MAKE_CONTINUE_MOEO_H_ +00014 #define MAKE_CONTINUE_MOEO_H_ +00015 +00016 #include <eoCombinedContinue.h> +00017 #include <eoGenContinue.h> +00018 #include <eoEvalContinue.h> +00019 #include <eoFitContinue.h> +00020 #include <eoTimeContinue.h> +00021 #ifndef _MSC_VER +00022 #include <eoCtrlCContinue.h> +00023 #endif +00024 #include <utils/eoParser.h> +00025 #include <utils/eoState.h> +00026 +00027 +00033 template <class MOEOT> +00034 eoCombinedContinue<MOEOT> * make_combinedContinue(eoCombinedContinue<MOEOT> *_combined, eoContinue<MOEOT> *_cont) +00035 { +00036 if (_combined) // already exists +00037 _combined->add(*_cont); +00038 else +00039 _combined = new eoCombinedContinue<MOEOT>(*_cont); +00040 return _combined; +00041 } +00042 +00043 +00050 template <class MOEOT> +00051 eoContinue<MOEOT> & do_make_continue_moeo(eoParser& _parser, eoState& _state, eoEvalFuncCounter<MOEOT> & _eval) +00052 { +00053 // the combined continue - to be filled +00054 eoCombinedContinue<MOEOT> *continuator = NULL; +00055 // First the eoGenContinue - need a default value so you can run blind +00056 // but we also need to be able to avoid it <--> 0 +00057 eoValueParam<unsigned int>& maxGenParam = _parser.createParam((unsigned int)(100), "maxGen", "Maximum number of generations (0 = none)",'G',"Stopping criterion"); +00058 if (maxGenParam.value()) // positive: -> define and store +00059 { +00060 eoGenContinue<MOEOT> *genCont = new eoGenContinue<MOEOT>(maxGenParam.value()); +00061 _state.storeFunctor(genCont); +00062 // and "add" to combined +00063 continuator = make_combinedContinue<MOEOT>(continuator, genCont); +00064 } +00065 // maxEval +00066 eoValueParam<unsigned long>& maxEvalParam = _parser.getORcreateParam((unsigned long)(0), "maxEval", "Maximum number of evaluations (0 = none)", 'E', "Stopping criterion"); +00067 if (maxEvalParam.value()) +00068 { +00069 eoEvalContinue<MOEOT> *evalCont = new eoEvalContinue<MOEOT>(_eval, maxEvalParam.value()); +00070 _state.storeFunctor(evalCont); +00071 // and "add" to combined +00072 continuator = make_combinedContinue<MOEOT>(continuator, evalCont); +00073 } +00074 // maxTime +00075 eoValueParam<unsigned long>& maxTimeParam = _parser.getORcreateParam((unsigned long)(0), "maxTime", "Maximum running time in seconds (0 = none)", 'T', "Stopping criterion"); +00076 if (maxTimeParam.value()) // positive: -> define and store +00077 { +00078 eoTimeContinue<MOEOT> *timeCont = new eoTimeContinue<MOEOT>(maxTimeParam.value()); +00079 _state.storeFunctor(timeCont); +00080 // and "add" to combined +00081 continuator = make_combinedContinue<MOEOT>(continuator, timeCont); +00082 } +00083 // CtrlC +00084 #ifndef _MSC_VER +00085 // the CtrlC interception (Linux only I'm afraid) +00086 eoCtrlCContinue<MOEOT> *ctrlCCont; +00087 eoValueParam<bool>& ctrlCParam = _parser.createParam(true, "CtrlC", "Terminate current generation upon Ctrl C",'C', "Stopping criterion"); +00088 if (_parser.isItThere(ctrlCParam)) +00089 { +00090 ctrlCCont = new eoCtrlCContinue<MOEOT>; +00091 // store +00092 _state.storeFunctor(ctrlCCont); +00093 // add to combinedContinue +00094 continuator = make_combinedContinue<MOEOT>(continuator, ctrlCCont); +00095 } +00096 #endif +00097 // now check that there is at least one! +00098 if (!continuator) +00099 throw std::runtime_error("You MUST provide a stopping criterion"); +00100 // OK, it's there: store in the eoState +00101 _state.storeFunctor(continuator); +00102 // and return +00103 return *continuator; +00104 } +00105 +00106 #endif /*MAKE_CONTINUE_MOEO_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/make__ea__moeo_8h-source.html b/trunk/paradiseo-moeo/doc/html/make__ea__moeo_8h-source.html
new file mode 100644
index 000000000..c666da25b
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/make__ea__moeo_8h-source.html
@@ -0,0 +1,291 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // make_ea_moeo.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MAKE_EA_MOEO_H_ +00014 #define MAKE_EA_MOEO_H_ +00015 +00016 #include <stdlib.h> +00017 #include <eoContinue.h> +00018 #include <eoEvalFunc.h> +00019 #include <eoGeneralBreeder.h> +00020 #include <eoGenOp.h> +00021 #include <utils/eoParser.h> +00022 #include <utils/eoState.h> +00023 +00024 #include <algo/moeoEA.h> +00025 #include <algo/moeoEasyEA.h> +00026 #include <archive/moeoArchive.h> +00027 #include <comparator/moeoAggregativeComparator.h> +00028 #include <comparator/moeoComparator.h> +00029 #include <comparator/moeoDiversityThenFitnessComparator.h> +00030 #include <comparator/moeoFitnessThenDiversityComparator.h> +00031 #include <diversity/moeoDiversityAssignment.h> +00032 #include <diversity/moeoDummyDiversityAssignment.h> +00033 #include <diversity/moeoFrontByFrontCrowdingDiversityAssignment.h> +00034 #include <diversity/moeoFrontByFrontSharingDiversityAssignment.h> +00035 #include <fitness/moeoDummyFitnessAssignment.h> +00036 #include <fitness/moeoExpBinaryIndicatorBasedFitnessAssignment.h> +00037 #include <fitness/moeoFastNonDominatedSortingFitnessAssignment.h> +00038 #include <fitness/moeoFitnessAssignment.h> +00039 #include <metric/moeoAdditiveEpsilonBinaryMetric.h> +00040 #include <metric/moeoHypervolumeBinaryMetric.h> +00041 #include <metric/moeoNormalizedSolutionVsSolutionBinaryMetric.h> +00042 #include <replacement/moeoElitistReplacement.h> +00043 #include <replacement/moeoEnvironmentalReplacement.h> +00044 #include <replacement/moeoGenerationalReplacement.h> +00045 #include <replacement/moeoReplacement.h> +00046 #include <selection/moeoDetTournamentSelect.h> +00047 #include <selection/moeoRandomSelect.h> +00048 #include <selection/moeoStochTournamentSelect.h> +00049 #include <selection/moeoSelectOne.h> +00050 #include <selection/moeoSelectors.h> +00051 +00052 +00062 template < class MOEOT > +00063 moeoEA < MOEOT > & do_make_ea_moeo(eoParser & _parser, eoState & _state, eoEvalFunc < MOEOT > & _eval, eoContinue < MOEOT > & _continue, eoGenOp < MOEOT > & _op, moeoArchive < MOEOT > & _archive) +00064 { +00065 +00066 /* the objective vector type */ +00067 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00068 +00069 +00070 /* the fitness assignment strategy */ +00071 std::string & fitnessParam = _parser.createParam(std::string("FastNonDominatedSorting"), "fitness", +00072 "Fitness assignment scheme: Dummy, FastNonDominatedSorting or IndicatorBased", 'F', +00073 "Evolution Engine").value(); +00074 std::string & indicatorParam = _parser.createParam(std::string("Epsilon"), "indicator", +00075 "Binary indicator for IndicatorBased: Epsilon, Hypervolume", 'i', +00076 "Evolution Engine").value(); +00077 double rho = _parser.createParam(1.1, "rho", "reference point for the hypervolume indicator", 'r', +00078 "Evolution Engine").value(); +00079 double kappa = _parser.createParam(0.05, "kappa", "Scaling factor kappa for IndicatorBased", 'k', +00080 "Evolution Engine").value(); +00081 moeoFitnessAssignment < MOEOT > * fitnessAssignment; +00082 if (fitnessParam == std::string("Dummy")) +00083 { +00084 fitnessAssignment = new moeoDummyFitnessAssignment < MOEOT> (); +00085 } +00086 else if (fitnessParam == std::string("FastNonDominatedSorting")) +00087 { +00088 fitnessAssignment = new moeoFastNonDominatedSortingFitnessAssignment < MOEOT> (); +00089 } +00090 else if (fitnessParam == std::string("IndicatorBased")) +00091 { +00092 // metric +00093 moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > *metric; +00094 if (indicatorParam == std::string("Epsilon")) +00095 { +00096 metric = new moeoAdditiveEpsilonBinaryMetric < ObjectiveVector >; +00097 } +00098 else if (indicatorParam == std::string("Hypervolume")) +00099 { +00100 metric = new moeoHypervolumeBinaryMetric < ObjectiveVector > (rho); +00101 } +00102 else +00103 { +00104 std::string stmp = std::string("Invalid binary quality indicator: ") + indicatorParam; +00105 throw std::runtime_error(stmp.c_str()); +00106 } +00107 fitnessAssignment = new moeoExpBinaryIndicatorBasedFitnessAssignment < MOEOT > (*metric, kappa); +00108 } +00109 else +00110 { +00111 std::string stmp = std::string("Invalid fitness assignment strategy: ") + fitnessParam; +00112 throw std::runtime_error(stmp.c_str()); +00113 } +00114 _state.storeFunctor(fitnessAssignment); +00115 +00116 +00117 /* the diversity assignment strategy */ +00118 eoValueParam<eoParamParamType> & diversityParam = _parser.createParam(eoParamParamType("Dummy"), "diversity", +00119 "Diversity assignment scheme: Dummy, Sharing(nicheSize) or Crowding", 'D', "Evolution Engine"); +00120 eoParamParamType & diversityParamValue = diversityParam.value(); +00121 moeoDiversityAssignment < MOEOT > * diversityAssignment; +00122 if (diversityParamValue.first == std::string("Dummy")) +00123 { +00124 diversityAssignment = new moeoDummyDiversityAssignment < MOEOT> (); +00125 } +00126 else if (diversityParamValue.first == std::string("Sharing")) +00127 { +00128 double nicheSize; +00129 if (!diversityParamValue.second.size()) // no parameter added +00130 { +00131 std::cerr << "WARNING, no niche size given for Sharing, using 0.5" << std::endl; +00132 nicheSize = 0.5; +00133 diversityParamValue.second.push_back(std::string("0.5")); +00134 } +00135 else +00136 { +00137 nicheSize = atoi(diversityParamValue.second[0].c_str()); +00138 } +00139 diversityAssignment = new moeoFrontByFrontSharingDiversityAssignment < MOEOT> (nicheSize); +00140 } +00141 else if (diversityParamValue.first == std::string("Crowding")) +00142 { +00143 diversityAssignment = new moeoFrontByFrontCrowdingDiversityAssignment < MOEOT> (); +00144 } +00145 else +00146 { +00147 std::string stmp = std::string("Invalid diversity assignment strategy: ") + diversityParamValue.first; +00148 throw std::runtime_error(stmp.c_str()); +00149 } +00150 _state.storeFunctor(diversityAssignment); +00151 +00152 +00153 /* the comparator strategy */ +00154 std::string & comparatorParam = _parser.createParam(std::string("FitnessThenDiversity"), "comparator", +00155 "Comparator scheme: FitnessThenDiversity, DiversityThenFitness or Aggregative", 'C', "Evolution Engine").value(); +00156 moeoComparator < MOEOT > * comparator; +00157 if (comparatorParam == std::string("FitnessThenDiversity")) +00158 { +00159 comparator = new moeoFitnessThenDiversityComparator < MOEOT> (); +00160 } +00161 else if (comparatorParam == std::string("DiversityThenFitness")) +00162 { +00163 comparator = new moeoDiversityThenFitnessComparator < MOEOT> (); +00164 } +00165 else if (comparatorParam == std::string("Aggregative")) +00166 { +00167 comparator = new moeoAggregativeComparator < MOEOT> (); +00168 } +00169 else +00170 { +00171 std::string stmp = std::string("Invalid comparator strategy: ") + comparatorParam; +00172 throw std::runtime_error(stmp.c_str()); +00173 } +00174 _state.storeFunctor(comparator); +00175 +00176 +00177 /* the selection strategy */ +00178 eoValueParam < eoParamParamType > & selectionParam = _parser.createParam(eoParamParamType("DetTour(2)"), "selection", +00179 "Selection scheme: DetTour(T), StochTour(t) or Random", 'S', "Evolution Engine"); +00180 eoParamParamType & ppSelect = selectionParam.value(); +00181 moeoSelectOne < MOEOT > * select; +00182 if (ppSelect.first == std::string("DetTour")) +00183 { +00184 unsigned int tSize; +00185 if (!ppSelect.second.size()) // no parameter added +00186 { +00187 std::cerr << "WARNING, no parameter passed to DetTour, using 2" << std::endl; +00188 tSize = 2; +00189 // put back 2 in parameter for consistency (and status file) +00190 ppSelect.second.push_back(std::string("2")); +00191 } +00192 else // parameter passed by user as DetTour(T) +00193 { +00194 tSize = atoi(ppSelect.second[0].c_str()); +00195 } +00196 select = new moeoDetTournamentSelect < MOEOT > (*comparator, tSize); +00197 } +00198 else if (ppSelect.first == std::string("StochTour")) +00199 { +00200 double tRate; +00201 if (!ppSelect.second.size()) // no parameter added +00202 { +00203 std::cerr << "WARNING, no parameter passed to StochTour, using 1" << std::endl; +00204 tRate = 1; +00205 // put back 1 in parameter for consistency (and status file) +00206 ppSelect.second.push_back(std::string("1")); +00207 } +00208 else // parameter passed by user as StochTour(T) +00209 { +00210 tRate = atof(ppSelect.second[0].c_str()); +00211 } +00212 select = new moeoStochTournamentSelect < MOEOT > (*comparator, tRate); +00213 } +00214 /* +00215 else if (ppSelect.first == string("Roulette")) +00216 { +00217 // TO DO ! +00218 // ... +00219 } +00220 */ +00221 else if (ppSelect.first == std::string("Random")) +00222 { +00223 select = new moeoRandomSelect <MOEOT > (); +00224 } +00225 else +00226 { +00227 std::string stmp = std::string("Invalid selection strategy: ") + ppSelect.first; +00228 throw std::runtime_error(stmp.c_str()); +00229 } +00230 _state.storeFunctor(select); +00231 +00232 +00233 /* the replacement strategy */ +00234 std::string & replacementParam = _parser.createParam(std::string("Elitist"), "replacement", +00235 "Replacement scheme: Elitist, Environmental or Generational", 'R', "Evolution Engine").value(); +00236 moeoReplacement < MOEOT > * replace; +00237 if (replacementParam == std::string("Elitist")) +00238 { +00239 replace = new moeoElitistReplacement < MOEOT> (*fitnessAssignment, *diversityAssignment, *comparator); +00240 } +00241 else if (replacementParam == std::string("Environmental")) +00242 { +00243 replace = new moeoEnvironmentalReplacement < MOEOT> (*fitnessAssignment, *diversityAssignment, *comparator); +00244 } +00245 else if (replacementParam == std::string("Generational")) +00246 { +00247 replace = new moeoGenerationalReplacement < MOEOT> (); +00248 } +00249 else +00250 { +00251 std::string stmp = std::string("Invalid replacement strategy: ") + replacementParam; +00252 throw std::runtime_error(stmp.c_str()); +00253 } +00254 _state.storeFunctor(replace); +00255 +00256 +00257 /* the number of offspring */ +00258 eoValueParam < eoHowMany > & offspringRateParam = _parser.createParam(eoHowMany(1.0), "nbOffspring", +00259 "Number of offspring (percentage or absolute)", 'O', "Evolution Engine"); +00260 +00261 +00262 // the general breeder +00263 eoGeneralBreeder < MOEOT > * breed = new eoGeneralBreeder < MOEOT > (*select, _op, offspringRateParam.value()); +00264 _state.storeFunctor(breed); +00265 // the eoEasyEA +00266 moeoEA < MOEOT > * algo = new moeoEasyEA < MOEOT > (_continue, _eval, *breed, *replace, *fitnessAssignment, *diversityAssignment); +00267 _state.storeFunctor(algo); +00268 return *algo; +00269 +00270 } +00271 +00272 #endif /*MAKE_EA_MOEO_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoAchievementFitnessAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoAchievementFitnessAssignment_8h-source.html
new file mode 100644
index 000000000..c3adbd5dc
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoAchievementFitnessAssignment_8h-source.html
@@ -0,0 +1,135 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoAchievementFitnessAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOACHIEVEMENTFITNESSASSIGNMENT_H_ +00014 #define MOEOACHIEVEMENTFITNESSASSIGNMENT_H_ +00015 +00016 #include <vector> +00017 #include <eoPop.h> +00018 #include <fitness/moeoScalarFitnessAssignment.h> +00019 +00023 template < class MOEOT > +00024 class moeoAchievementFitnessAssignment : public moeoScalarFitnessAssignment < MOEOT > +00025 { +00026 public: +00027 +00029 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00030 +00031 +00038 moeoAchievementFitnessAssignment(ObjectiveVector & _reference, std::vector < double > & _lambdas, double _spn=0.0001) : reference(_reference), lambdas(_lambdas), spn(_spn) +00039 { +00040 // consistency check +00041 if ((spn < 0.0) || (spn > 1.0)) +00042 { +00043 std::cout << "Warning, the arbitrary small positive number should be > 0 and <<1, adjusted to 0.0001\n"; +00044 spn = 0.0001; +00045 } +00046 } +00047 +00048 +00054 moeoAchievementFitnessAssignment(ObjectiveVector & _reference, double _spn=0.0001) : reference(_reference), spn(_spn) +00055 { +00056 // compute the default values for lambdas +00057 lambdas = std::vector < double > (ObjectiveVector::nObjectives()); +00058 for (unsigned int i=0 ; i<lambdas.size(); i++) +00059 { +00060 lambdas[i] = 1.0 / ObjectiveVector::nObjectives(); +00061 } +00062 // consistency check +00063 if ((spn < 0.0) || (spn > 1.0)) +00064 { +00065 std::cout << "Warning, the arbitrary small positive number should be > 0 and <<1, adjusted to 0.0001\n"; +00066 spn = 0.0001; +00067 } +00068 } +00069 +00070 +00075 virtual void operator()(eoPop < MOEOT > & _pop) +00076 { +00077 for (unsigned int i=0; i<_pop.size() ; i++) +00078 { +00079 compute(_pop[i]); +00080 } +00081 } +00082 +00083 +00089 void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) +00090 { +00091 // nothing to do ;-) +00092 } +00093 +00094 +00099 void setReference(const ObjectiveVector & _reference) +00100 { +00101 reference = _reference; +00102 } +00103 +00104 +00105 private: +00106 +00108 ObjectiveVector reference; +00110 std::vector < double > lambdas; +00112 double spn; +00113 +00114 +00118 double inf() const +00119 { +00120 return std::numeric_limits<double>::max(); +00121 } +00122 +00123 +00128 void compute(MOEOT & _moeo) +00129 { +00130 unsigned int nobj = MOEOT::ObjectiveVector::nObjectives(); +00131 double temp; +00132 double min = inf(); +00133 double sum = 0; +00134 for (unsigned int obj=0; obj<nobj; obj++) +00135 { +00136 temp = lambdas[obj] * (reference[obj] - _moeo.objectiveVector()[obj]); +00137 min = std::min(min, temp); +00138 sum += temp; +00139 } +00140 _moeo.fitness(min + spn*sum); +00141 } +00142 +00143 }; +00144 +00145 #endif /*MOEOACHIEVEMENTFITNESSASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoAdditiveEpsilonBinaryMetric_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoAdditiveEpsilonBinaryMetric_8h-source.html
new file mode 100644
index 000000000..2ff11db8c
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoAdditiveEpsilonBinaryMetric_8h-source.html
@@ -0,0 +1,92 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoAdditiveEpsilonBinaryMetric.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOADDITIVEEPSILONBINARYMETRIC_H_ +00014 #define MOEOADDITIVEEPSILONBINARYMETRIC_H_ +00015 +00016 #include <metric/moeoNormalizedSolutionVsSolutionBinaryMetric.h> +00017 +00023 template < class ObjectiveVector > +00024 class moeoAdditiveEpsilonBinaryMetric : public moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > +00025 { +00026 public: +00027 +00035 double operator()(const ObjectiveVector & _o1, const ObjectiveVector & _o2) +00036 { +00037 // computation of the epsilon value for the first objective +00038 double result = epsilon(_o1, _o2, 0); +00039 // computation of the epsilon value for the other objectives +00040 double tmp; +00041 for (unsigned int i=1; i<ObjectiveVector::Traits::nObjectives(); i++) +00042 { +00043 tmp = epsilon(_o1, _o2, i); +00044 result = std::max(result, tmp); +00045 } +00046 // returns the maximum epsilon value +00047 return result; +00048 } +00049 +00050 +00051 private: +00052 +00054 using moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > :: bounds; +00055 +00056 +00064 double epsilon(const ObjectiveVector & _o1, const ObjectiveVector & _o2, const unsigned int _obj) +00065 { +00066 double result; +00067 // if the objective _obj have to be minimized +00068 if (ObjectiveVector::Traits::minimizing(_obj)) +00069 { +00070 // _o1[_obj] - _o2[_obj] +00071 result = ( (_o1[_obj] - bounds[_obj].minimum()) / bounds[_obj].range() ) - ( (_o2[_obj] - bounds[_obj].minimum()) / bounds[_obj].range() ); +00072 } +00073 // if the objective _obj have to be maximized +00074 else +00075 { +00076 // _o2[_obj] - _o1[_obj] +00077 result = ( (_o2[_obj] - bounds[_obj].minimum()) / bounds[_obj].range() ) - ( (_o1[_obj] - bounds[_obj].minimum()) / bounds[_obj].range() ); +00078 } +00079 return result; +00080 } +00081 +00082 }; +00083 +00084 #endif /*MOEOADDITIVEEPSILONBINARYMETRIC_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoAggregativeComparator_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoAggregativeComparator_8h-source.html
new file mode 100644
index 000000000..bad8c503c
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoAggregativeComparator_8h-source.html
@@ -0,0 +1,68 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoAggregativeComparator.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOAGGREGATIVECOMPARATOR_H_ +00014 #define MOEOAGGREGATIVECOMPARATOR_H_ +00015 +00016 #include <comparator/moeoComparator.h> +00017 +00021 template < class MOEOT > +00022 class moeoAggregativeComparator : public moeoComparator < MOEOT > +00023 { +00024 public: +00025 +00031 moeoAggregativeComparator(double _weightFitness = 1.0, double _weightDiversity = 1.0) : weightFitness(_weightFitness), weightDiversity(_weightDiversity) +00032 {} +00033 +00034 +00040 const bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2) +00041 { +00042 return ( weightFitness * _moeo1.fitness() + weightDiversity * _moeo1.diversity() ) < ( weightFitness * _moeo2.fitness() + weightDiversity * _moeo2.diversity() ); +00043 } +00044 +00045 +00046 private: +00047 +00049 double weightFitness; +00051 double weightDiversity; +00052 +00053 }; +00054 +00055 #endif /*MOEOAGGREGATIVECOMPARATOR_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoAlgo_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoAlgo_8h-source.html
new file mode 100644
index 000000000..164ca48f2
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoAlgo_8h-source.html
@@ -0,0 +1,46 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoAlgo.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOALGO_H_ +00014 #define MOEOALGO_H_ +00015 +00019 class moeoAlgo {}; +00020 +00021 #endif /*MOEOALGO_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoArchiveObjectiveVectorSavingUpdater_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoArchiveObjectiveVectorSavingUpdater_8h-source.html
new file mode 100644
index 000000000..472ac2467
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoArchiveObjectiveVectorSavingUpdater_8h-source.html
@@ -0,0 +1,104 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoArchiveObjectiveVectorSavingUpdater.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOARCHIVEOBJECTIVEVECTORSAVINGUPDATER_H_ +00014 #define MOEOARCHIVEOBJECTIVEVECTORSAVINGUPDATER_H_ +00015 +00016 #include <fstream> +00017 #include <string> +00018 #include <eoPop.h> +00019 #include <utils/eoUpdater.h> +00020 #include <archive/moeoArchive.h> +00021 +00022 #define MAX_BUFFER_SIZE 1000 +00023 +00027 template < class MOEOT > +00028 class moeoArchiveObjectiveVectorSavingUpdater : public eoUpdater +00029 { +00030 public: +00031 +00039 moeoArchiveObjectiveVectorSavingUpdater (moeoArchive<MOEOT> & _arch, const std::string & _filename, bool _count = false, int _id = -1) : +00040 arch(_arch), filename(_filename), count(_count), counter(0), id(_id) +00041 {} +00042 +00043 +00047 void operator()() { +00048 char buff[MAX_BUFFER_SIZE]; +00049 if (count) +00050 { +00051 if (id == -1) +00052 { +00053 sprintf (buff, "%s.%u", filename.c_str(), counter ++); +00054 } +00055 else +00056 { +00057 sprintf (buff, "%s.%u.%u", filename.c_str(), id, counter ++); +00058 } +00059 } +00060 else +00061 { +00062 if (id == -1) +00063 { +00064 sprintf (buff, "%s", filename.c_str()); +00065 } +00066 else +00067 { +00068 sprintf (buff, "%s.%u", filename.c_str(), id); +00069 } +00070 counter ++; +00071 } +00072 std::ofstream f(buff); +00073 for (unsigned int i = 0; i < arch.size (); i++) +00074 f << arch[i].objectiveVector() << std::endl; +00075 f.close (); +00076 } +00077 +00078 +00079 private: +00080 +00082 moeoArchive<MOEOT> & arch; +00084 std::string filename; +00086 bool count; +00088 unsigned int counter; +00090 int id; +00091 +00092 }; +00093 +00094 #endif /*MOEOARCHIVEOBJECTIVEVECTORSAVINGUPDATER_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoArchiveUpdater_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoArchiveUpdater_8h-source.html
new file mode 100644
index 000000000..9bb5c2e89
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoArchiveUpdater_8h-source.html
@@ -0,0 +1,69 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoArchiveUpdater.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOARCHIVEUPDATER_H_ +00014 #define MOEOARCHIVEUPDATER_H_ +00015 +00016 #include <eoPop.h> +00017 #include <utils/eoUpdater.h> +00018 #include <archive/moeoArchive.h> +00019 +00023 template < class MOEOT > +00024 class moeoArchiveUpdater : public eoUpdater +00025 { +00026 public: +00027 +00033 moeoArchiveUpdater(moeoArchive < MOEOT > & _arch, const eoPop < MOEOT > & _pop) : arch(_arch), pop(_pop) +00034 {} +00035 +00036 +00040 void operator()() { +00041 arch.update(pop); +00042 } +00043 +00044 +00045 private: +00046 +00048 moeoArchive < MOEOT > & arch; +00050 const eoPop < MOEOT > & pop; +00051 +00052 }; +00053 +00054 #endif /*MOEOARCHIVEUPDATER_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoArchive_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoArchive_8h-source.html
new file mode 100644
index 000000000..bacac510c
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoArchive_8h-source.html
@@ -0,0 +1,172 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoArchive.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOARCHIVE_H_ +00014 #define MOEOARCHIVE_H_ +00015 +00016 #include <eoPop.h> +00017 #include <comparator/moeoObjectiveVectorComparator.h> +00018 #include <comparator/moeoParetoObjectiveVectorComparator.h> +00019 +00023 template < class MOEOT > +00024 class moeoArchive : public eoPop < MOEOT > +00025 { +00026 public: +00027 +00028 using eoPop < MOEOT > :: size; +00029 using eoPop < MOEOT > :: operator[]; +00030 using eoPop < MOEOT > :: back; +00031 using eoPop < MOEOT > :: pop_back; +00032 +00033 +00037 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00038 +00039 +00044 moeoArchive() : eoPop < MOEOT >(), comparator(paretoComparator) +00045 {} +00046 +00047 +00052 moeoArchive(moeoObjectiveVectorComparator < ObjectiveVector > & _comparator) : eoPop < MOEOT >(), comparator(_comparator) +00053 {} +00054 +00055 +00060 bool dominates (const ObjectiveVector & _objectiveVector) const +00061 { +00062 for (unsigned int i = 0; i<size(); i++) +00063 { +00064 // if _objectiveVector is dominated by the ith individual of the archive... +00065 if ( comparator(_objectiveVector, operator[](i).objectiveVector()) ) +00066 { +00067 return true; +00068 } +00069 } +00070 return false; +00071 } +00072 +00073 +00078 bool contains (const ObjectiveVector & _objectiveVector) const +00079 { +00080 for (unsigned int i = 0; i<size(); i++) +00081 { +00082 if (operator[](i).objectiveVector() == _objectiveVector) +00083 { +00084 return true; +00085 } +00086 } +00087 return false; +00088 } +00089 +00090 +00095 void update (const MOEOT & _moeo) +00096 { +00097 // first step: removing the dominated solutions from the archive +00098 for (unsigned int j=0; j<size();) +00099 { +00100 // if the jth solution contained in the archive is dominated by _moeo +00101 if ( comparator(operator[](j).objectiveVector(), _moeo.objectiveVector()) ) +00102 { +00103 operator[](j) = back(); +00104 pop_back(); +00105 } +00106 else if (_moeo.objectiveVector() == operator[](j).objectiveVector()) +00107 { +00108 operator[](j) = back(); +00109 pop_back(); +00110 } +00111 else +00112 { +00113 j++; +00114 } +00115 } +00116 // second step: is _moeo dominated? +00117 bool dom = false; +00118 for (unsigned int j=0; j<size(); j++) +00119 { +00120 // if _moeo is dominated by the jth solution contained in the archive +00121 if ( comparator(_moeo.objectiveVector(), operator[](j).objectiveVector()) ) +00122 { +00123 dom = true; +00124 break; +00125 } +00126 } +00127 if (!dom) +00128 { +00129 push_back(_moeo); +00130 } +00131 } +00132 +00133 +00138 void update (const eoPop < MOEOT > & _pop) +00139 { +00140 for (unsigned int i=0; i<_pop.size(); i++) +00141 { +00142 update(_pop[i]); +00143 } +00144 } +00145 +00146 +00151 bool equals (const moeoArchive < MOEOT > & _arch) +00152 { +00153 for (unsigned int i=0; i<size(); i++) +00154 { +00155 if (! _arch.contains(operator[](i).objectiveVector())) +00156 { +00157 return false; +00158 } +00159 } +00160 for (unsigned int i=0; i<_arch.size() ; i++) +00161 { +00162 if (! contains(_arch[i].objectiveVector())) +00163 { +00164 return false; +00165 } +00166 } +00167 return true; +00168 } +00169 +00170 +00171 private: +00172 +00174 moeoObjectiveVectorComparator < ObjectiveVector > & comparator; +00176 moeoParetoObjectiveVectorComparator < ObjectiveVector > paretoComparator; +00177 +00178 }; +00179 +00180 #endif /*MOEOARCHIVE_H_ */ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoBinaryIndicatorBasedFitnessAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoBinaryIndicatorBasedFitnessAssignment_8h-source.html
new file mode 100644
index 000000000..22dd7412c
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoBinaryIndicatorBasedFitnessAssignment_8h-source.html
@@ -0,0 +1,49 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoBinaryIndicatorBasedFitnessAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOBINARYINDICATORBASEDFITNESSASSIGNMENT_H_ +00014 #define MOEOBINARYINDICATORBASEDFITNESSASSIGNMENT_H_ +00015 +00016 #include <fitness/moeoIndicatorBasedFitnessAssignment.h> +00017 +00021 template < class MOEOT > +00022 class moeoBinaryIndicatorBasedFitnessAssignment : public moeoIndicatorBasedFitnessAssignment < MOEOT > {}; +00023 +00024 #endif /*MOEOINDICATORBASEDFITNESSASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoBinaryMetricSavingUpdater_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoBinaryMetricSavingUpdater_8h-source.html
new file mode 100644
index 000000000..0ada8ebab
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoBinaryMetricSavingUpdater_8h-source.html
@@ -0,0 +1,98 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoBinaryMetricSavingUpdater.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOBINARYMETRICSAVINGUPDATER_H_ +00014 #define MOEOBINARYMETRICSAVINGUPDATER_H_ +00015 +00016 #include <fstream> +00017 #include <string> +00018 #include <vector> +00019 #include <eoPop.h> +00020 #include <utils/eoUpdater.h> +00021 #include <metric/moeoMetric.h> +00022 +00027 template < class MOEOT > +00028 class moeoBinaryMetricSavingUpdater : public eoUpdater +00029 { +00030 public: +00031 +00033 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00034 +00035 +00042 moeoBinaryMetricSavingUpdater (moeoVectorVsVectorBinaryMetric < ObjectiveVector, double > & _metric, const eoPop < MOEOT > & _pop, std::string _filename) : +00043 metric(_metric), pop(_pop), filename(_filename), counter(1) +00044 {} +00045 +00046 +00050 void operator()() { +00051 if (pop.size()) { +00052 if (firstGen) { +00053 firstGen = false; +00054 } +00055 else { +00056 // creation of the two Pareto sets +00057 std::vector < ObjectiveVector > from; +00058 std::vector < ObjectiveVector > to; +00059 for (unsigned int i=0; i<pop.size(); i++) +00060 from.push_back(pop[i].objectiveVector()); +00061 for (unsigned int i=0 ; i<oldPop.size(); i++) +00062 to.push_back(oldPop[i].objectiveVector()); +00063 // writing the result into the file +00064 std::ofstream f (filename.c_str(), std::ios::app); +00065 f << counter++ << ' ' << metric(from,to) << std::endl; +00066 f.close(); +00067 } +00068 oldPop = pop; +00069 } +00070 } +00071 +00072 +00073 private: +00074 +00076 moeoVectorVsVectorBinaryMetric < ObjectiveVector, double > & metric; +00078 const eoPop < MOEOT > & pop; +00080 eoPop< MOEOT > oldPop; +00082 std::string filename; +00084 bool firstGen; +00086 unsigned int counter; +00087 +00088 }; +00089 +00090 #endif /*MOEOBINARYMETRICSAVINGUPDATER_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoBitVector_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoBitVector_8h-source.html
new file mode 100644
index 000000000..7a245446c
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoBitVector_8h-source.html
@@ -0,0 +1,92 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoBitVector.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOBITVECTOR_H_ +00014 #define MOEOBITVECTOR_H_ +00015 +00016 #include <core/moeoVector.h> +00017 +00021 template < class MOEOObjectiveVector, class MOEOFitness, class MOEODiversity > +00022 class moeoBitVector : public moeoVector < MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool > +00023 { +00024 public: +00025 +00026 using moeoVector < MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool > :: begin; +00027 using moeoVector < MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool > :: end; +00028 using moeoVector < MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool > :: resize; +00029 using moeoVector < MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool > :: size; +00030 +00031 +00037 moeoBitVector(unsigned int _size = 0, bool _value = false) : moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool >(_size, _value) +00038 {} +00039 +00040 +00044 virtual std::string className() const +00045 { +00046 return "moeoBitVector"; +00047 } +00048 +00049 +00054 virtual void printOn(std::ostream & _os) const +00055 { +00056 MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity >::printOn(_os); +00057 _os << ' '; +00058 _os << size() << ' '; +00059 std::copy(begin(), end(), std::ostream_iterator<bool>(_os)); +00060 } +00061 +00062 +00067 virtual void readFrom(std::istream & _is) +00068 { +00069 MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity >::readFrom(_is); +00070 unsigned int s; +00071 _is >> s; +00072 std::string bits; +00073 _is >> bits; +00074 if (_is) +00075 { +00076 resize(bits.size()); +00077 std::transform(bits.begin(), bits.end(), begin(), std::bind2nd(std::equal_to<char>(), '1')); +00078 } +00079 } +00080 +00081 }; +00082 +00083 #endif /*MOEOBITVECTOR_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoCombinedLS_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoCombinedLS_8h-source.html
new file mode 100644
index 000000000..89b60cfec
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoCombinedLS_8h-source.html
@@ -0,0 +1,76 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoCombinedLS.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOCOMBINEDLS_H_ +00014 #define MOEOCOMBINEDLS_H_ +00015 +00016 #include <vector> +00017 #include <algo/moeoLS.h> +00018 #include <archive/moeoArchive.h> +00019 +00024 template < class MOEOT, class Type > +00025 class moeoCombinedLS : public moeoLS < MOEOT, Type > +00026 { +00027 public: +00028 +00033 moeoCombinedLS(moeoLS < MOEOT, Type > & _first_mols) +00034 { +00035 combinedLS.push_back (& _first_mols); +00036 } +00037 +00042 void add(moeoLS < MOEOT, Type > & _mols) +00043 { +00044 combinedLS.push_back(& _mols); +00045 } +00046 +00053 void operator () (Type _type, moeoArchive < MOEOT > & _arch) +00054 { +00055 for (unsigned int i=0; i<combinedLS.size(); i++) +00056 combinedLS[i] -> operator()(_type, _arch); +00057 } +00058 +00059 +00060 private: +00061 +00063 std::vector< moeoLS < MOEOT, Type > * > combinedLS; +00064 +00065 }; +00066 +00067 #endif /*MOEOCOMBINEDLS_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoComparator_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoComparator_8h-source.html
new file mode 100644
index 000000000..1ba424805
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoComparator_8h-source.html
@@ -0,0 +1,49 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoComparator.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOCOMPARATOR_H_ +00014 #define MOEOCOMPARATOR_H_ +00015 +00016 #include <eoFunctor.h> +00017 +00021 template < class MOEOT > +00022 class moeoComparator : public eoBF < const MOEOT &, const MOEOT &, const bool > {}; +00023 +00024 #endif /*MOEOCOMPARATOR_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoContributionMetric_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoContributionMetric_8h-source.html
new file mode 100644
index 000000000..4bc173a4a
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoContributionMetric_8h-source.html
@@ -0,0 +1,110 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoContributionMetric.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOCONTRIBUTIONMETRIC_H_ +00014 #define MOEOCONTRIBUTIONMETRIC_H_ +00015 +00016 #include <comparator/moeoParetoObjectiveVectorComparator.h> +00017 #include <metric/moeoMetric.h> +00018 +00023 template < class ObjectiveVector > +00024 class moeoContributionMetric : public moeoVectorVsVectorBinaryMetric < ObjectiveVector, double > +00025 { +00026 public: +00027 +00033 double operator()(const std::vector < ObjectiveVector > & _set1, const std::vector < ObjectiveVector > & _set2) { +00034 unsigned int c = card_C(_set1, _set2); +00035 unsigned int w1 = card_W(_set1, _set2); +00036 unsigned int n1 = card_N(_set1, _set2); +00037 unsigned int w2 = card_W(_set2, _set1); +00038 unsigned int n2 = card_N(_set2, _set1); +00039 return (double) (c / 2.0 + w1 + n1) / (c + w1 + n1 + w2 + n2); +00040 } +00041 +00042 +00043 private: +00044 +00046 moeoParetoObjectiveVectorComparator < ObjectiveVector > paretoComparator; +00047 +00048 +00054 unsigned int card_C (const std::vector < ObjectiveVector > & _set1, const std::vector < ObjectiveVector > & _set2) { +00055 unsigned int c=0; +00056 for (unsigned int i=0; i<_set1.size(); i++) +00057 for (unsigned int j=0; j<_set2.size(); j++) +00058 if (_set1[i] == _set2[j]) { +00059 c++; +00060 break; +00061 } +00062 return c; +00063 } +00064 +00065 +00071 unsigned int card_W (const std::vector < ObjectiveVector > & _set1, const std::vector < ObjectiveVector > & _set2) { +00072 unsigned int w=0; +00073 for (unsigned int i=0; i<_set1.size(); i++) +00074 for (unsigned int j=0; j<_set2.size(); j++) +00075 if (paretoComparator(_set2[j], _set1[i])) +00076 { +00077 w++; +00078 break; +00079 } +00080 return w; +00081 } +00082 +00083 +00089 unsigned int card_N (const std::vector < ObjectiveVector > & _set1, const std::vector < ObjectiveVector > & _set2) { +00090 unsigned int n=0; +00091 for (unsigned int i=0; i<_set1.size(); i++) { +00092 bool domin_rel = false; +00093 for (unsigned int j=0; j<_set2.size(); j++) +00094 if ( (paretoComparator(_set2[j], _set1[i])) || (paretoComparator(_set1[i], _set2[j])) ) +00095 { +00096 domin_rel = true; +00097 break; +00098 } +00099 if (! domin_rel) +00100 n++; +00101 } +00102 return n; +00103 } +00104 +00105 }; +00106 +00107 #endif /*MOEOCONTRIBUTIONMETRIC_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoConvertPopToObjectiveVectors_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoConvertPopToObjectiveVectors_8h-source.html
new file mode 100644
index 000000000..5e85f298e
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoConvertPopToObjectiveVectors_8h-source.html
@@ -0,0 +1,65 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoConvertPopToObjectiveVectors.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOPOPTOOBJECTIVEVECTORS_H_ +00014 #define MOEOPOPTOOBJECTIVEVECTORS_H_ +00015 +00016 #include <vector> +00017 #include <eoFunctor.h> +00018 +00022 template < class MOEOT, class ObjectiveVector = typename MOEOT::ObjectiveVector > +00023 class moeoConvertPopToObjectiveVectors : public eoUF < const eoPop < MOEOT >, const std::vector < ObjectiveVector > > +00024 { +00025 public: +00026 +00031 const std::vector < ObjectiveVector > operator()(const eoPop < MOEOT > _pop) +00032 { +00033 std::vector < ObjectiveVector > result; +00034 result.resize(_pop.size()); +00035 for (unsigned int i=0; i<_pop.size(); i++) +00036 { +00037 result.push_back(_pop[i].objectiveVector()); +00038 } +00039 return result; +00040 } +00041 +00042 }; +00043 +00044 #endif /*MOEOPOPTOOBJECTIVEVECTORS_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoCriterionBasedFitnessAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoCriterionBasedFitnessAssignment_8h-source.html
new file mode 100644
index 000000000..8ac4e0bdc
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoCriterionBasedFitnessAssignment_8h-source.html
@@ -0,0 +1,49 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoCriterionBasedFitnessAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOCRITERIONBASEDFITNESSASSIGNMENT_H_ +00014 #define MOEOCRITERIONBASEDFITNESSASSIGNMENT_H_ +00015 +00016 #include <fitness/moeoFitnessAssignment.h> +00017 +00021 template < class MOEOT > +00022 class moeoCriterionBasedFitnessAssignment : public moeoFitnessAssignment < MOEOT > {}; +00023 +00024 #endif /*MOEOCRITERIONBASEDFITNESSASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoCrowdingDiversityAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoCrowdingDiversityAssignment_8h-source.html
new file mode 100644
index 000000000..81a466847
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoCrowdingDiversityAssignment_8h-source.html
@@ -0,0 +1,124 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoCrowdingDiversityAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOCROWDINGDIVERSITYASSIGNMENT_H_ +00014 #define MOEOCROWDINGDIVERSITYASSIGNMENT_H_ +00015 +00016 #include <eoPop.h> +00017 #include <comparator/moeoOneObjectiveComparator.h> +00018 #include <diversity/moeoDiversityAssignment.h> +00019 +00024 template < class MOEOT > +00025 class moeoCrowdingDiversityAssignment : public moeoDiversityAssignment < MOEOT > +00026 { +00027 public: +00028 +00030 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00031 +00032 +00036 double inf() const +00037 { +00038 return std::numeric_limits<double>::max(); +00039 } +00040 +00041 +00045 double tiny() const +00046 { +00047 return 1e-6; +00048 } +00049 +00050 +00055 void operator()(eoPop < MOEOT > & _pop) +00056 { +00057 if (_pop.size() <= 2) +00058 { +00059 for (unsigned int i=0; i<_pop.size(); i++) +00060 { +00061 _pop[i].diversity(inf()); +00062 } +00063 } +00064 else +00065 { +00066 setDistances(_pop); +00067 } +00068 } +00069 +00070 +00078 void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) +00079 { +00080 std::cout << "WARNING : updateByDeleting not implemented in moeoCrowdingDiversityAssignment" << std::endl; +00081 } +00082 +00083 +00084 protected: +00085 +00090 virtual void setDistances (eoPop < MOEOT > & _pop) +00091 { +00092 double min, max, distance; +00093 unsigned int nObjectives = MOEOT::ObjectiveVector::nObjectives(); +00094 // set diversity to 0 +00095 for (unsigned int i=0; i<_pop.size(); i++) +00096 { +00097 _pop[i].diversity(0); +00098 } +00099 // for each objective +00100 for (unsigned int obj=0; obj<nObjectives; obj++) +00101 { +00102 // comparator +00103 moeoOneObjectiveComparator < MOEOT > objComp(obj); +00104 // sort +00105 std::sort(_pop.begin(), _pop.end(), objComp); +00106 // min & max +00107 min = _pop[0].objectiveVector()[obj]; +00108 max = _pop[_pop.size()-1].objectiveVector()[obj]; +00109 // set the diversity value to infiny for min and max +00110 _pop[0].diversity(inf()); +00111 _pop[_pop.size()-1].diversity(inf()); +00112 for (unsigned int i=1; i<_pop.size()-1; i++) +00113 { +00114 distance = (_pop[i+1].objectiveVector()[obj] - _pop[i-1].objectiveVector()[obj]) / (max-min); +00115 _pop[i].diversity(_pop[i].diversity() + distance); +00116 } +00117 } +00118 } +00119 +00120 }; +00121 +00122 #endif /*MOEOCROWDINGDIVERSITYASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoDetTournamentSelect_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoDetTournamentSelect_8h-source.html
new file mode 100644
index 000000000..f00babb31
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoDetTournamentSelect_8h-source.html
@@ -0,0 +1,92 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoDetTournamentSelect.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEODETTOURNAMENTSELECT_H_ +00014 #define MOEODETTOURNAMENTSELECT_H_ +00015 +00016 #include <comparator/moeoComparator.h> +00017 #include <comparator/moeoFitnessThenDiversityComparator.h> +00018 #include <selection/moeoSelectOne.h> +00019 #include <selection/moeoSelectors.h> +00020 +00024 template < class MOEOT > class moeoDetTournamentSelect:public moeoSelectOne < MOEOT > +00025 { +00026 public: +00027 +00033 moeoDetTournamentSelect (moeoComparator < MOEOT > & _comparator, unsigned int _tSize = 2) : comparator (_comparator), tSize (_tSize) +00034 { +00035 // consistency check +00036 if (tSize < 2) +00037 { +00038 std:: +00039 cout << "Warning, Tournament size should be >= 2\nAdjusted to 2\n"; +00040 tSize = 2; +00041 } +00042 } +00043 +00044 +00049 moeoDetTournamentSelect (unsigned int _tSize = 2) : comparator (defaultComparator), tSize (_tSize) +00050 { +00051 // consistency check +00052 if (tSize < 2) +00053 { +00054 std:: +00055 cout << "Warning, Tournament size should be >= 2\nAdjusted to 2\n"; +00056 tSize = 2; +00057 } +00058 } +00059 +00060 +00065 const MOEOT & operator() (const eoPop < MOEOT > &_pop) +00066 { +00067 // use the selector +00068 return mo_deterministic_tournament (_pop, tSize, comparator); +00069 } +00070 +00071 +00072 protected: +00073 +00075 moeoComparator < MOEOT > & comparator; +00077 moeoFitnessThenDiversityComparator < MOEOT > defaultComparator; +00079 unsigned int tSize; +00080 +00081 }; +00082 +00083 #endif /*MOEODETTOURNAMENTSELECT_H_ */ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoDistanceMatrix_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoDistanceMatrix_8h-source.html
new file mode 100644
index 000000000..14543663d
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoDistanceMatrix_8h-source.html
@@ -0,0 +1,91 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoDistanceMatrix.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEODISTANCEMATRIX_H_ +00014 #define MOEODISTANCEMATRIX_H_ +00015 +00016 #include <vector> +00017 #include <eoFunctor.h> +00018 #include <distance/moeoDistance.h> +00019 +00023 template < class MOEOT , class Type > +00024 class moeoDistanceMatrix : public eoUF < const eoPop < MOEOT > &, void > , public std::vector< std::vector < Type > > +00025 { +00026 public: +00027 +00028 using std::vector< std::vector < Type > > :: size; +00029 using std::vector< std::vector < Type > > :: operator[]; +00030 +00031 +00037 moeoDistanceMatrix (unsigned int _size, moeoDistance < MOEOT , Type > & _distance) : distance(_distance) +00038 { +00039 this->resize(_size); +00040 for (unsigned int i=0; i<_size; i++) +00041 { +00042 this->operator[](i).resize(_size); +00043 } +00044 } +00045 +00046 +00051 void operator()(const eoPop < MOEOT > & _pop) +00052 { +00053 // 1 - setup the bounds (if necessary) +00054 distance.setup(_pop); +00055 // 2 - compute distances +00056 this->operator[](0).operator[](0) = Type(); +00057 for (unsigned int i=0; i<size(); i++) +00058 { +00059 this->operator[](i).operator[](i) = Type(); +00060 for (unsigned int j=0; j<i; j++) +00061 { +00062 this->operator[](i).operator[](j) = distance(_pop[i], _pop[j]); +00063 this->operator[](j).operator[](i) = this->operator[](i).operator[](j); +00064 } +00065 } +00066 } +00067 +00068 +00069 private: +00070 +00072 moeoDistance < MOEOT , Type > & distance; +00073 +00074 }; +00075 +00076 #endif /*MOEODISTANCEMATRIX_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoDistance_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoDistance_8h-source.html
new file mode 100644
index 000000000..53c01f451
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoDistance_8h-source.html
@@ -0,0 +1,64 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoDistance.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEODISTANCE_H_ +00014 #define MOEODISTANCE_H_ +00015 +00016 #include <eoFunctor.h> +00017 +00021 template < class MOEOT , class Type > +00022 class moeoDistance : public eoBF < const MOEOT &, const MOEOT &, const Type > +00023 { +00024 public: +00025 +00030 virtual void setup(const eoPop < MOEOT > & _pop) +00031 {} +00032 +00033 +00040 virtual void setup(double _min, double _max, unsigned int _obj) +00041 {} +00042 +00043 +00049 virtual void setup(eoRealInterval _realInterval, unsigned int _obj) +00050 {} +00051 +00052 }; +00053 +00054 #endif /*MOEODISTANCE_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoDiversityAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoDiversityAssignment_8h-source.html
new file mode 100644
index 000000000..5875078c3
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoDiversityAssignment_8h-source.html
@@ -0,0 +1,65 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoDiversityAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEODIVERSITYASSIGNMENT_H_ +00014 #define MOEODIVERSITYASSIGNMENT_H_ +00015 +00016 #include <eoFunctor.h> +00017 #include <eoPop.h> +00018 +00022 template < class MOEOT > +00023 class moeoDiversityAssignment : public eoUF < eoPop < MOEOT > &, void > +00024 { +00025 public: +00026 +00028 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00029 +00030 +00036 virtual void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) = 0; +00037 +00038 +00044 void updateByDeleting(eoPop < MOEOT > & _pop, MOEOT & _moeo) +00045 { +00046 updateByDeleting(_pop, _moeo.objectiveVector()); +00047 } +00048 +00049 }; +00050 +00051 #endif /*MOEODIVERSITYASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoDiversityThenFitnessComparator_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoDiversityThenFitnessComparator_8h-source.html
new file mode 100644
index 000000000..8e51ea53a
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoDiversityThenFitnessComparator_8h-source.html
@@ -0,0 +1,65 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoDiversityThenFitnessComparator.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEODIVERSITYTHENFITNESSCOMPARATOR_H_ +00014 #define MOEODIVERSITYTHENFITNESSCOMPARATOR_H_ +00015 +00016 #include <comparator/moeoComparator.h> +00017 +00021 template < class MOEOT > +00022 class moeoDiversityThenFitnessComparator : public moeoComparator < MOEOT > +00023 { +00024 public: +00025 +00031 const bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2) +00032 { +00033 if (_moeo1.diversity() == _moeo2.diversity()) +00034 { +00035 return _moeo1.fitness() < _moeo2.fitness(); +00036 } +00037 else +00038 { +00039 return _moeo1.diversity() < _moeo2.diversity(); +00040 } +00041 } +00042 +00043 }; +00044 +00045 #endif /*MOEODIVERSITYTHENFITNESSCOMPARATOR_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoDummyDiversityAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoDummyDiversityAssignment_8h-source.html
new file mode 100644
index 000000000..b5353cc2f
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoDummyDiversityAssignment_8h-source.html
@@ -0,0 +1,74 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoDummyDiversityAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEODUMMYDIVERSITYASSIGNMENT_H_ +00014 #define MOEODUMMYDIVERSITYASSIGNMENT_H_ +00015 +00016 #include<diversity/moeoDiversityAssignment.h> +00017 +00021 template < class MOEOT > +00022 class moeoDummyDiversityAssignment : public moeoDiversityAssignment < MOEOT > +00023 { +00024 public: +00025 +00027 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00028 +00029 +00034 void operator () (eoPop < MOEOT > & _pop) +00035 { +00036 for (unsigned int idx = 0; idx<_pop.size (); idx++) +00037 { +00038 if (_pop[idx].invalidDiversity()) +00039 { +00040 // set the diversity to 0 +00041 _pop[idx].diversity(0.0); +00042 } +00043 } +00044 } +00045 +00046 +00052 void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) +00053 { +00054 // nothing to do... ;-) +00055 } +00056 +00057 }; +00058 +00059 #endif /*MOEODUMMYDIVERSITYASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoDummyFitnessAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoDummyFitnessAssignment_8h-source.html
new file mode 100644
index 000000000..f72187e4e
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoDummyFitnessAssignment_8h-source.html
@@ -0,0 +1,74 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoDummyFitnessAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEODUMMYFITNESSASSIGNMENT_H_ +00014 #define MOEODUMMYFITNESSASSIGNMENT_H_ +00015 +00016 #include <fitness/moeoFitnessAssignment.h> +00017 +00021 template < class MOEOT > +00022 class moeoDummyFitnessAssignment : public moeoFitnessAssignment < MOEOT > +00023 { +00024 public: +00025 +00027 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00028 +00029 +00034 void operator () (eoPop < MOEOT > & _pop) +00035 { +00036 for (unsigned int idx = 0; idx<_pop.size (); idx++) +00037 { +00038 if (_pop[idx].invalidFitness()) +00039 { +00040 // set the diversity to 0 +00041 _pop[idx].fitness(0.0); +00042 } +00043 } +00044 } +00045 +00046 +00052 void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) +00053 { +00054 // nothing to do... ;-) +00055 } +00056 +00057 }; +00058 +00059 #endif /*MOEODUMMYFITNESSASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoEA_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoEA_8h-source.html
new file mode 100644
index 000000000..c9bc76cba
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoEA_8h-source.html
@@ -0,0 +1,50 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoEA.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOEA_H_ +00014 #define MOEOEA_H_ +00015 +00016 #include <eoAlgo.h> +00017 #include <algo/moeoAlgo.h> +00018 +00022 template < class MOEOT > +00023 class moeoEA : public moeoAlgo, public eoAlgo < MOEOT > {}; +00024 +00025 #endif /*MOEOEA_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoEasyEA_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoEasyEA_8h-source.html
new file mode 100644
index 000000000..d7d64aecd
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoEasyEA_8h-source.html
@@ -0,0 +1,169 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoEasyEA.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef _MOEOEASYEA_H +00014 #define _MOEOEASYEA_H +00015 +00016 #include <apply.h> +00017 #include <eoBreed.h> +00018 #include <eoContinue.h> +00019 #include <eoMergeReduce.h> +00020 #include <eoPopEvalFunc.h> +00021 #include <eoSelect.h> +00022 #include <eoTransform.h> +00023 #include <algo/moeoEA.h> +00024 #include <diversity/moeoDiversityAssignment.h> +00025 #include <diversity/moeoDummyDiversityAssignment.h> +00026 #include <fitness/moeoFitnessAssignment.h> +00027 #include <replacement/moeoReplacement.h> +00028 +00032 template < class MOEOT > +00033 class moeoEasyEA: public moeoEA < MOEOT > +00034 { +00035 public: +00036 +00047 moeoEasyEA(eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoBreed < MOEOT > & _breed, moeoReplacement < MOEOT > & _replace, +00048 moeoFitnessAssignment < MOEOT > & _fitnessEval, moeoDiversityAssignment < MOEOT > & _diversityEval, bool _evalFitAndDivBeforeSelection = false) +00049 : +00050 continuator(_continuator), eval (_eval), loopEval(_eval), popEval(loopEval), selectTransform(dummySelect, dummyTransform), breed(_breed), mergeReduce(dummyMerge, dummyReduce), replace(_replace), +00051 fitnessEval(_fitnessEval), diversityEval(_diversityEval), evalFitAndDivBeforeSelection(_evalFitAndDivBeforeSelection) +00052 {} +00053 +00054 +00065 moeoEasyEA(eoContinue < MOEOT > & _continuator, eoPopEvalFunc < MOEOT > & _popEval, eoBreed < MOEOT > & _breed, moeoReplacement < MOEOT > & _replace, +00066 moeoFitnessAssignment < MOEOT > & _fitnessEval, moeoDiversityAssignment < MOEOT > & _diversityEval, bool _evalFitAndDivBeforeSelection = false) +00067 : +00068 continuator(_continuator), eval (dummyEval), loopEval(dummyEval), popEval(_popEval), selectTransform(dummySelect, dummyTransform), breed(_breed), mergeReduce(dummyMerge, dummyReduce), replace(_replace), +00069 fitnessEval(_fitnessEval), diversityEval(_diversityEval), evalFitAndDivBeforeSelection(_evalFitAndDivBeforeSelection) +00070 {} +00071 +00072 +00084 moeoEasyEA(eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoBreed < MOEOT > & _breed, eoMerge < MOEOT > & _merge, eoReduce< MOEOT > & _reduce, +00085 moeoFitnessAssignment < MOEOT > & _fitnessEval, moeoDiversityAssignment < MOEOT > & _diversityEval, bool _evalFitAndDivBeforeSelection = false) +00086 : +00087 continuator(_continuator), eval(_eval), loopEval(_eval), popEval(loopEval), selectTransform(dummySelect, dummyTransform), breed(_breed), mergeReduce(_merge,_reduce), replace(mergeReduce), +00088 fitnessEval(_fitnessEval), diversityEval(_diversityEval), evalFitAndDivBeforeSelection(_evalFitAndDivBeforeSelection) +00089 {} +00090 +00091 +00103 moeoEasyEA(eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoSelect < MOEOT > & _select, eoTransform < MOEOT > & _transform, moeoReplacement < MOEOT > & _replace, +00104 moeoFitnessAssignment < MOEOT > & _fitnessEval, moeoDiversityAssignment < MOEOT > & _diversityEval, bool _evalFitAndDivBeforeSelection = false) +00105 : +00106 continuator(_continuator), eval(_eval), loopEval(_eval), popEval(loopEval), selectTransform(_select, _transform), breed(selectTransform), mergeReduce(dummyMerge, dummyReduce), replace(_replace), +00107 fitnessEval(_fitnessEval), diversityEval(_diversityEval), evalFitAndDivBeforeSelection(_evalFitAndDivBeforeSelection) +00108 {} +00109 +00110 +00123 moeoEasyEA(eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoSelect < MOEOT > & _select, eoTransform < MOEOT > & _transform, eoMerge < MOEOT > & _merge, eoReduce< MOEOT > & _reduce, +00124 moeoFitnessAssignment < MOEOT > & _fitnessEval, moeoDiversityAssignment < MOEOT > & _diversityEval, bool _evalFitAndDivBeforeSelection = false) +00125 : +00126 continuator(_continuator), eval(_eval), loopEval(_eval), popEval(loopEval), selectTransform(_select, _transform), breed(selectTransform), mergeReduce(_merge,_reduce), replace(mergeReduce), +00127 fitnessEval(_fitnessEval), diversityEval(_diversityEval), evalFitAndDivBeforeSelection(_evalFitAndDivBeforeSelection) +00128 {} +00129 +00130 +00135 virtual void operator()(eoPop < MOEOT > & _pop) +00136 { +00137 eoPop < MOEOT > offspring, empty_pop; +00138 popEval(empty_pop, _pop); // A first eval of pop. +00139 bool firstTime = true; +00140 do +00141 { +00142 try +00143 { +00144 unsigned int pSize = _pop.size(); +00145 offspring.clear(); // new offspring +00146 // fitness and diversity assignment (if you want to or if it is the first generation) +00147 if (evalFitAndDivBeforeSelection || firstTime) +00148 { +00149 firstTime = false; +00150 fitnessEval(_pop); +00151 diversityEval(_pop); +00152 } +00153 breed(_pop, offspring); +00154 popEval(_pop, offspring); // eval of parents + offspring if necessary +00155 replace(_pop, offspring); // after replace, the new pop. is in _pop +00156 if (pSize > _pop.size()) +00157 { +00158 throw std::runtime_error("Population shrinking!"); +00159 } +00160 else if (pSize < _pop.size()) +00161 { +00162 throw std::runtime_error("Population growing!"); +00163 } +00164 } +00165 catch (std::exception& e) +00166 { +00167 std::string s = e.what(); +00168 s.append( " in moeoEasyEA"); +00169 throw std::runtime_error( s ); +00170 } +00171 } while (continuator(_pop)); +00172 } +00173 +00174 +00175 protected: +00176 +00178 eoContinue < MOEOT > & continuator; +00180 eoEvalFunc < MOEOT > & eval; +00182 eoPopLoopEval < MOEOT > loopEval; +00184 eoPopEvalFunc < MOEOT > & popEval; +00186 eoSelectTransform < MOEOT > selectTransform; +00188 eoBreed < MOEOT > & breed; +00190 eoMergeReduce < MOEOT > mergeReduce; +00192 moeoReplacement < MOEOT > & replace; +00194 moeoFitnessAssignment < MOEOT > & fitnessEval; +00196 moeoDiversityAssignment < MOEOT > & diversityEval; +00198 bool evalFitAndDivBeforeSelection; +00200 class eoDummyEval : public eoEvalFunc < MOEOT > +00201 { public: +00202 void operator()(MOEOT &) {}} dummyEval; +00204 class eoDummySelect : public eoSelect < MOEOT > +00205 { public: +00206 void operator()(const eoPop < MOEOT > &, eoPop < MOEOT > &) {} } dummySelect; +00208 class eoDummyTransform : public eoTransform < MOEOT > +00209 { public: +00210 void operator()(eoPop < MOEOT > &) {} } dummyTransform; +00212 eoNoElitism < MOEOT > dummyMerge; +00214 eoTruncate < MOEOT > dummyReduce; +00215 +00216 }; +00217 +00218 #endif /*MOEOEASYEA_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoElitistReplacement_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoElitistReplacement_8h-source.html
new file mode 100644
index 000000000..b90cac909
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoElitistReplacement_8h-source.html
@@ -0,0 +1,114 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoElitistReplacement.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOELITISTREPLACEMENT_H_ +00014 #define MOEOELITISTREPLACEMENT_H_ +00015 +00016 #include <comparator/moeoComparator.h> +00017 #include <comparator/moeoFitnessThenDiversityComparator.h> +00018 #include <diversity/moeoDiversityAssignment.h> +00019 #include <diversity/moeoDummyDiversityAssignment.h> +00020 #include <fitness/moeoFitnessAssignment.h> +00021 #include <replacement/moeoReplacement.h> +00022 +00026 template < class MOEOT > class moeoElitistReplacement:public moeoReplacement < MOEOT > +00027 { +00028 public: +00029 +00036 moeoElitistReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoDiversityAssignment < MOEOT > & _diversityAssignment, moeoComparator < MOEOT > & _comparator) : +00037 fitnessAssignment (_fitnessAssignment), diversityAssignment (_diversityAssignment), comparator (_comparator) +00038 {} +00039 +00040 +00046 moeoElitistReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoDiversityAssignment < MOEOT > & _diversityAssignment) : +00047 fitnessAssignment (_fitnessAssignment), diversityAssignment (_diversityAssignment), comparator (defaultComparator) +00048 {} +00049 +00050 +00056 moeoElitistReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoComparator < MOEOT > & _comparator) : +00057 fitnessAssignment (_fitnessAssignment), diversityAssignment (defaultDiversity), comparator (_comparator) +00058 {} +00059 +00060 +00066 moeoElitistReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment) : +00067 fitnessAssignment (_fitnessAssignment), diversityAssignment (defaultDiversity), comparator (defaultComparator) +00068 {} +00069 +00070 +00076 void operator () (eoPop < MOEOT > &_parents, eoPop < MOEOT > &_offspring) +00077 { +00078 unsigned int sz = _parents.size (); +00079 // merges offspring and parents into a global population +00080 _parents.reserve (_parents.size () + _offspring.size ()); +00081 std::copy (_offspring.begin (), _offspring.end (), back_inserter (_parents)); +00082 // evaluates the fitness and the diversity of this global population +00083 fitnessAssignment (_parents); +00084 diversityAssignment (_parents); +00085 // sorts the whole population according to the comparator +00086 std::sort(_parents.begin(), _parents.end(), comparator); +00087 // finally, resize this global population +00088 _parents.resize (sz); +00089 // and clear the offspring population +00090 _offspring.clear (); +00091 } +00092 +00093 +00094 protected: +00095 +00097 moeoFitnessAssignment < MOEOT > & fitnessAssignment; +00099 moeoDiversityAssignment < MOEOT > & diversityAssignment; +00101 moeoDummyDiversityAssignment < MOEOT > defaultDiversity; +00103 moeoFitnessThenDiversityComparator < MOEOT > defaultComparator; +00105 class Cmp +00106 { +00107 public: +00112 Cmp(moeoComparator < MOEOT > & _comp) : comp(_comp) +00113 {} +00119 bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2) +00120 { +00121 return comp(_moeo2,_moeo1); +00122 } +00123 private: +00125 moeoComparator < MOEOT > & comp; +00126 } comparator; +00127 +00128 }; +00129 +00130 #endif /*MOEOELITISTREPLACEMENT_H_ */ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoEntropyMetric_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoEntropyMetric_8h-source.html
new file mode 100644
index 000000000..3f707cbaf
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoEntropyMetric_8h-source.html
@@ -0,0 +1,174 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoEntropyMetric.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOENTROPYMETRIC_H_ +00014 #define MOEOENTROPYMETRIC_H_ +00015 +00016 #include <vector> +00017 #include <comparator/moeoParetoObjectiveVectorComparator.h> +00018 #include <metric/moeoMetric.h> +00019 +00024 template < class ObjectiveVector > +00025 class moeoEntropyMetric : public moeoVectorVsVectorBinaryMetric < ObjectiveVector, double > +00026 { +00027 public: +00028 +00034 double operator()(const std::vector < ObjectiveVector > & _set1, const std::vector < ObjectiveVector > & _set2) { +00035 // normalization +00036 std::vector< ObjectiveVector > set1 = _set1; +00037 std::vector< ObjectiveVector > set2= _set2; +00038 removeDominated (set1); +00039 removeDominated (set2); +00040 prenormalize (set1); +00041 normalize (set1); +00042 normalize (set2); +00043 +00044 // making of PO* +00045 std::vector< ObjectiveVector > star; // rotf :-) +00046 computeUnion (set1, set2, star); +00047 removeDominated (star); +00048 +00049 // making of PO1 U PO* +00050 std::vector< ObjectiveVector > union_set1_star; // rotf again ... +00051 computeUnion (set1, star, union_set1_star); +00052 +00053 unsigned int C = union_set1_star.size(); +00054 float omega=0; +00055 float entropy=0; +00056 +00057 for (unsigned int i=0 ; i<C ; i++) { +00058 unsigned int N_i = howManyInNicheOf (union_set1_star, union_set1_star[i], star.size()); +00059 unsigned int n_i = howManyInNicheOf (set1, union_set1_star[i], star.size()); +00060 if (n_i > 0) { +00061 omega += 1.0 / N_i; +00062 entropy += (float) n_i / (N_i * C) * log (((float) n_i / C) / log (2.0)); +00063 } +00064 } +00065 entropy /= - log (omega); +00066 entropy *= log (2.0); +00067 return entropy; +00068 } +00069 +00070 +00071 private: +00072 +00074 std::vector<double> vect_min_val; +00076 std::vector<double> vect_max_val; +00078 moeoParetoObjectiveVectorComparator < ObjectiveVector > paretoComparator; +00079 +00080 +00085 void removeDominated(std::vector < ObjectiveVector > & _f) { +00086 for (unsigned int i=0 ; i<_f.size(); i++) { +00087 bool dom = false; +00088 for (unsigned int j=0; j<_f.size(); j++) +00089 if (i != j && paretoComparator(_f[i],_f[j])) +00090 { +00091 dom = true; +00092 break; +00093 } +00094 if (dom) { +00095 _f[i] = _f.back(); +00096 _f.pop_back(); +00097 i--; +00098 } +00099 } +00100 } +00101 +00102 +00107 void prenormalize (const std::vector< ObjectiveVector > & _f) { +00108 vect_min_val.clear(); +00109 vect_max_val.clear(); +00110 +00111 for (unsigned int i=0 ; i<ObjectiveVector::nObjectives(); i++) { +00112 float min_val = _f.front()[i], max_val = min_val; +00113 for (unsigned int j=1 ; j<_f.size(); j++) { +00114 if (_f[j][i] < min_val) +00115 min_val = _f[j][i]; +00116 if (_f[j][i]>max_val) +00117 max_val = _f[j][i]; +00118 } +00119 vect_min_val.push_back(min_val); +00120 vect_max_val.push_back (max_val); +00121 } +00122 } +00123 +00124 +00129 void normalize (std::vector< ObjectiveVector > & _f) { +00130 for (unsigned int i=0 ; i<ObjectiveVector::nObjectives(); i++) +00131 for (unsigned int j=0; j<_f.size(); j++) +00132 _f[j][i] = (_f[j][i] - vect_min_val[i]) / (vect_max_val[i] - vect_min_val[i]); +00133 } +00134 +00135 +00142 void computeUnion(const std::vector< ObjectiveVector > & _f1, const std::vector< ObjectiveVector > & _f2, std::vector< ObjectiveVector > & _f) { +00143 _f = _f1 ; +00144 for (unsigned int i=0; i<_f2.size(); i++) { +00145 bool b = false; +00146 for (unsigned int j=0; j<_f1.size(); j ++) +00147 if (_f1[j] == _f2[i]) { +00148 b = true; +00149 break; +00150 } +00151 if (! b) +00152 _f.push_back(_f2[i]); +00153 } +00154 } +00155 +00156 +00160 unsigned int howManyInNicheOf (const std::vector< ObjectiveVector > & _f, const ObjectiveVector & _s, unsigned int _size) { +00161 unsigned int n=0; +00162 for (unsigned int i=0 ; i<_f.size(); i++) { +00163 if (euclidianDistance(_f[i], _s) < (_s.size() / (double) _size)) +00164 n++; +00165 } +00166 return n; +00167 } +00168 +00169 +00173 double euclidianDistance (const ObjectiveVector & _set1, const ObjectiveVector & _to, unsigned int _deg = 2) { +00174 double dist=0; +00175 for (unsigned int i=0; i<_set1.size(); i++) +00176 dist += pow(fabs(_set1[i] - _to[i]), (int)_deg); +00177 return pow(dist, 1.0 / _deg); +00178 } +00179 +00180 }; +00181 +00182 #endif /*MOEOENTROPYMETRIC_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoEnvironmentalReplacement_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoEnvironmentalReplacement_8h-source.html
new file mode 100644
index 000000000..a9d0cae5f
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoEnvironmentalReplacement_8h-source.html
@@ -0,0 +1,128 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoEnvironmentalReplacement.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOENVIRONMENTALREPLACEMENT_H_ +00014 #define MOEOENVIRONMENTALREPLACEMENT_H_ +00015 +00016 #include <comparator/moeoComparator.h> +00017 #include <comparator/moeoFitnessThenDiversityComparator.h> +00018 #include <diversity/moeoDiversityAssignment.h> +00019 #include <fitness/moeoFitnessAssignment.h> +00020 #include <replacement/moeoReplacement.h> +00021 +00026 template < class MOEOT > class moeoEnvironmentalReplacement:public moeoReplacement < MOEOT > +00027 { +00028 public: +00029 +00031 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00032 +00033 +00040 moeoEnvironmentalReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoDiversityAssignment < MOEOT > & _diversityAssignment, moeoComparator < MOEOT > & _comparator) : +00041 fitnessAssignment (_fitnessAssignment), diversityAssignment (_diversityAssignment), comparator (_comparator) +00042 {} +00043 +00044 +00050 moeoEnvironmentalReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoDiversityAssignment < MOEOT > & _diversityAssignment) : +00051 fitnessAssignment (_fitnessAssignment), diversityAssignment (_diversityAssignment), comparator (defaultComparator) +00052 {} +00053 +00054 +00060 moeoEnvironmentalReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoComparator < MOEOT > & _comparator) : +00061 fitnessAssignment (_fitnessAssignment), diversityAssignment (defaultDiversity), comparator (_comparator) +00062 {} +00063 +00064 +00070 moeoEnvironmentalReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment) : +00071 fitnessAssignment (_fitnessAssignment), diversityAssignment (defaultDiversity), comparator (defaultComparator) +00072 {} +00073 +00074 +00080 void operator () (eoPop < MOEOT > &_parents, eoPop < MOEOT > &_offspring) +00081 { +00082 unsigned int sz = _parents.size(); +00083 // merges offspring and parents into a global population +00084 _parents.reserve (_parents.size() + _offspring.size()); +00085 std::copy (_offspring.begin(), _offspring.end(), back_inserter(_parents)); +00086 // evaluates the fitness and the diversity of this global population +00087 fitnessAssignment (_parents); +00088 diversityAssignment (_parents); +00089 // remove individuals 1 by 1 and update the fitness values +00090 unsigned int worstIdx; +00091 ObjectiveVector worstObjVec; +00092 while (_parents.size() > sz) +00093 { +00094 // the individual to delete +00095 worstIdx = std::min_element(_parents.begin(), _parents.end(), comparator) - _parents.begin(); +00096 worstObjVec = _parents[worstIdx].objectiveVector(); +00097 // remove the woorst individual +00098 _parents[worstIdx] = _parents.back(); +00099 _parents.pop_back(); +00100 // update of the fitness and diversity values +00101 fitnessAssignment.updateByDeleting(_parents, worstObjVec); +00102 diversityAssignment.updateByDeleting(_parents, worstObjVec); +00103 +00104 } +00105 // clear the offspring population +00106 _offspring.clear (); +00107 } +00108 +00109 +00110 protected: +00111 +00113 moeoFitnessAssignment < MOEOT > & fitnessAssignment; +00115 moeoDiversityAssignment < MOEOT > & diversityAssignment; +00117 moeoDummyDiversityAssignment < MOEOT > defaultDiversity; +00119 moeoFitnessThenDiversityComparator < MOEOT > defaultComparator; +00121 class Cmp +00122 { +00123 public: +00128 Cmp(moeoComparator < MOEOT > & _comp) : comp(_comp) +00129 {} +00135 bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2) +00136 { +00137 return comp(_moeo1,_moeo2); +00138 } +00139 private: +00141 moeoComparator < MOEOT > & comp; +00142 } comparator; +00143 +00144 }; +00145 +00146 #endif /*MOEOENVIRONMENTALREPLACEMENT_H_ */ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoEuclideanDistance_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoEuclideanDistance_8h-source.html
new file mode 100644
index 000000000..58b7b914c
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoEuclideanDistance_8h-source.html
@@ -0,0 +1,75 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoEuclideanDistance.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOEUCLIDEANDISTANCE_H_ +00014 #define MOEOEUCLIDEANDISTANCE_H_ +00015 +00016 #include <math.h> +00017 #include <distance/moeoNormalizedDistance.h> +00018 +00023 template < class MOEOT > +00024 class moeoEuclideanDistance : public moeoNormalizedDistance < MOEOT > +00025 { +00026 public: +00027 +00029 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00030 +00031 +00037 const double operator()(const MOEOT & _moeo1, const MOEOT & _moeo2) +00038 { +00039 double result = 0.0; +00040 double tmp1, tmp2; +00041 for (unsigned int i=0; i<ObjectiveVector::nObjectives(); i++) +00042 { +00043 tmp1 = (_moeo1.objectiveVector()[i] - bounds[i].minimum()) / bounds[i].range(); +00044 tmp2 = (_moeo2.objectiveVector()[i] - bounds[i].minimum()) / bounds[i].range(); +00045 result += (tmp1-tmp2) * (tmp1-tmp2); +00046 } +00047 return sqrt(result); +00048 } +00049 +00050 +00051 private: +00052 +00054 using moeoNormalizedDistance < MOEOT > :: bounds; +00055 +00056 }; +00057 +00058 #endif /*MOEOEUCLIDEANDISTANCE_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoEvalFunc_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoEvalFunc_8h-source.html
new file mode 100644
index 000000000..a34f93694
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoEvalFunc_8h-source.html
@@ -0,0 +1,52 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoEvalFunc.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOEVALFUNC_H_ +00014 #define MOEOEVALFUNC_H_ +00015 +00016 #include <eoEvalFunc.h> +00017 +00018 /* +00019 * Functor that evaluates one MOEO by setting all its objective values. +00020 */ +00021 template < class MOEOT > +00022 class moeoEvalFunc : public eoEvalFunc< MOEOT > {}; +00023 +00024 #endif /*MOEOEVALFUNC_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoExpBinaryIndicatorBasedFitnessAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoExpBinaryIndicatorBasedFitnessAssignment_8h-source.html
new file mode 100644
index 000000000..1412f26db
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoExpBinaryIndicatorBasedFitnessAssignment_8h-source.html
@@ -0,0 +1,185 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoIndicatorBasedFitnessAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOEXPBINARYINDICATORBASEDFITNESSASSIGNMENT_H_ +00014 #define MOEOEXPBINARYINDICATORBASEDFITNESSASSIGNMENT_H_ +00015 +00016 #include <math.h> +00017 #include <vector> +00018 #include <eoPop.h> +00019 #include <fitness/moeoBinaryIndicatorBasedFitnessAssignment.h> +00020 #include <metric/moeoNormalizedSolutionVsSolutionBinaryMetric.h> +00021 #include <utils/moeoConvertPopToObjectiveVectors.h> +00022 +00028 template < class MOEOT > +00029 class moeoExpBinaryIndicatorBasedFitnessAssignment : public moeoBinaryIndicatorBasedFitnessAssignment < MOEOT > +00030 { +00031 public: +00032 +00034 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00035 +00036 +00042 moeoExpBinaryIndicatorBasedFitnessAssignment(moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & _metric, const double _kappa = 0.05) : metric(_metric), kappa(_kappa) +00043 {} +00044 +00045 +00050 void operator()(eoPop < MOEOT > & _pop) +00051 { +00052 // 1 - setting of the bounds +00053 setup(_pop); +00054 // 2 - computing every indicator values +00055 computeValues(_pop); +00056 // 3 - setting fitnesses +00057 setFitnesses(_pop); +00058 } +00059 +00060 +00066 void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) +00067 { +00068 std::vector < double > v; +00069 v.resize(_pop.size()); +00070 for (unsigned int i=0; i<_pop.size(); i++) +00071 { +00072 v[i] = metric(_objVec, _pop[i].objectiveVector()); +00073 } +00074 for (unsigned int i=0; i<_pop.size(); i++) +00075 { +00076 _pop[i].fitness( _pop[i].fitness() + exp(-v[i]/kappa) ); +00077 } +00078 } +00079 +00080 +00087 double updateByAdding(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) +00088 { +00089 std::vector < double > v; +00090 // update every fitness values to take the new individual into account +00091 v.resize(_pop.size()); +00092 for (unsigned int i=0; i<_pop.size(); i++) +00093 { +00094 v[i] = metric(_objVec, _pop[i].objectiveVector()); +00095 } +00096 for (unsigned int i=0; i<_pop.size(); i++) +00097 { +00098 _pop[i].fitness( _pop[i].fitness() - exp(-v[i]/kappa) ); +00099 } +00100 // compute the fitness of the new individual +00101 v.clear(); +00102 v.resize(_pop.size()); +00103 for (unsigned int i=0; i<_pop.size(); i++) +00104 { +00105 v[i] = metric(_pop[i].objectiveVector(), _objVec); +00106 } +00107 double result = 0; +00108 for (unsigned int i=0; i<v.size(); i++) +00109 { +00110 result -= exp(-v[i]/kappa); +00111 } +00112 return result; +00113 } +00114 +00115 +00116 protected: +00117 +00119 moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & metric; +00121 double kappa; +00123 std::vector < std::vector<double> > values; +00124 +00125 +00130 void setup(const eoPop < MOEOT > & _pop) +00131 { +00132 double min, max; +00133 for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++) +00134 { +00135 min = _pop[0].objectiveVector()[i]; +00136 max = _pop[0].objectiveVector()[i]; +00137 for (unsigned int j=1; j<_pop.size(); j++) +00138 { +00139 min = std::min(min, _pop[j].objectiveVector()[i]); +00140 max = std::max(max, _pop[j].objectiveVector()[i]); +00141 } +00142 // setting of the bounds for the objective i +00143 metric.setup(min, max, i); +00144 } +00145 } +00146 +00147 +00152 void computeValues(const eoPop < MOEOT > & _pop) +00153 { +00154 values.clear(); +00155 values.resize(_pop.size()); +00156 for (unsigned int i=0; i<_pop.size(); i++) +00157 { +00158 values[i].resize(_pop.size()); +00159 for (unsigned int j=0; j<_pop.size(); j++) +00160 { +00161 if (i != j) +00162 { +00163 values[i][j] = metric(_pop[i].objectiveVector(), _pop[j].objectiveVector()); +00164 } +00165 } +00166 } +00167 } +00168 +00169 +00174 void setFitnesses(eoPop < MOEOT > & _pop) +00175 { +00176 for (unsigned int i=0; i<_pop.size(); i++) +00177 { +00178 _pop[i].fitness(computeFitness(i)); +00179 } +00180 } +00181 +00182 +00187 double computeFitness(const unsigned int _idx) +00188 { +00189 double result = 0; +00190 for (unsigned int i=0; i<values.size(); i++) +00191 { +00192 if (i != _idx) +00193 { +00194 result -= exp(-values[i][_idx]/kappa); +00195 } +00196 } +00197 return result; +00198 } +00199 +00200 }; +00201 +00202 #endif /*MOEOEXPBINARYINDICATORBASEDFITNESSASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoFastNonDominatedSortingFitnessAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoFastNonDominatedSortingFitnessAssignment_8h-source.html
new file mode 100644
index 000000000..47e06fc92
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoFastNonDominatedSortingFitnessAssignment_8h-source.html
@@ -0,0 +1,222 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoFastNonDominatedSortingFitnessAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOFASTNONDOMINATEDSORTINGFITNESSASSIGNMENT_H_ +00014 #define MOEOFASTNONDOMINATEDSORTINGFITNESSASSIGNMENT_H_ +00015 +00016 #include <vector> +00017 #include <eoPop.h> +00018 #include <comparator/moeoObjectiveObjectiveVectorComparator.h> +00019 #include <comparator/moeoObjectiveVectorComparator.h> +00020 #include <comparator/moeoParetoObjectiveVectorComparator.h> +00021 #include <fitness/moeoParetoBasedFitnessAssignment.h> +00022 +00023 +00031 template < class MOEOT > +00032 class moeoFastNonDominatedSortingFitnessAssignment : public moeoParetoBasedFitnessAssignment < MOEOT > +00033 { +00034 public: +00035 +00037 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00038 +00039 +00043 moeoFastNonDominatedSortingFitnessAssignment() : comparator(paretoComparator) +00044 {} +00045 +00046 +00051 moeoFastNonDominatedSortingFitnessAssignment(moeoObjectiveVectorComparator < ObjectiveVector > & _comparator) : comparator(_comparator) +00052 {} +00053 +00054 +00059 void operator()(eoPop < MOEOT > & _pop) +00060 { +00061 // number of objectives for the problem under consideration +00062 unsigned int nObjectives = MOEOT::ObjectiveVector::nObjectives(); +00063 if (nObjectives == 1) +00064 { +00065 // one objective +00066 oneObjective(_pop); +00067 } +00068 else if (nObjectives == 2) +00069 { +00070 // two objectives (the two objectives function is still to implement) +00071 mObjectives(_pop); +00072 } +00073 else if (nObjectives > 2) +00074 { +00075 // more than two objectives +00076 mObjectives(_pop); +00077 } +00078 else +00079 { +00080 // problem with the number of objectives +00081 throw std::runtime_error("Problem with the number of objectives in moeoNonDominatedSortingFitnessAssignment"); +00082 } +00083 // a higher fitness is better, so the values need to be inverted +00084 double max = _pop[0].fitness(); +00085 for (unsigned int i=1 ; i<_pop.size() ; i++) +00086 { +00087 max = std::max(max, _pop[i].fitness()); +00088 } +00089 for (unsigned int i=0 ; i<_pop.size() ; i++) +00090 { +00091 _pop[i].fitness(max - _pop[i].fitness()); +00092 } +00093 } +00094 +00095 +00101 void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) +00102 { +00103 for (unsigned int i=0; i<_pop.size(); i++) +00104 { +00105 // if _pop[i] is dominated by _objVec +00106 if ( comparator(_pop[i].objectiveVector(), _objVec) ) +00107 { +00108 _pop[i].fitness(_pop[i].fitness()+1); +00109 } +00110 } +00111 } +00112 +00113 +00114 private: +00115 +00117 moeoObjectiveVectorComparator < ObjectiveVector > & comparator; +00119 moeoParetoObjectiveVectorComparator < ObjectiveVector > paretoComparator; +00121 class ObjectiveComparator : public moeoComparator < MOEOT > +00122 { +00123 public: +00129 const bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2) +00130 { +00131 return cmp(_moeo1.objectiveVector(), _moeo2.objectiveVector()); +00132 } +00133 private: +00135 moeoObjectiveObjectiveVectorComparator < ObjectiveVector > cmp; +00136 } objComparator; +00137 +00138 +00143 void oneObjective (eoPop < MOEOT > & _pop) +00144 { +00145 // sorts the population in the ascending order +00146 std::sort(_pop.begin(), _pop.end(), objComparator); +00147 // assign fitness values +00148 unsigned int rank = 1; +00149 _pop[_pop.size()-1].fitness(rank); +00150 for (unsigned int i=_pop.size()-2; i>=0; i--) +00151 { +00152 if (_pop[i].objectiveVector() != _pop[i+1].objectiveVector()) +00153 { +00154 rank++; +00155 } +00156 _pop[i].fitness(rank); +00157 } +00158 } +00159 +00160 +00165 void twoObjectives (eoPop < MOEOT > & _pop) +00166 { +00167 //... TO DO ! +00168 } +00169 +00170 +00175 void mObjectives (eoPop < MOEOT > & _pop) +00176 { +00177 // S[i] = indexes of the individuals dominated by _pop[i] +00178 std::vector < std::vector<unsigned int> > S(_pop.size()); +00179 // n[i] = number of individuals that dominate the individual _pop[i] +00180 std::vector < unsigned int > n(_pop.size(), 0); +00181 // fronts: F[i] = indexes of the individuals contained in the ith front +00182 std::vector < std::vector<unsigned int> > F(_pop.size()+2); +00183 // used to store the number of the first front +00184 F[1].reserve(_pop.size()); +00185 for (unsigned int p=0; p<_pop.size(); p++) +00186 { +00187 for (unsigned int q=0; q<_pop.size(); q++) +00188 { +00189 // if q is dominated by p +00190 if ( comparator(_pop[q].objectiveVector(), _pop[p].objectiveVector()) ) +00191 { +00192 // add q to the set of solutions dominated by p +00193 S[p].push_back(q); +00194 } +00195 // if p is dominated by q +00196 else if ( comparator(_pop[p].objectiveVector(), _pop[q].objectiveVector()) ) +00197 { +00198 // increment the domination counter of p +00199 n[p]++; +00200 } +00201 } +00202 // if no individual dominates p +00203 if (n[p] == 0) +00204 { +00205 // p belongs to the first front +00206 _pop[p].fitness(1); +00207 F[1].push_back(p); +00208 } +00209 } +00210 // front counter +00211 unsigned int counter=1; +00212 unsigned int p,q; +00213 while (! F[counter].empty()) +00214 { +00215 // used to store the number of the next front +00216 F[counter+1].reserve(_pop.size()); +00217 for (unsigned int i=0; i<F[counter].size(); i++) +00218 { +00219 p = F[counter][i]; +00220 for (unsigned int j=0; j<S[p].size(); j++) +00221 { +00222 q = S[p][j]; +00223 n[q]--; +00224 // if no individual dominates q anymore +00225 if (n[q] == 0) +00226 { +00227 // q belongs to the next front +00228 _pop[q].fitness(counter+1); +00229 F[counter+1].push_back(q); +00230 } +00231 } +00232 } +00233 counter++; +00234 } +00235 } +00236 +00237 }; +00238 +00239 #endif /*MOEOFASTNONDOMINATEDSORTINGFITNESSASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoFitnessAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoFitnessAssignment_8h-source.html
new file mode 100644
index 000000000..2d3e65454
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoFitnessAssignment_8h-source.html
@@ -0,0 +1,65 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoFitnessAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOFITNESSASSIGNMENT_H_ +00014 #define MOEOFITNESSASSIGNMENT_H_ +00015 +00016 #include <eoFunctor.h> +00017 #include <eoPop.h> +00018 +00022 template < class MOEOT > +00023 class moeoFitnessAssignment : public eoUF < eoPop < MOEOT > &, void > +00024 { +00025 public: +00026 +00028 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00029 +00030 +00036 virtual void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) = 0; +00037 +00038 +00044 void updateByDeleting(eoPop < MOEOT > & _pop, MOEOT & _moeo) +00045 { +00046 updateByDeleting(_pop, _moeo.objectiveVector()); +00047 } +00048 +00049 }; +00050 +00051 #endif /*MOEOFITNESSASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoFitnessThenDiversityComparator_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoFitnessThenDiversityComparator_8h-source.html
new file mode 100644
index 000000000..51eec72da
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoFitnessThenDiversityComparator_8h-source.html
@@ -0,0 +1,65 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoFitnessThenDiversityComparator.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOFITNESSTHENDIVERSITYCOMPARATOR_H_ +00014 #define MOEOFITNESSTHENDIVERSITYCOMPARATOR_H_ +00015 +00016 #include <comparator/moeoComparator.h> +00017 +00021 template < class MOEOT > +00022 class moeoFitnessThenDiversityComparator : public moeoComparator < MOEOT > +00023 { +00024 public: +00025 +00031 const bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2) +00032 { +00033 if (_moeo1.fitness() == _moeo2.fitness()) +00034 { +00035 return _moeo1.diversity() < _moeo2.diversity(); +00036 } +00037 else +00038 { +00039 return _moeo1.fitness() < _moeo2.fitness(); +00040 } +00041 } +00042 +00043 }; +00044 +00045 #endif /*MOEOFITNESSTHENDIVERSITYCOMPARATOR_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoFrontByFrontCrowdingDiversityAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoFrontByFrontCrowdingDiversityAssignment_8h-source.html
new file mode 100644
index 000000000..a3bcf6363
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoFrontByFrontCrowdingDiversityAssignment_8h-source.html
@@ -0,0 +1,139 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoFrontByFrontCrowdingDiversityAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOFRONTBYFRONTCROWDINGDIVERSITYASSIGNMENT_H_ +00014 #define MOEOFRONTBYFRONTCROWDINGDIVERSITYASSIGNMENT_H_ +00015 +00016 #include <diversity/moeoCrowdingDiversityAssignment.h> +00017 #include <comparator/moeoFitnessThenDiversityComparator.h> +00018 +00024 template < class MOEOT > +00025 class moeoFrontByFrontCrowdingDiversityAssignment : public moeoCrowdingDiversityAssignment < MOEOT > +00026 { +00027 public: +00028 +00030 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00031 +00032 +00040 void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) +00041 { +00042 std::cout << "WARNING : updateByDeleting not implemented in moeoFrontByFrontCrowdingDistanceDiversityAssignment" << std::endl; +00043 } +00044 +00045 +00046 private: +00047 +00048 using moeoCrowdingDiversityAssignment < MOEOT >::inf; +00049 using moeoCrowdingDiversityAssignment < MOEOT >::tiny; +00050 +00055 void setDistances (eoPop < MOEOT > & _pop) +00056 { +00057 unsigned int a,b; +00058 double min, max, distance; +00059 unsigned int nObjectives = MOEOT::ObjectiveVector::nObjectives(); +00060 // set diversity to 0 for every individual +00061 for (unsigned int i=0; i<_pop.size(); i++) +00062 { +00063 _pop[i].diversity(0.0); +00064 } +00065 // sort the whole pop according to fitness values +00066 moeoFitnessThenDiversityComparator < MOEOT > fitnessComparator; +00067 std::sort(_pop.begin(), _pop.end(), fitnessComparator); +00068 // compute the crowding distance values for every individual "front" by "front" (front : from a to b) +00069 a = 0; // the front starts at a +00070 while (a < _pop.size()) +00071 { +00072 b = lastIndex(_pop,a); // the front ends at b +00073 // if there is less than 2 individuals in the front... +00074 if ((b-a) < 2) +00075 { +00076 for (unsigned int i=a; i<=b; i++) +00077 { +00078 _pop[i].diversity(inf()); +00079 } +00080 } +00081 // else... +00082 else +00083 { +00084 // for each objective +00085 for (unsigned int obj=0; obj<nObjectives; obj++) +00086 { +00087 // sort in the descending order using the values of the objective 'obj' +00088 moeoOneObjectiveComparator < MOEOT > objComp(obj); +00089 std::sort(_pop.begin()+a, _pop.begin()+b+1, objComp); +00090 // min & max +00091 min = _pop[b].objectiveVector()[obj]; +00092 max = _pop[a].objectiveVector()[obj]; +00093 // avoid extreme case +00094 if (min == max) +00095 { +00096 min -= tiny(); +00097 max += tiny(); +00098 } +00099 // set the diversity value to infiny for min and max +00100 _pop[a].diversity(inf()); +00101 _pop[b].diversity(inf()); +00102 // set the diversity values for the other individuals +00103 for (unsigned int i=a+1; i<b; i++) +00104 { +00105 distance = (_pop[i-1].objectiveVector()[obj] - _pop[i+1].objectiveVector()[obj]) / (max-min); +00106 _pop[i].diversity(_pop[i].diversity() + distance); +00107 } +00108 } +00109 } +00110 // go to the next front +00111 a = b+1; +00112 } +00113 } +00114 +00115 +00121 unsigned int lastIndex (eoPop < MOEOT > & _pop, unsigned int _start) +00122 { +00123 unsigned int i=_start; +00124 while ( (i<_pop.size()-1) && (_pop[i].fitness()==_pop[i+1].fitness()) ) +00125 { +00126 i++; +00127 } +00128 return i; +00129 } +00130 +00131 }; +00132 +00133 #endif /*MOEOFRONTBYFRONTCROWDINGDIVERSITYASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoFrontByFrontSharingDiversityAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoFrontByFrontSharingDiversityAssignment_8h-source.html
new file mode 100644
index 000000000..60d9474b3
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoFrontByFrontSharingDiversityAssignment_8h-source.html
@@ -0,0 +1,108 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoFrontByFrontSharingDiversityAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOFRONTBYFRONTSHARINGDIVERSITYASSIGNMENT_H_ +00014 #define MOEOFRONTBYFRONTSHARINGDIVERSITYASSIGNMENT_H_ +00015 +00016 #include <diversity/moeoSharingDiversityAssignment.h> +00017 +00021 template < class MOEOT > +00022 class moeoFrontByFrontSharingDiversityAssignment : public moeoSharingDiversityAssignment < MOEOT > +00023 { +00024 public: +00025 +00027 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00028 +00029 +00036 moeoFrontByFrontSharingDiversityAssignment(moeoDistance<MOEOT,double> & _distance, double _nicheSize = 0.5, double _alpha = 2.0) : moeoSharingDiversityAssignment < MOEOT >(_distance, _nicheSize, _alpha) +00037 {} +00038 +00039 +00045 moeoFrontByFrontSharingDiversityAssignment(double _nicheSize = 0.5, double _alpha = 2.0) : moeoSharingDiversityAssignment < MOEOT >(_nicheSize, _alpha) +00046 {} +00047 +00048 +00056 void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) +00057 { +00058 std::cout << "WARNING : updateByDeleting not implemented in moeoSharingDiversityAssignment" << std::endl; +00059 } +00060 +00061 +00062 private: +00063 +00064 using moeoSharingDiversityAssignment < MOEOT >::distance; +00065 using moeoSharingDiversityAssignment < MOEOT >::nicheSize; +00066 using moeoSharingDiversityAssignment < MOEOT >::sh; +00067 using moeoSharingDiversityAssignment < MOEOT >::operator(); +00068 +00069 +00074 void setSimilarities(eoPop < MOEOT > & _pop) +00075 { +00076 // compute distances between every individuals +00077 moeoDistanceMatrix < MOEOT , double > dMatrix (_pop.size(), distance); +00078 dMatrix(_pop); +00079 // sets the distance to bigger than the niche size for every couple of solutions that do not belong to the same front +00080 for (unsigned int i=0; i<_pop.size(); i++) +00081 { +00082 for (unsigned int j=0; j<i; j++) +00083 { +00084 if (_pop[i].fitness() != _pop[j].fitness()) +00085 { +00086 dMatrix[i][j] = nicheSize; +00087 dMatrix[j][i] = nicheSize; +00088 } +00089 } +00090 } +00091 // compute similarities +00092 double sum; +00093 for (unsigned int i=0; i<_pop.size(); i++) +00094 { +00095 sum = 0.0; +00096 for (unsigned int j=0; j<_pop.size(); j++) +00097 { +00098 sum += sh(dMatrix[i][j]); +00099 } +00100 _pop[i].diversity(sum); +00101 } +00102 } +00103 +00104 }; +00105 +00106 #endif /*MOEOFRONTBYFRONTSHARINGDIVERSITYASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoGDominanceObjectiveVectorComparator_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoGDominanceObjectiveVectorComparator_8h-source.html
new file mode 100644
index 000000000..22cf6d1f2
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoGDominanceObjectiveVectorComparator_8h-source.html
@@ -0,0 +1,109 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoGDominanceObjectiveVectorComparator.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOGDOMINANCEOBJECTIVEVECTORCOMPARATOR_H_ +00014 #define MOEOGDOMINANCEOBJECTIVEVECTORCOMPARATOR_H_ +00015 +00016 #include <comparator/moeoObjectiveVectorComparator.h> +00017 +00024 template < class ObjectiveVector > +00025 class moeoGDominanceObjectiveVectorComparator : public moeoObjectiveVectorComparator < ObjectiveVector > +00026 { +00027 public: +00028 +00033 moeoGDominanceObjectiveVectorComparator(ObjectiveVector & _ref) : ref(_ref) +00034 {} +00035 +00036 +00042 const bool operator()(const ObjectiveVector & _objectiveVector1, const ObjectiveVector & _objectiveVector2) +00043 { +00044 unsigned int flag1 = flag(_objectiveVector1); +00045 unsigned int flag2 = flag(_objectiveVector2); +00046 if (flag2==0) +00047 { +00048 // cannot dominate +00049 return false; +00050 } +00051 else if ( (flag2==1) && (flag1==0) ) +00052 { +00053 // is dominated +00054 return true; +00055 } +00056 else // (flag1==1) && (flag2==1) +00057 { +00058 // both are on the good region, so let's use the classical Pareto dominance +00059 return paretoComparator(_objectiveVector1, _objectiveVector2); +00060 } +00061 } +00062 +00063 +00064 private: +00065 +00067 ObjectiveVector & ref; +00069 moeoParetoObjectiveVectorComparator < ObjectiveVector > paretoComparator; +00070 +00071 +00076 unsigned int flag(const ObjectiveVector & _objectiveVector) +00077 { +00078 unsigned int result=1; +00079 for (unsigned int i=0; i<ref.nObjectives(); i++) +00080 { +00081 if (_objectiveVector[i] > ref[i]) +00082 { +00083 result=0; +00084 } +00085 } +00086 if (result==0) +00087 { +00088 result=1; +00089 for (unsigned int i=0; i<ref.nObjectives(); i++) +00090 { +00091 if (_objectiveVector[i] < ref[i]) +00092 { +00093 result=0; +00094 } +00095 } +00096 } +00097 return result; +00098 } +00099 +00100 }; +00101 +00102 #endif /*MOEOGDOMINANCEOBJECTIVEVECTORCOMPARATOR_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoGenerationalReplacement_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoGenerationalReplacement_8h-source.html
new file mode 100644
index 000000000..65209b79c
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoGenerationalReplacement_8h-source.html
@@ -0,0 +1,59 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoGenerationalReplacement.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOGENERATIONALREPLACEMENT_H_ +00014 #define MOEOGENERATIONALREPLACEMENT_H_ +00015 +00016 #include <eoReplacement.h> +00017 #include <replacement/moeoReplacement.h> +00018 +00022 template < class MOEOT > +00023 class moeoGenerationalReplacement : public moeoReplacement < MOEOT >, public eoGenerationalReplacement < MOEOT > +00024 { +00025 public: +00026 +00032 void operator()(eoPop < MOEOT > & _parents, eoPop < MOEOT > & _offspring) +00033 { +00034 eoGenerationalReplacement < MOEOT >::operator ()(_parents, _offspring); +00035 } +00036 +00037 }; +00038 +00039 #endif /*MOEOGENERATIONALREPLACEMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoHybridLS_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoHybridLS_8h-source.html
new file mode 100644
index 000000000..a071245d5
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoHybridLS_8h-source.html
@@ -0,0 +1,86 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoHybridLS.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOHYBRIDLS_H_ +00014 #define MOEOHYBRIDLS_H_ +00015 +00016 #include <eoContinue.h> +00017 #include <eoPop.h> +00018 #include <eoSelect.h> +00019 #include <utils/eoUpdater.h> +00020 #include <algo/moeoLS.h> +00021 #include <archive/moeoArchive.h> +00022 +00027 template < class MOEOT > +00028 class moeoHybridLS : public eoUpdater +00029 { +00030 public: +00031 +00039 moeoHybridLS (eoContinue < MOEOT > & _term, eoSelect < MOEOT > & _select, moeoLS < MOEOT, MOEOT > & _mols, moeoArchive < MOEOT > & _arch) : +00040 term(_term), select(_select), mols(_mols), arch(_arch) +00041 {} +00042 +00043 +00047 void operator () () +00048 { +00049 if (! term (arch)) +00050 { +00051 // selection of solutions +00052 eoPop < MOEOT > selectedSolutions; +00053 select(arch, selectedSolutions); +00054 // apply the local search to every selected solution +00055 for (unsigned int i=0; i<selectedSolutions.size(); i++) +00056 { +00057 mols(selectedSolutions[i], arch); +00058 } +00059 } +00060 } +00061 +00062 +00063 private: +00064 +00066 eoContinue < MOEOT > & term; +00068 eoSelect < MOEOT > & select; +00070 moeoLS < MOEOT, MOEOT > & mols; +00072 moeoArchive < MOEOT > & arch; +00073 +00074 }; +00075 +00076 #endif /*MOEOHYBRIDLS_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoHypervolumeBinaryMetric_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoHypervolumeBinaryMetric_8h-source.html
new file mode 100644
index 000000000..509d30bd5
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoHypervolumeBinaryMetric_8h-source.html
@@ -0,0 +1,141 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoHypervolumeBinaryMetric.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOHYPERVOLUMEBINARYMETRIC_H_ +00014 #define MOEOHYPERVOLUMEBINARYMETRIC_H_ +00015 +00016 #include <stdexcept> +00017 #include <comparator/moeoParetoObjectiveVectorComparator.h> +00018 #include <metric/moeoNormalizedSolutionVsSolutionBinaryMetric.h> +00019 +00028 template < class ObjectiveVector > +00029 class moeoHypervolumeBinaryMetric : public moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > +00030 { +00031 public: +00032 +00037 moeoHypervolumeBinaryMetric(double _rho = 1.1) : rho(_rho) +00038 { +00039 // not-a-maximization problem check +00040 for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++) +00041 { +00042 if (ObjectiveVector::Traits::maximizing(i)) +00043 { +00044 throw std::runtime_error("Hypervolume binary metric not yet implemented for a maximization problem in moeoHypervolumeBinaryMetric"); +00045 } +00046 } +00047 // consistency check +00048 if (rho < 1) +00049 { +00050 std::cout << "Warning, value used to compute the reference point rho for the hypervolume calculation must not be smaller than 1" << std::endl; +00051 std::cout << "Adjusted to 1" << std::endl; +00052 rho = 1; +00053 } +00054 } +00055 +00056 +00063 double operator()(const ObjectiveVector & _o1, const ObjectiveVector & _o2) +00064 { +00065 double result; +00066 // if _o2 is dominated by _o1 +00067 if ( paretoComparator(_o2,_o1) ) +00068 { +00069 result = - hypervolume(_o1, _o2, ObjectiveVector::Traits::nObjectives()-1); +00070 } +00071 else +00072 { +00073 result = hypervolume(_o2, _o1, ObjectiveVector::Traits::nObjectives()-1); +00074 } +00075 return result; +00076 } +00077 +00078 +00079 private: +00080 +00082 double rho; +00084 using moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > :: bounds; +00086 moeoParetoObjectiveVectorComparator < ObjectiveVector > paretoComparator; +00087 +00088 +00096 double hypervolume(const ObjectiveVector & _o1, const ObjectiveVector & _o2, const unsigned int _obj, const bool _flag = false) +00097 { +00098 double result; +00099 double range = rho * bounds[_obj].range(); +00100 double max = bounds[_obj].minimum() + range; +00101 // value of _1 for the objective _obj +00102 double v1 = _o1[_obj]; +00103 // value of _2 for the objective _obj (if _flag=true, v2=max) +00104 double v2; +00105 if (_flag) +00106 { +00107 v2 = max; +00108 } +00109 else +00110 { +00111 v2 = _o2[_obj]; +00112 } +00113 // computation of the volume +00114 if (_obj == 0) +00115 { +00116 if (v1 < v2) +00117 { +00118 result = (v2 - v1) / range; +00119 } +00120 else +00121 { +00122 result = 0; +00123 } +00124 } +00125 else +00126 { +00127 if (v1 < v2) +00128 { +00129 result = ( hypervolume(_o1, _o2, _obj-1, true) * (v2 - v1) / range ) + ( hypervolume(_o1, _o2, _obj-1) * (max - v2) / range ); +00130 } +00131 else +00132 { +00133 result = hypervolume(_o1, _o2, _obj-1) * (max - v2) / range; +00134 } +00135 } +00136 return result; +00137 } +00138 +00139 }; +00140 +00141 #endif /*MOEOHYPERVOLUMEBINARYMETRIC_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoIBEA_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoIBEA_8h-source.html
new file mode 100644
index 000000000..f78c42c40
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoIBEA_8h-source.html
@@ -0,0 +1,133 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoIBEA.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOIBEA_H_ +00014 #define MOEOIBEA_H_ +00015 +00016 +00017 #include <eoBreed.h> +00018 #include <eoContinue.h> +00019 #include <eoEvalFunc.h> +00020 #include <eoGenContinue.h> +00021 #include <eoGeneralBreeder.h> +00022 #include <eoGenOp.h> +00023 #include <eoPopEvalFunc.h> +00024 #include <eoSGAGenOp.h> +00025 #include <algo/moeoEA.h> +00026 #include <diversity/moeoDummyDiversityAssignment.h> +00027 #include <fitness/moeoIndicatorBasedFitnessAssignment.h> +00028 #include <metric/moeoNormalizedSolutionVsSolutionBinaryMetric.h> +00029 #include <replacement/moeoEnvironmentalReplacement.h> +00030 #include <selection/moeoDetTournamentSelect.h> +00031 +00037 template < class MOEOT > +00038 class moeoIBEA : public moeoEA < MOEOT > +00039 { +00040 public: +00041 +00043 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00044 +00045 +00054 moeoIBEA (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoGenOp < MOEOT > & _op, moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & _metric, const double _kappa=0.05) : +00055 defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select(2), +00056 fitnessAssignment(_metric, _kappa), replace(fitnessAssignment, dummyDiversityAssignment), genBreed(select, _op), breed(genBreed) +00057 {} +00058 +00059 +00068 moeoIBEA (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoTransform < MOEOT > & _op, moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & _metric, const double _kappa=0.05) : +00069 defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select(2), +00070 fitnessAssignment(_metric, _kappa), replace(fitnessAssignment, dummyDiversityAssignment), genBreed(select, _op), breed(genBreed) +00071 {} +00072 +00073 +00085 moeoIBEA (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoQuadOp < MOEOT > & _crossover, double _pCross, eoMonOp < MOEOT > & _mutation, double _pMut, moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & _metric, const double _kappa=0.05) : +00086 defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select (2), +00087 fitnessAssignment(_metric, _kappa), replace (fitnessAssignment, dummyDiversityAssignment), defaultSGAGenOp(_crossover, _pCross, _mutation, _pMut), +00088 genBreed (select, defaultSGAGenOp), breed (genBreed) +00089 {} +00090 +00091 +00100 moeoIBEA (eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoGenOp < MOEOT > & _op, moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & _metric, const double _kappa=0.05) : +00101 continuator(_continuator), popEval(_eval), select(2), +00102 fitnessAssignment(_metric, _kappa), replace(fitnessAssignment, dummyDiversityAssignment), genBreed(select, _op), breed(genBreed) +00103 {} +00104 +00105 +00114 moeoIBEA (eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoTransform < MOEOT > & _op, moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & _metric, const double _kappa=0.05) : +00115 continuator(_continuator), popEval(_eval), select(2), +00116 fitnessAssignment(_metric, _kappa), replace(fitnessAssignment, dummyDiversityAssignment), genBreed(select, _op), breed(genBreed) +00117 {} +00118 +00119 +00124 virtual void operator () (eoPop < MOEOT > &_pop) +00125 { +00126 eoPop < MOEOT > offspring, empty_pop; +00127 popEval (empty_pop, _pop); // a first eval of _pop +00128 // evaluate fitness and diversity +00129 fitnessAssignment(_pop); +00130 dummyDiversityAssignment(_pop); +00131 do +00132 { +00133 // generate offspring, worths are recalculated if necessary +00134 breed (_pop, offspring); +00135 // eval of offspring +00136 popEval (_pop, offspring); +00137 // after replace, the new pop is in _pop. Worths are recalculated if necessary +00138 replace (_pop, offspring); +00139 } while (continuator (_pop)); +00140 } +00141 +00142 +00143 protected: +00144 +00146 eoGenContinue < MOEOT > defaultGenContinuator; +00148 eoContinue < MOEOT > & continuator; +00150 eoPopLoopEval < MOEOT > popEval; +00152 moeoDetTournamentSelect < MOEOT > select; +00154 moeoIndicatorBasedFitnessAssignment < MOEOT > fitnessAssignment; +00156 moeoDummyDiversityAssignment < MOEOT > dummyDiversityAssignment; +00158 moeoEnvironmentalReplacement < MOEOT > replace; +00160 eoSGAGenOp < MOEOT > defaultSGAGenOp; +00162 eoGeneralBreeder < MOEOT > genBreed; +00164 eoBreed < MOEOT > & breed; +00165 +00166 }; +00167 +00168 #endif /*MOEOIBEA_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoIndicatorBasedFitnessAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoIndicatorBasedFitnessAssignment_8h-source.html
new file mode 100644
index 000000000..abf9b7d87
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoIndicatorBasedFitnessAssignment_8h-source.html
@@ -0,0 +1,49 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoIndicatorBasedFitnessAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOINDICATORBASEDFITNESSASSIGNMENT_H_ +00014 #define MOEOINDICATORBASEDFITNESSASSIGNMENT_H_ +00015 +00016 #include <fitness/moeoFitnessAssignment.h> +00017 +00021 template < class MOEOT > +00022 class moeoIndicatorBasedFitnessAssignment : public moeoFitnessAssignment < MOEOT > {}; +00023 +00024 #endif /*MOEOINDICATORBASEDFITNESSASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoLS_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoLS_8h-source.html
new file mode 100644
index 000000000..b29b6b869
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoLS_8h-source.html
@@ -0,0 +1,51 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoLS.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOLS_H_ +00014 #define MOEOLS_H_ +00015 +00016 #include <eoFunctor.h> +00017 #include <algo/moeoAlgo.h> +00018 #include <archive/moeoArchive.h> +00019 +00024 template < class MOEOT, class Type > +00025 class moeoLS: public moeoAlgo, public eoBF < Type, moeoArchive < MOEOT > &, void > {}; +00026 +00027 #endif /*MOEOLS_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoManhattanDistance_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoManhattanDistance_8h-source.html
new file mode 100644
index 000000000..21bdeb6db
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoManhattanDistance_8h-source.html
@@ -0,0 +1,75 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoManhattanDistance.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOMANHATTANDISTANCE_H_ +00014 #define MOEOMANHATTANDISTANCE_H_ +00015 +00016 #include <math.h> +00017 #include <distance/moeoNormalizedDistance.h> +00018 +00023 template < class MOEOT > +00024 class moeoManhattanDistance : public moeoNormalizedDistance < MOEOT > +00025 { +00026 public: +00027 +00029 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00030 +00031 +00037 const double operator()(const MOEOT & _moeo1, const MOEOT & _moeo2) +00038 { +00039 double result = 0.0; +00040 double tmp1, tmp2; +00041 for (unsigned int i=0; i<ObjectiveVector::nObjectives(); i++) +00042 { +00043 tmp1 = (_moeo1.objectiveVector()[i] - bounds[i].minimum()) / bounds[i].range(); +00044 tmp2 = (_moeo2.objectiveVector()[i] - bounds[i].minimum()) / bounds[i].range(); +00045 result += fabs(tmp1-tmp2); +00046 } +00047 return result; +00048 } +00049 +00050 +00051 private: +00052 +00054 using moeoNormalizedDistance < MOEOT > :: bounds; +00055 +00056 }; +00057 +00058 #endif /*MOEOMANHATTANDISTANCE_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoMetric_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoMetric_8h-source.html
new file mode 100644
index 000000000..b2fb8c660
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoMetric_8h-source.html
@@ -0,0 +1,74 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoMetric.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOMETRIC_H_ +00014 #define MOEOMETRIC_H_ +00015 +00016 #include <vector> +00017 #include <eoFunctor.h> +00018 +00022 class moeoMetric : public eoFunctorBase {}; +00023 +00024 +00028 template < class A, class R > +00029 class moeoUnaryMetric : public eoUF < A, R >, public moeoMetric {}; +00030 +00031 +00035 template < class A1, class A2, class R > +00036 class moeoBinaryMetric : public eoBF < A1, A2, R >, public moeoMetric {}; +00037 +00038 +00042 template < class ObjectiveVector, class R > +00043 class moeoSolutionUnaryMetric : public moeoUnaryMetric < const ObjectiveVector &, R > {}; +00044 +00045 +00049 template < class ObjectiveVector, class R > +00050 class moeoVectorUnaryMetric : public moeoUnaryMetric < const std::vector < ObjectiveVector > &, R > {}; +00051 +00052 +00056 template < class ObjectiveVector, class R > +00057 class moeoSolutionVsSolutionBinaryMetric : public moeoBinaryMetric < const ObjectiveVector &, const ObjectiveVector &, R > {}; +00058 +00059 +00063 template < class ObjectiveVector, class R > +00064 class moeoVectorVsVectorBinaryMetric : public moeoBinaryMetric < const std::vector < ObjectiveVector > &, const std::vector < ObjectiveVector > &, R > {}; +00065 +00066 +00067 #endif /*MOEOMETRIC_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoNSGAII_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoNSGAII_8h-source.html
new file mode 100644
index 000000000..9b7449711
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoNSGAII_8h-source.html
@@ -0,0 +1,128 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoNSGAII.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEONSGAII_H_ +00014 #define MOEONSGAII_H_ +00015 +00016 #include <eoBreed.h> +00017 #include <eoContinue.h> +00018 #include <eoEvalFunc.h> +00019 #include <eoGenContinue.h> +00020 #include <eoGeneralBreeder.h> +00021 #include <eoGenOp.h> +00022 #include <eoPopEvalFunc.h> +00023 #include <eoSGAGenOp.h> +00024 #include <algo/moeoEA.h> +00025 #include <diversity/moeoFrontByFrontCrowdingDiversityAssignment.h> +00026 #include <fitness/moeoFastNonDominatedSortingFitnessAssignment.h> +00027 #include <replacement/moeoElitistReplacement.h> +00028 #include <selection/moeoDetTournamentSelect.h> +00029 +00036 template < class MOEOT > +00037 class moeoNSGAII: public moeoEA < MOEOT > +00038 { +00039 public: +00040 +00047 moeoNSGAII (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoGenOp < MOEOT > & _op) : +00048 defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select(2), +00049 replace(fitnessAssignment, diversityAssignment), genBreed(select, _op), breed(genBreed) +00050 {} +00051 +00052 +00059 moeoNSGAII (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoTransform < MOEOT > & _op) : +00060 defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select(2), +00061 replace(fitnessAssignment, diversityAssignment), genBreed(select, _op), breed(genBreed) +00062 {} +00063 +00064 +00074 moeoNSGAII (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoQuadOp < MOEOT > & _crossover, double _pCross, eoMonOp < MOEOT > & _mutation, double _pMut) : +00075 defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select (2), +00076 replace (fitnessAssignment, diversityAssignment), defaultSGAGenOp(_crossover, _pCross, _mutation, _pMut), +00077 genBreed (select, defaultSGAGenOp), breed (genBreed) +00078 {} +00079 +00080 +00087 moeoNSGAII (eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoGenOp < MOEOT > & _op) : +00088 continuator(_continuator), popEval(_eval), select(2), +00089 replace(fitnessAssignment, diversityAssignment), genBreed(select, _op), breed(genBreed) +00090 {} +00091 +00092 +00099 moeoNSGAII (eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoTransform < MOEOT > & _op) : +00100 continuator(_continuator), popEval(_eval), select(2), +00101 replace(fitnessAssignment, diversityAssignment), genBreed(select, _op), breed(genBreed) +00102 {} +00103 +00104 +00109 virtual void operator () (eoPop < MOEOT > &_pop) +00110 { +00111 eoPop < MOEOT > offspring, empty_pop; +00112 popEval (empty_pop, _pop); // a first eval of _pop +00113 // evaluate fitness and diversity +00114 fitnessAssignment(_pop); +00115 diversityAssignment(_pop); +00116 do +00117 { +00118 // generate offspring, worths are recalculated if necessary +00119 breed (_pop, offspring); +00120 // eval of offspring +00121 popEval (_pop, offspring); +00122 // after replace, the new pop is in _pop. Worths are recalculated if necessary +00123 replace (_pop, offspring); +00124 } while (continuator (_pop)); +00125 } +00126 +00127 +00128 protected: +00129 +00131 eoGenContinue < MOEOT > defaultGenContinuator; +00133 eoContinue < MOEOT > & continuator; +00135 eoPopLoopEval < MOEOT > popEval; +00137 moeoDetTournamentSelect < MOEOT > select; +00139 moeoFastNonDominatedSortingFitnessAssignment < MOEOT > fitnessAssignment; +00141 moeoFrontByFrontCrowdingDiversityAssignment < MOEOT > diversityAssignment; +00143 moeoElitistReplacement < MOEOT > replace; +00145 eoSGAGenOp < MOEOT > defaultSGAGenOp; +00147 eoGeneralBreeder < MOEOT > genBreed; +00149 eoBreed < MOEOT > & breed; +00150 +00151 }; +00152 +00153 #endif /*MOEONSGAII_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoNSGA_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoNSGA_8h-source.html
new file mode 100644
index 000000000..1c6d15205
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoNSGA_8h-source.html
@@ -0,0 +1,128 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoNSGA.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEONSGA_H_ +00014 #define MOEONSGA_H_ +00015 +00016 #include <eoBreed.h> +00017 #include <eoContinue.h> +00018 #include <eoEvalFunc.h> +00019 #include <eoGenContinue.h> +00020 #include <eoGeneralBreeder.h> +00021 #include <eoGenOp.h> +00022 #include <eoPopEvalFunc.h> +00023 #include <eoSGAGenOp.h> +00024 #include <algo/moeoEA.h> +00025 #include <diversity/moeoFrontByFrontSharingDiversityAssignment.h> +00026 #include <fitness/moeoFastNonDominatedSortingFitnessAssignment.h> +00027 #include <replacement/moeoElitistReplacement.h> +00028 #include <selection/moeoDetTournamentSelect.h> +00029 +00036 template < class MOEOT > +00037 class moeoNSGA: public moeoEA < MOEOT > +00038 { +00039 public: +00040 +00048 moeoNSGA (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoGenOp < MOEOT > & _op, double _nicheSize = 0.5) : +00049 defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select(2), +00050 diversityAssignment(_nicheSize), replace(fitnessAssignment, diversityAssignment), genBreed(select, _op), breed(genBreed) +00051 {} +00052 +00053 +00061 moeoNSGA (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoTransform < MOEOT > & _op, double _nicheSize = 0.5) : +00062 defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select(2), +00063 diversityAssignment(_nicheSize), replace(fitnessAssignment, diversityAssignment), genBreed(select, _op), breed(genBreed) +00064 {} +00065 +00066 +00077 moeoNSGA (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoQuadOp < MOEOT > & _crossover, double _pCross, eoMonOp < MOEOT > & _mutation, double _pMut, double _nicheSize = 0.5) : +00078 defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select (2), +00079 diversityAssignment(_nicheSize), replace (fitnessAssignment, diversityAssignment), +00080 defaultSGAGenOp(_crossover, _pCross, _mutation, _pMut), genBreed (select, defaultSGAGenOp), breed (genBreed) +00081 {} +00082 +00083 +00091 moeoNSGA (eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoGenOp < MOEOT > & _op, double _nicheSize = 0.5) : +00092 continuator(_continuator), popEval(_eval), select(2), +00093 diversityAssignment(_nicheSize), replace(fitnessAssignment, diversityAssignment), genBreed(select, _op), breed(genBreed) +00094 {} +00095 +00096 +00104 moeoNSGA (eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoTransform < MOEOT > & _op, double _nicheSize = 0.5) : +00105 continuator(_continuator), popEval(_eval), select(2), +00106 diversityAssignment(_nicheSize), replace(fitnessAssignment, diversityAssignment), genBreed(select, _op), breed(genBreed) +00107 {} +00108 +00109 +00114 virtual void operator () (eoPop < MOEOT > &_pop) +00115 { +00116 eoPop < MOEOT > offspring, empty_pop; +00117 popEval (empty_pop, _pop); // a first eval of _pop +00118 // evaluate fitness and diversity +00119 fitnessAssignment(_pop); +00120 diversityAssignment(_pop); +00121 do +00122 { +00123 // generate offspring, worths are recalculated if necessary +00124 breed (_pop, offspring); +00125 // eval of offspring +00126 popEval (_pop, offspring); +00127 // after replace, the new pop is in _pop. Worths are recalculated if necessary +00128 replace (_pop, offspring); +00129 } while (continuator (_pop)); +00130 } +00131 +00132 +00133 protected: +00134 +00136 eoGenContinue < MOEOT > defaultGenContinuator; +00138 eoContinue < MOEOT > & continuator; +00140 eoPopLoopEval < MOEOT > popEval; +00142 moeoDetTournamentSelect < MOEOT > select; +00144 moeoFastNonDominatedSortingFitnessAssignment < MOEOT > fitnessAssignment; +00146 moeoFrontByFrontSharingDiversityAssignment < MOEOT > diversityAssignment; +00148 moeoElitistReplacement < MOEOT > replace; +00150 eoSGAGenOp < MOEOT > defaultSGAGenOp; +00152 eoGeneralBreeder < MOEOT > genBreed; +00154 eoBreed < MOEOT > & breed; +00155 +00156 }; +00157 +00158 #endif /*MOEONSGAII_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoNormalizedDistance_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoNormalizedDistance_8h-source.html
new file mode 100644
index 000000000..21ac6cbb4
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoNormalizedDistance_8h-source.html
@@ -0,0 +1,114 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoNormalizedDistance.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEONORMALIZEDDISTANCE_H_ +00014 #define MOEONORMALIZEDDISTANCE_H_ +00015 +00016 #include <vector> +00017 #include <utils/eoRealBounds.h> +00018 #include <distance/moeoDistance.h> +00019 +00023 template < class MOEOT , class Type = double > +00024 class moeoNormalizedDistance : public moeoDistance < MOEOT , Type > +00025 { +00026 public: +00027 +00029 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00030 +00031 +00035 moeoNormalizedDistance() +00036 { +00037 bounds.resize(ObjectiveVector::Traits::nObjectives()); +00038 // initialize bounds in case someone does not want to use them +00039 for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++) +00040 { +00041 bounds[i] = eoRealInterval(0,1); +00042 } +00043 } +00044 +00045 +00049 static double tiny() +00050 { +00051 return 1e-6; +00052 } +00053 +00054 +00059 virtual void setup(const eoPop < MOEOT > & _pop) +00060 { +00061 double min, max; +00062 for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++) +00063 { +00064 min = _pop[0].objectiveVector()[i]; +00065 max = _pop[0].objectiveVector()[i]; +00066 for (unsigned int j=1; j<_pop.size(); j++) +00067 { +00068 min = std::min(min, _pop[j].objectiveVector()[i]); +00069 max = std::max(max, _pop[j].objectiveVector()[i]); +00070 } +00071 // setting of the bounds for the objective i +00072 setup(min, max, i); +00073 } +00074 } +00075 +00076 +00083 virtual void setup(double _min, double _max, unsigned int _obj) +00084 { +00085 if (_min == _max) +00086 { +00087 _min -= tiny(); +00088 _max += tiny(); +00089 } +00090 bounds[_obj] = eoRealInterval(_min, _max); +00091 } +00092 +00093 +00099 virtual void setup(eoRealInterval _realInterval, unsigned int _obj) +00100 { +00101 bounds[_obj] = _realInterval; +00102 } +00103 +00104 +00105 protected: +00106 +00108 std::vector < eoRealInterval > bounds; +00109 +00110 }; +00111 +00112 #endif /*MOEONORMALIZEDDISTANCE_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoNormalizedSolutionVsSolutionBinaryMetric_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoNormalizedSolutionVsSolutionBinaryMetric_8h-source.html
new file mode 100644
index 000000000..0647af1ae
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoNormalizedSolutionVsSolutionBinaryMetric_8h-source.html
@@ -0,0 +1,93 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoNormalizedSolutionVsSolutionBinaryMetric.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEONORMALIZEDSOLUTIONVSSOLUTIONBINARYMETRIC_H_ +00014 #define MOEONORMALIZEDSOLUTIONVSSOLUTIONBINARYMETRIC_H_ +00015 +00016 #include <vector> +00017 #include <utils/eoRealBounds.h> +00018 #include <metric/moeoMetric.h> +00019 +00025 template < class ObjectiveVector, class R > +00026 class moeoNormalizedSolutionVsSolutionBinaryMetric : public moeoSolutionVsSolutionBinaryMetric < ObjectiveVector, R > +00027 { +00028 public: +00029 +00033 moeoNormalizedSolutionVsSolutionBinaryMetric() +00034 { +00035 bounds.resize(ObjectiveVector::Traits::nObjectives()); +00036 // initialize bounds in case someone does not want to use them +00037 for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++) +00038 { +00039 bounds[i] = eoRealInterval(0,1); +00040 } +00041 } +00042 +00043 +00050 void setup(double _min, double _max, unsigned int _obj) +00051 { +00052 if (_min == _max) +00053 { +00054 _min -= tiny(); +00055 _max += tiny(); +00056 } +00057 bounds[_obj] = eoRealInterval(_min, _max); +00058 } +00059 +00060 +00066 virtual void setup(eoRealInterval _realInterval, unsigned int _obj) +00067 { +00068 bounds[_obj] = _realInterval; +00069 } +00070 +00071 +00075 static double tiny() +00076 { +00077 return 1e-6; +00078 } +00079 +00080 +00081 protected: +00082 +00084 std::vector < eoRealInterval > bounds; +00085 +00086 }; +00087 +00088 #endif /*MOEONORMALIZEDSOLUTIONVSSOLUTIONBINARYMETRIC_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoObjectiveObjectiveVectorComparator_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoObjectiveObjectiveVectorComparator_8h-source.html
new file mode 100644
index 000000000..447f36768
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoObjectiveObjectiveVectorComparator_8h-source.html
@@ -0,0 +1,72 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoObjectiveObjectiveVectorComparator.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOOBJECTIVEOBJECTIVEVECTORCOMPARATOR_H_ +00014 #define MOEOOBJECTIVEOBJECTIVEVECTORCOMPARATOR_H_ +00015 +00016 #include <comparator/moeoObjectiveVectorComparator.h> +00017 +00021 template < class ObjectiveVector > +00022 class moeoObjectiveObjectiveVectorComparator : public moeoObjectiveVectorComparator < ObjectiveVector > +00023 { +00024 public: +00025 +00031 const bool operator()(const ObjectiveVector & _objectiveVector1, const ObjectiveVector & _objectiveVector2) +00032 { +00033 for (unsigned int i=0; i<ObjectiveVector::nObjectives(); i++) +00034 { +00035 if ( fabs(_objectiveVector1[i] - _objectiveVector2[i]) > ObjectiveVector::Traits::tolerance() ) +00036 { +00037 if (_objectiveVector1[i] < _objectiveVector2[i]) +00038 { +00039 return true; +00040 } +00041 else +00042 { +00043 return false; +00044 } +00045 } +00046 } +00047 return false; +00048 } +00049 +00050 }; +00051 +00052 #endif /*MOEOOBJECTIVEOBJECTIVEVECTORCOMPARATOR_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoObjectiveVectorComparator_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoObjectiveVectorComparator_8h-source.html
new file mode 100644
index 000000000..7d7d504fb
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoObjectiveVectorComparator_8h-source.html
@@ -0,0 +1,50 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoObjectiveVectorComparator.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOOBJECTIVEVECTORCOMPARATOR_H_ +00014 #define MOEOOBJECTIVEVECTORCOMPARATOR_H_ +00015 +00016 #include <math.h> +00017 #include <eoFunctor.h> +00018 +00023 template < class ObjectiveVector > +00024 class moeoObjectiveVectorComparator : public eoBF < const ObjectiveVector &, const ObjectiveVector &, const bool > {}; +00025 +00026 #endif /*MOEOOBJECTIVEVECTORCOMPARATOR_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoObjectiveVectorTraits_8cpp-source.html b/trunk/paradiseo-moeo/doc/html/moeoObjectiveVectorTraits_8cpp-source.html
new file mode 100644
index 000000000..15cda480e
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoObjectiveVectorTraits_8cpp-source.html
@@ -0,0 +1,45 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoObjectiveVectorTraits.cpp +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #include <core/moeoObjectiveVectorTraits.h> +00014 +00015 // The static variables of the moeoObjectiveVectorTraits class need to be allocated +00016 unsigned int moeoObjectiveVectorTraits::nObj; +00017 std::vector < bool > moeoObjectiveVectorTraits::bObj; +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoObjectiveVectorTraits_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoObjectiveVectorTraits_8h-source.html
new file mode 100644
index 000000000..5a32248bf
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoObjectiveVectorTraits_8h-source.html
@@ -0,0 +1,107 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoObjectiveVectorTraits.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOOBJECTIVEVECTORTRAITS_H_ +00014 #define MOEOOBJECTIVEVECTORTRAITS_H_ +00015 +00016 #include <iostream> +00017 #include <stdexcept> +00018 #include <vector> +00019 +00023 class moeoObjectiveVectorTraits +00024 { +00025 public: +00026 +00032 static void setup(unsigned int _nObjectives, std::vector < bool > & _bObjectives) +00033 { +00034 // in case the number of objectives was already set to a different value +00035 if ( nObj && (nObj != _nObjectives) ) { +00036 std::cout << "WARNING\n"; +00037 std::cout << "WARNING : the number of objectives are changing\n"; +00038 std::cout << "WARNING : Make sure all existing objects are destroyed\n"; +00039 std::cout << "WARNING\n"; +00040 } +00041 // number of objectives +00042 nObj = _nObjectives; +00043 // min/max vector +00044 bObj = _bObjectives; +00045 // in case the number of objectives and the min/max vector size don't match +00046 if (nObj != bObj.size()) +00047 throw std::runtime_error("Number of objectives and min/max size don't match in moeoObjectiveVectorTraits::setup"); +00048 } +00049 +00050 +00054 static unsigned int nObjectives() +00055 { +00056 // in case the number of objectives would not be assigned yet +00057 if (! nObj) +00058 throw std::runtime_error("Number of objectives not assigned in moeoObjectiveVectorTraits"); +00059 return nObj; +00060 } +00061 +00062 +00067 static bool minimizing(unsigned int _i) +00068 { +00069 // in case there would be a wrong index +00070 if (_i >= bObj.size()) +00071 throw std::runtime_error("Wrong index in moeoObjectiveVectorTraits"); +00072 return bObj[_i]; +00073 } +00074 +00075 +00080 static bool maximizing(unsigned int _i) { +00081 return (! minimizing(_i)); +00082 } +00083 +00084 +00088 static double tolerance() +00089 { +00090 return 1e-6; +00091 } +00092 +00093 +00094 private: +00095 +00097 static unsigned int nObj; +00099 static std::vector < bool > bObj; +00100 +00101 }; +00102 +00103 #endif /*MOEOOBJECTIVEVECTORTRAITS_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoObjectiveVector_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoObjectiveVector_8h-source.html
new file mode 100644
index 000000000..1c9bb8b2d
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoObjectiveVector_8h-source.html
@@ -0,0 +1,88 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoObjectiveVector.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOOBJECTIVEVECTOR_H_ +00014 #define MOEOOBJECTIVEVECTOR_H_ +00015 +00016 #include <vector> +00017 +00024 template < class ObjectiveVectorTraits, class ObjectiveVectorType > +00025 class moeoObjectiveVector : public std::vector < ObjectiveVectorType > +00026 { +00027 public: +00028 +00030 typedef ObjectiveVectorTraits Traits; +00032 typedef ObjectiveVectorType Type; +00033 +00034 +00038 moeoObjectiveVector(Type _value = Type()) : std::vector < Type > (ObjectiveVectorTraits::nObjectives(), _value) +00039 {} +00040 +00041 +00046 moeoObjectiveVector(std::vector < Type > & _v) : std::vector < Type > (_v) +00047 {} +00048 +00049 +00055 static void setup(unsigned int _nObjectives, std::vector < bool > & _bObjectives) +00056 { +00057 ObjectiveVectorTraits::setup(_nObjectives, _bObjectives); +00058 } +00059 +00060 +00064 static unsigned int nObjectives() +00065 { +00066 return ObjectiveVectorTraits::nObjectives(); +00067 } +00068 +00069 +00074 static bool minimizing(unsigned int _i) +00075 { +00076 return ObjectiveVectorTraits::minimizing(_i); +00077 } +00078 +00079 +00084 static bool maximizing(unsigned int _i) +00085 { +00086 return ObjectiveVectorTraits::maximizing(_i); +00087 } +00088 +00089 }; +00090 +00091 #endif /*MOEOOBJECTIVEVECTOR_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoOneObjectiveComparator_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoOneObjectiveComparator_8h-source.html
new file mode 100644
index 000000000..498c27c35
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoOneObjectiveComparator_8h-source.html
@@ -0,0 +1,72 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoOneObjectiveComparator.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOONEOBJECTIVECOMPARATOR_H_ +00014 #define MOEOONEOBJECTIVECOMPARATOR_H_ +00015 +00016 #include <comparator/moeoComparator.h> +00017 +00021 template < class MOEOT > +00022 class moeoOneObjectiveComparator : public moeoComparator < MOEOT > +00023 { +00024 public: +00025 +00030 moeoOneObjectiveComparator(unsigned int _obj) : obj(_obj) +00031 { +00032 if (obj > MOEOT::ObjectiveVector::nObjectives()) +00033 { +00034 throw std::runtime_error("Problem with the index of objective in moeoOneObjectiveComparator"); +00035 } +00036 } +00037 +00038 +00044 const bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2) +00045 { +00046 return _moeo1.objectiveVector()[obj] < _moeo2.objectiveVector()[obj]; +00047 } +00048 +00049 +00050 private: +00051 +00053 unsigned int obj; +00054 +00055 }; +00056 +00057 #endif /*MOEOONEOBJECTIVECOMPARATOR_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoParetoBasedFitnessAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoParetoBasedFitnessAssignment_8h-source.html
new file mode 100644
index 000000000..d8244551f
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoParetoBasedFitnessAssignment_8h-source.html
@@ -0,0 +1,49 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoParetoBasedFitnessAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOPARETOBASEDFITNESSASSIGNMENT_H_ +00014 #define MOEOPARETOBASEDFITNESSASSIGNMENT_H_ +00015 +00016 #include <fitness/moeoFitnessAssignment.h> +00017 +00021 template < class MOEOT > +00022 class moeoParetoBasedFitnessAssignment : public moeoFitnessAssignment < MOEOT > {}; +00023 +00024 #endif /*MOEOPARETOBASEDFITNESSASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoParetoObjectiveVectorComparator_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoParetoObjectiveVectorComparator_8h-source.html
new file mode 100644
index 000000000..f2fbd5fe9
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoParetoObjectiveVectorComparator_8h-source.html
@@ -0,0 +1,90 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoParetoObjectiveVectorComparator.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOPARETOOBJECTIVEVECTORCOMPARATOR_H_ +00014 #define MOEOPARETOOBJECTIVEVECTORCOMPARATOR_H_ +00015 +00016 #include <comparator/moeoObjectiveVectorComparator.h> +00017 +00021 template < class ObjectiveVector > +00022 class moeoParetoObjectiveVectorComparator : public moeoObjectiveVectorComparator < ObjectiveVector > +00023 { +00024 public: +00025 +00031 const bool operator()(const ObjectiveVector & _objectiveVector1, const ObjectiveVector & _objectiveVector2) +00032 { +00033 bool dom = false; +00034 for (unsigned int i=0; i<ObjectiveVector::nObjectives(); i++) +00035 { +00036 // first, we have to check if the 2 objective values are not equal for the ith objective +00037 if ( fabs(_objectiveVector1[i] - _objectiveVector2[i]) > ObjectiveVector::Traits::tolerance() ) +00038 { +00039 // if the ith objective have to be minimized... +00040 if (ObjectiveVector::minimizing(i)) +00041 { +00042 if (_objectiveVector1[i] > _objectiveVector2[i]) +00043 { +00044 dom = true; //_objectiveVector1[i] is not better than _objectiveVector2[i] +00045 } +00046 else +00047 { +00048 return false; //_objectiveVector2 cannot dominate _objectiveVector1 +00049 } +00050 } +00051 // if the ith objective have to be maximized... +00052 else if (ObjectiveVector::maximizing(i)) +00053 { +00054 if (_objectiveVector1[i] > _objectiveVector2[i]) +00055 { +00056 dom = true; //_objectiveVector1[i] is not better than _objectiveVector2[i] +00057 } +00058 else +00059 { +00060 return false; //_objectiveVector2 cannot dominate _objectiveVector1 +00061 } +00062 } +00063 } +00064 } +00065 return dom; +00066 } +00067 +00068 }; +00069 +00070 #endif /*MOEOPARETOOBJECTIVEVECTORCOMPARATOR_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoRandomSelect_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoRandomSelect_8h-source.html
new file mode 100644
index 000000000..151df4872
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoRandomSelect_8h-source.html
@@ -0,0 +1,62 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoRandomSelect.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEORANDOMSELECT_H_ +00014 #define MOEORANDOMSELECT_H_ +00015 +00016 #include <eoRandomSelect.h> +00017 #include <selection/moeoSelectOne.h> +00018 +00019 +00023 template < class MOEOT > class moeoRandomSelect:public moeoSelectOne < MOEOT >, public eoRandomSelect <MOEOT > +00024 { +00025 public: +00026 +00030 moeoRandomSelect(){} +00031 +00032 +00036 const MOEOT & operator () (const eoPop < MOEOT > &_pop) +00037 { +00038 return eoRandomSelect < MOEOT >::operator ()(_pop); +00039 } +00040 +00041 }; +00042 +00043 #endif /*MOEORANDOMSELECT_H_ */ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoRealObjectiveVector_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoRealObjectiveVector_8h-source.html
new file mode 100644
index 000000000..b1ddcac38
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoRealObjectiveVector_8h-source.html
@@ -0,0 +1,140 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoRealObjectiveVector.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOREALOBJECTIVEVECTOR_H_ +00014 #define MOEOREALOBJECTIVEVECTOR_H_ +00015 +00016 #include <iostream> +00017 #include <math.h> +00018 #include <comparator/moeoObjectiveObjectiveVectorComparator.h> +00019 #include <comparator/moeoParetoObjectiveVectorComparator.h> +00020 #include <core/moeoObjectiveVector.h> +00021 +00026 template < class ObjectiveVectorTraits > +00027 class moeoRealObjectiveVector : public moeoObjectiveVector < ObjectiveVectorTraits, double > +00028 { +00029 public: +00030 +00031 using moeoObjectiveVector < ObjectiveVectorTraits, double >::size; +00032 using moeoObjectiveVector < ObjectiveVectorTraits, double >::operator[]; +00033 +00037 moeoRealObjectiveVector(double _value = 0.0) : moeoObjectiveVector < ObjectiveVectorTraits, double > (_value) +00038 {} +00039 +00040 +00045 moeoRealObjectiveVector(std::vector < double > & _v) : moeoObjectiveVector < ObjectiveVectorTraits, double > (_v) +00046 {} +00047 +00048 +00054 bool dominates(const moeoRealObjectiveVector < ObjectiveVectorTraits > & _other) const +00055 { +00056 moeoParetoObjectiveVectorComparator < moeoRealObjectiveVector<ObjectiveVectorTraits> > comparator; +00057 return comparator(_other, *this); +00058 } +00059 +00060 +00065 bool operator==(const moeoRealObjectiveVector < ObjectiveVectorTraits > & _other) const +00066 { +00067 for (unsigned int i=0; i < size(); i++) +00068 { +00069 if ( fabs(operator[](i) - _other[i]) > ObjectiveVectorTraits::tolerance() ) +00070 { +00071 return false; +00072 } +00073 } +00074 return true; +00075 } +00076 +00077 +00082 bool operator!=(const moeoRealObjectiveVector < ObjectiveVectorTraits > & _other) const +00083 { +00084 return ! operator==(_other); +00085 } +00086 +00087 +00093 bool operator<(const moeoRealObjectiveVector < ObjectiveVectorTraits > & _other) const +00094 { +00095 moeoObjectiveObjectiveVectorComparator < moeoRealObjectiveVector < ObjectiveVectorTraits > > cmp; +00096 return cmp(*this, _other); +00097 } +00098 +00099 +00105 bool operator>(const moeoRealObjectiveVector < ObjectiveVectorTraits > & _other) const +00106 { +00107 return _other < *this; +00108 } +00109 +00110 +00116 bool operator<=(const moeoRealObjectiveVector < ObjectiveVectorTraits > & _other) const +00117 { +00118 return operator==(_other) || operator<(_other); +00119 } +00120 +00121 +00127 bool operator>=(const moeoRealObjectiveVector < ObjectiveVectorTraits > & _other) const +00128 { +00129 return operator==(_other) || operator>(_other); +00130 } +00131 +00132 }; +00133 +00134 +00140 template < class ObjectiveVectorTraits > +00141 std::ostream & operator<<(std::ostream & _os, const moeoRealObjectiveVector < ObjectiveVectorTraits > & _objectiveVector) +00142 { +00143 for (unsigned int i=0; i<_objectiveVector.size(); i++) +00144 { +00145 _os << _objectiveVector[i] << '\t'; +00146 } +00147 return _os; +00148 } +00149 +00155 template < class ObjectiveVectorTraits > +00156 std::istream & operator>>(std::istream & _is, moeoRealObjectiveVector < ObjectiveVectorTraits > & _objectiveVector) +00157 { +00158 _objectiveVector = moeoRealObjectiveVector < ObjectiveVectorTraits > (); +00159 for (unsigned int i=0; i<_objectiveVector.size(); i++) +00160 { +00161 _is >> _objectiveVector[i]; +00162 } +00163 return _is; +00164 } +00165 +00166 #endif /*MOEOREALOBJECTIVEVECTOR_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoRealVector_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoRealVector_8h-source.html
new file mode 100644
index 000000000..c4f1dc730
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoRealVector_8h-source.html
@@ -0,0 +1,62 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoRealVector.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOREALVECTOR_H_ +00014 #define MOEOREALVECTOR_H_ +00015 +00016 #include <core/moeoVector.h> +00017 +00021 template < class MOEOObjectiveVector, class MOEOFitness, class MOEODiversity > +00022 class moeoRealVector : public moeoVector < MOEOObjectiveVector, MOEOFitness, MOEODiversity, double > +00023 { +00024 public: +00025 +00031 moeoRealVector(unsigned int _size = 0, double _value = 0.0) : moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, double >(_size, _value) +00032 {} +00033 +00034 +00038 virtual std::string className() const +00039 { +00040 return "moeoRealVector"; +00041 } +00042 +00043 }; +00044 +00045 #endif /*MOEOREALVECTOR_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoReplacement_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoReplacement_8h-source.html
new file mode 100644
index 000000000..76136285b
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoReplacement_8h-source.html
@@ -0,0 +1,49 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoReplacement.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOREPLACEMENT_H_ +00014 #define MOEOREPLACEMENT_H_ +00015 +00016 #include <eoReplacement.h> +00017 +00021 template < class MOEOT > +00022 class moeoReplacement : public eoReplacement < MOEOT > {}; +00023 +00024 #endif /*MOEOREPLACEMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoRouletteSelect_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoRouletteSelect_8h-source.html
new file mode 100644
index 000000000..ba6387e6a
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoRouletteSelect_8h-source.html
@@ -0,0 +1,77 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoRouletteSelect.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOROULETTESELECT_H_ +00014 #define MOEOROULETTESELECT_H_ +00015 +00016 #include <selection/moeoSelectOne.h> +00017 #include <selection/moeoSelectors.h> +00018 +00023 template < class MOEOT > +00024 class moeoRouletteSelect:public moeoSelectOne < MOEOT > +00025 { +00026 public: +00027 +00032 moeoRouletteSelect (unsigned int _tSize = 2) : tSize (_tSize) +00033 { +00034 // consistency check +00035 if (tSize < 2) +00036 { +00037 std:: +00038 cout << "Warning, Tournament size should be >= 2\nAdjusted to 2\n"; +00039 tSize = 2; +00040 } +00041 } +00042 +00043 +00048 const MOEOT & operator () (const eoPop < MOEOT > & _pop) +00049 { +00050 // use the selector +00051 return mo_roulette_wheel(_pop,tSize); +00052 } +00053 +00054 +00055 protected: +00056 +00058 double & tSize; +00059 +00060 }; +00061 +00062 #endif /*MOEOROULETTESELECT_H_ */ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoScalarFitnessAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoScalarFitnessAssignment_8h-source.html
new file mode 100644
index 000000000..67d19c5d9
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoScalarFitnessAssignment_8h-source.html
@@ -0,0 +1,49 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoScalarFitnessAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOSCALARFITNESSASSIGNMENT_H_ +00014 #define MOEOSCALARFITNESSASSIGNMENT_H_ +00015 +00016 #include <fitness/moeoFitnessAssignment.h> +00017 +00021 template < class MOEOT > +00022 class moeoScalarFitnessAssignment : public moeoFitnessAssignment < MOEOT > {}; +00023 +00024 #endif /*MOEOSCALARFITNESSASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoSelectFromPopAndArch_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoSelectFromPopAndArch_8h-source.html
new file mode 100644
index 000000000..86ac2fe9e
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoSelectFromPopAndArch_8h-source.html
@@ -0,0 +1,93 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoSelectFormPopAndArch.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOSELECTONEFROMPOPANDARCH_H_ +00014 #define MOEOSELECTONEFROMPOPANDARCH_H_ +00015 +00016 #include <eoPop.h> +00017 #include <utils/eoRNG.h> +00018 #include <archive/moeoArchive.h> +00019 #include <selection/moeoSelectOne.h> +00020 #include <selection/moeoRandomSelect.h> +00021 +00025 template < class MOEOT > +00026 class moeoSelectFromPopAndArch : public moeoSelectOne < MOEOT > +00027 { +00028 public: +00029 +00037 moeoSelectFromPopAndArch (moeoSelectOne < MOEOT > & _popSelectOne, moeoSelectOne < MOEOT > _archSelectOne, moeoArchive < MOEOT > & _arch, double _ratioFromPop=0.5) +00038 : popSelectOne(_popSelectOne), archSelectOne(_archSelectOne), arch(_arch), ratioFromPop(_ratioFromPop) +00039 {} +00040 +00041 +00048 moeoSelectFromPopAndArch (moeoSelectOne < MOEOT > & _popSelectOne, moeoArchive < MOEOT > & _arch, double _ratioFromPop=0.5) +00049 : popSelectOne(_popSelectOne), archSelectOne(randomSelectOne), arch(_arch), ratioFromPop(_ratioFromPop) +00050 {} +00051 +00052 +00056 virtual const MOEOT & operator () (const eoPop < MOEOT > & pop) +00057 { +00058 if (arch.size() > 0) +00059 if (rng.flip(ratioFromPop)) +00060 return popSelectOne(pop); +00061 else +00062 return archSelectOne(arch); +00063 else +00064 return popSelectOne(pop); +00065 } +00066 +00067 +00071 virtual void setup (const eoPop < MOEOT > & _pop) +00072 { +00073 popSelectOne.setup(_pop); +00074 } +00075 +00076 +00077 private: +00078 +00080 moeoSelectOne < MOEOT > & popSelectOne; +00082 moeoSelectOne < MOEOT > & archSelectOne; +00084 moeoArchive < MOEOT > & arch; +00086 double ratioFromPop; +00088 moeoRandomSelect < MOEOT > randomSelectOne; +00089 +00090 }; +00091 +00092 #endif /*MOEOSELECTONEFROMPOPANDARCH_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoSelectOne_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoSelectOne_8h-source.html
new file mode 100644
index 000000000..b6d1fe0fe
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoSelectOne_8h-source.html
@@ -0,0 +1,49 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoSelectOne.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOSELECTONE_H_ +00014 #define MOEOSELECTONE_H_ +00015 +00016 #include <eoSelectOne.h> +00017 +00021 template < class MOEOT > +00022 class moeoSelectOne : public eoSelectOne < MOEOT > {}; +00023 +00024 #endif /*MOEOSELECTONE_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoSelectors_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoSelectors_8h-source.html
new file mode 100644
index 000000000..3fb7d8628
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoSelectors_8h-source.html
@@ -0,0 +1,186 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoSelectors.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOSELECTORS_H_ +00014 #define MOEOSELECTORS_H_ +00015 +00016 #include <comparator/moeoComparator.h> +00017 +00018 +00019 template <class It,class MOEOT> +00020 It mo_deterministic_tournament(It _begin, It _end, unsigned int _t_size,moeoComparator<MOEOT>& _comparator ,eoRng& _gen = rng) +00021 { +00022 It best = _begin + _gen.random(_end - _begin); +00023 +00024 for (unsigned int i = 0; i < _t_size - 1; ++i) +00025 { +00026 It competitor = _begin + _gen.random(_end - _begin); +00027 // compare the two individuals by using the comparator +00028 if (_comparator(*best, *competitor)) +00029 // best "better" than competitor +00030 best=competitor; +00031 } +00032 return best; +00033 } +00034 +00035 +00036 template <class MOEOT> +00037 const MOEOT& mo_deterministic_tournament(const eoPop<MOEOT>& _pop, unsigned int _t_size,moeoComparator<MOEOT>& _comparator, eoRng& _gen = rng) +00038 { +00039 return *mo_deterministic_tournament(_pop.begin(), _pop.end(),_t_size,_comparator, _gen); +00040 } +00041 +00042 +00043 template <class MOEOT> +00044 MOEOT& mo_deterministic_tournament(eoPop<MOEOT>& _pop, unsigned int _t_size,moeoComparator<MOEOT>& _comparator,eoRng& _gen = rng) +00045 { +00046 return *mo_deterministic_tournament(_pop.begin(), _pop.end(), _t_size,_comparator, _gen); +00047 } +00048 +00049 +00050 template <class It,class MOEOT> +00051 It mo_stochastic_tournament(It _begin, It _end, double _t_rate,moeoComparator<MOEOT>& _comparator ,eoRng& _gen = rng) +00052 { +00053 It i1 = _begin + _gen.random(_end - _begin); +00054 It i2 = _begin + _gen.random(_end - _begin); +00055 +00056 bool return_better = _gen.flip(_t_rate); +00057 +00058 if (_comparator(*i1, *i2)) +00059 { +00060 if (return_better) return i2; +00061 // else +00062 +00063 return i1; +00064 } +00065 else +00066 { +00067 if (return_better) return i1; +00068 // else +00069 } +00070 // else +00071 +00072 return i2; +00073 } +00074 +00075 +00076 template <class MOEOT> +00077 const MOEOT& mo_stochastic_tournament(const eoPop<MOEOT>& _pop, double _t_rate,moeoComparator<MOEOT>& _comparator, eoRng& _gen = rng) +00078 { +00079 return *mo_stochastic_tournament(_pop.begin(), _pop.end(), _t_rate,_comparator, _gen); +00080 } +00081 +00082 +00083 template <class MOEOT> +00084 MOEOT& mo_stochastic_tournament(eoPop<MOEOT>& _pop, double _t_rate, eoRng& _gen = rng) +00085 { +00086 return *mo_stochastic_tournament(_pop.begin(), _pop.end(), _t_rate, _gen); +00087 } +00088 +00089 +00090 template <class It> +00091 It mo_roulette_wheel(It _begin, It _end, double total, eoRng& _gen = rng) +00092 { +00093 +00094 float roulette = _gen.uniform(total); +00095 +00096 if (roulette == 0.0) // covers the case where total==0.0 +00097 return _begin + _gen.random(_end - _begin); // uniform choice +00098 +00099 It i = _begin; +00100 +00101 while (roulette > 0.0) +00102 { +00103 roulette -= static_cast<double>(*(i++)); +00104 } +00105 +00106 return --i; +00107 } +00108 +00109 +00110 template <class MOEOT> +00111 const MOEOT& mo_roulette_wheel(const eoPop<MOEOT>& _pop, double total, eoRng& _gen = rng) +00112 { +00113 float roulette = _gen.uniform(total); +00114 +00115 if (roulette == 0.0) // covers the case where total==0.0 +00116 return _pop[_gen.random(_pop.size())]; // uniform choice +00117 +00118 typename eoPop<MOEOT>::const_iterator i = _pop.begin(); +00119 +00120 while (roulette > 0.0) +00121 { +00122 roulette -= static_cast<double>((i++)->fitness()); +00123 } +00124 +00125 return *--i; +00126 } +00127 +00128 +00129 template <class MOEOT> +00130 MOEOT& mo_roulette_wheel(eoPop<MOEOT>& _pop, double total, eoRng& _gen = rng) +00131 { +00132 float roulette = _gen.uniform(total); +00133 +00134 if (roulette == 0.0) // covers the case where total==0.0 +00135 return _pop[_gen.random(_pop.size())]; // uniform choice +00136 +00137 typename eoPop<MOEOT>::iterator i = _pop.begin(); +00138 +00139 while (roulette > 0.0) +00140 { +00141 // fitness only +00142 roulette -= static_cast<double>((i++)->fitness()); +00143 } +00144 +00145 return *--i; +00146 } +00147 +00148 +00149 #endif /*MOEOSELECTORS_H_*/ +00150 +00151 +00152 +00153 +00154 +00155 +00156 +00157 +00158 +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoSharingDiversityAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoSharingDiversityAssignment_8h-source.html
new file mode 100644
index 000000000..c4e697ef9
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoSharingDiversityAssignment_8h-source.html
@@ -0,0 +1,131 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoSharingDiversityAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOSHARINGDIVERSITYASSIGNMENT_H_ +00014 #define MOEOSHARINGDIVERSITYASSIGNMENT_H_ +00015 +00016 #include <eoPop.h> +00017 #include <comparator/moeoDiversityThenFitnessComparator.h> +00018 #include <distance/moeoDistance.h> +00019 #include <distance/moeoDistanceMatrix.h> +00020 #include <distance/moeoEuclideanDistance.h> +00021 #include <diversity/moeoDiversityAssignment.h> +00022 +00027 template < class MOEOT > +00028 class moeoSharingDiversityAssignment : public moeoDiversityAssignment < MOEOT > +00029 { +00030 public: +00031 +00033 typedef typename MOEOT::ObjectiveVector ObjectiveVector; +00034 +00035 +00042 moeoSharingDiversityAssignment(moeoDistance<MOEOT,double> & _distance, double _nicheSize = 0.5, double _alpha = 1.0) : distance(_distance), nicheSize(_nicheSize), alpha(_alpha) +00043 {} +00044 +00045 +00051 moeoSharingDiversityAssignment(double _nicheSize = 0.5, double _alpha = 1.0) : distance(defaultDistance), nicheSize(_nicheSize), alpha(_alpha) +00052 {} +00053 +00054 +00059 void operator()(eoPop < MOEOT > & _pop) +00060 { +00061 // 1 - set simuilarities +00062 setSimilarities(_pop); +00063 // 2 - a higher diversity is better, so the values need to be inverted +00064 moeoDiversityThenFitnessComparator < MOEOT > divComparator; +00065 double max = std::max_element(_pop.begin(), _pop.end(), divComparator)->diversity(); +00066 for (unsigned int i=0 ; i<_pop.size() ; i++) +00067 { +00068 _pop[i].diversity(max - _pop[i].diversity()); +00069 } +00070 } +00071 +00072 +00080 void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) +00081 { +00082 std::cout << "WARNING : updateByDeleting not implemented in moeoSharingDiversityAssignment" << std::endl; +00083 } +00084 +00085 +00086 protected: +00087 +00089 moeoDistance < MOEOT , double > & distance; +00091 moeoEuclideanDistance < MOEOT > defaultDistance; +00093 double nicheSize; +00095 double alpha; +00096 +00097 +00102 virtual void setSimilarities(eoPop < MOEOT > & _pop) +00103 { +00104 // compute distances between every individuals +00105 moeoDistanceMatrix < MOEOT , double > dMatrix (_pop.size(), distance); +00106 dMatrix(_pop); +00107 // compute similarities +00108 double sum; +00109 for (unsigned int i=0; i<_pop.size(); i++) +00110 { +00111 sum = 0.0; +00112 for (unsigned int j=0; j<_pop.size(); j++) +00113 { +00114 sum += sh(dMatrix[i][j]); +00115 } +00116 _pop[i].diversity(sum); +00117 } +00118 } +00119 +00120 +00125 double sh(double _dist) +00126 { +00127 double result; +00128 if (_dist < nicheSize) +00129 { +00130 result = 1.0 - pow(_dist / nicheSize, alpha); +00131 } +00132 else +00133 { +00134 result = 0.0; +00135 } +00136 return result; +00137 } +00138 +00139 }; +00140 +00141 +00142 #endif /*MOEOSHARINGDIVERSITYASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoStochTournamentSelect_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoStochTournamentSelect_8h-source.html
new file mode 100644
index 000000000..b111a50d9
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoStochTournamentSelect_8h-source.html
@@ -0,0 +1,100 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoStochTournamentSelect.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOSTOCHTOURNAMENTSELECT_H_ +00014 #define MOEOSTOCHTOURNAMENTSELECT_H_ +00015 +00016 #include <comparator/moeoComparator.h> +00017 #include <comparator/moeoFitnessThenDiversityComparator.h> +00018 #include <selection/moeoSelectOne.h> +00019 #include <selection/moeoSelectors.h> +00020 +00024 template < class MOEOT > class moeoStochTournamentSelect:public moeoSelectOne <MOEOT> +00025 { +00026 public: +00027 +00033 moeoStochTournamentSelect (moeoComparator < MOEOT > & _comparator, double _tRate = 1.0) : comparator (_comparator), tRate (_tRate) +00034 { +00035 // consistency checks +00036 if (tRate < 0.5) +00037 { +00038 std::cerr << "Warning, Tournament rate should be > 0.5\nAdjusted to 0.55\n"; +00039 tRate = 0.55; +00040 } +00041 if (tRate > 1) +00042 { +00043 std::cerr << "Warning, Tournament rate should be < 1\nAdjusted to 1\n"; +00044 tRate = 1; +00045 } +00046 } +00047 +00048 +00053 moeoStochTournamentSelect (double _tRate = 1.0) : comparator (defaultComparator), tRate (_tRate) +00054 { +00055 // consistency checks +00056 if (tRate < 0.5) +00057 { +00058 std::cerr << "Warning, Tournament rate should be > 0.5\nAdjusted to 0.55\n"; +00059 tRate = 0.55; +00060 } +00061 if (tRate > 1) +00062 { +00063 std::cerr << "Warning, Tournament rate should be < 1\nAdjusted to 1\n"; +00064 tRate = 1; +00065 } +00066 } +00067 +00068 +00073 const MOEOT & operator() (const eoPop < MOEOT > &_pop) +00074 { +00075 // use the selector +00076 return mo_stochastic_tournament(_pop,tRate,comparator); +00077 } +00078 +00079 +00080 protected: +00081 +00083 moeoComparator < MOEOT > & comparator; +00085 moeoFitnessThenDiversityComparator < MOEOT > defaultComparator; +00087 double tRate; +00088 +00089 }; +00090 +00091 #endif /*MOEOSTOCHTOURNAMENTSELECT_H_ */ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoUnaryIndicatorBasedFitnessAssignment_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoUnaryIndicatorBasedFitnessAssignment_8h-source.html
new file mode 100644
index 000000000..9d26046f4
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoUnaryIndicatorBasedFitnessAssignment_8h-source.html
@@ -0,0 +1,49 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoUnaryIndicatorBasedFitnessAssignment.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOUNARYINDICATORBASEDFITNESSASSIGNMENT_H_ +00014 #define MOEOUNARYINDICATORBASEDFITNESSASSIGNMENT_H_ +00015 +00016 #include <fitness/moeoIndicatorBasedFitnessAssignment.h> +00017 +00021 template < class MOEOT > +00022 class moeoUnaryIndicatorBasedFitnessAssignment : public moeoIndicatorBasedFitnessAssignment < MOEOT > {}; +00023 +00024 #endif /*MOEOINDICATORBASEDFITNESSASSIGNMENT_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/moeoVector_8h-source.html b/trunk/paradiseo-moeo/doc/html/moeoVector_8h-source.html
new file mode 100644
index 000000000..241fd7163
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/moeoVector_8h-source.html
@@ -0,0 +1,134 @@
+
+
+00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- +00002 +00003 //----------------------------------------------------------------------------- +00004 // moeoVector.h +00005 // (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007 +00006 /* +00007 This library... +00008 +00009 Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr +00010 */ +00011 //----------------------------------------------------------------------------- +00012 +00013 #ifndef MOEOVECTOR_H_ +00014 #define MOEOVECTOR_H_ +00015 +00016 #include <iterator> +00017 #include <vector> +00018 #include <core/MOEO.h> +00019 +00024 template < class MOEOObjectiveVector, class MOEOFitness, class MOEODiversity, class GeneType > +00025 class moeoVector : public MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity >, public std::vector < GeneType > +00026 { +00027 public: +00028 +00029 using MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity > :: invalidate; +00030 using std::vector < GeneType > :: operator[]; +00031 using std::vector < GeneType > :: begin; +00032 using std::vector < GeneType > :: end; +00033 using std::vector < GeneType > :: resize; +00034 using std::vector < GeneType > :: size; +00035 +00037 typedef GeneType AtomType; +00039 typedef std::vector < GeneType > ContainerType; +00040 +00041 +00047 moeoVector(unsigned int _size = 0, GeneType _value = GeneType()) : +00048 MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity >(), std::vector<GeneType>(_size, _value) +00049 {} +00050 +00051 +00056 void value(const std::vector < GeneType > & _v) +00057 { +00058 if (_v.size() != size()) // safety check +00059 { +00060 if (size()) // NOT an initial empty std::vector +00061 { +00062 std::cout << "Warning: Changing size in moeoVector assignation"<<std::endl; +00063 resize(_v.size()); +00064 } +00065 else +00066 { +00067 throw std::runtime_error("Size not initialized in moeoVector"); +00068 } +00069 } +00070 std::copy(_v.begin(), _v.end(), begin()); +00071 invalidate(); +00072 } +00073 +00074 +00079 bool operator<(const moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType> & _moeo) const +00080 { +00081 return MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity >::operator<(_moeo); +00082 } +00083 +00084 +00089 virtual void printOn(std::ostream & _os) const +00090 { +00091 MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity >::printOn(_os); +00092 _os << ' '; +00093 _os << size() << ' '; +00094 std::copy(begin(), end(), std::ostream_iterator<AtomType>(_os, " ")); +00095 } +00096 +00097 +00102 virtual void readFrom(std::istream & _is) +00103 { +00104 MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity >::readFrom(_is); +00105 unsigned int sz; +00106 _is >> sz; +00107 resize(sz); +00108 unsigned int i; +00109 for (i = 0; i < sz; ++i) +00110 { +00111 AtomType atom; +00112 _is >> atom; +00113 operator[](i) = atom; +00114 } +00115 } +00116 +00117 }; +00118 +00119 +00125 template < class MOEOObjectiveVector, class MOEOFitness, class MOEODiversity, class GeneType > +00126 bool operator<(const moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType> & _moeo1, const moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType> & _moeo2) +00127 { +00128 return _moeo1.operator<(_moeo2); +00129 } +00130 +00131 +00137 template < class MOEOObjectiveVector, class MOEOFitness, class MOEODiversity, class GeneType > +00138 bool operator>(const moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType> & _moeo1, const moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType> & _moeo2) +00139 { +00140 return _moeo1.operator>(_moeo2); +00141 } +00142 +00143 #endif /*MOEOVECTOR_H_*/ +
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/pages.html b/trunk/paradiseo-moeo/doc/html/pages.html
new file mode 100644
index 000000000..587a516c0
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/pages.html
@@ -0,0 +1,33 @@
+
+
+ 1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/search.idx b/trunk/paradiseo-moeo/doc/html/search.idx
new file mode 100644
index 000000000..4927c4c6c
Binary files /dev/null and b/trunk/paradiseo-moeo/doc/html/search.idx differ
diff --git a/trunk/paradiseo-moeo/doc/html/search.php b/trunk/paradiseo-moeo/doc/html/search.php
new file mode 100644
index 000000000..fcb8efe46
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/search.php
@@ -0,0 +1,381 @@
+
+
+".search_results()." | \n";
+ echo " |
| ".matches_text(0)." | \n"; + echo "|
| ".matches_text($numDocs); + echo "\n"; + echo " | \n"; + echo "|
| $num. | "; + echo "".$doc["name"]." | \n"; + echo "
| ".report_matches()." "; + foreach ($doc["words"] as $wordInfo) + { + $word = $wordInfo["word"]; + $matchRight = substr($wordInfo["match"],strlen($word)); + echo "$word$matchRight(".$wordInfo["freq"].") "; + } + echo " | \n"; + echo "
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/html/tree.html b/trunk/paradiseo-moeo/doc/html/tree.html
new file mode 100644
index 000000000..69d9d5aff
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/html/tree.html
@@ -0,0 +1,495 @@
+
+
+
+
+
+
+ 
MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >
moeoAchievementFitnessAssignment< MOEOT >
moeoAdditiveEpsilonBinaryMetric< ObjectiveVector >
moeoAggregativeComparator< MOEOT >
moeoArchiveObjectiveVectorSavingUpdater< MOEOT >
moeoBinaryIndicatorBasedFitnessAssignment< MOEOT >
moeoBinaryMetricSavingUpdater< MOEOT >
moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >
moeoContributionMetric< ObjectiveVector >
moeoConvertPopToObjectiveVectors< MOEOT, ObjectiveVector >
moeoCriterionBasedFitnessAssignment< MOEOT >
moeoCrowdingDiversityAssignment< MOEOT >
moeoDetTournamentSelect< MOEOT >
moeoDistanceMatrix< MOEOT, Type >
moeoDiversityAssignment< MOEOT >
moeoDiversityThenFitnessComparator< MOEOT >
moeoDummyDiversityAssignment< MOEOT >
moeoDummyFitnessAssignment< MOEOT >
moeoEasyEA< MOEOT >::eoDummyEval
moeoEasyEA< MOEOT >::eoDummySelect
moeoEasyEA< MOEOT >::eoDummyTransform
moeoElitistReplacement< MOEOT >
moeoElitistReplacement< MOEOT >::Cmp
moeoEntropyMetric< ObjectiveVector >
moeoEnvironmentalReplacement< MOEOT >
moeoEnvironmentalReplacement< MOEOT >::Cmp
moeoEuclideanDistance< MOEOT >
moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >
moeoFastNonDominatedSortingFitnessAssignment< MOEOT >
moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator
moeoFitnessAssignment< MOEOT >
moeoFitnessThenDiversityComparator< MOEOT >
moeoFrontByFrontCrowdingDiversityAssignment< MOEOT >
moeoFrontByFrontSharingDiversityAssignment< MOEOT >
moeoGDominanceObjectiveVectorComparator< ObjectiveVector >
moeoGenerationalReplacement< MOEOT >
moeoHypervolumeBinaryMetric< ObjectiveVector >
moeoIndicatorBasedFitnessAssignment< MOEOT >
moeoManhattanDistance< MOEOT >
moeoNormalizedDistance< MOEOT, Type >
moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R >
moeoObjectiveObjectiveVectorComparator< ObjectiveVector >
moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType >
moeoObjectiveVectorComparator< ObjectiveVector >
moeoOneObjectiveComparator< MOEOT >
moeoParetoBasedFitnessAssignment< MOEOT >
moeoParetoObjectiveVectorComparator< ObjectiveVector >
moeoRealObjectiveVector< ObjectiveVectorTraits >
moeoRealVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >
moeoScalarFitnessAssignment< MOEOT >
moeoSelectFromPopAndArch< MOEOT >
moeoSharingDiversityAssignment< MOEOT >
moeoSolutionUnaryMetric< ObjectiveVector, R >
moeoSolutionVsSolutionBinaryMetric< ObjectiveVector, R >
moeoStochTournamentSelect< MOEOT >
moeoUnaryIndicatorBasedFitnessAssignment< MOEOT >
moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >
eoFunctorBase [external]
eoBF< A1, A2, R > [external]
eoReplacement< EOT > [external]
eoGenerationalReplacement< MOEOT > [external]
eoReplacement< MOEOT > [external]
eoSelect< MOEOT > [external]
moeoSolutionVsSolutionBinaryMetric< ObjectiveVector, R >
moeoSolutionVsSolutionBinaryMetric< ObjectiveVector, double >
moeoAggregativeComparator< MOEOT >
moeoDiversityThenFitnessComparator< MOEOT >
moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator
eoBF< const const ObjectiveVector &, ObjectiveVector &, double > [external]
eoBF< const const ObjectiveVector &, ObjectiveVector &, R > [external]
eoBF< const const std::vector< ObjectiveVector > &, std::vector< ObjectiveVector > &, double > [external]
eoBF< const const std::vector< ObjectiveVector > &, std::vector< ObjectiveVector > &, R > [external]
eoBF< Type, moeoArchive< MOEOT > &, void > [external]
eoF< void > [external]
eoUpdater [external]
eoUF< A1, R > [external]
eoAlgo< MOEOT > [external]
eoEvalFunc< MOEOT > [external]
eoSelectOne< EOT, WorthT > [external]
eoRandomSelect< MOEOT > [external]
eoSelectOne< MOEOT > [external]
eoTransform< MOEOT > [external]
eoUF< A, R > [external]
eoUF< const eoPop< MOEOT > &, void > [external]
eoUF< const ObjectiveVector &, R > [external]
eoUF< const std::vector< ObjectiveVector > &, R > [external]
eoUF< eoPop< MOEOT > &, void > [external]
moeoDiversityAssignment< MOEOT >
eoObject [external]
EO< MOEOObjectiveVector > [external]
eoPop< MOEOT > [external]
eoPrintable [external]
eoPersistent [external]
EO< MOEOObjectiveVector > [external]
eoPop< MOEOT > [external]
moeoElitistReplacement< MOEOT >::Cmp
moeoEnvironmentalReplacement< MOEOT >::Cmp
moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType >
index.h
make_checkpoint_moeo.h
make_continue_moeo.h
make_ea_moeo.h
MOEO.h
moeoAchievementFitnessAssignment.h
moeoAdditiveEpsilonBinaryMetric.h
moeoAggregativeComparator.h
moeoAlgo.h
moeoArchive.h
moeoArchiveObjectiveVectorSavingUpdater.h
moeoArchiveUpdater.h
moeoBinaryIndicatorBasedFitnessAssignment.h
moeoBinaryMetricSavingUpdater.h
moeoBitVector.h
moeoCombinedLS.h
moeoComparator.h
moeoContributionMetric.h
moeoConvertPopToObjectiveVectors.h
moeoCriterionBasedFitnessAssignment.h
moeoCrowdingDiversityAssignment.h
moeoDetTournamentSelect.h
moeoDistance.h
moeoDistanceMatrix.h
moeoDiversityAssignment.h
moeoDiversityThenFitnessComparator.h
moeoDummyDiversityAssignment.h
moeoDummyFitnessAssignment.h
moeoEA.h
moeoEasyEA.h
moeoElitistReplacement.h
moeoEntropyMetric.h
moeoEnvironmentalReplacement.h
moeoEuclideanDistance.h
moeoEvalFunc.h
moeoExpBinaryIndicatorBasedFitnessAssignment.h
moeoFastNonDominatedSortingFitnessAssignment.h
moeoFitnessAssignment.h
moeoFitnessThenDiversityComparator.h
moeoFrontByFrontCrowdingDiversityAssignment.h
moeoFrontByFrontSharingDiversityAssignment.h
moeoGDominanceObjectiveVectorComparator.h
moeoGenerationalReplacement.h
moeoHybridLS.h
moeoHypervolumeBinaryMetric.h
moeoIBEA.h
moeoIndicatorBasedFitnessAssignment.h
moeoLS.h
moeoManhattanDistance.h
moeoMetric.h
moeoNormalizedDistance.h
moeoNormalizedSolutionVsSolutionBinaryMetric.h
moeoNSGA.h
moeoNSGAII.h
moeoObjectiveObjectiveVectorComparator.h
moeoObjectiveVector.h
moeoObjectiveVectorComparator.h
moeoObjectiveVectorTraits.cpp
moeoObjectiveVectorTraits.h
moeoOneObjectiveComparator.h
moeoParetoBasedFitnessAssignment.h
moeoParetoObjectiveVectorComparator.h
moeoRandomSelect.h
moeoRealObjectiveVector.h
moeoRealVector.h
moeoReplacement.h
moeoRouletteSelect.h
moeoScalarFitnessAssignment.h
moeoSelectFromPopAndArch.h
moeoSelectOne.h
moeoSelectors.h
moeoSharingDiversityAssignment.h
moeoStochTournamentSelect.h
moeoUnaryIndicatorBasedFitnessAssignment.h
moeoVector.h
1.4.7
+
+
diff --git a/trunk/paradiseo-moeo/doc/latex/annotated.tex b/trunk/paradiseo-moeo/doc/latex/annotated.tex
new file mode 100644
index 000000000..72ddd57a4
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/latex/annotated.tex
@@ -0,0 +1,84 @@
+\section{Paradis\-EO-MOEO Class List}
+Here are the classes, structs, unions and interfaces with brief descriptions:\begin{CompactList}
+\item\contentsline{section}{\bf{MOEO$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$} (Base class allowing to represent a solution (an individual) for multi-objective optimization )}{\pageref{classMOEO}}{}
+\item\contentsline{section}{\bf{moeo\-Achievement\-Fitness\-Assignment$<$ MOEOT $>$} (Fitness assignment sheme based on the achievement scalarizing function propozed by Wiersbicki (1980) )}{\pageref{classmoeoAchievementFitnessAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-Additive\-Epsilon\-Binary\-Metric$<$ Objective\-Vector $>$} (Additive epsilon binary metric allowing to compare two objective vectors as proposed in Zitzler E., Thiele L., Laumanns M., Fonseca C )}{\pageref{classmoeoAdditiveEpsilonBinaryMetric}}{}
+\item\contentsline{section}{\bf{moeo\-Aggregative\-Comparator$<$ MOEOT $>$} (Functor allowing to compare two solutions according to their fitness and diversity values, each according to its aggregative value )}{\pageref{classmoeoAggregativeComparator}}{}
+\item\contentsline{section}{\bf{moeo\-Algo} (Abstract class for multi-objective algorithms )}{\pageref{classmoeoAlgo}}{}
+\item\contentsline{section}{\bf{moeo\-Archive$<$ MOEOT $>$} (An archive is a secondary population that stores non-dominated solutions )}{\pageref{classmoeoArchive}}{}
+\item\contentsline{section}{\bf{moeo\-Archive\-Objective\-Vector\-Saving\-Updater$<$ MOEOT $>$} (This class allows to save the objective vectors of the solutions contained in an archive into a file at each generation )}{\pageref{classmoeoArchiveObjectiveVectorSavingUpdater}}{}
+\item\contentsline{section}{\bf{moeo\-Archive\-Updater$<$ MOEOT $>$} (This class allows to update the archive at each generation with newly found non-dominated solutions )}{\pageref{classmoeoArchiveUpdater}}{}
+\item\contentsline{section}{\bf{moeo\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$} (Moeo\-Indicator\-Based\-Fitness\-Assignment for binary indicators )}{\pageref{classmoeoBinaryIndicatorBasedFitnessAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-Binary\-Metric$<$ A1, A2, R $>$} (Base class for binary metrics )}{\pageref{classmoeoBinaryMetric}}{}
+\item\contentsline{section}{\bf{moeo\-Binary\-Metric\-Saving\-Updater$<$ MOEOT $>$} (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 )}{\pageref{classmoeoBinaryMetricSavingUpdater}}{}
+\item\contentsline{section}{\bf{moeo\-Bit\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$} (This class is an implementationeo of a simple bit-valued \doxyref{moeo\-Vector}{p.}{classmoeoVector} )}{\pageref{classmoeoBitVector}}{}
+\item\contentsline{section}{\bf{moeo\-Combined\-LS$<$ MOEOT, Type $>$} (This class allows to embed a set of local searches that are sequentially applied, and so working and updating the same archive of non-dominated solutions )}{\pageref{classmoeoCombinedLS}}{}
+\item\contentsline{section}{\bf{moeo\-Comparator$<$ MOEOT $>$} (Functor allowing to compare two solutions )}{\pageref{classmoeoComparator}}{}
+\item\contentsline{section}{\bf{moeo\-Contribution\-Metric$<$ Objective\-Vector $>$} (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 )}{\pageref{classmoeoContributionMetric}}{}
+\item\contentsline{section}{\bf{moeo\-Convert\-Pop\-To\-Objective\-Vectors$<$ MOEOT, Objective\-Vector $>$} (Functor allowing to get a vector of objective vectors from a population )}{\pageref{classmoeoConvertPopToObjectiveVectors}}{}
+\item\contentsline{section}{\bf{moeo\-Criterion\-Based\-Fitness\-Assignment$<$ MOEOT $>$} (Moeo\-Criterion\-Based\-Fitness\-Assignment is a \doxyref{moeo\-Fitness\-Assignment}{p.}{classmoeoFitnessAssignment} for criterion-based strategies )}{\pageref{classmoeoCriterionBasedFitnessAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-Crowding\-Diversity\-Assignment$<$ MOEOT $>$} (Diversity assignment sheme based on crowding proposed in: K )}{\pageref{classmoeoCrowdingDiversityAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-Det\-Tournament\-Select$<$ MOEOT $>$} (Selection strategy that selects ONE individual by deterministic tournament )}{\pageref{classmoeoDetTournamentSelect}}{}
+\item\contentsline{section}{\bf{moeo\-Distance$<$ MOEOT, Type $>$} (The base class for distance computation )}{\pageref{classmoeoDistance}}{}
+\item\contentsline{section}{\bf{moeo\-Distance\-Matrix$<$ MOEOT, Type $>$} (A matrix to compute distances between every pair of individuals contained in a population )}{\pageref{classmoeoDistanceMatrix}}{}
+\item\contentsline{section}{\bf{moeo\-Diversity\-Assignment$<$ MOEOT $>$} (Functor that sets the diversity values of a whole population )}{\pageref{classmoeoDiversityAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-Diversity\-Then\-Fitness\-Comparator$<$ MOEOT $>$} (Functor allowing to compare two solutions according to their diversity values, then according to their fitness values )}{\pageref{classmoeoDiversityThenFitnessComparator}}{}
+\item\contentsline{section}{\bf{moeo\-Dummy\-Diversity\-Assignment$<$ MOEOT $>$} (Moeo\-Dummy\-Diversity\-Assignment is a \doxyref{moeo\-Diversity\-Assignment}{p.}{classmoeoDiversityAssignment} that gives the value '0' as the individual's diversity for a whole population if it is invalid )}{\pageref{classmoeoDummyDiversityAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-Dummy\-Fitness\-Assignment$<$ MOEOT $>$} (Moeo\-Dummy\-Fitness\-Assignment is a \doxyref{moeo\-Fitness\-Assignment}{p.}{classmoeoFitnessAssignment} that gives the value '0' as the individual's fitness for a whole population if it is invalid )}{\pageref{classmoeoDummyFitnessAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-EA$<$ MOEOT $>$} (Abstract class for multi-objective evolutionary algorithms )}{\pageref{classmoeoEA}}{}
+\item\contentsline{section}{\bf{moeo\-Easy\-EA$<$ MOEOT $>$} (An easy class to design multi-objective evolutionary algorithms )}{\pageref{classmoeoEasyEA}}{}
+\item\contentsline{section}{\bf{moeo\-Easy\-EA$<$ MOEOT $>$::eo\-Dummy\-Eval} (\doxyref{Dummy} eval )}{\pageref{classmoeoEasyEA_1_1eoDummyEval}}{}
+\item\contentsline{section}{\bf{moeo\-Easy\-EA$<$ MOEOT $>$::eo\-Dummy\-Select} (\doxyref{Dummy} select )}{\pageref{classmoeoEasyEA_1_1eoDummySelect}}{}
+\item\contentsline{section}{\bf{moeo\-Easy\-EA$<$ MOEOT $>$::eo\-Dummy\-Transform} (\doxyref{Dummy} transform )}{\pageref{classmoeoEasyEA_1_1eoDummyTransform}}{}
+\item\contentsline{section}{\bf{moeo\-Elitist\-Replacement$<$ MOEOT $>$} (Elitist replacement strategy that consists in keeping the N best individuals )}{\pageref{classmoeoElitistReplacement}}{}
+\item\contentsline{section}{\bf{moeo\-Elitist\-Replacement$<$ MOEOT $>$::Cmp} (This object is used to compare solutions in order to sort the population )}{\pageref{classmoeoElitistReplacement_1_1Cmp}}{}
+\item\contentsline{section}{\bf{moeo\-Entropy\-Metric$<$ Objective\-Vector $>$} (The entropy gives an idea of the diversity of a Pareto set relatively to another (Basseur, Seynhaeve, Talbi: 'Design of Multi-objective Evolutionary Algorithms: Application to the Flow-shop Scheduling Problem', in Proc )}{\pageref{classmoeoEntropyMetric}}{}
+\item\contentsline{section}{\bf{moeo\-Environmental\-Replacement$<$ MOEOT $>$} (Environmental replacement strategy that consists in keeping the N best individuals by deleting individuals 1 by 1 and by updating the fitness and diversity values after each deletion )}{\pageref{classmoeoEnvironmentalReplacement}}{}
+\item\contentsline{section}{\bf{moeo\-Environmental\-Replacement$<$ MOEOT $>$::Cmp} (This object is used to compare solutions in order to sort the population )}{\pageref{classmoeoEnvironmentalReplacement_1_1Cmp}}{}
+\item\contentsline{section}{\bf{moeo\-Euclidean\-Distance$<$ MOEOT $>$} (A class allowing to compute an euclidian distance between two solutions in the objective space with normalized objective values (i.e )}{\pageref{classmoeoEuclideanDistance}}{}
+\item\contentsline{section}{\bf{moeo\-Eval\-Func$<$ MOEOT $>$} }{\pageref{classmoeoEvalFunc}}{}
+\item\contentsline{section}{\bf{moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$} (Fitness assignment sheme based on an indicator proposed in: E )}{\pageref{classmoeoExpBinaryIndicatorBasedFitnessAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment$<$ MOEOT $>$} (Fitness assignment sheme based on Pareto-dominance count proposed in: N )}{\pageref{classmoeoFastNonDominatedSortingFitnessAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment$<$ MOEOT $>$::Objective\-Comparator} (Functor allowing to compare two solutions according to their first objective value, then their second, and so on )}{\pageref{classmoeoFastNonDominatedSortingFitnessAssignment_1_1ObjectiveComparator}}{}
+\item\contentsline{section}{\bf{moeo\-Fitness\-Assignment$<$ MOEOT $>$} (Functor that sets the fitness values of a whole population )}{\pageref{classmoeoFitnessAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-Fitness\-Then\-Diversity\-Comparator$<$ MOEOT $>$} (Functor allowing to compare two solutions according to their fitness values, then according to their diversity values )}{\pageref{classmoeoFitnessThenDiversityComparator}}{}
+\item\contentsline{section}{\bf{moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment$<$ MOEOT $>$} (Diversity assignment sheme based on crowding proposed in: K )}{\pageref{classmoeoFrontByFrontCrowdingDiversityAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$} (Sharing assignment scheme on the way it is used in NSGA )}{\pageref{classmoeoFrontByFrontSharingDiversityAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-GDominance\-Objective\-Vector\-Comparator$<$ Objective\-Vector $>$} (This functor class allows to compare 2 objective vectors according to g-dominance )}{\pageref{classmoeoGDominanceObjectiveVectorComparator}}{}
+\item\contentsline{section}{\bf{moeo\-Generational\-Replacement$<$ MOEOT $>$} (Generational replacement: only the new individuals are preserved )}{\pageref{classmoeoGenerationalReplacement}}{}
+\item\contentsline{section}{\bf{moeo\-Hybrid\-LS$<$ MOEOT $>$} (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 )}{\pageref{classmoeoHybridLS}}{}
+\item\contentsline{section}{\bf{moeo\-Hypervolume\-Binary\-Metric$<$ Objective\-Vector $>$} (Hypervolume binary metric allowing to compare two objective vectors as proposed in Zitzler E., K\~{A}¼nzli S )}{\pageref{classmoeoHypervolumeBinaryMetric}}{}
+\item\contentsline{section}{\bf{moeo\-IBEA$<$ MOEOT $>$} (IBEA (Indicator-Based Evolutionary Algorithm) as described in: E )}{\pageref{classmoeoIBEA}}{}
+\item\contentsline{section}{\bf{moeo\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$} (Moeo\-Indicator\-Based\-Fitness\-Assignment is a \doxyref{moeo\-Fitness\-Assignment}{p.}{classmoeoFitnessAssignment} for Indicator-based strategies )}{\pageref{classmoeoIndicatorBasedFitnessAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-LS$<$ MOEOT, Type $>$} (Abstract class for local searches applied to multi-objective optimization )}{\pageref{classmoeoLS}}{}
+\item\contentsline{section}{\bf{moeo\-Manhattan\-Distance$<$ MOEOT $>$} (A class allowing to compute the Manhattan distance between two solutions in the objective space normalized objective values (i.e )}{\pageref{classmoeoManhattanDistance}}{}
+\item\contentsline{section}{\bf{moeo\-Metric} (Base class for performance metrics (also known as quality indicators) )}{\pageref{classmoeoMetric}}{}
+\item\contentsline{section}{\bf{moeo\-Normalized\-Distance$<$ MOEOT, Type $>$} (The base class for double distance computation with normalized objective values (i.e )}{\pageref{classmoeoNormalizedDistance}}{}
+\item\contentsline{section}{\bf{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric$<$ Objective\-Vector, R $>$} (Base class for binary metrics dedicated to the performance comparison between two solutions's objective vectors using normalized values )}{\pageref{classmoeoNormalizedSolutionVsSolutionBinaryMetric}}{}
+\item\contentsline{section}{\bf{moeo\-NSGA$<$ MOEOT $>$} (NSGA (Non-dominated Sorting Genetic Algorithm) as described in: N )}{\pageref{classmoeoNSGA}}{}
+\item\contentsline{section}{\bf{moeo\-NSGAII$<$ MOEOT $>$} (NSGA-II (Non-dominated Sorting Genetic Algorithm II) as described in: Deb, K., S )}{\pageref{classmoeoNSGAII}}{}
+\item\contentsline{section}{\bf{moeo\-Objective\-Objective\-Vector\-Comparator$<$ Objective\-Vector $>$} (Functor allowing to compare two objective vectors according to their first objective value, then their second, and so on )}{\pageref{classmoeoObjectiveObjectiveVectorComparator}}{}
+\item\contentsline{section}{\bf{moeo\-Objective\-Vector$<$ Objective\-Vector\-Traits, Objective\-Vector\-Type $>$} (Abstract class allowing to represent a solution in the objective space (phenotypic representation) )}{\pageref{classmoeoObjectiveVector}}{}
+\item\contentsline{section}{\bf{moeo\-Objective\-Vector\-Comparator$<$ Objective\-Vector $>$} (Abstract class allowing to compare 2 objective vectors )}{\pageref{classmoeoObjectiveVectorComparator}}{}
+\item\contentsline{section}{\bf{moeo\-Objective\-Vector\-Traits} (A traits class for \doxyref{moeo\-Objective\-Vector}{p.}{classmoeoObjectiveVector} to specify the number of objectives and which ones have to be minimized or maximized )}{\pageref{classmoeoObjectiveVectorTraits}}{}
+\item\contentsline{section}{\bf{moeo\-One\-Objective\-Comparator$<$ MOEOT $>$} (Functor allowing to compare two solutions according to one objective )}{\pageref{classmoeoOneObjectiveComparator}}{}
+\item\contentsline{section}{\bf{moeo\-Pareto\-Based\-Fitness\-Assignment$<$ MOEOT $>$} (Moeo\-Pareto\-Based\-Fitness\-Assignment is a \doxyref{moeo\-Fitness\-Assignment}{p.}{classmoeoFitnessAssignment} for Pareto-based strategies )}{\pageref{classmoeoParetoBasedFitnessAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-Pareto\-Objective\-Vector\-Comparator$<$ Objective\-Vector $>$} (This functor class allows to compare 2 objective vectors according to Pareto dominance )}{\pageref{classmoeoParetoObjectiveVectorComparator}}{}
+\item\contentsline{section}{\bf{moeo\-Random\-Select$<$ MOEOT $>$} (Selection strategy that selects only one element randomly from a whole population )}{\pageref{classmoeoRandomSelect}}{}
+\item\contentsline{section}{\bf{moeo\-Real\-Objective\-Vector$<$ Objective\-Vector\-Traits $>$} (This class allows to represent a solution in the objective space (phenotypic representation) by a std::vector of real values, i.e )}{\pageref{classmoeoRealObjectiveVector}}{}
+\item\contentsline{section}{\bf{moeo\-Real\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$} (This class is an implementation of a simple double-valued \doxyref{moeo\-Vector}{p.}{classmoeoVector} )}{\pageref{classmoeoRealVector}}{}
+\item\contentsline{section}{\bf{moeo\-Replacement$<$ MOEOT $>$} (Replacement strategy for multi-objective optimization )}{\pageref{classmoeoReplacement}}{}
+\item\contentsline{section}{\bf{moeo\-Roulette\-Select$<$ MOEOT $>$} (Selection strategy that selects ONE individual by using roulette wheel process )}{\pageref{classmoeoRouletteSelect}}{}
+\item\contentsline{section}{\bf{moeo\-Scalar\-Fitness\-Assignment$<$ MOEOT $>$} (Moeo\-Scalar\-Fitness\-Assignment is a \doxyref{moeo\-Fitness\-Assignment}{p.}{classmoeoFitnessAssignment} for scalar strategies )}{\pageref{classmoeoScalarFitnessAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-Select\-From\-Pop\-And\-Arch$<$ MOEOT $>$} (Elitist selection process that consists in choosing individuals in the archive as well as in the current population )}{\pageref{classmoeoSelectFromPopAndArch}}{}
+\item\contentsline{section}{\bf{moeo\-Select\-One$<$ MOEOT $>$} (Selection strategy for multi-objective optimization that selects only one element from a whole population )}{\pageref{classmoeoSelectOne}}{}
+\item\contentsline{section}{\bf{moeo\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$} (Sharing assignment scheme originally porposed by: D )}{\pageref{classmoeoSharingDiversityAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-Solution\-Unary\-Metric$<$ Objective\-Vector, R $>$} (Base class for unary metrics dedicated to the performance evaluation of a single solution's objective vector )}{\pageref{classmoeoSolutionUnaryMetric}}{}
+\item\contentsline{section}{\bf{moeo\-Solution\-Vs\-Solution\-Binary\-Metric$<$ Objective\-Vector, R $>$} (Base class for binary metrics dedicated to the performance comparison between two solutions's objective vectors )}{\pageref{classmoeoSolutionVsSolutionBinaryMetric}}{}
+\item\contentsline{section}{\bf{moeo\-Stoch\-Tournament\-Select$<$ MOEOT $>$} (Selection strategy that selects ONE individual by stochastic tournament )}{\pageref{classmoeoStochTournamentSelect}}{}
+\item\contentsline{section}{\bf{moeo\-Unary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$} (Moeo\-Indicator\-Based\-Fitness\-Assignment for unary indicators )}{\pageref{classmoeoUnaryIndicatorBasedFitnessAssignment}}{}
+\item\contentsline{section}{\bf{moeo\-Unary\-Metric$<$ A, R $>$} (Base class for unary metrics )}{\pageref{classmoeoUnaryMetric}}{}
+\item\contentsline{section}{\bf{moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, Gene\-Type $>$} (Base class for fixed length chromosomes, just derives from \doxyref{MOEO}{p.}{classMOEO} and std::vector and redirects the smaller than operator to MOEO (objective vector based comparison) )}{\pageref{classmoeoVector}}{}
+\item\contentsline{section}{\bf{moeo\-Vector\-Unary\-Metric$<$ Objective\-Vector, R $>$} (Base class for unary metrics dedicated to the performance evaluation of a Pareto set (a vector of objective vectors) )}{\pageref{classmoeoVectorUnaryMetric}}{}
+\item\contentsline{section}{\bf{moeo\-Vector\-Vs\-Vector\-Binary\-Metric$<$ Objective\-Vector, R $>$} (Base class for binary metrics dedicated to the performance comparison between two Pareto sets (two vectors of objective vectors) )}{\pageref{classmoeoVectorVsVectorBinaryMetric}}{}
+\end{CompactList}
diff --git a/trunk/paradiseo-moeo/doc/latex/classmoeoAlgo.eps b/trunk/paradiseo-moeo/doc/latex/classmoeoAlgo.eps
new file mode 100644
index 000000000..a43467b12
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/latex/classmoeoAlgo.eps
@@ -0,0 +1,229 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For:
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 52.6316
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 9.5 def % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 5 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+ /a exch def
+ /b exch def
+ a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+ 0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+ /str exch def
+ /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+ 2 setlinewidth
+ newpath
+ exch xspacing mul xoffset add
+ exch yspacing mul
+ moveto
+ boxwidth 0 rlineto
+ 0 boxheight rlineto
+ boxwidth neg 0 rlineto
+ 0 boxheight neg rlineto
+ closepath
+ dup stringwidth pop neg boxwidth add 2 div
+ boxheight fontheight 2 div sub 2 div
+ rmoveto show stroke
+ grestore
+} def
+
+/mark
+{ newpath
+ exch xspacing mul xoffset add boxwidth add
+ exch yspacing mul
+ moveto
+ 0 boxheight 4 div rlineto
+ boxheight neg 4 div boxheight neg 4 div rlineto
+ closepath
+ eofill
+ stroke
+} def
+
+/arrow
+{ newpath
+ moveto
+ 3 -8 rlineto
+ -6 0 rlineto
+ 3 8 rlineto
+ closepath
+ eofill
+ stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+ newpath
+ exch xspacing mul xoffset add boxwidth 2 div add
+ exch yspacing mul boxheight add
+ /y exch def
+ /x exch def
+ x y moveto
+ 0 disty 2 div rlineto
+ stroke
+ 1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+ newpath
+ exch xspacing mul xoffset add boxwidth 2 div add
+ exch yspacing mul disty 2 div sub
+ /y exch def
+ /x exch def
+ x y moveto
+ 0 disty 2 div rlineto
+ stroke
+ 1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+ exch xspacing mul xoffset add boxwidth 2 div add
+ exch yspacing mul boxheight 2 div sub
+ /y exch def
+ /x exch def
+ newpath
+ x y moveto
+ boxwidth 2 div distx add 0 rlineto
+ stroke
+ 1 eq
+ { newpath x boxwidth 2 div distx add add y moveto
+ -8 3 rlineto
+ 0 -6 rlineto
+ 8 3 rlineto
+ closepath
+ eofill
+ stroke
+ } if
+} def
+
+/vedge
+{
+ /ye exch def
+ /ys exch def
+ /xs exch def
+ newpath
+ xs xspacing mul xoffset add boxwidth 2 div add dup
+ ys yspacing mul boxheight 2 div sub
+ moveto
+ ye yspacing mul boxheight 2 div sub
+ lineto
+ stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+ /ys exch def
+ /xe exch def
+ /xs exch def
+ newpath
+ xs xspacing mul xoffset add boxwidth 2 div add
+ ys yspacing mul disty 2 div sub
+ moveto
+ xspacing xe xs sub mul 0
+ rlineto
+ stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(moeoAlgo) cw
+(moeoEA< MOEOT >) cw
+(moeoLS< MOEOT, Type >) cw
+(moeoEasyEA< MOEOT >) cw
+(moeoIBEA< MOEOT >) cw
+(moeoNSGA< MOEOT >) cw
+(moeoNSGAII< MOEOT >) cw
+(moeoCombinedLS< MOEOT, Type >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor
+ boxwidth cols mul distx cols 1 sub mul add
+ boxheight rows mul disty rows 1 sub mul add boundaspect mul
+ max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (moeoAlgo) 2.75 2 box
+ (moeoEA< MOEOT >) 1.5 1 box
+ (moeoLS< MOEOT, Type >) 4 1 box
+ (moeoEasyEA< MOEOT >) 0 0 box
+ (moeoIBEA< MOEOT >) 1 0 box
+ (moeoNSGA< MOEOT >) 2 0 box
+ (moeoNSGAII< MOEOT >) 3 0 box
+ (moeoCombinedLS< MOEOT, Type >) 4 0 box
+
+% ----- relations -----
+
+solid
+1 2.75 1.25 out
+solid
+1.5 4 2 conn
+solid
+0 1.5 1.75 in
+solid
+1 1.5 0.25 out
+solid
+0 3 1 conn
+solid
+0 4 1.75 in
+solid
+1 4 0.25 out
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
+solid
+0 3 0.75 in
+solid
+0 4 0.75 in
diff --git a/trunk/paradiseo-moeo/doc/latex/classmoeoAlgo.tex b/trunk/paradiseo-moeo/doc/latex/classmoeoAlgo.tex
new file mode 100644
index 000000000..528bd7d40
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/latex/classmoeoAlgo.tex
@@ -0,0 +1,25 @@
+\section{moeo\-Algo Class Reference}
+\label{classmoeoAlgo}\index{moeoAlgo@{moeoAlgo}}
+Abstract class for multi-objective algorithms.
+
+
+{\tt \#include $<$moeo\-Algo.h$>$}
+
+Inheritance diagram for moeo\-Algo::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.47368cm]{classmoeoAlgo}
+\end{center}
+\end{figure}
+
+
+\subsection{Detailed Description}
+Abstract class for multi-objective algorithms.
+
+
+
+Definition at line 19 of file moeo\-Algo.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item
+moeo\-Algo.h\end{CompactItemize}
diff --git a/trunk/paradiseo-moeo/doc/latex/classmoeoArchive.tex b/trunk/paradiseo-moeo/doc/latex/classmoeoArchive.tex
new file mode 100644
index 000000000..56265b135
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/latex/classmoeoArchive.tex
@@ -0,0 +1,170 @@
+\section{moeo\-Archive$<$ MOEOT $>$ Class Template Reference}
+\label{classmoeoArchive}\index{moeoArchive@{moeoArchive}}
+An archive is a secondary population that stores non-dominated solutions.
+
+
+{\tt \#include $<$moeo\-Archive.h$>$}
+
+Inheritance diagram for moeo\-Archive$<$ MOEOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classmoeoArchive}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item
+typedef MOEOT::Objective\-Vector \bf{Objective\-Vector}\label{classmoeoArchive_655f6879b14d7b4e65ea03724e5ee601}
+
+\begin{CompactList}\small\item\em The type of an objective vector for a solution. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item
+\bf{moeo\-Archive} ()
+\begin{CompactList}\small\item\em Default ctor. \item\end{CompactList}\item
+\bf{moeo\-Archive} (\bf{moeo\-Objective\-Vector\-Comparator}$<$ \bf{Objective\-Vector} $>$ \&\_\-comparator)
+\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item
+bool \bf{dominates} (const \bf{Objective\-Vector} \&\_\-objective\-Vector) const
+\begin{CompactList}\small\item\em Returns true if the current archive dominates \_\-objective\-Vector according to the \doxyref{moeo\-Objective\-Vector\-Comparator}{p.}{classmoeoObjectiveVectorComparator} given in the constructor. \item\end{CompactList}\item
+bool \bf{contains} (const \bf{Objective\-Vector} \&\_\-objective\-Vector) const
+\begin{CompactList}\small\item\em Returns true if the current archive already contains a solution with the same objective values than \_\-objective\-Vector. \item\end{CompactList}\item
+void \bf{update} (const MOEOT \&\_\-moeo)
+\begin{CompactList}\small\item\em Updates the archive with a given individual \_\-moeo. \item\end{CompactList}\item
+void \bf{update} (const \bf{eo\-Pop}$<$ MOEOT $>$ \&\_\-pop)
+\begin{CompactList}\small\item\em Updates the archive with a given population \_\-pop. \item\end{CompactList}\item
+bool \bf{equals} (const \bf{moeo\-Archive}$<$ MOEOT $>$ \&\_\-arch)
+\begin{CompactList}\small\item\em Returns true if the current archive contains the same objective vectors than the given archive \_\-arch. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item
+\bf{moeo\-Objective\-Vector\-Comparator}$<$ \bf{Objective\-Vector} $>$ \& \bf{comparator}\label{classmoeoArchive_59d96d161a53b3ee50df8ca5ad0d0642}
+
+\begin{CompactList}\small\item\em The \doxyref{moeo\-Objective\-Vector\-Comparator}{p.}{classmoeoObjectiveVectorComparator} used to compare solutions. \item\end{CompactList}\item
+\bf{moeo\-Pareto\-Objective\-Vector\-Comparator}$<$ \bf{Objective\-Vector} $>$ \bf{pareto\-Comparator}\label{classmoeoArchive_eefd5b82b1d7f7d60c72683da9cd8682}
+
+\begin{CompactList}\small\item\em A \doxyref{moeo\-Objective\-Vector\-Comparator}{p.}{classmoeoObjectiveVectorComparator} based on Pareto dominance (used as default). \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class MOEOT$>$ class moeo\-Archive$<$ MOEOT $>$}
+
+An archive is a secondary population that stores non-dominated solutions.
+
+
+
+Definition at line 24 of file moeo\-Archive.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{moeoArchive@{moeo\-Archive}!moeoArchive@{moeoArchive}}
+\index{moeoArchive@{moeoArchive}!moeoArchive@{moeo\-Archive}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Archive}$<$ MOEOT $>$::\bf{moeo\-Archive} ()\hspace{0.3cm}{\tt [inline]}}\label{classmoeoArchive_a593ca2122484d255b5aa5a0463bd913}
+
+
+Default ctor.
+
+The \doxyref{moeo\-Objective\-Vector\-Comparator}{p.}{classmoeoObjectiveVectorComparator} used to compare solutions is based on Pareto dominance
+
+Definition at line 44 of file moeo\-Archive.h.\index{moeoArchive@{moeo\-Archive}!moeoArchive@{moeoArchive}}
+\index{moeoArchive@{moeoArchive}!moeoArchive@{moeo\-Archive}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Archive}$<$ MOEOT $>$::\bf{moeo\-Archive} (\bf{moeo\-Objective\-Vector\-Comparator}$<$ \bf{Objective\-Vector} $>$ \& {\em \_\-comparator})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoArchive_75e5fee339ca463405434f6f48497de0}
+
+
+Ctor.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-comparator}]the \doxyref{moeo\-Objective\-Vector\-Comparator}{p.}{classmoeoObjectiveVectorComparator} used to compare solutions \end{description}
+\end{Desc}
+
+
+Definition at line 52 of file moeo\-Archive.h.
+
+\subsection{Member Function Documentation}
+\index{moeoArchive@{moeo\-Archive}!dominates@{dominates}}
+\index{dominates@{dominates}!moeoArchive@{moeo\-Archive}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ bool \bf{moeo\-Archive}$<$ MOEOT $>$::dominates (const \bf{Objective\-Vector} \& {\em \_\-objective\-Vector}) const\hspace{0.3cm}{\tt [inline]}}\label{classmoeoArchive_67f667e822e0485c6976c6ee0d18f70a}
+
+
+Returns true if the current archive dominates \_\-objective\-Vector according to the \doxyref{moeo\-Objective\-Vector\-Comparator}{p.}{classmoeoObjectiveVectorComparator} given in the constructor.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-objective\-Vector}]the objective vector to compare with the current archive \end{description}
+\end{Desc}
+
+
+Definition at line 60 of file moeo\-Archive.h.
+
+References moeo\-Archive$<$ MOEOT $>$::comparator.\index{moeoArchive@{moeo\-Archive}!contains@{contains}}
+\index{contains@{contains}!moeoArchive@{moeo\-Archive}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ bool \bf{moeo\-Archive}$<$ MOEOT $>$::contains (const \bf{Objective\-Vector} \& {\em \_\-objective\-Vector}) const\hspace{0.3cm}{\tt [inline]}}\label{classmoeoArchive_748d5c75d713075288257192be1986a9}
+
+
+Returns true if the current archive already contains a solution with the same objective values than \_\-objective\-Vector.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-objective\-Vector}]the objective vector to compare with the current archive \end{description}
+\end{Desc}
+
+
+Definition at line 78 of file moeo\-Archive.h.
+
+Referenced by moeo\-Archive$<$ MOEOT $>$::equals().\index{moeoArchive@{moeo\-Archive}!update@{update}}
+\index{update@{update}!moeoArchive@{moeo\-Archive}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ void \bf{moeo\-Archive}$<$ MOEOT $>$::update (const MOEOT \& {\em \_\-moeo})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoArchive_6df0acd84cab4cb53682f2e6ca850e9a}
+
+
+Updates the archive with a given individual \_\-moeo.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-moeo}]the given individual \end{description}
+\end{Desc}
+
+
+Definition at line 95 of file moeo\-Archive.h.
+
+References moeo\-Archive$<$ MOEOT $>$::comparator.
+
+Referenced by moeo\-Archive$<$ MOEOT $>$::update().\index{moeoArchive@{moeo\-Archive}!update@{update}}
+\index{update@{update}!moeoArchive@{moeo\-Archive}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ void \bf{moeo\-Archive}$<$ MOEOT $>$::update (const \bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoArchive_877bf4f0937f6be263e2686df4e77cf3}
+
+
+Updates the archive with a given population \_\-pop.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-pop}]the given population \end{description}
+\end{Desc}
+
+
+Definition at line 138 of file moeo\-Archive.h.
+
+References moeo\-Archive$<$ MOEOT $>$::update().\index{moeoArchive@{moeo\-Archive}!equals@{equals}}
+\index{equals@{equals}!moeoArchive@{moeo\-Archive}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ bool \bf{moeo\-Archive}$<$ MOEOT $>$::equals (const \bf{moeo\-Archive}$<$ MOEOT $>$ \& {\em \_\-arch})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoArchive_937088a6054ba1b50db651f50dda3a72}
+
+
+Returns true if the current archive contains the same objective vectors than the given archive \_\-arch.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-arch}]the given archive \end{description}
+\end{Desc}
+
+
+Definition at line 151 of file moeo\-Archive.h.
+
+References moeo\-Archive$<$ MOEOT $>$::contains().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item
+moeo\-Archive.h\end{CompactItemize}
diff --git a/trunk/paradiseo-moeo/doc/latex/classmoeoFitnessAssignment.eps b/trunk/paradiseo-moeo/doc/latex/classmoeoFitnessAssignment.eps
new file mode 100644
index 000000000..3756f7262
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/latex/classmoeoFitnessAssignment.eps
@@ -0,0 +1,257 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For:
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 54.0541
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 9.25 def % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 6 def
+/cols 6 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+ /a exch def
+ /b exch def
+ a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+ 0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+ /str exch def
+ /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+ 2 setlinewidth
+ newpath
+ exch xspacing mul xoffset add
+ exch yspacing mul
+ moveto
+ boxwidth 0 rlineto
+ 0 boxheight rlineto
+ boxwidth neg 0 rlineto
+ 0 boxheight neg rlineto
+ closepath
+ dup stringwidth pop neg boxwidth add 2 div
+ boxheight fontheight 2 div sub 2 div
+ rmoveto show stroke
+ grestore
+} def
+
+/mark
+{ newpath
+ exch xspacing mul xoffset add boxwidth add
+ exch yspacing mul
+ moveto
+ 0 boxheight 4 div rlineto
+ boxheight neg 4 div boxheight neg 4 div rlineto
+ closepath
+ eofill
+ stroke
+} def
+
+/arrow
+{ newpath
+ moveto
+ 3 -8 rlineto
+ -6 0 rlineto
+ 3 8 rlineto
+ closepath
+ eofill
+ stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+ newpath
+ exch xspacing mul xoffset add boxwidth 2 div add
+ exch yspacing mul boxheight add
+ /y exch def
+ /x exch def
+ x y moveto
+ 0 disty 2 div rlineto
+ stroke
+ 1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+ newpath
+ exch xspacing mul xoffset add boxwidth 2 div add
+ exch yspacing mul disty 2 div sub
+ /y exch def
+ /x exch def
+ x y moveto
+ 0 disty 2 div rlineto
+ stroke
+ 1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+ exch xspacing mul xoffset add boxwidth 2 div add
+ exch yspacing mul boxheight 2 div sub
+ /y exch def
+ /x exch def
+ newpath
+ x y moveto
+ boxwidth 2 div distx add 0 rlineto
+ stroke
+ 1 eq
+ { newpath x boxwidth 2 div distx add add y moveto
+ -8 3 rlineto
+ 0 -6 rlineto
+ 8 3 rlineto
+ closepath
+ eofill
+ stroke
+ } if
+} def
+
+/vedge
+{
+ /ye exch def
+ /ys exch def
+ /xs exch def
+ newpath
+ xs xspacing mul xoffset add boxwidth 2 div add dup
+ ys yspacing mul boxheight 2 div sub
+ moveto
+ ye yspacing mul boxheight 2 div sub
+ lineto
+ stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+ /ys exch def
+ /xe exch def
+ /xs exch def
+ newpath
+ xs xspacing mul xoffset add boxwidth 2 div add
+ ys yspacing mul disty 2 div sub
+ moveto
+ xspacing xe xs sub mul 0
+ rlineto
+ stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(moeoFitnessAssignment< MOEOT >) cw
+(eoUF< eoPop< MOEOT > &, void >) cw
+(eoFunctorBase) cw
+(moeoCriterionBasedFitnessAssignment< MOEOT >) cw
+(moeoDummyFitnessAssignment< MOEOT >) cw
+(moeoIndicatorBasedFitnessAssignment< MOEOT >) cw
+(moeoParetoBasedFitnessAssignment< MOEOT >) cw
+(moeoScalarFitnessAssignment< MOEOT >) cw
+(moeoBinaryIndicatorBasedFitnessAssignment< MOEOT >) cw
+(moeoUnaryIndicatorBasedFitnessAssignment< MOEOT >) cw
+(moeoFastNonDominatedSortingFitnessAssignment< MOEOT >) cw
+(moeoAchievementFitnessAssignment< MOEOT >) cw
+(moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor
+ boxwidth cols mul distx cols 1 sub mul add
+ boxheight rows mul disty rows 1 sub mul add boundaspect mul
+ max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (moeoFitnessAssignment< MOEOT >) 2 3 box
+ (eoUF< eoPop< MOEOT > &, void >) 2 4 box
+ (eoFunctorBase) 2 5 box
+ (moeoCriterionBasedFitnessAssignment< MOEOT >) 0 2 box
+ (moeoDummyFitnessAssignment< MOEOT >) 1 2 box
+ (moeoIndicatorBasedFitnessAssignment< MOEOT >) 2 2 box
+ (moeoParetoBasedFitnessAssignment< MOEOT >) 3.5 2 box
+ (moeoScalarFitnessAssignment< MOEOT >) 4.5 2 box
+ (moeoBinaryIndicatorBasedFitnessAssignment< MOEOT >) 1.5 1 box
+ (moeoUnaryIndicatorBasedFitnessAssignment< MOEOT >) 2.5 1 box
+ (moeoFastNonDominatedSortingFitnessAssignment< MOEOT >) 3.5 1 box
+ (moeoAchievementFitnessAssignment< MOEOT >) 4.5 1 box
+ (moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >) 1.5 0 box
+
+% ----- relations -----
+
+solid
+0 2 3 out
+solid
+1 2 4 in
+solid
+0 2 4 out
+solid
+1 2 5 in
+solid
+1 2 2.25 out
+solid
+0 4.5 3 conn
+solid
+0 0 2.75 in
+solid
+0 1 2.75 in
+solid
+0 2 2.75 in
+solid
+1 2 1.25 out
+solid
+1.5 2.5 2 conn
+solid
+0 3.5 2.75 in
+solid
+1 3.5 1.25 out
+solid
+0 4.5 2.75 in
+solid
+1 4.5 1.25 out
+solid
+0 1.5 1.75 in
+solid
+1 1.5 0.25 out
+solid
+0 2.5 1.75 in
+solid
+0 3.5 1.75 in
+solid
+0 4.5 1.75 in
+solid
+0 1.5 0.75 in
diff --git a/trunk/paradiseo-moeo/doc/latex/classmoeoFitnessAssignment.tex b/trunk/paradiseo-moeo/doc/latex/classmoeoFitnessAssignment.tex
new file mode 100644
index 000000000..e59b75d7e
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/latex/classmoeoFitnessAssignment.tex
@@ -0,0 +1,75 @@
+\section{moeo\-Fitness\-Assignment$<$ MOEOT $>$ Class Template Reference}
+\label{classmoeoFitnessAssignment}\index{moeoFitnessAssignment@{moeoFitnessAssignment}}
+Functor that sets the fitness values of a whole population.
+
+
+{\tt \#include $<$moeo\-Fitness\-Assignment.h$>$}
+
+Inheritance diagram for moeo\-Fitness\-Assignment$<$ MOEOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.51351cm]{classmoeoFitnessAssignment}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item
+typedef MOEOT::Objective\-Vector \bf{Objective\-Vector}\label{classmoeoFitnessAssignment_6271b8215ea5df4fc1f19e513cd1d533}
+
+\begin{CompactList}\small\item\em The type for objective vector. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item
+virtual void \bf{update\-By\-Deleting} (\bf{eo\-Pop}$<$ MOEOT $>$ \&\_\-pop, \bf{Objective\-Vector} \&\_\-obj\-Vec)=0
+\begin{CompactList}\small\item\em Updates the fitness values of the whole population \_\-pop by taking the deletion of the objective vector \_\-obj\-Vec into account. \item\end{CompactList}\item
+void \bf{update\-By\-Deleting} (\bf{eo\-Pop}$<$ MOEOT $>$ \&\_\-pop, MOEOT \&\_\-moeo)
+\begin{CompactList}\small\item\em Updates the fitness values of the whole population \_\-pop by taking the deletion of the individual \_\-moeo into account. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class MOEOT$>$ class moeo\-Fitness\-Assignment$<$ MOEOT $>$}
+
+Functor that sets the fitness values of a whole population.
+
+
+
+Definition at line 23 of file moeo\-Fitness\-Assignment.h.
+
+\subsection{Member Function Documentation}
+\index{moeoFitnessAssignment@{moeo\-Fitness\-Assignment}!updateByDeleting@{updateByDeleting}}
+\index{updateByDeleting@{updateByDeleting}!moeoFitnessAssignment@{moeo\-Fitness\-Assignment}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ virtual void \bf{moeo\-Fitness\-Assignment}$<$ MOEOT $>$::update\-By\-Deleting (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop}, \bf{Objective\-Vector} \& {\em \_\-obj\-Vec})\hspace{0.3cm}{\tt [pure virtual]}}\label{classmoeoFitnessAssignment_4922629569eddc9be049b3ead1ab0269}
+
+
+Updates the fitness values of the whole population \_\-pop by taking the deletion of the objective vector \_\-obj\-Vec into account.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-pop}]the population \item[{\em \_\-obj\-Vec}]the objective vector \end{description}
+\end{Desc}
+
+
+Implemented in \bf{moeo\-Achievement\-Fitness\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoAchievementFitnessAssignment_a6a2ae6c263dbcea3c16cde4c8a1e5fc}, \bf{moeo\-Dummy\-Fitness\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoDummyFitnessAssignment_6e87d4a8ff8f43a7001a21a13795d00e}, \bf{moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoExpBinaryIndicatorBasedFitnessAssignment_1ad61bf146d3b24b41ef0575360f664b}, and \bf{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoFastNonDominatedSortingFitnessAssignment_8d16de444f6c7a73c28c9087b652656e}.
+
+Referenced by moeo\-Fitness\-Assignment$<$ MOEOT $>$::update\-By\-Deleting().\index{moeoFitnessAssignment@{moeo\-Fitness\-Assignment}!updateByDeleting@{updateByDeleting}}
+\index{updateByDeleting@{updateByDeleting}!moeoFitnessAssignment@{moeo\-Fitness\-Assignment}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ void \bf{moeo\-Fitness\-Assignment}$<$ MOEOT $>$::update\-By\-Deleting (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop}, MOEOT \& {\em \_\-moeo})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoFitnessAssignment_057fd85764abb5de35adb52b5ef695be}
+
+
+Updates the fitness values of the whole population \_\-pop by taking the deletion of the individual \_\-moeo into account.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-pop}]the population \item[{\em \_\-moeo}]the individual \end{description}
+\end{Desc}
+
+
+Definition at line 44 of file moeo\-Fitness\-Assignment.h.
+
+References moeo\-Fitness\-Assignment$<$ MOEOT $>$::update\-By\-Deleting().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item
+moeo\-Fitness\-Assignment.h\end{CompactItemize}
diff --git a/trunk/paradiseo-moeo/doc/latex/classmoeoNormalizedSolutionVsSolutionBinaryMetric.tex b/trunk/paradiseo-moeo/doc/latex/classmoeoNormalizedSolutionVsSolutionBinaryMetric.tex
new file mode 100644
index 000000000..531f2961c
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/latex/classmoeoNormalizedSolutionVsSolutionBinaryMetric.tex
@@ -0,0 +1,84 @@
+\section{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric$<$ Objective\-Vector, R $>$ Class Template Reference}
+\label{classmoeoNormalizedSolutionVsSolutionBinaryMetric}\index{moeoNormalizedSolutionVsSolutionBinaryMetric@{moeoNormalizedSolutionVsSolutionBinaryMetric}}
+Base class for binary metrics dedicated to the performance comparison between two solutions's objective vectors using normalized values.
+
+
+{\tt \#include $<$moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric.h$>$}
+
+Inheritance diagram for moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric$<$ Objective\-Vector, R $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.30189cm]{classmoeoNormalizedSolutionVsSolutionBinaryMetric}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item
+\bf{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric} ()\label{classmoeoNormalizedSolutionVsSolutionBinaryMetric_e58174a553269d3e8b0685a1f22b8333}
+
+\begin{CompactList}\small\item\em Default ctr for any \doxyref{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric}{p.}{classmoeoNormalizedSolutionVsSolutionBinaryMetric} object. \item\end{CompactList}\item
+void \bf{setup} (double \_\-min, double \_\-max, unsigned int \_\-obj)
+\begin{CompactList}\small\item\em Sets the lower bound (\_\-min) and the upper bound (\_\-max) for the objective \_\-obj. \item\end{CompactList}\item
+virtual void \bf{setup} (\bf{eo\-Real\-Interval} \_\-real\-Interval, unsigned int \_\-obj)
+\begin{CompactList}\small\item\em Sets the lower bound and the upper bound for the objective \_\-obj using a \doxyref{eo\-Real\-Interval} object. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Static Public Member Functions}
+\begin{CompactItemize}
+\item
+static double \bf{tiny} ()\label{classmoeoNormalizedSolutionVsSolutionBinaryMetric_d0ccbdceb71b9d2d6ae8ceec1af9dcdb}
+
+\begin{CompactList}\small\item\em Returns a very small value that can be used to avoid extreme cases (where the min bound == the max bound). \item\end{CompactList}\end{CompactItemize}
+\subsection*{Protected Attributes}
+\begin{CompactItemize}
+\item
+std::vector$<$ \bf{eo\-Real\-Interval} $>$ \bf{bounds}\label{classmoeoNormalizedSolutionVsSolutionBinaryMetric_81bff9a83c74f7f7f8a1db28c09c4c38}
+
+\begin{CompactList}\small\item\em the bounds for every objective (bounds[i] = bounds for the objective i) \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Objective\-Vector, class R$>$ class moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric$<$ Objective\-Vector, R $>$}
+
+Base class for binary metrics dedicated to the performance comparison between two solutions's objective vectors using normalized values.
+
+Then, indicator values lie in the interval [-1,1]. Note that you have to set the bounds for every objective before using the operator().
+
+
+
+Definition at line 26 of file moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric.h.
+
+\subsection{Member Function Documentation}
+\index{moeoNormalizedSolutionVsSolutionBinaryMetric@{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric}!setup@{setup}}
+\index{setup@{setup}!moeoNormalizedSolutionVsSolutionBinaryMetric@{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Objective\-Vector, class R$>$ void \bf{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric}$<$ Objective\-Vector, R $>$::setup (double {\em \_\-min}, double {\em \_\-max}, unsigned int {\em \_\-obj})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoNormalizedSolutionVsSolutionBinaryMetric_1f56a2f59a9b0548ad0ab691c8a02334}
+
+
+Sets the lower bound (\_\-min) and the upper bound (\_\-max) for the objective \_\-obj.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-min}]lower bound \item[{\em \_\-max}]upper bound \item[{\em \_\-obj}]the objective index \end{description}
+\end{Desc}
+
+
+Definition at line 50 of file moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric.h.
+
+Referenced by moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::setup().\index{moeoNormalizedSolutionVsSolutionBinaryMetric@{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric}!setup@{setup}}
+\index{setup@{setup}!moeoNormalizedSolutionVsSolutionBinaryMetric@{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Objective\-Vector, class R$>$ virtual void \bf{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric}$<$ Objective\-Vector, R $>$::setup (\bf{eo\-Real\-Interval} {\em \_\-real\-Interval}, unsigned int {\em \_\-obj})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classmoeoNormalizedSolutionVsSolutionBinaryMetric_0693a23c68e3fe0bb546e34926dcfe93}
+
+
+Sets the lower bound and the upper bound for the objective \_\-obj using a \doxyref{eo\-Real\-Interval} object.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-real\-Interval}]the \doxyref{eo\-Real\-Interval} object \item[{\em \_\-obj}]the objective index \end{description}
+\end{Desc}
+
+
+Definition at line 66 of file moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item
+moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric.h\end{CompactItemize}
diff --git a/trunk/paradiseo-moeo/doc/latex/doxygen.sty b/trunk/paradiseo-moeo/doc/latex/doxygen.sty
new file mode 100644
index 000000000..68a4cc202
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/latex/doxygen.sty
@@ -0,0 +1,78 @@
+\NeedsTeXFormat{LaTeX2e}
+\ProvidesPackage{doxygen}
+\RequirePackage{calc}
+\RequirePackage{array}
+\pagestyle{fancyplain}
+\newcommand{\clearemptydoublepage}{\newpage{\pagestyle{empty}\cleardoublepage}}
+\renewcommand{\chaptermark}[1]{\markboth{#1}{}}
+\renewcommand{\sectionmark}[1]{\markright{\thesection\ #1}}
+\lhead[\fancyplain{}{\bfseries\thepage}]
+ {\fancyplain{}{\bfseries\rightmark}}
+\rhead[\fancyplain{}{\bfseries\leftmark}]
+ {\fancyplain{}{\bfseries\thepage}}
+\rfoot[\fancyplain{}{\bfseries\scriptsize Generated on Thu Jul 5 17:36:46 2007 for Paradis\-EO-MOEO by Doxygen }]{}
+\lfoot[]{\fancyplain{}{\bfseries\scriptsize Generated on Thu Jul 5 17:36:46 2007 for Paradis\-EO-MOEO by Doxygen }}
+\cfoot{}
+\newenvironment{Code}
+{\footnotesize}
+{\normalsize}
+\newcommand{\doxyref}[3]{\textbf{#1} (\textnormal{#2}\,\pageref{#3})}
+\newenvironment{DocInclude}
+{\footnotesize}
+{\normalsize}
+\newenvironment{VerbInclude}
+{\footnotesize}
+{\normalsize}
+\newenvironment{Image}
+{\begin{figure}[H]}
+{\end{figure}}
+\newenvironment{ImageNoCaption}{}{}
+\newenvironment{CompactList}
+{\begin{list}{}{
+ \setlength{\leftmargin}{0.5cm}
+ \setlength{\itemsep}{0pt}
+ \setlength{\parsep}{0pt}
+ \setlength{\topsep}{0pt}
+ \renewcommand{\makelabel}{\hfill}}}
+{\end{list}}
+\newenvironment{CompactItemize}
+{
+ \begin{itemize}
+ \setlength{\itemsep}{-3pt}
+ \setlength{\parsep}{0pt}
+ \setlength{\topsep}{0pt}
+ \setlength{\partopsep}{0pt}
+}
+{\end{itemize}}
+\newcommand{\PBS}[1]{\let\temp=\\#1\let\\=\temp}
+\newlength{\tmplength}
+\newenvironment{TabularC}[1]
+{
+\setlength{\tmplength}
+ {\linewidth/(#1)-\tabcolsep*2-\arrayrulewidth*(#1+1)/(#1)}
+ \par\begin{tabular*}{\linewidth}
+ {*{#1}{|>{\PBS\raggedright\hspace{0pt}}p{\the\tmplength}}|}
+}
+{\end{tabular*}\par}
+\newcommand{\entrylabel}[1]{
+ {\parbox[b]{\labelwidth-4pt}{\makebox[0pt][l]{\textbf{#1}}\vspace{1.5\baselineskip}}}}
+\newenvironment{Desc}
+{\begin{list}{}
+ {
+ \settowidth{\labelwidth}{40pt}
+ \setlength{\leftmargin}{\labelwidth}
+ \setlength{\parsep}{0pt}
+ \setlength{\itemsep}{-4pt}
+ \renewcommand{\makelabel}{\entrylabel}
+ }
+}
+{\end{list}}
+\newenvironment{Indent}
+ {\begin{list}{}{\setlength{\leftmargin}{0.5cm}}
+ \item[]\ignorespaces}
+ {\unskip\end{list}}
+\setlength{\parindent}{0cm}
+\setlength{\parskip}{0.2cm}
+\addtocounter{secnumdepth}{1}
+\sloppy
+\usepackage[T1]{fontenc}
diff --git a/trunk/paradiseo-moeo/doc/latex/hierarchy.tex b/trunk/paradiseo-moeo/doc/latex/hierarchy.tex
new file mode 100644
index 000000000..f20cb80c6
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/latex/hierarchy.tex
@@ -0,0 +1,230 @@
+\section{Paradis\-EO-MOEO Class Hierarchy}
+This inheritance list is sorted roughly, but not completely, alphabetically:\begin{CompactList}
+\item eo\-Functor\-Base{\tt [external]}\begin{CompactList}
+\item eo\-BF$<$ A1, A2, R $>${\tt [external]}\begin{CompactList}
+\item eo\-Replacement$<$ EOT $>${\tt [external]}\begin{CompactList}
+\item eo\-Generational\-Replacement$<$ MOEOT $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Generational\-Replacement$<$ MOEOT $>$}{\pageref{classmoeoGenerationalReplacement}}{}
+\end{CompactList}
+\end{CompactList}
+\item eo\-Replacement$<$ MOEOT $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Replacement$<$ MOEOT $>$}{\pageref{classmoeoReplacement}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Elitist\-Replacement$<$ MOEOT $>$}{\pageref{classmoeoElitistReplacement}}{}
+\item \contentsline{section}{moeo\-Environmental\-Replacement$<$ MOEOT $>$}{\pageref{classmoeoEnvironmentalReplacement}}{}
+\item \contentsline{section}{moeo\-Generational\-Replacement$<$ MOEOT $>$}{\pageref{classmoeoGenerationalReplacement}}{}
+\end{CompactList}
+\end{CompactList}
+\item eo\-Select$<$ MOEOT $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Easy\-EA$<$ MOEOT $>$::eo\-Dummy\-Select}{\pageref{classmoeoEasyEA_1_1eoDummySelect}}{}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Binary\-Metric$<$ A1, A2, R $>$}{\pageref{classmoeoBinaryMetric}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Solution\-Vs\-Solution\-Binary\-Metric$<$ Objective\-Vector, R $>$}{\pageref{classmoeoSolutionVsSolutionBinaryMetric}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric$<$ Objective\-Vector, R $>$}{\pageref{classmoeoNormalizedSolutionVsSolutionBinaryMetric}}{}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Solution\-Vs\-Solution\-Binary\-Metric$<$ Objective\-Vector, double $>$}{\pageref{classmoeoSolutionVsSolutionBinaryMetric}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric$<$ Objective\-Vector, double $>$}{\pageref{classmoeoNormalizedSolutionVsSolutionBinaryMetric}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Additive\-Epsilon\-Binary\-Metric$<$ Objective\-Vector $>$}{\pageref{classmoeoAdditiveEpsilonBinaryMetric}}{}
+\item \contentsline{section}{moeo\-Hypervolume\-Binary\-Metric$<$ Objective\-Vector $>$}{\pageref{classmoeoHypervolumeBinaryMetric}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Vector\-Vs\-Vector\-Binary\-Metric$<$ Objective\-Vector, R $>$}{\pageref{classmoeoVectorVsVectorBinaryMetric}}{}
+\item \contentsline{section}{moeo\-Vector\-Vs\-Vector\-Binary\-Metric$<$ Objective\-Vector, double $>$}{\pageref{classmoeoVectorVsVectorBinaryMetric}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Contribution\-Metric$<$ Objective\-Vector $>$}{\pageref{classmoeoContributionMetric}}{}
+\item \contentsline{section}{moeo\-Entropy\-Metric$<$ Objective\-Vector $>$}{\pageref{classmoeoEntropyMetric}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Comparator$<$ MOEOT $>$}{\pageref{classmoeoComparator}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Aggregative\-Comparator$<$ MOEOT $>$}{\pageref{classmoeoAggregativeComparator}}{}
+\item \contentsline{section}{moeo\-Diversity\-Then\-Fitness\-Comparator$<$ MOEOT $>$}{\pageref{classmoeoDiversityThenFitnessComparator}}{}
+\item \contentsline{section}{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment$<$ MOEOT $>$::Objective\-Comparator}{\pageref{classmoeoFastNonDominatedSortingFitnessAssignment_1_1ObjectiveComparator}}{}
+\item \contentsline{section}{moeo\-Fitness\-Then\-Diversity\-Comparator$<$ MOEOT $>$}{\pageref{classmoeoFitnessThenDiversityComparator}}{}
+\item \contentsline{section}{moeo\-One\-Objective\-Comparator$<$ MOEOT $>$}{\pageref{classmoeoOneObjectiveComparator}}{}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Distance$<$ MOEOT, Type $>$}{\pageref{classmoeoDistance}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Normalized\-Distance$<$ MOEOT, Type $>$}{\pageref{classmoeoNormalizedDistance}}{}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Distance$<$ MOEOT, double $>$}{\pageref{classmoeoDistance}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Normalized\-Distance$<$ MOEOT $>$}{\pageref{classmoeoNormalizedDistance}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Euclidean\-Distance$<$ MOEOT $>$}{\pageref{classmoeoEuclideanDistance}}{}
+\item \contentsline{section}{moeo\-Manhattan\-Distance$<$ MOEOT $>$}{\pageref{classmoeoManhattanDistance}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Objective\-Vector\-Comparator$<$ Objective\-Vector $>$}{\pageref{classmoeoObjectiveVectorComparator}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-GDominance\-Objective\-Vector\-Comparator$<$ Objective\-Vector $>$}{\pageref{classmoeoGDominanceObjectiveVectorComparator}}{}
+\item \contentsline{section}{moeo\-Objective\-Objective\-Vector\-Comparator$<$ Objective\-Vector $>$}{\pageref{classmoeoObjectiveObjectiveVectorComparator}}{}
+\item \contentsline{section}{moeo\-Pareto\-Objective\-Vector\-Comparator$<$ Objective\-Vector $>$}{\pageref{classmoeoParetoObjectiveVectorComparator}}{}
+\end{CompactList}
+\end{CompactList}
+\item eo\-BF$<$ const const Objective\-Vector \&, Objective\-Vector \&, double $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Binary\-Metric$<$ const const Objective\-Vector \&, Objective\-Vector \&, double $>$}{\pageref{classmoeoBinaryMetric}}{}
+\end{CompactList}
+\item eo\-BF$<$ const const Objective\-Vector \&, Objective\-Vector \&, R $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Binary\-Metric$<$ const const Objective\-Vector \&, Objective\-Vector \&, R $>$}{\pageref{classmoeoBinaryMetric}}{}
+\end{CompactList}
+\item eo\-BF$<$ const const std::vector$<$ Objective\-Vector $>$ \&, std::vector$<$ Objective\-Vector $>$ \&, double $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Binary\-Metric$<$ const const std::vector$<$ Objective\-Vector $>$ \&, std::vector$<$ Objective\-Vector $>$ \&, double $>$}{\pageref{classmoeoBinaryMetric}}{}
+\end{CompactList}
+\item eo\-BF$<$ const const std::vector$<$ Objective\-Vector $>$ \&, std::vector$<$ Objective\-Vector $>$ \&, R $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Binary\-Metric$<$ const const std::vector$<$ Objective\-Vector $>$ \&, std::vector$<$ Objective\-Vector $>$ \&, R $>$}{\pageref{classmoeoBinaryMetric}}{}
+\end{CompactList}
+\item eo\-BF$<$ Type, moeo\-Archive$<$ MOEOT $>$ \&, void $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-LS$<$ MOEOT, Type $>$}{\pageref{classmoeoLS}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Combined\-LS$<$ MOEOT, Type $>$}{\pageref{classmoeoCombinedLS}}{}
+\end{CompactList}
+\end{CompactList}
+\item eo\-F$<$ void $>${\tt [external]}\begin{CompactList}
+\item eo\-Updater{\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Archive\-Objective\-Vector\-Saving\-Updater$<$ MOEOT $>$}{\pageref{classmoeoArchiveObjectiveVectorSavingUpdater}}{}
+\item \contentsline{section}{moeo\-Archive\-Updater$<$ MOEOT $>$}{\pageref{classmoeoArchiveUpdater}}{}
+\item \contentsline{section}{moeo\-Binary\-Metric\-Saving\-Updater$<$ MOEOT $>$}{\pageref{classmoeoBinaryMetricSavingUpdater}}{}
+\item \contentsline{section}{moeo\-Hybrid\-LS$<$ MOEOT $>$}{\pageref{classmoeoHybridLS}}{}
+\end{CompactList}
+\end{CompactList}
+\item eo\-UF$<$ A1, R $>${\tt [external]}\begin{CompactList}
+\item eo\-Algo$<$ MOEOT $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-EA$<$ MOEOT $>$}{\pageref{classmoeoEA}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Easy\-EA$<$ MOEOT $>$}{\pageref{classmoeoEasyEA}}{}
+\item \contentsline{section}{moeo\-IBEA$<$ MOEOT $>$}{\pageref{classmoeoIBEA}}{}
+\item \contentsline{section}{moeo\-NSGA$<$ MOEOT $>$}{\pageref{classmoeoNSGA}}{}
+\item \contentsline{section}{moeo\-NSGAII$<$ MOEOT $>$}{\pageref{classmoeoNSGAII}}{}
+\end{CompactList}
+\end{CompactList}
+\item eo\-Eval\-Func$<$ MOEOT $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Easy\-EA$<$ MOEOT $>$::eo\-Dummy\-Eval}{\pageref{classmoeoEasyEA_1_1eoDummyEval}}{}
+\item \contentsline{section}{moeo\-Eval\-Func$<$ MOEOT $>$}{\pageref{classmoeoEvalFunc}}{}
+\end{CompactList}
+\item eo\-Select\-One$<$ EOT, Worth\-T $>${\tt [external]}\begin{CompactList}
+\item eo\-Random\-Select$<$ MOEOT $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Random\-Select$<$ MOEOT $>$}{\pageref{classmoeoRandomSelect}}{}
+\end{CompactList}
+\end{CompactList}
+\item eo\-Select\-One$<$ MOEOT $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Select\-One$<$ MOEOT $>$}{\pageref{classmoeoSelectOne}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Det\-Tournament\-Select$<$ MOEOT $>$}{\pageref{classmoeoDetTournamentSelect}}{}
+\item \contentsline{section}{moeo\-Random\-Select$<$ MOEOT $>$}{\pageref{classmoeoRandomSelect}}{}
+\item \contentsline{section}{moeo\-Roulette\-Select$<$ MOEOT $>$}{\pageref{classmoeoRouletteSelect}}{}
+\item \contentsline{section}{moeo\-Select\-From\-Pop\-And\-Arch$<$ MOEOT $>$}{\pageref{classmoeoSelectFromPopAndArch}}{}
+\item \contentsline{section}{moeo\-Stoch\-Tournament\-Select$<$ MOEOT $>$}{\pageref{classmoeoStochTournamentSelect}}{}
+\end{CompactList}
+\end{CompactList}
+\item eo\-Transform$<$ MOEOT $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Easy\-EA$<$ MOEOT $>$::eo\-Dummy\-Transform}{\pageref{classmoeoEasyEA_1_1eoDummyTransform}}{}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Convert\-Pop\-To\-Objective\-Vectors$<$ MOEOT, Objective\-Vector $>$}{\pageref{classmoeoConvertPopToObjectiveVectors}}{}
+\end{CompactList}
+\item eo\-UF$<$ A, R $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Unary\-Metric$<$ A, R $>$}{\pageref{classmoeoUnaryMetric}}{}
+\end{CompactList}
+\item eo\-UF$<$ const eo\-Pop$<$ MOEOT $>$ \&, void $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Distance\-Matrix$<$ MOEOT, Type $>$}{\pageref{classmoeoDistanceMatrix}}{}
+\end{CompactList}
+\item eo\-UF$<$ const Objective\-Vector \&, R $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Unary\-Metric$<$ const Objective\-Vector \&, R $>$}{\pageref{classmoeoUnaryMetric}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Solution\-Unary\-Metric$<$ Objective\-Vector, R $>$}{\pageref{classmoeoSolutionUnaryMetric}}{}
+\end{CompactList}
+\end{CompactList}
+\item eo\-UF$<$ const std::vector$<$ Objective\-Vector $>$ \&, R $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Unary\-Metric$<$ const std::vector$<$ Objective\-Vector $>$ \&, R $>$}{\pageref{classmoeoUnaryMetric}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Vector\-Unary\-Metric$<$ Objective\-Vector, R $>$}{\pageref{classmoeoVectorUnaryMetric}}{}
+\end{CompactList}
+\end{CompactList}
+\item eo\-UF$<$ eo\-Pop$<$ MOEOT $>$ \&, void $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Diversity\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoDiversityAssignment}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Crowding\-Diversity\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoCrowdingDiversityAssignment}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoFrontByFrontCrowdingDiversityAssignment}}{}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Dummy\-Diversity\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoDummyDiversityAssignment}}{}
+\item \contentsline{section}{moeo\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoSharingDiversityAssignment}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoFrontByFrontSharingDiversityAssignment}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Fitness\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoFitnessAssignment}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Criterion\-Based\-Fitness\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoCriterionBasedFitnessAssignment}}{}
+\item \contentsline{section}{moeo\-Dummy\-Fitness\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoDummyFitnessAssignment}}{}
+\item \contentsline{section}{moeo\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoIndicatorBasedFitnessAssignment}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoBinaryIndicatorBasedFitnessAssignment}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoExpBinaryIndicatorBasedFitnessAssignment}}{}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Unary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoUnaryIndicatorBasedFitnessAssignment}}{}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Pareto\-Based\-Fitness\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoParetoBasedFitnessAssignment}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoFastNonDominatedSortingFitnessAssignment}}{}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Scalar\-Fitness\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoScalarFitnessAssignment}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Achievement\-Fitness\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoAchievementFitnessAssignment}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Metric}{\pageref{classmoeoMetric}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Binary\-Metric$<$ A1, A2, R $>$}{\pageref{classmoeoBinaryMetric}}{}
+\item \contentsline{section}{moeo\-Binary\-Metric$<$ const const Objective\-Vector \&, Objective\-Vector \&, double $>$}{\pageref{classmoeoBinaryMetric}}{}
+\item \contentsline{section}{moeo\-Binary\-Metric$<$ const const Objective\-Vector \&, Objective\-Vector \&, R $>$}{\pageref{classmoeoBinaryMetric}}{}
+\item \contentsline{section}{moeo\-Binary\-Metric$<$ const const std::vector$<$ Objective\-Vector $>$ \&, std::vector$<$ Objective\-Vector $>$ \&, double $>$}{\pageref{classmoeoBinaryMetric}}{}
+\item \contentsline{section}{moeo\-Binary\-Metric$<$ const const std::vector$<$ Objective\-Vector $>$ \&, std::vector$<$ Objective\-Vector $>$ \&, R $>$}{\pageref{classmoeoBinaryMetric}}{}
+\item \contentsline{section}{moeo\-Unary\-Metric$<$ A, R $>$}{\pageref{classmoeoUnaryMetric}}{}
+\item \contentsline{section}{moeo\-Unary\-Metric$<$ const Objective\-Vector \&, R $>$}{\pageref{classmoeoUnaryMetric}}{}
+\item \contentsline{section}{moeo\-Unary\-Metric$<$ const std::vector$<$ Objective\-Vector $>$ \&, R $>$}{\pageref{classmoeoUnaryMetric}}{}
+\end{CompactList}
+\end{CompactList}
+\item eo\-Object{\tt [external]}\begin{CompactList}
+\item EO$<$ MOEOObjective\-Vector $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{MOEO$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$}{\pageref{classMOEO}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, Gene\-Type $>$}{\pageref{classmoeoVector}}{}
+\item \contentsline{section}{moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, bool $>$}{\pageref{classmoeoVector}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Bit\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$}{\pageref{classmoeoBitVector}}{}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, double $>$}{\pageref{classmoeoVector}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Real\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$}{\pageref{classmoeoRealVector}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item eo\-Pop$<$ MOEOT $>${\tt [external]}\begin{CompactList}
+\item \contentsline{section}{moeo\-Archive$<$ MOEOT $>$}{\pageref{classmoeoArchive}}{}
+\end{CompactList}
+\end{CompactList}
+\item eo\-Printable{\tt [external]}\begin{CompactList}
+\item eo\-Persistent{\tt [external]}\begin{CompactList}
+\item EO$<$ MOEOObjective\-Vector $>${\tt [external]}\item eo\-Pop$<$ MOEOT $>${\tt [external]}\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Algo}{\pageref{classmoeoAlgo}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-EA$<$ MOEOT $>$}{\pageref{classmoeoEA}}{}
+\item \contentsline{section}{moeo\-LS$<$ MOEOT, Type $>$}{\pageref{classmoeoLS}}{}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Elitist\-Replacement$<$ MOEOT $>$::Cmp}{\pageref{classmoeoElitistReplacement_1_1Cmp}}{}
+\item \contentsline{section}{moeo\-Environmental\-Replacement$<$ MOEOT $>$::Cmp}{\pageref{classmoeoEnvironmentalReplacement_1_1Cmp}}{}
+\item \contentsline{section}{moeo\-Objective\-Vector$<$ Objective\-Vector\-Traits, Objective\-Vector\-Type $>$}{\pageref{classmoeoObjectiveVector}}{}
+\item \contentsline{section}{moeo\-Objective\-Vector$<$ Objective\-Vector\-Traits, double $>$}{\pageref{classmoeoObjectiveVector}}{}
+\begin{CompactList}
+\item \contentsline{section}{moeo\-Real\-Objective\-Vector$<$ Objective\-Vector\-Traits $>$}{\pageref{classmoeoRealObjectiveVector}}{}
+\end{CompactList}
+\item \contentsline{section}{moeo\-Objective\-Vector\-Traits}{\pageref{classmoeoObjectiveVectorTraits}}{}
+\end{CompactList}
diff --git a/trunk/paradiseo-moeo/doc/latex/pages.tex b/trunk/paradiseo-moeo/doc/latex/pages.tex
new file mode 100644
index 000000000..8297a1563
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/latex/pages.tex
@@ -0,0 +1,5 @@
+\section{Paradis\-EO-MOEO Related Pages}
+Here is a list of all related documentation pages:\begin{CompactList}
+\item \contentsline{section}{Related webpages}{\pageref{webpages}}{}
+
+\end{CompactList}
diff --git a/trunk/paradiseo-moeo/doc/latex/refman.tex b/trunk/paradiseo-moeo/doc/latex/refman.tex
new file mode 100644
index 000000000..835ee755e
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/latex/refman.tex
@@ -0,0 +1,119 @@
+\documentclass[a4paper]{book}
+\usepackage{a4wide}
+\usepackage{makeidx}
+\usepackage{fancyhdr}
+\usepackage{graphicx}
+\usepackage{multicol}
+\usepackage{float}
+\usepackage{textcomp}
+\usepackage{alltt}
+\usepackage{doxygen}
+\makeindex
+\setcounter{tocdepth}{1}
+\renewcommand{\footrulewidth}{0.4pt}
+\begin{document}
+\begin{titlepage}
+\vspace*{7cm}
+\begin{center}
+{\Large Paradis\-EO-MOEO Reference Manual\\[1ex]\large 1.0-beta }\\
+\vspace*{1cm}
+{\large Generated by Doxygen 1.4.7}\\
+\vspace*{0.5cm}
+{\small Thu Jul 5 17:36:46 2007}\\
+\end{center}
+\end{titlepage}
+\clearemptydoublepage
+\pagenumbering{roman}
+\tableofcontents
+\clearemptydoublepage
+\pagenumbering{arabic}
+\chapter{Welcome to Paradis\-EO-MOEO }
+\label{index}\input{main}
+\chapter{Paradis\-EO-MOEO Hierarchical Index}
+\input{hierarchy}
+\chapter{Paradis\-EO-MOEO Class Index}
+\input{annotated}
+\chapter{Paradis\-EO-MOEO Class Documentation}
+\input{classMOEO}
+\include{classmoeoAchievementFitnessAssignment}
+\include{classmoeoAdditiveEpsilonBinaryMetric}
+\include{classmoeoAggregativeComparator}
+\include{classmoeoAlgo}
+\include{classmoeoArchive}
+\include{classmoeoArchiveObjectiveVectorSavingUpdater}
+\include{classmoeoArchiveUpdater}
+\include{classmoeoBinaryIndicatorBasedFitnessAssignment}
+\include{classmoeoBinaryMetric}
+\include{classmoeoBinaryMetricSavingUpdater}
+\include{classmoeoBitVector}
+\include{classmoeoCombinedLS}
+\include{classmoeoComparator}
+\include{classmoeoContributionMetric}
+\include{classmoeoConvertPopToObjectiveVectors}
+\include{classmoeoCriterionBasedFitnessAssignment}
+\include{classmoeoCrowdingDiversityAssignment}
+\include{classmoeoDetTournamentSelect}
+\include{classmoeoDistance}
+\include{classmoeoDistanceMatrix}
+\include{classmoeoDiversityAssignment}
+\include{classmoeoDiversityThenFitnessComparator}
+\include{classmoeoDummyDiversityAssignment}
+\include{classmoeoDummyFitnessAssignment}
+\include{classmoeoEA}
+\include{classmoeoEasyEA}
+\include{classmoeoEasyEA_1_1eoDummyEval}
+\include{classmoeoEasyEA_1_1eoDummySelect}
+\include{classmoeoEasyEA_1_1eoDummyTransform}
+\include{classmoeoElitistReplacement}
+\include{classmoeoElitistReplacement_1_1Cmp}
+\include{classmoeoEntropyMetric}
+\include{classmoeoEnvironmentalReplacement}
+\include{classmoeoEnvironmentalReplacement_1_1Cmp}
+\include{classmoeoEuclideanDistance}
+\include{classmoeoEvalFunc}
+\include{classmoeoExpBinaryIndicatorBasedFitnessAssignment}
+\include{classmoeoFastNonDominatedSortingFitnessAssignment}
+\include{classmoeoFastNonDominatedSortingFitnessAssignment_1_1ObjectiveComparator}
+\include{classmoeoFitnessAssignment}
+\include{classmoeoFitnessThenDiversityComparator}
+\include{classmoeoFrontByFrontCrowdingDiversityAssignment}
+\include{classmoeoFrontByFrontSharingDiversityAssignment}
+\include{classmoeoGDominanceObjectiveVectorComparator}
+\include{classmoeoGenerationalReplacement}
+\include{classmoeoHybridLS}
+\include{classmoeoHypervolumeBinaryMetric}
+\include{classmoeoIBEA}
+\include{classmoeoIndicatorBasedFitnessAssignment}
+\include{classmoeoLS}
+\include{classmoeoManhattanDistance}
+\include{classmoeoMetric}
+\include{classmoeoNormalizedDistance}
+\include{classmoeoNormalizedSolutionVsSolutionBinaryMetric}
+\include{classmoeoNSGA}
+\include{classmoeoNSGAII}
+\include{classmoeoObjectiveObjectiveVectorComparator}
+\include{classmoeoObjectiveVector}
+\include{classmoeoObjectiveVectorComparator}
+\include{classmoeoObjectiveVectorTraits}
+\include{classmoeoOneObjectiveComparator}
+\include{classmoeoParetoBasedFitnessAssignment}
+\include{classmoeoParetoObjectiveVectorComparator}
+\include{classmoeoRandomSelect}
+\include{classmoeoRealObjectiveVector}
+\include{classmoeoRealVector}
+\include{classmoeoReplacement}
+\include{classmoeoRouletteSelect}
+\include{classmoeoScalarFitnessAssignment}
+\include{classmoeoSelectFromPopAndArch}
+\include{classmoeoSelectOne}
+\include{classmoeoSharingDiversityAssignment}
+\include{classmoeoSolutionUnaryMetric}
+\include{classmoeoSolutionVsSolutionBinaryMetric}
+\include{classmoeoStochTournamentSelect}
+\include{classmoeoUnaryIndicatorBasedFitnessAssignment}
+\include{classmoeoUnaryMetric}
+\include{classmoeoVector}
+\include{classmoeoVectorUnaryMetric}
+\include{classmoeoVectorVsVectorBinaryMetric}
+\printindex
+\end{document}
diff --git a/trunk/paradiseo-moeo/doc/latex/webpages.tex b/trunk/paradiseo-moeo/doc/latex/webpages.tex
new file mode 100644
index 000000000..f17506321
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/latex/webpages.tex
@@ -0,0 +1,3 @@
+\section{Related webpages}\label{webpages}
+\begin{itemize}
+\item Paradis\-EO {\tt homepage}\item INRIA GForge {\tt project page}\item {\tt README}\item {\tt NEWS} \end{itemize}
diff --git a/trunk/paradiseo-moeo/doc/man/man3/MOEO.3 b/trunk/paradiseo-moeo/doc/man/man3/MOEO.3
new file mode 100644
index 000000000..494c012cb
--- /dev/null
+++ b/trunk/paradiseo-moeo/doc/man/man3/MOEO.3
@@ -0,0 +1,253 @@
+.TH "MOEO" 3 "5 Jul 2007" "Version 1.0-beta" "ParadisEO-MOEO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+MOEO \- Base class allowing to represent a solution (an individual) for multi-objective optimization.
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include