diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopBenchmarkParser_8cpp-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopBenchmarkParser_8cpp-source.html index bae6d394f..e9a6ef9ac 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopBenchmarkParser_8cpp-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopBenchmarkParser_8cpp-source.html @@ -21,108 +21,133 @@ -

FlowShopBenchmarkParser.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopBenchmarkParser.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 <stdexcept>
-00014 #include <FlowShopBenchmarkParser.h>
-00015 
-00016 FlowShopBenchmarkParser::FlowShopBenchmarkParser(const std::string _benchmarkFileName)
-00017 {
-00018     init(_benchmarkFileName);
-00019 }
-00020 
-00021 
-00022 const unsigned int FlowShopBenchmarkParser::getM()
-00023 {
-00024     return M;
-00025 }
-00026 
-00027 
-00028 const unsigned int FlowShopBenchmarkParser::getN()
-00029 {
-00030     return N;
-00031 }
-00032 
-00033 
-00034 const std::vector< std::vector<unsigned int> > FlowShopBenchmarkParser::getP()
-00035 {
-00036     return p;
-00037 }
-00038 
-00039 
-00040 const std::vector<unsigned int> FlowShopBenchmarkParser::getD()
-00041 {
-00042     return d;
-00043 }
-00044 
+
FlowShopBenchmarkParser.cpp
00001 /* 
+00002 * <FlowShopBenchmarkParser.cpp>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #include <stdexcept>
+00039 #include <FlowShopBenchmarkParser.h>
+00040 
+00041 FlowShopBenchmarkParser::FlowShopBenchmarkParser(const std::string _benchmarkFileName)
+00042 {
+00043     init(_benchmarkFileName);
+00044 }
 00045 
-00046 void FlowShopBenchmarkParser::printOn(std::ostream & _os) const
-00047 {
-00048     _os << "M=" << M << " N=" << N << std::endl;
-00049     _os << "*** processing times" << std::endl;
-00050     for (unsigned int i=0; i<M; i++) {
-00051         for (unsigned int j=0; j<N; j++) {
-00052             _os << p[i][j] << " ";
-00053         }
-00054         _os << std::endl;
-00055     }
-00056     _os << "*** due-dates" << std::endl;
-00057     for (unsigned int j=0; j<N; j++) {
-00058         _os << d[j] << " ";
-00059     }
-00060     _os << std::endl << std::endl;
-00061 }
-00062 
+00046 
+00047 const unsigned int FlowShopBenchmarkParser::getM()
+00048 {
+00049     return M;
+00050 }
+00051 
+00052 
+00053 const unsigned int FlowShopBenchmarkParser::getN()
+00054 {
+00055     return N;
+00056 }
+00057 
+00058 
+00059 const std::vector< std::vector<unsigned int> > FlowShopBenchmarkParser::getP()
+00060 {
+00061     return p;
+00062 }
 00063 
-00064 void FlowShopBenchmarkParser::init(const std::string _benchmarkFileName)
-00065 {
-00066     std::string buffer;
-00067     std::string::size_type start, end;
-00068     std::ifstream inputFile(_benchmarkFileName.data(), std::ios::in);
-00069     // opening of the benchmark file
-00070     if (! inputFile)
-00071         throw std::runtime_error("*** ERROR : Unable to open the benchmark file");
-00072     // number of jobs (N)
-00073     getline(inputFile, buffer, '\n');
-00074     N = atoi(buffer.data());
-00075     // number of machines M
-00076     getline(inputFile, buffer, '\n');
-00077     M = atoi(buffer.data());
-00078     // initial and current seeds (not used)
-00079     getline(inputFile, buffer, '\n');
-00080     // processing times and due-dates
-00081     p = std::vector< std::vector<unsigned int> > (M,N);
-00082     d = std::vector<unsigned int> (N);
-00083     // for each job...
-00084     for (unsigned int j=0 ; j<N ; j++) {
-00085         // index of the job (<=> j)
-00086         getline(inputFile, buffer, '\n');
-00087         // due-date of the job j
-00088         getline(inputFile, buffer, '\n');
-00089         d[j] = atoi(buffer.data());
-00090         // processing times of the job j on each machine
-00091         getline(inputFile, buffer, '\n');
-00092         start = buffer.find_first_not_of(" ");
-00093         for (unsigned int i=0 ; i<M ; i++) {
-00094             end = buffer.find_first_of(" ", start);
-00095             p[i][j] = atoi(buffer.substr(start, end-start).data());
-00096             start = buffer.find_first_not_of(" ", end);
-00097         }
-00098     }
-00099     // closing of the input file
-00100     inputFile.close();
-00101 }
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00064 
+00065 const std::vector<unsigned int> FlowShopBenchmarkParser::getD()
+00066 {
+00067     return d;
+00068 }
+00069 
+00070 
+00071 void FlowShopBenchmarkParser::printOn(std::ostream & _os) const
+00072 {
+00073     _os << "M=" << M << " N=" << N << std::endl;
+00074     _os << "*** processing times" << std::endl;
+00075     for (unsigned int i=0; i<M; i++) {
+00076         for (unsigned int j=0; j<N; j++) {
+00077             _os << p[i][j] << " ";
+00078         }
+00079         _os << std::endl;
+00080     }
+00081     _os << "*** due-dates" << std::endl;
+00082     for (unsigned int j=0; j<N; j++) {
+00083         _os << d[j] << " ";
+00084     }
+00085     _os << std::endl << std::endl;
+00086 }
+00087 
+00088 
+00089 void FlowShopBenchmarkParser::init(const std::string _benchmarkFileName)
+00090 {
+00091     std::string buffer;
+00092     std::string::size_type start, end;
+00093     std::ifstream inputFile(_benchmarkFileName.data(), std::ios::in);
+00094     // opening of the benchmark file
+00095     if (! inputFile)
+00096         throw std::runtime_error("*** ERROR : Unable to open the benchmark file");
+00097     // number of jobs (N)
+00098     getline(inputFile, buffer, '\n');
+00099     N = atoi(buffer.data());
+00100     // number of machines M
+00101     getline(inputFile, buffer, '\n');
+00102     M = atoi(buffer.data());
+00103     // initial and current seeds (not used)
+00104     getline(inputFile, buffer, '\n');
+00105     // processing times and due-dates
+00106     p = std::vector< std::vector<unsigned int> > (M,N);
+00107     d = std::vector<unsigned int> (N);
+00108     // for each job...
+00109     for (unsigned int j=0 ; j<N ; j++) {
+00110         // index of the job (<=> j)
+00111         getline(inputFile, buffer, '\n');
+00112         // due-date of the job j
+00113         getline(inputFile, buffer, '\n');
+00114         d[j] = atoi(buffer.data());
+00115         // processing times of the job j on each machine
+00116         getline(inputFile, buffer, '\n');
+00117         start = buffer.find_first_not_of(" ");
+00118         for (unsigned int i=0 ; i<M ; i++) {
+00119             end = buffer.find_first_of(" ", start);
+00120             p[i][j] = atoi(buffer.substr(start, end-start).data());
+00121             start = buffer.find_first_not_of(" ", end);
+00122         }
+00123     }
+00124     // closing of the input file
+00125     inputFile.close();
+00126 }
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopBenchmarkParser_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopBenchmarkParser_8h-source.html index 0919ff0eb..b971a24b1 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopBenchmarkParser_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopBenchmarkParser_8h-source.html @@ -21,61 +21,86 @@ -

FlowShopBenchmarkParser.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopBenchmarkParser.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 FLOWSHOPBENCHMARKPARSER_H_
-00014 #define FLOWSHOPBENCHMARKPARSER_H_
-00015 
-00016 #include <fstream>
-00017 #include <string>
-00018 #include <vector>
-00019 
-00023 class FlowShopBenchmarkParser
-00024 {
-00025 public:
-00026 
-00031     FlowShopBenchmarkParser(const std::string _benchmarkFileName);
-00032 
-00033 
-00037     const unsigned int getM();
-00038 
-00039 
-00043     const unsigned int getN();
+
FlowShopBenchmarkParser.h
00001 /* 
+00002 * <FlowShopBenchmarkParser.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef FLOWSHOPBENCHMARKPARSER_H_
+00039 #define FLOWSHOPBENCHMARKPARSER_H_
+00040 
+00041 #include <fstream>
+00042 #include <string>
+00043 #include <vector>
 00044 
-00045 
-00049     const std::vector < std::vector < unsigned int > > getP();
-00050 
+00048 class FlowShopBenchmarkParser
+00049 {
+00050 public:
 00051 
-00055     const std::vector < unsigned int > getD();
-00056 
+00056     FlowShopBenchmarkParser(const std::string _benchmarkFileName);
 00057 
-00061     void printOn(std::ostream & _os) const;
-00062 
+00058 
+00062     const unsigned int getM();
 00063 
-00064 private:
-00065 
-00067     unsigned int M;
-00069     unsigned int N;
-00071     std::vector < std::vector < unsigned int > > p;
-00073     std::vector < unsigned int > d;
-00074 
+00064 
+00068     const unsigned int getN();
+00069 
+00070 
+00074     const std::vector < std::vector < unsigned int > > getP();
 00075 
-00080     void init(const std::string _benchmarkFileName);
+00076 
+00080     const std::vector < unsigned int > getD();
 00081 
-00082 };
-00083 
-00084 #endif /*FLOWSHOPBENCHMARKPARSER_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00082 
+00086     void printOn(std::ostream & _os) const;
+00087 
+00088 
+00089 private:
+00090 
+00092     unsigned int M;
+00094     unsigned int N;
+00096     std::vector < std::vector < unsigned int > > p;
+00098     std::vector < unsigned int > d;
+00099 
+00100 
+00105     void init(const std::string _benchmarkFileName);
+00106 
+00107 };
+00108 
+00109 #endif /*FLOWSHOPBENCHMARKPARSER_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopEA_8cpp-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopEA_8cpp-source.html index 168f09873..cb233440d 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopEA_8cpp-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopEA_8cpp-source.html @@ -21,114 +21,139 @@ -

FlowShopEA.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopEA.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 
-00014 // moeo general include
-00015 #include <moeo>
-00016 // for the creation of an evaluator
-00017 #include <make_eval_FlowShop.h>
-00018 // for the creation of an initializer
-00019 #include <make_genotype_FlowShop.h>
-00020 // for the creation of the variation operators
-00021 #include <make_op_FlowShop.h>
-00022 // how to initialize the population
-00023 #include <do/make_pop.h>
-00024 // the stopping criterion
-00025 #include <do/make_continue_moeo.h>
-00026 // outputs (stats, population dumps, ...)
-00027 #include <do/make_checkpoint_moeo.h>
-00028 // evolution engine (selection and replacement)
-00029 #include <do/make_ea_moeo.h>
-00030 // simple call to the algo
-00031 #include <do/make_run.h>
-00032 // checks for help demand, and writes the status file and make_help; in libutils
-00033 void make_help(eoParser & _parser);
-00034 // definition of the representation
-00035 #include <FlowShop.h>
-00036 
+
FlowShopEA.cpp
00001 /* 
+00002 * <FlowShopEA.cpp>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
 00037 
-00038 using namespace std;
-00039 
-00040 
-00041 int main(int argc, char* argv[])
-00042 {
-00043     try
-00044     {
-00045     
-00046         eoParser parser(argc, argv);  // for user-parameter reading
-00047         eoState state;                // to keep all things allocated
-00048 
-00049 
-00050         /*** the representation-dependent things ***/
-00051 
-00052         // The fitness evaluation
-00053         eoEvalFuncCounter<FlowShop>& eval = do_make_eval(parser, state);
-00054         // the genotype (through a genotype initializer)
-00055         eoInit<FlowShop>& init = do_make_genotype(parser, state);
-00056         // the variation operators
-00057         eoGenOp<FlowShop>& op = do_make_op(parser, state);
-00058 
-00059 
-00060         /*** the representation-independent things ***/
+00038 
+00039 // moeo general include
+00040 #include <moeo>
+00041 // for the creation of an evaluator
+00042 #include <make_eval_FlowShop.h>
+00043 // for the creation of an initializer
+00044 #include <make_genotype_FlowShop.h>
+00045 // for the creation of the variation operators
+00046 #include <make_op_FlowShop.h>
+00047 // how to initialize the population
+00048 #include <do/make_pop.h>
+00049 // the stopping criterion
+00050 #include <do/make_continue_moeo.h>
+00051 // outputs (stats, population dumps, ...)
+00052 #include <do/make_checkpoint_moeo.h>
+00053 // evolution engine (selection and replacement)
+00054 #include <do/make_ea_moeo.h>
+00055 // simple call to the algo
+00056 #include <do/make_run.h>
+00057 // checks for help demand, and writes the status file and make_help; in libutils
+00058 void make_help(eoParser & _parser);
+00059 // definition of the representation
+00060 #include <FlowShop.h>
 00061 
-00062         // initialization of the population
-00063         eoPop<FlowShop>& pop = do_make_pop(parser, state, init);
-00064         // definition of the archive
-00065         moeoArchive<FlowShop> arch;
-00066         // stopping criteria
-00067         eoContinue<FlowShop>& term = do_make_continue_moeo(parser, state, eval);
-00068         // output
-00069         eoCheckPoint<FlowShop>& checkpoint = do_make_checkpoint_moeo(parser, state, eval, term, pop, arch);
-00070         // algorithm
-00071         eoAlgo<FlowShop>& algo = do_make_ea_moeo(parser, state, eval, checkpoint, op, arch);
-00072 
+00062 
+00063 using namespace std;
+00064 
+00065 
+00066 int main(int argc, char* argv[])
+00067 {
+00068     try
+00069     {
+00070     
+00071         eoParser parser(argc, argv);  // for user-parameter reading
+00072         eoState state;                // to keep all things allocated
 00073 
-00074         /*** Go ! ***/
-00075 
-00076         // help ?
-00077         make_help(parser);
-00078 
-00079         // first evalution
-00080         apply<FlowShop>(eval, pop);
-00081 
-00082         // printing of the initial population
-00083         cout << "Initial Population\n";
-00084         pop.sortedPrintOn(cout);
-00085         cout << endl;
+00074 
+00075         /*** the representation-dependent things ***/
+00076 
+00077         // The fitness evaluation
+00078         eoEvalFuncCounter<FlowShop>& eval = do_make_eval(parser, state);
+00079         // the genotype (through a genotype initializer)
+00080         eoInit<FlowShop>& init = do_make_genotype(parser, state);
+00081         // the variation operators
+00082         eoGenOp<FlowShop>& op = do_make_op(parser, state);
+00083 
+00084 
+00085         /*** the representation-independent things ***/
 00086 
-00087         // run the algo
-00088         do_run(algo, pop);
-00089 
-00090         // printing of the final population
-00091         cout << "Final Population\n";
-00092         pop.sortedPrintOn(cout);
-00093         cout << endl;
-00094 
-00095         // printing of the final archive
-00096         cout << "Final Archive\n";
-00097         arch.sortedPrintOn(cout);
-00098         cout << endl;
-00099 
+00087         // initialization of the population
+00088         eoPop<FlowShop>& pop = do_make_pop(parser, state, init);
+00089         // definition of the archive
+00090         moeoArchive<FlowShop> arch;
+00091         // stopping criteria
+00092         eoContinue<FlowShop>& term = do_make_continue_moeo(parser, state, eval);
+00093         // output
+00094         eoCheckPoint<FlowShop>& checkpoint = do_make_checkpoint_moeo(parser, state, eval, term, pop, arch);
+00095         // algorithm
+00096         eoAlgo<FlowShop>& algo = do_make_ea_moeo(parser, state, eval, checkpoint, op, arch);
+00097 
+00098 
+00099         /*** Go ! ***/
 00100 
-00101     }
-00102     catch (exception& e)
-00103     {
-00104         cout << e.what() << endl;
-00105     }
-00106     return EXIT_SUCCESS;
-00107 }
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00101         // help ?
+00102         make_help(parser);
+00103 
+00104         // first evalution
+00105         apply<FlowShop>(eval, pop);
+00106 
+00107         // printing of the initial population
+00108         cout << "Initial Population\n";
+00109         pop.sortedPrintOn(cout);
+00110         cout << endl;
+00111 
+00112         // run the algo
+00113         do_run(algo, pop);
+00114 
+00115         // printing of the final population
+00116         cout << "Final Population\n";
+00117         pop.sortedPrintOn(cout);
+00118         cout << endl;
+00119 
+00120         // printing of the final archive
+00121         cout << "Final Archive\n";
+00122         arch.sortedPrintOn(cout);
+00123         cout << endl;
+00124 
+00125 
+00126     }
+00127     catch (exception& e)
+00128     {
+00129         cout << e.what() << endl;
+00130     }
+00131     return EXIT_SUCCESS;
+00132 }
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopEval_8cpp-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopEval_8cpp-source.html index 57ea467ec..8827eb366 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopEval_8cpp-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopEval_8cpp-source.html @@ -21,71 +21,96 @@ -

FlowShopEval.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopEval.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 <FlowShopEval.h>
-00014 
-00015 
-00016 FlowShopEval::FlowShopEval(unsigned int _M, unsigned int _N, const std::vector< std::vector<unsigned int> > & _p, const std::vector<unsigned int> & _d) :
-00017         M(_M), N (_N), p(_p), d(_d)
-00018 {}
-00019 
-00020 
-00021 void FlowShopEval::operator()(FlowShop & _flowshop)
-00022 {
-00023     FlowShopObjectiveVector objVector;
-00024     objVector[0] = makespan(_flowshop);
-00025     objVector[1] = tardiness(_flowshop);
-00026     _flowshop.objectiveVector(objVector);
-00027 }
-00028 
-00029 
-00030 
-00031 double FlowShopEval::makespan(const FlowShop & _flowshop)
-00032 {
-00033     // completion times computation for each job on each machine
-00034     // C[i][j] = completion of the jth job of the scheduling on the ith machine
-00035     std::vector< std::vector<unsigned int> > C = completionTime(_flowshop);
-00036     return C[M-1][_flowshop[N-1]];
-00037 }
-00038 
+
FlowShopEval.cpp
00001 /* 
+00002 * <FlowShopEval.cpp>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #include <FlowShopEval.h>
 00039 
-00040 double FlowShopEval::tardiness(const FlowShop & _flowshop)
-00041 {
-00042     // completion times computation for each job on each machine
-00043     // C[i][j] = completion of the jth job of the scheduling on the ith machine
-00044     std::vector< std::vector<unsigned int> > C = completionTime(_flowshop);
-00045     // tardiness computation
-00046     unsigned int long sum = 0;
-00047     for (unsigned int j=0 ; j<N ; j++)
-00048         sum += (unsigned int) std::max (0, (int) (C[M-1][_flowshop[j]] - d[_flowshop[j]]));
-00049     return sum;
-00050 }
-00051 
-00052 
-00053 std::vector< std::vector<unsigned int> > FlowShopEval::completionTime(const FlowShop & _flowshop) {
-00054     std::vector< std::vector<unsigned int> > C(M,N);
-00055     C[0][_flowshop[0]] = p[0][_flowshop[0]];
-00056     for (unsigned int j=1; j<N; j++)
-00057         C[0][_flowshop[j]] = C[0][_flowshop[j-1]] + p[0][_flowshop[j]];
-00058     for (unsigned int i=1; i<M; i++)
-00059         C[i][_flowshop[0]] = C[i-1][_flowshop[0]] + p[i][_flowshop[0]];
-00060     for (unsigned int i=1; i<M; i++)
-00061         for (unsigned int j=1; j<N; j++)
-00062             C[i][_flowshop[j]] = std::max(C[i][_flowshop[j-1]], C[i-1][_flowshop[j]]) + p[i][_flowshop[j]];
-00063     return C;
-00064 }
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00040 
+00041 FlowShopEval::FlowShopEval(unsigned int _M, unsigned int _N, const std::vector< std::vector<unsigned int> > & _p, const std::vector<unsigned int> & _d) :
+00042         M(_M), N (_N), p(_p), d(_d)
+00043 {}
+00044 
+00045 
+00046 void FlowShopEval::operator()(FlowShop & _flowshop)
+00047 {
+00048     FlowShopObjectiveVector objVector;
+00049     objVector[0] = makespan(_flowshop);
+00050     objVector[1] = tardiness(_flowshop);
+00051     _flowshop.objectiveVector(objVector);
+00052 }
+00053 
+00054 
+00055 
+00056 double FlowShopEval::makespan(const FlowShop & _flowshop)
+00057 {
+00058     // completion times computation for each job on each machine
+00059     // C[i][j] = completion of the jth job of the scheduling on the ith machine
+00060     std::vector< std::vector<unsigned int> > C = completionTime(_flowshop);
+00061     return C[M-1][_flowshop[N-1]];
+00062 }
+00063 
+00064 
+00065 double FlowShopEval::tardiness(const FlowShop & _flowshop)
+00066 {
+00067     // completion times computation for each job on each machine
+00068     // C[i][j] = completion of the jth job of the scheduling on the ith machine
+00069     std::vector< std::vector<unsigned int> > C = completionTime(_flowshop);
+00070     // tardiness computation
+00071     unsigned int long sum = 0;
+00072     for (unsigned int j=0 ; j<N ; j++)
+00073         sum += (unsigned int) std::max (0, (int) (C[M-1][_flowshop[j]] - d[_flowshop[j]]));
+00074     return sum;
+00075 }
+00076 
+00077 
+00078 std::vector< std::vector<unsigned int> > FlowShopEval::completionTime(const FlowShop & _flowshop) {
+00079     std::vector< std::vector<unsigned int> > C(M,N);
+00080     C[0][_flowshop[0]] = p[0][_flowshop[0]];
+00081     for (unsigned int j=1; j<N; j++)
+00082         C[0][_flowshop[j]] = C[0][_flowshop[j-1]] + p[0][_flowshop[j]];
+00083     for (unsigned int i=1; i<M; i++)
+00084         C[i][_flowshop[0]] = C[i-1][_flowshop[0]] + p[i][_flowshop[0]];
+00085     for (unsigned int i=1; i<M; i++)
+00086         for (unsigned int j=1; j<N; j++)
+00087             C[i][_flowshop[j]] = std::max(C[i][_flowshop[j-1]], C[i-1][_flowshop[j]]) + p[i][_flowshop[j]];
+00088     return C;
+00089 }
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopEval_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopEval_8h-source.html index 89f92434f..5e572e2af 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopEval_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopEval_8h-source.html @@ -21,55 +21,80 @@ -

FlowShopEval.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopEval.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 FLOWSHOPEVAL_H_
-00014 #define FLOWSHOPEVAL_H_
-00015 
-00016 #include <vector>
-00017 #include <core/moeoEvalFunc.h>
-00018 #include <FlowShop.h>
-00019 
-00023 class FlowShopEval : public moeoEvalFunc<FlowShop>
-00024 {
-00025 public:
-00026 
-00034     FlowShopEval(unsigned int _M, unsigned int _N, const std::vector< std::vector<unsigned int> > & _p, const std::vector<unsigned int> & _d);
-00035 
-00036 
-00041     void operator()(FlowShop & _flowshop);
-00042 
-00043 
-00044 private:
-00045 
-00047     unsigned int M;
-00049     unsigned int N;
-00051     std::vector< std::vector < unsigned int > > p;
-00053     std::vector < unsigned int > d;
-00054 
-00055 
-00060     double makespan(const FlowShop & _flowshop);
+
FlowShopEval.h
00001 /* 
+00002 * <FlowShopEval.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef FLOWSHOPEVAL_H_
+00039 #define FLOWSHOPEVAL_H_
+00040 
+00041 #include <vector>
+00042 #include <core/moeoEvalFunc.h>
+00043 #include <FlowShop.h>
+00044 
+00048 class FlowShopEval : public moeoEvalFunc<FlowShop>
+00049 {
+00050 public:
+00051 
+00059     FlowShopEval(unsigned int _M, unsigned int _N, const std::vector< std::vector<unsigned int> > & _p, const std::vector<unsigned int> & _d);
+00060 
 00061 
-00062 
-00067     double tardiness(const FlowShop & _flowshop);
+00066     void operator()(FlowShop & _flowshop);
+00067 
 00068 
-00069 
-00075     std::vector< std::vector<unsigned int> > completionTime (const FlowShop & _flowshop);
-00076 
-00077 };
-00078 
-00079 #endif /*FLOWSHOPEVAL_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00069 private:
+00070 
+00072     unsigned int M;
+00074     unsigned int N;
+00076     std::vector< std::vector < unsigned int > > p;
+00078     std::vector < unsigned int > d;
+00079 
+00080 
+00085     double makespan(const FlowShop & _flowshop);
+00086 
+00087 
+00092     double tardiness(const FlowShop & _flowshop);
+00093 
+00094 
+00100     std::vector< std::vector<unsigned int> > completionTime (const FlowShop & _flowshop);
+00101 
+00102 };
+00103 
+00104 #endif /*FLOWSHOPEVAL_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopInit_8cpp-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopInit_8cpp-source.html index 517100d66..9a0806156 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopInit_8cpp-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopInit_8cpp-source.html @@ -21,46 +21,71 @@ -

FlowShopInit.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopInit.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 <FlowShopInit.h>
-00014 
-00015 
-00016 FlowShopInit::FlowShopInit(unsigned int _N) : N(_N)
-00017 {}
-00018 
-00019 
-00020 void FlowShopInit::operator()(FlowShop & _flowshop)
-00021 {
-00022     // scheduling vector
-00023     std::vector<unsigned int> scheduling(N);
-00024     // initialisation of possible values
-00025     std::vector<unsigned int> possibles(N);
-00026     for (unsigned int i=0 ; i<N ; i++)
-00027         possibles[i] = i;
-00028     // random initialization
-00029     unsigned int rInd;     // random index
-00030     for (unsigned int i=0; i<N; i++)
-00031     {
-00032         rInd = (unsigned int) rng.uniform(N-i);
-00033         scheduling[i] = possibles[rInd];
-00034         possibles[rInd] = possibles[N-i-1];
-00035     }
-00036     _flowshop.resize(N);
-00037     _flowshop.value(scheduling);
-00038     _flowshop.invalidate();        // IMPORTANT in case the _genotype is old
-00039 }
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

FlowShopInit.cpp

00001 /* 
+00002 * <FlowShopInit.cpp>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #include <FlowShopInit.h>
+00039 
+00040 
+00041 FlowShopInit::FlowShopInit(unsigned int _N) : N(_N)
+00042 {}
+00043 
+00044 
+00045 void FlowShopInit::operator()(FlowShop & _flowshop)
+00046 {
+00047     // scheduling vector
+00048     std::vector<unsigned int> scheduling(N);
+00049     // initialisation of possible values
+00050     std::vector<unsigned int> possibles(N);
+00051     for (unsigned int i=0 ; i<N ; i++)
+00052         possibles[i] = i;
+00053     // random initialization
+00054     unsigned int rInd;     // random index
+00055     for (unsigned int i=0; i<N; i++)
+00056     {
+00057         rInd = (unsigned int) rng.uniform(N-i);
+00058         scheduling[i] = possibles[rInd];
+00059         possibles[rInd] = possibles[N-i-1];
+00060     }
+00061     _flowshop.resize(N);
+00062     _flowshop.value(scheduling);
+00063     _flowshop.invalidate();        // IMPORTANT in case the _genotype is old
+00064 }
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopInit_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopInit_8h-source.html index a2f0e2d18..3cfab3a08 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopInit_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopInit_8h-source.html @@ -21,42 +21,67 @@ -

FlowShopInit.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopInit.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 FLOWSHOPINIT_H_
-00014 #define FLOWSHOPINIT_H_
-00015 
-00016 #include <eoInit.h>
-00017 #include <FlowShop.h>
-00018 
-00022 class FlowShopInit : public eoInit<FlowShop>
-00023 {
-00024 public:
-00025 
-00030     FlowShopInit(unsigned int _N);
-00031 
-00032 
-00037     void operator()(FlowShop & _flowshop);
-00038 
-00039 
-00040 private:
-00041 
-00043     unsigned int N;
-00044 
-00045 };
-00046 
-00047 #endif /*FLOWSHOPINIT_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

FlowShopInit.h

00001 /* 
+00002 * <FlowShopInit.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef FLOWSHOPINIT_H_
+00039 #define FLOWSHOPINIT_H_
+00040 
+00041 #include <eoInit.h>
+00042 #include <FlowShop.h>
+00043 
+00047 class FlowShopInit : public eoInit<FlowShop>
+00048 {
+00049 public:
+00050 
+00055     FlowShopInit(unsigned int _N);
+00056 
+00057 
+00062     void operator()(FlowShop & _flowshop);
+00063 
+00064 
+00065 private:
+00066 
+00068     unsigned int N;
+00069 
+00070 };
+00071 
+00072 #endif /*FLOWSHOPINIT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopObjectiveVectorTraits_8cpp-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopObjectiveVectorTraits_8cpp-source.html index e2151de10..3da305325 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopObjectiveVectorTraits_8cpp-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopObjectiveVectorTraits_8cpp-source.html @@ -21,39 +21,64 @@ -

FlowShopObjectiveVectorTraits.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopObjectiveVectorTraits.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 <FlowShopObjectiveVectorTraits.h>
-00014 
-00015 
-00016 bool FlowShopObjectiveVectorTraits::minimizing (int _i)
-00017 {
-00018     // minimizing both
-00019     return true;
-00020 }
-00021 
-00022 bool FlowShopObjectiveVectorTraits::maximizing (int _i)
-00023 {
-00024     // minimizing both
-00025     return false;
-00026 }
-00027 
-00028 unsigned int FlowShopObjectiveVectorTraits::nObjectives ()
-00029 {
-00030     // 2 objectives
-00031     return 2;
-00032 }
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

FlowShopObjectiveVectorTraits.cpp

00001 /* 
+00002 * <FlowShopObjectiveVectorTraits.cpp>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #include <FlowShopObjectiveVectorTraits.h>
+00039 
+00040 
+00041 bool FlowShopObjectiveVectorTraits::minimizing (int _i)
+00042 {
+00043     // minimizing both
+00044     return true;
+00045 }
+00046 
+00047 bool FlowShopObjectiveVectorTraits::maximizing (int _i)
+00048 {
+00049     // minimizing both
+00050     return false;
+00051 }
+00052 
+00053 unsigned int FlowShopObjectiveVectorTraits::nObjectives ()
+00054 {
+00055     // 2 objectives
+00056     return 2;
+00057 }
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopObjectiveVectorTraits_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopObjectiveVectorTraits_8h-source.html index 019fc5f7c..b848bf91c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopObjectiveVectorTraits_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopObjectiveVectorTraits_8h-source.html @@ -21,39 +21,64 @@ -

FlowShopObjectiveVectorTraits.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopObjectiveVectorTraits.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 FLOWSHOPOBJECTIVEVECTORTRAITS_H_
-00014 #define FLOWSHOPOBJECTIVEVECTORTRAITS_H_
-00015 
-00016 #include <core/moeoObjectiveVectorTraits.h>
-00017 
-00021 class FlowShopObjectiveVectorTraits : public moeoObjectiveVectorTraits
-00022 {
-00023 public:
-00024 
-00029     static bool minimizing (int _i);
-00030 
-00031 
-00036     static bool maximizing (int _i);
+
FlowShopObjectiveVectorTraits.h
00001 /* 
+00002 * <FlowShopObjectiveVectorTraits.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
 00037 
-00038 
-00042     static unsigned int nObjectives ();
-00043 
-00044 };
-00045 
-00046 #endif /*FLOWSHOPOBJECTIVEVECTORTRAITS_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00038 #ifndef FLOWSHOPOBJECTIVEVECTORTRAITS_H_
+00039 #define FLOWSHOPOBJECTIVEVECTORTRAITS_H_
+00040 
+00041 #include <core/moeoObjectiveVectorTraits.h>
+00042 
+00046 class FlowShopObjectiveVectorTraits : public moeoObjectiveVectorTraits
+00047 {
+00048 public:
+00049 
+00054     static bool minimizing (int _i);
+00055 
+00056 
+00061     static bool maximizing (int _i);
+00062 
+00063 
+00067     static unsigned int nObjectives ();
+00068 
+00069 };
+00070 
+00071 #endif /*FLOWSHOPOBJECTIVEVECTORTRAITS_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopObjectiveVector_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopObjectiveVector_8h-source.html index 72287fcf6..75ca12a05 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopObjectiveVector_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopObjectiveVector_8h-source.html @@ -21,28 +21,53 @@ -

FlowShopObjectiveVector.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopObjectiveVector.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 FLOWSHOPOBJECTIVEVECTOR_H_
-00014 #define FLOWSHOPOBJECTIVEVECTOR_H_
-00015 
-00016 #include <core/moeoRealObjectiveVector.h>
-00017 #include <FlowShopObjectiveVectorTraits.h>
-00018 
-00022 typedef moeoRealObjectiveVector < FlowShopObjectiveVectorTraits > FlowShopObjectiveVector;
-00023 
-00024 #endif /*FLOWSHOPOBJECTIVEVECTOR_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

FlowShopObjectiveVector.h

00001 /* 
+00002 * <FlowShopObjectiveVector.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef FLOWSHOPOBJECTIVEVECTOR_H_
+00039 #define FLOWSHOPOBJECTIVEVECTOR_H_
+00040 
+00041 #include <core/moeoRealObjectiveVector.h>
+00042 #include <FlowShopObjectiveVectorTraits.h>
+00043 
+00047 typedef moeoRealObjectiveVector < FlowShopObjectiveVectorTraits > FlowShopObjectiveVector;
+00048 
+00049 #endif /*FLOWSHOPOBJECTIVEVECTOR_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpCrossoverQuad_8cpp-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpCrossoverQuad_8cpp-source.html index d043498ed..8e135cf54 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpCrossoverQuad_8cpp-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpCrossoverQuad_8cpp-source.html @@ -21,91 +21,116 @@ -

FlowShopOpCrossoverQuad.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopOpCrossoverQuad.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 <FlowShopOpCrossoverQuad.h>
-00014 
-00015 
-00016 std::string FlowShopOpCrossoverQuad::className() const
-00017 {
-00018     return "FlowShopOpCrossoverQuad";
-00019 }
-00020 
-00021 
-00022 bool FlowShopOpCrossoverQuad::operator()(FlowShop & _flowshop1, FlowShop & _flowshop2)
-00023 {
-00024     bool oneAtLeastIsModified;
-00025     // computation of the 2 random points
-00026     unsigned int point1, point2;
-00027     do
-00028     {
-00029         point1 =  rng.random(std::min(_flowshop1.size(), _flowshop2.size()));
-00030         point2 =  rng.random(std::min(_flowshop1.size(), _flowshop2.size()));
-00031     } while (fabs((double) point1-point2) <= 2);
-00032     // computation of the offspring
-00033     FlowShop offspring1 = generateOffspring(_flowshop1, _flowshop2, point1, point2);
-00034     FlowShop offspring2 = generateOffspring(_flowshop2, _flowshop1, point1, point2);
-00035     // does at least one genotype has been modified ?
-00036     if ((_flowshop1 != offspring1) || (_flowshop2 != offspring2))
-00037     {
-00038         // update
-00039         _flowshop1.value(offspring1);
-00040         _flowshop2.value(offspring2);
-00041         // at least one genotype has been modified
-00042         oneAtLeastIsModified = true;
-00043     }
-00044     else
-00045     {
-00046         // no genotype has been modified
-00047         oneAtLeastIsModified = false;
-00048     }
-00049     // return 'true' if at least one genotype has been modified
-00050     return oneAtLeastIsModified;
-00051 }
-00052 
-00053 
-00054 FlowShop FlowShopOpCrossoverQuad::generateOffspring(const FlowShop & _parent1, const FlowShop & _parent2, unsigned int _point1, unsigned int _point2)
-00055 {
-00056     FlowShop result = _parent1;
-00057     std::vector<bool> taken_values(result.size(), false);
-00058     if (_point1 > _point2)
-00059         std::swap(_point1, _point2);
-00060     /* first parent */
-00061     for (unsigned int i=0 ; i<=_point1 ; i++)
+
FlowShopOpCrossoverQuad.cpp
00001 /* 
+00002 * <FlowShopOpCrossoverQuad.cpp>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #include <FlowShopOpCrossoverQuad.h>
+00039 
+00040 
+00041 std::string FlowShopOpCrossoverQuad::className() const
+00042 {
+00043     return "FlowShopOpCrossoverQuad";
+00044 }
+00045 
+00046 
+00047 bool FlowShopOpCrossoverQuad::operator()(FlowShop & _flowshop1, FlowShop & _flowshop2)
+00048 {
+00049     bool oneAtLeastIsModified;
+00050     // computation of the 2 random points
+00051     unsigned int point1, point2;
+00052     do
+00053     {
+00054         point1 =  rng.random(std::min(_flowshop1.size(), _flowshop2.size()));
+00055         point2 =  rng.random(std::min(_flowshop1.size(), _flowshop2.size()));
+00056     } while (fabs((double) point1-point2) <= 2);
+00057     // computation of the offspring
+00058     FlowShop offspring1 = generateOffspring(_flowshop1, _flowshop2, point1, point2);
+00059     FlowShop offspring2 = generateOffspring(_flowshop2, _flowshop1, point1, point2);
+00060     // does at least one genotype has been modified ?
+00061     if ((_flowshop1 != offspring1) || (_flowshop2 != offspring2))
 00062     {
-00063         // result[i] == _parent1[i]
-00064         taken_values[_parent1[i]] = true;
-00065     }
-00066     for (unsigned int i=_point2 ; i<result.size() ; i++)
-00067     {
-00068         // result[i] == _parent1[i]
-00069         taken_values[_parent1[i]] = true;
-00070     }
-00071     /* second parent */
-00072     unsigned int i = _point1+1;
-00073     unsigned int j = 0;
-00074     while (i<_point2 && j<_parent2.size())
-00075     {
-00076         if (! taken_values[_parent2[j]])
-00077         {
-00078             result[i] = _parent2[j];
-00079             i++;
-00080         }
-00081         j++;
-00082     }
-00083     return result;
-00084 }
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00063         // update
+00064         _flowshop1.value(offspring1);
+00065         _flowshop2.value(offspring2);
+00066         // at least one genotype has been modified
+00067         oneAtLeastIsModified = true;
+00068     }
+00069     else
+00070     {
+00071         // no genotype has been modified
+00072         oneAtLeastIsModified = false;
+00073     }
+00074     // return 'true' if at least one genotype has been modified
+00075     return oneAtLeastIsModified;
+00076 }
+00077 
+00078 
+00079 FlowShop FlowShopOpCrossoverQuad::generateOffspring(const FlowShop & _parent1, const FlowShop & _parent2, unsigned int _point1, unsigned int _point2)
+00080 {
+00081     FlowShop result = _parent1;
+00082     std::vector<bool> taken_values(result.size(), false);
+00083     if (_point1 > _point2)
+00084         std::swap(_point1, _point2);
+00085     /* first parent */
+00086     for (unsigned int i=0 ; i<=_point1 ; i++)
+00087     {
+00088         // result[i] == _parent1[i]
+00089         taken_values[_parent1[i]] = true;
+00090     }
+00091     for (unsigned int i=_point2 ; i<result.size() ; i++)
+00092     {
+00093         // result[i] == _parent1[i]
+00094         taken_values[_parent1[i]] = true;
+00095     }
+00096     /* second parent */
+00097     unsigned int i = _point1+1;
+00098     unsigned int j = 0;
+00099     while (i<_point2 && j<_parent2.size())
+00100     {
+00101         if (! taken_values[_parent2[j]])
+00102         {
+00103             result[i] = _parent2[j];
+00104             i++;
+00105         }
+00106         j++;
+00107     }
+00108     return result;
+00109 }
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpCrossoverQuad_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpCrossoverQuad_8h-source.html index 3e74236d7..55dede705 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpCrossoverQuad_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpCrossoverQuad_8h-source.html @@ -21,42 +21,67 @@ -

FlowShopOpCrossoverQuad.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopOpCrossoverQuad.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 FLOWSHOPOPCROSSOVERQUAD_H_
-00014 #define FLOWSHOPOPCROSSOVERQUAD_H_
-00015 
-00016 #include <eoOp.h>
-00017 #include <FlowShop.h>
-00018 
-00022 class FlowShopOpCrossoverQuad : public eoQuadOp < FlowShop >
-00023 {
-00024 public:
-00025 
-00029     std::string className() const;
-00030 
-00031 
-00037     bool operator()(FlowShop & _flowshop1, FlowShop & _flowshop2);
-00038 
-00039 
-00040 private:
-00041 
-00049     FlowShop generateOffspring(const FlowShop & _parent1, const FlowShop & _parent2, unsigned int _point1, unsigned int _point2);
+
FlowShopOpCrossoverQuad.h
00001 /* 
+00002 * <FlowShopOpCrossoverQuad.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef FLOWSHOPOPCROSSOVERQUAD_H_
+00039 #define FLOWSHOPOPCROSSOVERQUAD_H_
+00040 
+00041 #include <eoOp.h>
+00042 #include <FlowShop.h>
+00043 
+00047 class FlowShopOpCrossoverQuad : public eoQuadOp < FlowShop >
+00048 {
+00049 public:
 00050 
-00051 };
-00052 
-00053 #endif /*FLOWSHOPOPCROSSOVERQUAD_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00054     std::string className() const;
+00055 
+00056 
+00062     bool operator()(FlowShop & _flowshop1, FlowShop & _flowshop2);
+00063 
+00064 
+00065 private:
+00066 
+00074     FlowShop generateOffspring(const FlowShop & _parent1, const FlowShop & _parent2, unsigned int _point1, unsigned int _point2);
+00075 
+00076 };
+00077 
+00078 #endif /*FLOWSHOPOPCROSSOVERQUAD_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationExchange_8cpp-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationExchange_8cpp-source.html index b1bb51814..67644e0a6 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationExchange_8cpp-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationExchange_8cpp-source.html @@ -21,57 +21,82 @@ -

FlowShopOpMutationExchange.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopOpCrossoverQuad.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 <FlowShopOpMutationExchange.h>
-00014 
-00015 
-00016 std::string FlowShopOpMutationExchange::className() const
-00017 {
-00018     return "FlowShopOpMutationExchange";
-00019 }
-00020 
-00021 
-00022 bool FlowShopOpMutationExchange::operator()(FlowShop & _flowshop)
-00023 {
-00024     bool isModified;
-00025     FlowShop result = _flowshop;
-00026     // computation of the 2 random points
-00027     unsigned int point1, point2;
-00028     do
-00029     {
-00030         point1 = rng.random(result.size());
-00031         point2 = rng.random(result.size());
-00032     } while (point1 == point2);
-00033     // swap
-00034     std::swap (result[point1], result[point2]);
-00035     // update (if necessary)
-00036     if (result != _flowshop)
-00037     {
-00038         // update
-00039         _flowshop.value(result);
-00040         // the genotype has been modified
-00041         isModified = true;
-00042     }
-00043     else
-00044     {
-00045         // the genotype has not been modified
-00046         isModified = false;
-00047     }
-00048     // return 'true' if the genotype has been modified
-00049     return isModified;
-00050 }
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

FlowShopOpMutationExchange.cpp

00001 /* 
+00002 * <FlowShopOpMutationExchange.cpp>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #include <FlowShopOpMutationExchange.h>
+00039 
+00040 
+00041 std::string FlowShopOpMutationExchange::className() const
+00042 {
+00043     return "FlowShopOpMutationExchange";
+00044 }
+00045 
+00046 
+00047 bool FlowShopOpMutationExchange::operator()(FlowShop & _flowshop)
+00048 {
+00049     bool isModified;
+00050     FlowShop result = _flowshop;
+00051     // computation of the 2 random points
+00052     unsigned int point1, point2;
+00053     do
+00054     {
+00055         point1 = rng.random(result.size());
+00056         point2 = rng.random(result.size());
+00057     } while (point1 == point2);
+00058     // swap
+00059     std::swap (result[point1], result[point2]);
+00060     // update (if necessary)
+00061     if (result != _flowshop)
+00062     {
+00063         // update
+00064         _flowshop.value(result);
+00065         // the genotype has been modified
+00066         isModified = true;
+00067     }
+00068     else
+00069     {
+00070         // the genotype has not been modified
+00071         isModified = false;
+00072     }
+00073     // return 'true' if the genotype has been modified
+00074     return isModified;
+00075 }
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationExchange_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationExchange_8h-source.html index 36e594109..ebcc2916c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationExchange_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationExchange_8h-source.html @@ -21,37 +21,62 @@ -

FlowShopOpMutationExchange.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopOpCrossoverQuad.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 FLOWSHOPOPMUTATIONEXCHANGE_H_
-00014 #define FLOWSHOPOPMUTATIONEXCHANGE_H_
-00015 
-00016 #include <eoOp.h>
-00017 #include <FlowShop.h>
-00018 
-00022 class FlowShopOpMutationExchange : public eoMonOp<FlowShop>
-00023 {
-00024 public:
-00025 
-00029     std::string className() const;
-00030 
-00031 
-00036     bool operator()(FlowShop & _flowshop);
+
FlowShopOpMutationExchange.h
00001 /* 
+00002 * <FlowShopOpMutationExchange.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
 00037 
-00038 };
-00039 
-00040 #endif /*FLOWSHOPOPMUTATIONEXCHANGE_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00038 #ifndef FLOWSHOPOPMUTATIONEXCHANGE_H_
+00039 #define FLOWSHOPOPMUTATIONEXCHANGE_H_
+00040 
+00041 #include <eoOp.h>
+00042 #include <FlowShop.h>
+00043 
+00047 class FlowShopOpMutationExchange : public eoMonOp<FlowShop>
+00048 {
+00049 public:
+00050 
+00054     std::string className() const;
+00055 
+00056 
+00061     bool operator()(FlowShop & _flowshop);
+00062 
+00063 };
+00064 
+00065 #endif /*FLOWSHOPOPMUTATIONEXCHANGE_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationShift_8cpp-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationShift_8cpp-source.html index 4d8cc7198..2737ebc7c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationShift_8cpp-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationShift_8cpp-source.html @@ -21,67 +21,92 @@ -

FlowShopOpMutationShift.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopOpMutationShift.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 <FlowShopOpMutationShift.h>
-00014 
-00015 
-00016 std::string FlowShopOpMutationShift::className() const
-00017 {
-00018     return "FlowShopOpMutationShift";
-00019 }
-00020 
-00021 
-00022 bool FlowShopOpMutationShift::operator()(FlowShop & _flowshop)
-00023 {
-00024     bool isModified;
-00025     int direction;
-00026     unsigned int tmp;
-00027     FlowShop result = _flowshop;
-00028     // computation of the 2 random points
-00029     unsigned int point1, point2;
-00030     do
-00031     {
-00032         point1 = rng.random(result.size());
-00033         point2 = rng.random(result.size());
-00034     } while (point1 == point2);
-00035     // direction
-00036     if (point1 < point2)
-00037         direction = 1;
-00038     else
-00039         direction = -1;
-00040     // mutation
-00041     tmp = result[point1];
-00042     for (unsigned int i=point1 ; i!=point2 ; i+=direction)
-00043         result[i] = result[i+direction];
-00044     result[point2] = tmp;
-00045     // update (if necessary)
-00046     if (result != _flowshop)
-00047     {
-00048         // update
-00049         _flowshop.value(result);
-00050         // the genotype has been modified
-00051         isModified = true;
-00052     }
-00053     else
-00054     {
-00055         // the genotype has not been modified
-00056         isModified = false;
-00057     }
-00058     // return 'true' if the genotype has been modified
-00059     return isModified;
-00060 }
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

FlowShopOpMutationShift.cpp

00001 /* 
+00002 * <FlowShopOpMutationShift.cpp>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #include <FlowShopOpMutationShift.h>
+00039 
+00040 
+00041 std::string FlowShopOpMutationShift::className() const
+00042 {
+00043     return "FlowShopOpMutationShift";
+00044 }
+00045 
+00046 
+00047 bool FlowShopOpMutationShift::operator()(FlowShop & _flowshop)
+00048 {
+00049     bool isModified;
+00050     int direction;
+00051     unsigned int tmp;
+00052     FlowShop result = _flowshop;
+00053     // computation of the 2 random points
+00054     unsigned int point1, point2;
+00055     do
+00056     {
+00057         point1 = rng.random(result.size());
+00058         point2 = rng.random(result.size());
+00059     } while (point1 == point2);
+00060     // direction
+00061     if (point1 < point2)
+00062         direction = 1;
+00063     else
+00064         direction = -1;
+00065     // mutation
+00066     tmp = result[point1];
+00067     for (unsigned int i=point1 ; i!=point2 ; i+=direction)
+00068         result[i] = result[i+direction];
+00069     result[point2] = tmp;
+00070     // update (if necessary)
+00071     if (result != _flowshop)
+00072     {
+00073         // update
+00074         _flowshop.value(result);
+00075         // the genotype has been modified
+00076         isModified = true;
+00077     }
+00078     else
+00079     {
+00080         // the genotype has not been modified
+00081         isModified = false;
+00082     }
+00083     // return 'true' if the genotype has been modified
+00084     return isModified;
+00085 }
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationShift_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationShift_8h-source.html index da9808f6f..ce8fc53a2 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationShift_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShopOpMutationShift_8h-source.html @@ -21,37 +21,62 @@ -

FlowShopOpMutationShift.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShopOpMutationShift.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 FLOWSHOPOPMUTATIONSHIFT_H_
-00014 #define FLOWSHOPOPMUTATIONSHIFT_H_
-00015 
-00016 #include <eoOp.h>
-00017 #include <FlowShop.h>
-00018 
-00022 class FlowShopOpMutationShift : public eoMonOp < FlowShop >
-00023 {
-00024 public:
-00025 
-00029     std::string className() const;
-00030 
-00031 
-00036     bool operator()(FlowShop & _flowshop);
+
FlowShopOpMutationShift.h
00001 /* 
+00002 * <FlowShopOpMutationShift.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
 00037 
-00038 };
-00039 
-00040 #endif /*FLOWSHOPOPMUTATIONSHIFT_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00038 #ifndef FLOWSHOPOPMUTATIONSHIFT_H_
+00039 #define FLOWSHOPOPMUTATIONSHIFT_H_
+00040 
+00041 #include <eoOp.h>
+00042 #include <FlowShop.h>
+00043 
+00047 class FlowShopOpMutationShift : public eoMonOp < FlowShop >
+00048 {
+00049 public:
+00050 
+00054     std::string className() const;
+00055 
+00056 
+00061     bool operator()(FlowShop & _flowshop);
+00062 
+00063 };
+00064 
+00065 #endif /*FLOWSHOPOPMUTATIONSHIFT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShop_8cpp-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShop_8cpp-source.html index 30cfded2e..31ad1231f 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShop_8cpp-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShop_8cpp-source.html @@ -21,25 +21,50 @@ -

FlowShop.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShop.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 <FlowShop.h>
-00014 
-00015 std::string FlowShop::className() const
-00016 {
-00017     return "FlowShop";
-00018 }
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

FlowShop.cpp

00001 /* 
+00002 * <FlowShop.cpp>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #include <FlowShop.h>
+00039 
+00040 std::string FlowShop::className() const
+00041 {
+00042     return "FlowShop";
+00043 }
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShop_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShop_8h-source.html index 10873c602..3d592fea2 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShop_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/FlowShop_8h-source.html @@ -21,34 +21,59 @@ -

FlowShop.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // FlowShop.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 FLOWSHOP_H_
-00014 #define FLOWSHOP_H_
-00015 
-00016 #include <core/moeoVector.h>
-00017 #include <FlowShopObjectiveVector.h>
-00018 
-00022 class FlowShop: public moeoVector < FlowShopObjectiveVector , double , double , unsigned int >
-00023 {
-00024 public:
-00025 
-00029     std::string className() const;
-00030 
-00031 };
-00032 
-00033 #endif /*FLOWSHOP_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

FlowShop.h

00001 /* 
+00002 * <FlowShop.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef FLOWSHOP_H_
+00039 #define FLOWSHOP_H_
+00040 
+00041 #include <core/moeoVector.h>
+00042 #include <FlowShopObjectiveVector.h>
+00043 
+00047 class FlowShop: public moeoVector < FlowShopObjectiveVector , double , double , unsigned int >
+00048 {
+00049 public:
+00050 
+00054     std::string className() const;
+00055 
+00056 };
+00057 
+00058 #endif /*FLOWSHOP_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/MOEO_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/MOEO_8h-source.html index b60c3cb26..b09c2dbc5 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/MOEO_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/MOEO_8h-source.html @@ -21,209 +21,234 @@ -

MOEO.h

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:
+
MOEO.h
00001 /* 
+00002 * <MOEO.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
 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 
+00038 #ifndef MOEO_H_
+00039 #define MOEO_H_
+00040 
+00041 #include <iostream>
+00042 #include <stdexcept>
+00043 #include <string>
+00044 #include <EO.h>
+00045 
+00058 template < class MOEOObjectiveVector, class MOEOFitness, class MOEODiversity >
+00059 class MOEO : public EO < MOEOObjectiveVector >
+00060 {
+00061 public:
+00062 
+00064     typedef MOEOObjectiveVector ObjectiveVector;
+00065 
+00067     typedef MOEOFitness Fitness;
+00068 
+00070     typedef MOEODiversity Diversity;
+00071 
+00072 
+00076     MOEO()
+00077     {
+00078         // default values for every parameters
+00079         objectiveVectorValue = ObjectiveVector();
+00080         fitnessValue = Fitness();
+00081         diversityValue = Diversity();
+00082         // invalidate all
+00083         invalidate();
+00084     }
+00085 
+00086 
+00090     virtual ~MOEO() {};
 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 
+00092 
+00096     ObjectiveVector objectiveVector() const
+00097     {
+00098         if ( invalidObjectiveVector() )
+00099         {
+00100             throw std::runtime_error("invalid objective vector in MOEO");
+00101         }
+00102         return objectiveVectorValue;
+00103     }
+00104 
+00105 
+00110     void objectiveVector(const ObjectiveVector & _objectiveVectorValue)
+00111     {
+00112         objectiveVectorValue = _objectiveVectorValue;
+00113         invalidObjectiveVectorValue = false;
+00114     }
+00115 
+00116 
+00120     void invalidateObjectiveVector()
+00121     {
+00122         invalidObjectiveVectorValue = true;
+00123     }
+00124 
+00125 
+00129     bool invalidObjectiveVector() const
+00130     {
+00131         return invalidObjectiveVectorValue;
+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 
+00134 
+00138     Fitness fitness() const
+00139     {
+00140         if ( invalidFitness() )
+00141         {
+00142             throw std::runtime_error("invalid fitness in MOEO");
+00143         }
+00144         return fitnessValue;
+00145     }
+00146 
+00147 
+00152     void fitness(const Fitness & _fitnessValue)
+00153     {
+00154         fitnessValue = _fitnessValue;
+00155         invalidFitnessValue = false;
+00156     }
+00157 
+00158 
+00162     void invalidateFitness()
+00163     {
+00164         invalidFitnessValue = true;
+00165     }
+00166 
+00167 
+00171     bool invalidFitness() const
+00172     {
+00173         return invalidFitnessValue;
+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     }
+00176 
+00180     Diversity diversity() const
+00181     {
+00182         if ( invalidDiversity() )
+00183         {
+00184             throw std::runtime_error("invalid diversity in MOEO");
+00185         }
+00186         return diversityValue;
+00187     }
+00188 
+00189 
+00194     void diversity(const Diversity & _diversityValue)
+00195     {
+00196         diversityValue = _diversityValue;
+00197         invalidDiversityValue = false;
+00198     }
+00199 
+00200 
+00204     void invalidateDiversity()
+00205     {
+00206         invalidDiversityValue = true;
+00207     }
+00208 
+00209 
+00213     bool invalidDiversity() const
+00214     {
+00215         return invalidDiversityValue;
+00216     }
+00217 
+00218 
+00222     void invalidate()
+00223     {
+00224         invalidateObjectiveVector();
+00225         invalidateFitness();
+00226         invalidateDiversity();
+00227     }
+00228 
+00229 
+00233     bool invalid() const
+00234     {
+00235         return invalidObjectiveVector();
+00236     }
+00237 
+00238 
+00245     bool operator<(const MOEO & _other) const
+00246     {
+00247         return objectiveVector() < _other.objectiveVector();
+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:
+00254     virtual std::string className() const
+00255     {
+00256         return "MOEO";
+00257     }
+00258 
+00259 
+00264     virtual void printOn(std::ostream & _os) const
+00265     {
+00266         if ( invalidObjectiveVector() )
+00267         {
+00268             _os << "INVALID\t";
+00269         }
+00270         else
+00271         {
+00272             _os << objectiveVectorValue << '\t';
+00273         }
+00274     }
 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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00276 
+00281     virtual void readFrom(std::istream & _is)
+00282     {
+00283         std::string objectiveVector_str;
+00284         int pos = _is.tellg();
+00285         _is >> objectiveVector_str;
+00286         if (objectiveVector_str == "INVALID")
+00287         {
+00288             invalidateObjectiveVector();
+00289         }
+00290         else
+00291         {
+00292             invalidObjectiveVectorValue = false;
+00293             _is.seekg(pos); // rewind
+00294             _is >> objectiveVectorValue;
+00295         }
+00296     }
+00297 
+00298 
+00299 private:
+00300 
+00302     ObjectiveVector objectiveVectorValue;
+00304     bool invalidObjectiveVectorValue;
+00306     Fitness fitnessValue;
+00308     bool invalidFitnessValue;
+00310     Diversity diversityValue;
+00312     bool invalidDiversityValue;
+00313 
+00314 };
+00315 
+00316 #endif /*MOEO_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/README-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/README-source.html index fbf74993d..7c54fa962 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/README-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/README-source.html @@ -101,7 +101,7 @@ 00078 ======================================================================= 00079 00080 Mailing list : paradiseo-help@lists.gforge.inria.fr -
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/Sch1_8cpp-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/Sch1_8cpp-source.html index 95e3646b8..f1a990436 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/Sch1_8cpp-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/Sch1_8cpp-source.html @@ -21,114 +21,139 @@ -

Sch1.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // Sch1.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 <stdio.h>
-00014 #include <moeo>
-00015 #include <es/eoRealInitBounded.h>
-00016 #include <es/eoRealOp.h>
-00017 
-00018 using namespace std;
-00019 
-00020 // the moeoObjectiveVectorTraits : minimizing 2 objectives
-00021 class Sch1ObjectiveVectorTraits : public moeoObjectiveVectorTraits
-00022 {
-00023 public:
-00024     static bool minimizing (int i)
-00025     {
-00026         return true;
-00027     }
-00028     static bool maximizing (int i)
-00029     {
-00030         return false;
-00031     }
-00032     static unsigned int nObjectives ()
-00033     {
-00034         return 2;
-00035     }
-00036 };
+
Sch1.cpp
00001 /* 
+00002 * <Sch1.cpp>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Abdelhakim Deneche
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
 00037 
-00038 
-00039 // objective vector of real values
-00040 typedef moeoRealObjectiveVector < Sch1ObjectiveVectorTraits > Sch1ObjectiveVector;
-00041 
+00038 #include <stdio.h>
+00039 #include <moeo>
+00040 #include <es/eoRealInitBounded.h>
+00041 #include <es/eoRealOp.h>
 00042 
-00043 // multi-objective evolving object for the Sch1 problem
-00044 class Sch1 : public moeoRealVector < Sch1ObjectiveVector, double, double >
-00045 {
-00046 public:
-00047     Sch1() : moeoRealVector < Sch1ObjectiveVector, double, double > (1) {}
-00048 };
-00049 
-00050 
-00051 // evaluation of objective functions
-00052 class Sch1Eval : public moeoEvalFunc < Sch1 >
-00053 {
-00054 public:
-00055     void operator () (Sch1 & _sch1)
-00056     {
-00057         if (_sch1.invalidObjectiveVector())
-00058         {
-00059             Sch1ObjectiveVector objVec;
-00060             double x = _sch1[0];
-00061             objVec[0] = x * x;
-00062             objVec[1] = (x - 2.0) * (x - 2.0);
-00063             _sch1.objectiveVector(objVec);
-00064         }
-00065     }
-00066 };
+00043 using namespace std;
+00044 
+00045 // the moeoObjectiveVectorTraits : minimizing 2 objectives
+00046 class Sch1ObjectiveVectorTraits : public moeoObjectiveVectorTraits
+00047 {
+00048 public:
+00049     static bool minimizing (int i)
+00050     {
+00051         return true;
+00052     }
+00053     static bool maximizing (int i)
+00054     {
+00055         return false;
+00056     }
+00057     static unsigned int nObjectives ()
+00058     {
+00059         return 2;
+00060     }
+00061 };
+00062 
+00063 
+00064 // objective vector of real values
+00065 typedef moeoRealObjectiveVector < Sch1ObjectiveVectorTraits > Sch1ObjectiveVector;
+00066 
 00067 
-00068 
-00069 // main
-00070 int main (int argc, char *argv[])
-00071 {
-00072     // parameters
-00073     unsigned int POP_SIZE = 20;
-00074     unsigned int MAX_GEN = 100;
-00075     double M_EPSILON = 0.01;
-00076     double P_CROSS = 0.25;
-00077     double P_MUT = 0.35;
-00078 
-00079     // objective functions evaluation
-00080     Sch1Eval eval;
-00081 
-00082     // crossover and mutation
-00083     eoQuadCloneOp < Sch1 > xover;
-00084     eoUniformMutation < Sch1 > mutation (M_EPSILON);
-00085 
-00086     // generate initial population
-00087     eoRealVectorBounds bounds (1, 0.0, 2.0);    // [0, 2]
-00088     eoRealInitBounded < Sch1 > init (bounds);
-00089     eoPop < Sch1 > pop (POP_SIZE, init);
-00090 
-00091     // build NSGA-II
-00092     moeoNSGAII < Sch1 > nsgaII (MAX_GEN, eval, xover, P_CROSS, mutation, P_MUT);
+00068 // multi-objective evolving object for the Sch1 problem
+00069 class Sch1 : public moeoRealVector < Sch1ObjectiveVector, double, double >
+00070 {
+00071 public:
+00072     Sch1() : moeoRealVector < Sch1ObjectiveVector, double, double > (1) {}
+00073 };
+00074 
+00075 
+00076 // evaluation of objective functions
+00077 class Sch1Eval : public moeoEvalFunc < Sch1 >
+00078 {
+00079 public:
+00080     void operator () (Sch1 & _sch1)
+00081     {
+00082         if (_sch1.invalidObjectiveVector())
+00083         {
+00084             Sch1ObjectiveVector objVec;
+00085             double x = _sch1[0];
+00086             objVec[0] = x * x;
+00087             objVec[1] = (x - 2.0) * (x - 2.0);
+00088             _sch1.objectiveVector(objVec);
+00089         }
+00090     }
+00091 };
+00092 
 00093 
-00094     // run the algo
-00095     nsgaII (pop);
-00096 
-00097     // extract first front of the final population using an moeoArchive (this is the output of nsgaII)
-00098     moeoArchive < Sch1 > arch;
-00099     arch.update (pop);
-00100 
-00101     // printing of the final archive
-00102     cout << "Final Archive" << endl;
-00103     arch.sortedPrintOn (cout);
-00104     cout << endl;
-00105 
-00106     return EXIT_SUCCESS;
-00107 }
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by 
+00094 // main
+00095 int main (int argc, char *argv[])
+00096 {
+00097     // parameters
+00098     unsigned int POP_SIZE = 20;
+00099     unsigned int MAX_GEN = 100;
+00100     double M_EPSILON = 0.01;
+00101     double P_CROSS = 0.25;
+00102     double P_MUT = 0.35;
+00103 
+00104     // objective functions evaluation
+00105     Sch1Eval eval;
+00106 
+00107     // crossover and mutation
+00108     eoQuadCloneOp < Sch1 > xover;
+00109     eoUniformMutation < Sch1 > mutation (M_EPSILON);
+00110 
+00111     // generate initial population
+00112     eoRealVectorBounds bounds (1, 0.0, 2.0);    // [0, 2]
+00113     eoRealInitBounded < Sch1 > init (bounds);
+00114     eoPop < Sch1 > pop (POP_SIZE, init);
+00115 
+00116     // build NSGA-II
+00117     moeoNSGAII < Sch1 > nsgaII (MAX_GEN, eval, xover, P_CROSS, mutation, P_MUT);
+00118 
+00119     // run the algo
+00120     nsgaII (pop);
+00121 
+00122     // extract first front of the final population using an moeoArchive (this is the output of nsgaII)
+00123     moeoArchive < Sch1 > arch;
+00124     arch.update (pop);
+00125 
+00126     // printing of the final archive
+00127     cout << "Final Archive" << endl;
+00128     arch.sortedPrintOn (cout);
+00129     cout << endl;
+00130 
+00131     return EXIT_SUCCESS;
+00132 }
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/annotated.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/annotated.html index c6cedd040..71f4b1523 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/annotated.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/annotated.html @@ -86,14 +86,10 @@ 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 - moeoIBMOLS< MOEOT, Move >Indicator-Based Multi-Objective Local Search (IBMOLS) as described in Basseur M., Burke K - moeoIBMOLS< MOEOT, Move >::OneObjectiveComparator moeoIndicatorBasedFitnessAssignment< MOEOT >MoeoIndicatorBasedFitnessAssignment is a moeoFitnessAssignment for Indicator-based strategies - moeoIteratedIBMOLS< MOEOT, Move >Iterated version of IBMOLS as described in Basseur M., Burke K 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 moeoMetricBase class for performance metrics (also known as quality indicators) - moeoMoveIncrEval< Move > 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 @@ -108,7 +104,6 @@ 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 - moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >Fitness assignment sheme based a Reference Point and a Quality Indicator 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 @@ -123,12 +118,11 @@ 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) - peoEA< EOT >The peoEA class offers an elementary evolutionary algorithm implementation Sch1 Sch1Eval Sch1ObjectiveVectorTraits -
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/classFlowShop-members.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/classFlowShop-members.html index 5a213f39c..25054a87b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/classFlowShop-members.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/classFlowShop-members.html @@ -79,7 +79,7 @@ ~eoPersistent()eoPersistent [virtual] ~eoPrintable()eoPrintable [virtual] ~MOEO()MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity > [inline, virtual] -
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/classFlowShop.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/classFlowShop.html index 095edf912..9c871a975 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/classFlowShop.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/classFlowShop.html @@ -56,9 +56,9 @@ Structure of the genotype for the flow-shop scheduling problem: a vector of unsi

-Definition at line 22 of file FlowShop.h.

The documentation for this class was generated from the following files: -

moeoArchive.h

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     }
+
moeoArchive.h
00001 /* 
+00002 * <moeoArchive.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Sebastien Cahon, Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOARCHIVE_H_
+00039 #define MOEOARCHIVE_H_
+00040 
+00041 #include <eoPop.h>
+00042 #include <comparator/moeoObjectiveVectorComparator.h>
+00043 #include <comparator/moeoParetoObjectiveVectorComparator.h>
+00044 
+00048 template < class MOEOT >
+00049 class moeoArchive : public eoPop < MOEOT >
+00050 {
+00051 public:
+00052 
+00053     using eoPop < MOEOT > :: size;
+00054     using eoPop < MOEOT > :: operator[];
+00055     using eoPop < MOEOT > :: back;
+00056     using eoPop < MOEOT > :: pop_back;
+00057 
+00058 
+00062     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+00063 
+00064 
+00069     moeoArchive() : eoPop < MOEOT >(), comparator(paretoComparator)
+00070     {}
+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();
+00077     moeoArchive(moeoObjectiveVectorComparator < ObjectiveVector > & _comparator) : eoPop < MOEOT >(), comparator(_comparator)
+00078     {}
+00079 
+00080 
+00085     bool dominates (const ObjectiveVector & _objectiveVector) const
+00086     {
+00087         for (unsigned int i = 0; i<size(); i++)
+00088         {
+00089             // if _objectiveVector is dominated by the ith individual of the archive...
+00090             if ( comparator(_objectiveVector, operator[](i).objectiveVector()) )
+00091             {
+00092                 return true;
+00093             }
+00094         }
+00095         return false;
+00096     }
+00097 
+00098 
+00103     bool contains (const ObjectiveVector & _objectiveVector) const
+00104     {
+00105         for (unsigned int i = 0; i<size(); i++)
+00106         {
+00107             if (operator[](i).objectiveVector() == _objectiveVector)
+00108             {
+00109                 return true;
 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 
+00111         }
+00112         return false;
+00113     }
+00114 
+00115 
+00120     void update (const MOEOT & _moeo)
+00121     {
+00122         // first step: removing the dominated solutions from the archive
+00123         for (unsigned int j=0; j<size();)
+00124         {
+00125             // if the jth solution contained in the archive is dominated by _moeo
+00126             if ( comparator(operator[](j).objectiveVector(), _moeo.objectiveVector()) )
+00127             {
+00128                 operator[](j) = back();
+00129                 pop_back();
+00130             }
+00131             else if (_moeo.objectiveVector() == operator[](j).objectiveVector())
+00132             {
+00133                 operator[](j) = back();
+00134                 pop_back();
+00135             }
+00136             else
+00137             {
+00138                 j++;
+00139             }
+00140         }
+00141         // second step: is _moeo dominated?
+00142         bool dom = false;
+00143         for (unsigned int j=0; j<size(); j++)
+00144         {
+00145             // if _moeo is dominated by the jth solution contained in the archive
+00146             if ( comparator(_moeo.objectiveVector(), operator[](j).objectiveVector()) )
+00147             {
+00148                 dom = true;
+00149                 break;
+00150             }
+00151         }
+00152         if (!dom)
+00153         {
+00154             push_back(_moeo);
+00155         }
+00156     }
+00157 
+00158 
+00163     void update (const eoPop < MOEOT > & _pop)
+00164     {
+00165         for (unsigned int i=0; i<_pop.size(); i++)
+00166         {
+00167             update(_pop[i]);
+00168         }
+00169     }
 00170 
-00171 private:
-00172 
-00174     moeoObjectiveVectorComparator < ObjectiveVector > & comparator;
-00176     moeoParetoObjectiveVectorComparator < ObjectiveVector > paretoComparator;
-00177 
-00178 };
-00179 
-00180 #endif /*MOEOARCHIVE_H_ */
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00171 
+00176     bool equals (const moeoArchive < MOEOT > & _arch)
+00177     {
+00178         for (unsigned int i=0; i<size(); i++)
+00179         {
+00180             if (! _arch.contains(operator[](i).objectiveVector()))
+00181             {
+00182                 return false;
+00183             }
+00184         }
+00185         for (unsigned int i=0; i<_arch.size() ; i++)
+00186         {
+00187             if (! contains(_arch[i].objectiveVector()))
+00188             {
+00189                 return false;
+00190             }
+00191         }
+00192         return true;
+00193     }
+00194 
+00195 
+00196 private:
+00197 
+00199     moeoObjectiveVectorComparator < ObjectiveVector > & comparator;
+00201     moeoParetoObjectiveVectorComparator < ObjectiveVector > paretoComparator;
+00202 
+00203 };
+00204 
+00205 #endif /*MOEOARCHIVE_H_ */
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoBinaryIndicatorBasedFitnessAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoBinaryIndicatorBasedFitnessAssignment_8h-source.html index 97549ebcf..b27b4fd2a 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoBinaryIndicatorBasedFitnessAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoBinaryIndicatorBasedFitnessAssignment_8h-source.html @@ -21,37 +21,62 @@ -

moeoBinaryIndicatorBasedFitnessAssignment.h

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 public:
-00025 
-00027     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
-00028 
-00029 
-00036     virtual double updateByAdding(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) = 0;
+
moeoBinaryIndicatorBasedFitnessAssignment.h
00001 /* 
+00002 * <moeoBinaryIndicatorBasedFitnessAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
 00037 
-00038 };
-00039 
-00040 #endif /*MOEOINDICATORBASEDFITNESSASSIGNMENT_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00038 #ifndef MOEOBINARYINDICATORBASEDFITNESSASSIGNMENT_H_
+00039 #define MOEOBINARYINDICATORBASEDFITNESSASSIGNMENT_H_
+00040 
+00041 #include <fitness/moeoIndicatorBasedFitnessAssignment.h>
+00042 
+00046 template < class MOEOT >
+00047 class moeoBinaryIndicatorBasedFitnessAssignment : public moeoIndicatorBasedFitnessAssignment < MOEOT >
+00048 {
+00049 public:
+00050 
+00052     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+00053 
+00054 
+00061     virtual double updateByAdding(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) = 0;
+00062 
+00063 };
+00064 
+00065 #endif /*MOEOINDICATORBASEDFITNESSASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoBinaryMetricSavingUpdater_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoBinaryMetricSavingUpdater_8h-source.html index e9693b9bc..804624cc8 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoBinaryMetricSavingUpdater_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoBinaryMetricSavingUpdater_8h-source.html @@ -21,77 +21,102 @@ -

moeoBinaryMetricSavingUpdater.h

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     }
+
moeoBinaryMetricSavingUpdater.h
00001 /* 
+00002 * <moeoBinaryMetricSavingUpdater.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Sebastien Cahon, Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOBINARYMETRICSAVINGUPDATER_H_
+00039 #define MOEOBINARYMETRICSAVINGUPDATER_H_
+00040 
+00041 #include <fstream>
+00042 #include <string>
+00043 #include <vector>
+00044 #include <eoPop.h>
+00045 #include <utils/eoUpdater.h>
+00046 #include <metric/moeoMetric.h>
+00047 
+00052 template < class MOEOT >
+00053 class moeoBinaryMetricSavingUpdater : public eoUpdater
+00054 {
+00055 public:
+00056 
+00058     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+00059 
+00060 
+00067     moeoBinaryMetricSavingUpdater (moeoVectorVsVectorBinaryMetric < ObjectiveVector, double > & _metric, const eoPop < MOEOT > & _pop, std::string _filename) :
+00068             metric(_metric), pop(_pop), filename(_filename), counter(1)
+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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00075     void operator()() {
+00076         if (pop.size()) {
+00077             if (firstGen) {
+00078                 firstGen = false;
+00079             }
+00080             else {
+00081                 // creation of the two Pareto sets
+00082                 std::vector < ObjectiveVector > from;
+00083                 std::vector < ObjectiveVector > to;
+00084                 for (unsigned int i=0; i<pop.size(); i++)
+00085                     from.push_back(pop[i].objectiveVector());
+00086                 for (unsigned int i=0 ; i<oldPop.size(); i++)
+00087                     to.push_back(oldPop[i].objectiveVector());
+00088                 // writing the result into the file
+00089                 std::ofstream f (filename.c_str(), std::ios::app);
+00090                 f << counter++ << ' ' << metric(from,to) << std::endl;
+00091                 f.close();
+00092             }
+00093             oldPop = pop;
+00094         }
+00095     }
+00096 
+00097 
+00098 private:
+00099 
+00101     moeoVectorVsVectorBinaryMetric < ObjectiveVector, double > & metric;
+00103     const eoPop < MOEOT > & pop;
+00105     eoPop< MOEOT > oldPop;
+00107     std::string filename;
+00109     bool firstGen;
+00111     unsigned int counter;
+00112 
+00113 };
+00114 
+00115 #endif /*MOEOBINARYMETRICSAVINGUPDATER_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoBitVector_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoBitVector_8h-source.html index 3a5f2b8f6..6306124c2 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoBitVector_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoBitVector_8h-source.html @@ -21,71 +21,96 @@ -

moeoBitVector.h

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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

moeoBitVector.h

00001 /* 
+00002 * <moeoBitVector.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOBITVECTOR_H_
+00039 #define MOEOBITVECTOR_H_
+00040 
+00041 #include <core/moeoVector.h>
+00042 
+00046 template < class MOEOObjectiveVector, class MOEOFitness, class MOEODiversity >
+00047 class moeoBitVector : public moeoVector < MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool >
+00048 {
+00049 public:
+00050 
+00051     using moeoVector < MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool > :: begin;
+00052     using moeoVector < MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool > :: end;
+00053     using moeoVector < MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool > :: resize;
+00054     using moeoVector < MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool > :: size;
+00055 
+00056 
+00062     moeoBitVector(unsigned int _size = 0, bool _value = false) : moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool >(_size, _value)
+00063     {}
+00064 
+00065 
+00069     virtual std::string className() const
+00070     {
+00071         return "moeoBitVector";
+00072     }
+00073     
+00074     
+00079     virtual void printOn(std::ostream & _os) const
+00080     {
+00081         MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity >::printOn(_os);
+00082         _os << ' ';
+00083         _os << size() << ' ';
+00084         std::copy(begin(), end(), std::ostream_iterator<bool>(_os));
+00085     }
+00086 
+00087 
+00092     virtual void readFrom(std::istream & _is)
+00093     {
+00094         MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity >::readFrom(_is);
+00095         unsigned int s;
+00096         _is >> s;
+00097         std::string bits;
+00098         _is >> bits;
+00099         if (_is)
+00100         {
+00101             resize(bits.size());
+00102             std::transform(bits.begin(), bits.end(), begin(), std::bind2nd(std::equal_to<char>(), '1'));
+00103         }
+00104     }
+00105 
+00106 };
+00107 
+00108 #endif /*MOEOBITVECTOR_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoCombinedLS_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoCombinedLS_8h-source.html index ce9aab383..bfcbc3d66 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoCombinedLS_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoCombinedLS_8h-source.html @@ -21,55 +21,80 @@ -

moeoCombinedLS.h

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     }
+
moeoCombinedLS.h
00001 /* 
+00002 * <moeoCombinedLS.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Sebastien Cahon, Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00038 #ifndef MOEOCOMBINEDLS_H_
+00039 #define MOEOCOMBINEDLS_H_
+00040 
+00041 #include <vector>
+00042 #include <algo/moeoLS.h>
+00043 #include <archive/moeoArchive.h>
+00044 
+00049 template < class MOEOT, class Type >
+00050 class moeoCombinedLS : public moeoLS < MOEOT, Type >
+00051 {
+00052 public:
+00053 
+00058     moeoCombinedLS(moeoLS < MOEOT, Type > & _first_mols)
+00059     {
+00060         combinedLS.push_back (& _first_mols);
+00061     }
+00062 
+00067     void add(moeoLS < MOEOT, Type > & _mols)
+00068     {
+00069         combinedLS.push_back(& _mols);
+00070     }
+00071 
+00078     void operator () (Type _type, moeoArchive < MOEOT > & _arch)
+00079     {
+00080         for (unsigned int i=0; i<combinedLS.size(); i++)
+00081             combinedLS[i] -> operator()(_type, _arch);
+00082     }
+00083 
+00084 
+00085 private:
+00086 
+00088     std::vector< moeoLS < MOEOT, Type > * >  combinedLS;
+00089 
+00090 };
+00091 
+00092 #endif /*MOEOCOMBINEDLS_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoComparator_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoComparator_8h-source.html index 1990027d0..331f42c66 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoComparator_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoComparator_8h-source.html @@ -21,28 +21,53 @@ -

moeoComparator.h

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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

moeoComparator.h

00001 /* 
+00002 * <moeoComparator.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOCOMPARATOR_H_
+00039 #define MOEOCOMPARATOR_H_
+00040 
+00041 #include <eoFunctor.h>
+00042 
+00046 template < class MOEOT >
+00047 class moeoComparator : public eoBF < const MOEOT &, const MOEOT &, const bool > {};
+00048 
+00049 #endif /*MOEOCOMPARATOR_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoContributionMetric_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoContributionMetric_8h-source.html index 89a19e7a0..beff31e33 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoContributionMetric_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoContributionMetric_8h-source.html @@ -21,89 +21,114 @@ -

moeoContributionMetric.h

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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

moeoContributionMetric.h

00001 /* 
+00002 * <moeoContributionMetric.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Sebastien Cahon, Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOCONTRIBUTIONMETRIC_H_
+00039 #define MOEOCONTRIBUTIONMETRIC_H_
+00040 
+00041 #include <comparator/moeoParetoObjectiveVectorComparator.h>
+00042 #include <metric/moeoMetric.h>
+00043 
+00048 template < class ObjectiveVector >
+00049 class moeoContributionMetric : public moeoVectorVsVectorBinaryMetric < ObjectiveVector, double >
+00050 {
+00051 public:
+00052 
+00058     double operator()(const std::vector < ObjectiveVector > & _set1, const std::vector < ObjectiveVector > & _set2) {
+00059         unsigned int c  = card_C(_set1, _set2);
+00060         unsigned int w1 = card_W(_set1, _set2);
+00061         unsigned int n1 = card_N(_set1, _set2);
+00062         unsigned int w2 = card_W(_set2, _set1);
+00063         unsigned int n2 = card_N(_set2, _set1);
+00064         return (double) (c / 2.0 + w1 + n1) / (c + w1 + n1 + w2 + n2);
+00065     }
+00066 
+00067 
+00068 private:
+00069 
+00071     moeoParetoObjectiveVectorComparator < ObjectiveVector > paretoComparator;
+00072     
+00073     
+00079     unsigned int card_C (const std::vector < ObjectiveVector > & _set1, const std::vector < ObjectiveVector > & _set2) {
+00080         unsigned int c=0;
+00081         for (unsigned int i=0; i<_set1.size(); i++)
+00082             for (unsigned int j=0; j<_set2.size(); j++)
+00083                 if (_set1[i] == _set2[j]) {
+00084                     c++;
+00085                     break;
+00086                 }
+00087         return c;
+00088     }
+00089 
+00090 
+00096     unsigned int card_W (const std::vector < ObjectiveVector > & _set1, const std::vector < ObjectiveVector > & _set2) {
+00097         unsigned int w=0;
+00098         for (unsigned int i=0; i<_set1.size(); i++)
+00099             for (unsigned int j=0; j<_set2.size(); j++)
+00100                 if (paretoComparator(_set2[j], _set1[i]))
+00101                 {
+00102                     w++;
+00103                     break;
+00104                 }
+00105         return w;
+00106     }
+00107 
+00108 
+00114     unsigned int card_N (const std::vector < ObjectiveVector > & _set1, const std::vector < ObjectiveVector > & _set2) {
+00115         unsigned int n=0;
+00116         for (unsigned int i=0; i<_set1.size(); i++) {
+00117             bool domin_rel = false;
+00118             for (unsigned int j=0; j<_set2.size(); j++)
+00119                 if ( (paretoComparator(_set2[j], _set1[i])) || (paretoComparator(_set1[i], _set2[j])) )
+00120                 {
+00121                     domin_rel = true;
+00122                     break;
+00123                 }
+00124             if (! domin_rel)
+00125                 n++;
+00126         }
+00127         return n;
+00128     }
+00129 
+00130 };
+00131 
+00132 #endif /*MOEOCONTRIBUTIONMETRIC_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoConvertPopToObjectiveVectors_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoConvertPopToObjectiveVectors_8h-source.html index 80a4fa7c6..5d9ad05cb 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoConvertPopToObjectiveVectors_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoConvertPopToObjectiveVectors_8h-source.html @@ -21,44 +21,69 @@ -

moeoConvertPopToObjectiveVectors.h

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 };
+
moeoConvertPopToObjectiveVectors.h
00001 /* 
+00002 * <moeoConvertPopToObjectiveVectors.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOPOPTOOBJECTIVEVECTORS_H_
+00039 #define MOEOPOPTOOBJECTIVEVECTORS_H_
+00040 
+00041 #include <vector>
+00042 #include <eoFunctor.h>
 00043 
-00044 #endif /*MOEOPOPTOOBJECTIVEVECTORS_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00047 template < class MOEOT, class ObjectiveVector = typename MOEOT::ObjectiveVector >
+00048 class moeoConvertPopToObjectiveVectors : public eoUF < const eoPop < MOEOT >, const std::vector < ObjectiveVector > >
+00049 {
+00050 public:
+00051 
+00056     const std::vector < ObjectiveVector > operator()(const eoPop < MOEOT > _pop)
+00057     {
+00058         std::vector < ObjectiveVector > result;
+00059         result.resize(_pop.size());
+00060         for (unsigned int i=0; i<_pop.size(); i++)
+00061         {
+00062             result.push_back(_pop[i].objectiveVector());
+00063         }
+00064         return result;
+00065     }
+00066 
+00067 };
+00068 
+00069 #endif /*MOEOPOPTOOBJECTIVEVECTORS_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoCriterionBasedFitnessAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoCriterionBasedFitnessAssignment_8h-source.html index ed4ed4ce6..8f7e3ef16 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoCriterionBasedFitnessAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoCriterionBasedFitnessAssignment_8h-source.html @@ -21,28 +21,53 @@ -

moeoCriterionBasedFitnessAssignment.h

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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

moeoCriterionBasedFitnessAssignment.h

00001 /* 
+00002 * <moeoCriterionBasedFitnessAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOCRITERIONBASEDFITNESSASSIGNMENT_H_
+00039 #define MOEOCRITERIONBASEDFITNESSASSIGNMENT_H_
+00040 
+00041 #include <fitness/moeoFitnessAssignment.h>
+00042 
+00046 template < class MOEOT >
+00047 class moeoCriterionBasedFitnessAssignment : public moeoFitnessAssignment < MOEOT > {};
+00048 
+00049 #endif /*MOEOCRITERIONBASEDFITNESSASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoCrowdingDiversityAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoCrowdingDiversityAssignment_8h-source.html index 94654b975..6896309fe 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoCrowdingDiversityAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoCrowdingDiversityAssignment_8h-source.html @@ -21,103 +21,128 @@ -

moeoCrowdingDiversityAssignment.h

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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

moeoCrowdingDiversityAssignment.h

00001 /* 
+00002 * <moeoCrowdingDiversityAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOCROWDINGDIVERSITYASSIGNMENT_H_
+00039 #define MOEOCROWDINGDIVERSITYASSIGNMENT_H_
+00040 
+00041 #include <eoPop.h>
+00042 #include <comparator/moeoOneObjectiveComparator.h>
+00043 #include <diversity/moeoDiversityAssignment.h>
+00044 
+00049 template < class MOEOT >
+00050 class moeoCrowdingDiversityAssignment : public moeoDiversityAssignment < MOEOT >
+00051 {
+00052 public:
+00053 
+00055     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+00056 
+00057 
+00061     double inf() const
+00062     {
+00063         return std::numeric_limits<double>::max();
+00064     }
+00065 
+00066 
+00070     double tiny() const
+00071     {
+00072         return 1e-6;
+00073     }
+00074 
+00075 
+00080     void operator()(eoPop < MOEOT > & _pop)
+00081     {
+00082         if (_pop.size() <= 2)
+00083         {
+00084             for (unsigned int i=0; i<_pop.size(); i++)
+00085             {
+00086                 _pop[i].diversity(inf());
+00087             }
+00088         }
+00089         else
+00090         {
+00091             setDistances(_pop);
+00092         }
+00093     }
+00094 
+00095 
+00103     void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec)
+00104     {
+00105         std::cout << "WARNING : updateByDeleting not implemented in moeoCrowdingDiversityAssignment" << std::endl;
+00106     }
+00107 
+00108 
+00109 protected:
+00110 
+00115     virtual void setDistances (eoPop < MOEOT > & _pop)
+00116     {
+00117         double min, max, distance;
+00118         unsigned int nObjectives = MOEOT::ObjectiveVector::nObjectives();
+00119         // set diversity to 0
+00120         for (unsigned int i=0; i<_pop.size(); i++)
+00121         {
+00122             _pop[i].diversity(0);
+00123         }
+00124         // for each objective
+00125         for (unsigned int obj=0; obj<nObjectives; obj++)
+00126         {
+00127             // comparator
+00128             moeoOneObjectiveComparator < MOEOT > objComp(obj);
+00129             // sort
+00130             std::sort(_pop.begin(), _pop.end(), objComp);
+00131             // min & max
+00132             min = _pop[0].objectiveVector()[obj];
+00133             max = _pop[_pop.size()-1].objectiveVector()[obj];
+00134             // set the diversity value to infiny for min and max
+00135             _pop[0].diversity(inf());
+00136             _pop[_pop.size()-1].diversity(inf());
+00137             for (unsigned int i=1; i<_pop.size()-1; i++)
+00138             {
+00139                 distance = (_pop[i+1].objectiveVector()[obj] - _pop[i-1].objectiveVector()[obj]) / (max-min);
+00140                 _pop[i].diversity(_pop[i].diversity() + distance);
+00141             }
+00142         }
+00143     }
+00144 
+00145 };
+00146 
+00147 #endif /*MOEOCROWDINGDIVERSITYASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDetTournamentSelect_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDetTournamentSelect_8h-source.html index d014eb1be..c13de3c90 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDetTournamentSelect_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDetTournamentSelect_8h-source.html @@ -21,71 +21,96 @@ -

moeoDetTournamentSelect.h

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_ */
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

moeoDetTournamentSelect.h

00001 /* 
+00002 * <moeoDetTournamentSelect.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEODETTOURNAMENTSELECT_H_
+00039 #define MOEODETTOURNAMENTSELECT_H_
+00040 
+00041 #include <comparator/moeoComparator.h>
+00042 #include <comparator/moeoFitnessThenDiversityComparator.h>
+00043 #include <selection/moeoSelectOne.h>
+00044 #include <selection/moeoSelectors.h>
+00045 
+00049 template < class MOEOT > class moeoDetTournamentSelect:public moeoSelectOne < MOEOT >
+00050 {
+00051 public:
+00052 
+00058     moeoDetTournamentSelect (moeoComparator < MOEOT > & _comparator, unsigned int _tSize = 2) : comparator (_comparator), tSize (_tSize)
+00059     {
+00060         // consistency check
+00061         if (tSize < 2)
+00062         {
+00063             std::
+00064             cout << "Warning, Tournament size should be >= 2\nAdjusted to 2\n";
+00065             tSize = 2;
+00066         }
+00067     }
+00068 
+00069 
+00074     moeoDetTournamentSelect (unsigned int _tSize = 2) : comparator (defaultComparator), tSize (_tSize)
+00075     {
+00076         // consistency check
+00077         if (tSize < 2)
+00078         {
+00079             std::
+00080             cout << "Warning, Tournament size should be >= 2\nAdjusted to 2\n";
+00081             tSize = 2;
+00082         }
+00083     }
+00084 
+00085 
+00090     const MOEOT & operator() (const eoPop < MOEOT > &_pop)
+00091     {
+00092         // use the selector
+00093         return mo_deterministic_tournament (_pop, tSize, comparator);
+00094     }
+00095 
+00096 
+00097 protected:
+00098 
+00100     moeoComparator < MOEOT > & comparator;
+00102     moeoFitnessThenDiversityComparator < MOEOT > defaultComparator;
+00104     unsigned int tSize;
+00105 
+00106 };
+00107 
+00108 #endif /*MOEODETTOURNAMENTSELECT_H_ */
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDistanceMatrix_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDistanceMatrix_8h-source.html index bd14fb035..ab02d1fe1 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDistanceMatrix_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDistanceMatrix_8h-source.html @@ -21,70 +21,95 @@ -

moeoDistanceMatrix.h

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:
+
moeoDistanceMatrix.h
00001 /* 
+00002 * <moeoDistanceMatrix.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEODISTANCEMATRIX_H_
+00039 #define MOEODISTANCEMATRIX_H_
+00040 
+00041 #include <vector>
+00042 #include <eoFunctor.h>
+00043 #include <distance/moeoDistance.h>
+00044 
+00048 template < class MOEOT , class Type >
+00049 class moeoDistanceMatrix : public eoUF < const eoPop < MOEOT > &, void > , public std::vector< std::vector < Type > >
+00050 {
+00051 public:
+00052 
+00053     using std::vector< std::vector < Type > > :: size;
+00054     using std::vector< std::vector < Type > > :: operator[];
+00055 
+00056 
+00062     moeoDistanceMatrix (unsigned int _size, moeoDistance < MOEOT , Type > & _distance) : distance(_distance)
+00063     {
+00064         this->resize(_size);
+00065         for (unsigned int i=0; i<_size; i++)
+00066         {
+00067             this->operator[](i).resize(_size);
+00068         }
+00069     }
 00070 
-00072     moeoDistance < MOEOT , Type > & distance;
-00073 
-00074 };
-00075 
-00076 #endif /*MOEODISTANCEMATRIX_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00071 
+00076     void operator()(const eoPop < MOEOT > & _pop)
+00077     {
+00078         // 1 - setup the bounds (if necessary)
+00079         distance.setup(_pop);
+00080         // 2 - compute distances
+00081         this->operator[](0).operator[](0) = Type();
+00082         for (unsigned int i=0; i<size(); i++)
+00083         {
+00084             this->operator[](i).operator[](i) = Type();
+00085             for (unsigned int j=0; j<i; j++)
+00086             {
+00087                 this->operator[](i).operator[](j) = distance(_pop[i], _pop[j]);
+00088                 this->operator[](j).operator[](i) = this->operator[](i).operator[](j);
+00089             }
+00090         }
+00091     }
+00092 
+00093 
+00094 private:
+00095 
+00097     moeoDistance < MOEOT , Type > & distance;
+00098 
+00099 };
+00100 
+00101 #endif /*MOEODISTANCEMATRIX_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDistance_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDistance_8h-source.html index 6c76c8180..a8a07dea0 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDistance_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDistance_8h-source.html @@ -21,43 +21,68 @@ -

moeoDistance.h

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     {}
+
moeoDistance.h
00001 /* 
+00002 * <moeoDistance.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEODISTANCE_H_
+00039 #define MOEODISTANCE_H_
+00040 
+00041 #include <eoFunctor.h>
 00042 
-00043 
-00049     virtual void setup(eoRealInterval _realInterval, unsigned int _obj)
-00050     {}
-00051 
-00052 };
-00053 
-00054 #endif /*MOEODISTANCE_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00046 template < class MOEOT , class Type >
+00047 class moeoDistance : public eoBF < const MOEOT &, const MOEOT &, const Type >
+00048 {
+00049 public:
+00050 
+00055     virtual void setup(const eoPop < MOEOT > & _pop)
+00056     {}
+00057 
+00058 
+00065     virtual void setup(double _min, double _max, unsigned int _obj)
+00066     {}
+00067 
+00068 
+00074     virtual void setup(eoRealInterval _realInterval, unsigned int _obj)
+00075     {}
+00076 
+00077 };
+00078 
+00079 #endif /*MOEODISTANCE_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDiversityAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDiversityAssignment_8h-source.html index d22ff9622..54ba98380 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDiversityAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDiversityAssignment_8h-source.html @@ -21,44 +21,69 @@ -

moeoDiversityAssignment.h

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;
+
moeoDiversityAssignment.h
00001 /* 
+00002 * <moeoDiversityAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
 00037 
-00038 
-00044     void updateByDeleting(eoPop < MOEOT > & _pop, MOEOT & _moeo)
-00045     {
-00046         updateByDeleting(_pop, _moeo.objectiveVector());
-00047     }
-00048 
-00049 };
-00050 
-00051 #endif /*MOEODIVERSITYASSIGNMENT_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00038 #ifndef MOEODIVERSITYASSIGNMENT_H_
+00039 #define MOEODIVERSITYASSIGNMENT_H_
+00040 
+00041 #include <eoFunctor.h>
+00042 #include <eoPop.h>
+00043 
+00047 template < class MOEOT >
+00048 class moeoDiversityAssignment : public eoUF < eoPop < MOEOT > &, void >
+00049 {
+00050 public:
+00051 
+00053     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+00054 
+00055 
+00061     virtual void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) = 0;
+00062 
+00063 
+00069     void updateByDeleting(eoPop < MOEOT > & _pop, MOEOT & _moeo)
+00070     {
+00071         updateByDeleting(_pop, _moeo.objectiveVector());
+00072     }
+00073 
+00074 };
+00075 
+00076 #endif /*MOEODIVERSITYASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDiversityThenFitnessComparator_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDiversityThenFitnessComparator_8h-source.html index 4a38fdb46..1e5c0b7b1 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDiversityThenFitnessComparator_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDiversityThenFitnessComparator_8h-source.html @@ -21,44 +21,69 @@ -

moeoDiversityThenFitnessComparator.h

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     }
+
moeoDiversityThenFitnessComparator.h
00001 /* 
+00002 * <moeoDiversityThenFitnessComparator.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEODIVERSITYTHENFITNESSCOMPARATOR_H_
+00039 #define MOEODIVERSITYTHENFITNESSCOMPARATOR_H_
+00040 
+00041 #include <comparator/moeoComparator.h>
 00042 
-00043 };
-00044 
-00045 #endif /*MOEODIVERSITYTHENFITNESSCOMPARATOR_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00046 template < class MOEOT >
+00047 class moeoDiversityThenFitnessComparator : public moeoComparator < MOEOT >
+00048 {
+00049 public:
+00050 
+00056     const bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2)
+00057     {
+00058         if (_moeo1.diversity() == _moeo2.diversity())
+00059         {
+00060             return _moeo1.fitness() < _moeo2.fitness();
+00061         }
+00062         else
+00063         {
+00064             return _moeo1.diversity() < _moeo2.diversity();
+00065         }
+00066     }
+00067 
+00068 };
+00069 
+00070 #endif /*MOEODIVERSITYTHENFITNESSCOMPARATOR_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDummyDiversityAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDummyDiversityAssignment_8h-source.html index c5749393e..f1b162462 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDummyDiversityAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDummyDiversityAssignment_8h-source.html @@ -21,53 +21,78 @@ -

moeoDummyDiversityAssignment.h

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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

moeoDummyDiversityAssignment.h

00001 /* 
+00002 * <moeoDummyDiversityAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEODUMMYDIVERSITYASSIGNMENT_H_
+00039 #define MOEODUMMYDIVERSITYASSIGNMENT_H_
+00040 
+00041 #include<diversity/moeoDiversityAssignment.h>
+00042 
+00046 template < class MOEOT >
+00047 class moeoDummyDiversityAssignment : public moeoDiversityAssignment < MOEOT >
+00048 {
+00049 public:
+00050 
+00052     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+00053 
+00054 
+00059     void operator () (eoPop < MOEOT > & _pop)
+00060     {
+00061         for (unsigned int idx = 0; idx<_pop.size (); idx++)
+00062         {
+00063             if (_pop[idx].invalidDiversity())
+00064             {
+00065                 // set the diversity to 0
+00066                 _pop[idx].diversity(0.0);
+00067             }
+00068         }
+00069     }
+00070 
+00071 
+00077     void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec)
+00078     {
+00079         // nothing to do...  ;-)
+00080     }
+00081 
+00082 };
+00083 
+00084 #endif /*MOEODUMMYDIVERSITYASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDummyFitnessAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDummyFitnessAssignment_8h-source.html index 4c1e3d2d5..7b433ac53 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDummyFitnessAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoDummyFitnessAssignment_8h-source.html @@ -21,53 +21,78 @@ -

moeoDummyFitnessAssignment.h

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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

moeoDummyFitnessAssignment.h

00001 /* 
+00002 * <moeoDummyFitnessAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEODUMMYFITNESSASSIGNMENT_H_
+00039 #define MOEODUMMYFITNESSASSIGNMENT_H_
+00040 
+00041 #include <fitness/moeoFitnessAssignment.h>
+00042 
+00046 template < class MOEOT >
+00047 class moeoDummyFitnessAssignment : public moeoFitnessAssignment < MOEOT >
+00048 {
+00049 public:
+00050 
+00052     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+00053 
+00054 
+00059     void operator () (eoPop < MOEOT > & _pop)
+00060     {
+00061         for (unsigned int idx = 0; idx<_pop.size (); idx++)
+00062         {
+00063             if (_pop[idx].invalidFitness())
+00064             {
+00065                 // set the diversity to 0
+00066                 _pop[idx].fitness(0.0);
+00067             }
+00068         }
+00069     }
+00070 
+00071 
+00077     void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec)
+00078     {
+00079         // nothing to do...  ;-)
+00080     }
+00081 
+00082 };
+00083 
+00084 #endif /*MOEODUMMYFITNESSASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEA_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEA_8h-source.html index 90cfef452..eaeae7718 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEA_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEA_8h-source.html @@ -21,29 +21,54 @@ -

moeoEA.h

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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

moeoEA.h

00001 /* 
+00002 * <moeoEA.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOEA_H_
+00039 #define MOEOEA_H_
+00040 
+00041 #include <eoAlgo.h>
+00042 #include <algo/moeoAlgo.h>
+00043 
+00047 template < class MOEOT >
+00048 class moeoEA : public moeoAlgo, public eoAlgo < MOEOT > {};
+00049 
+00050 #endif /*MOEOEA_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEasyEA_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEasyEA_8h-source.html index 6a05d5665..698bcf529 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEasyEA_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEasyEA_8h-source.html @@ -21,148 +21,173 @@ -

moeoEasyEA.h

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     {}
+
moeoEasyEA.h
00001 /* 
+00002 * <moeoEasyEA.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef _MOEOEASYEA_H
+00039 #define _MOEOEASYEA_H
+00040 
+00041 #include <apply.h>
+00042 #include <eoBreed.h>
+00043 #include <eoContinue.h>
+00044 #include <eoMergeReduce.h>
+00045 #include <eoPopEvalFunc.h>
+00046 #include <eoSelect.h>
+00047 #include <eoTransform.h>
+00048 #include <algo/moeoEA.h>
+00049 #include <diversity/moeoDiversityAssignment.h>
+00050 #include <diversity/moeoDummyDiversityAssignment.h>
+00051 #include <fitness/moeoFitnessAssignment.h>
+00052 #include <replacement/moeoReplacement.h>
 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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00057 template < class MOEOT >
+00058 class moeoEasyEA: public moeoEA < MOEOT >
+00059 {
+00060 public:
+00061 
+00072     moeoEasyEA(eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoBreed < MOEOT > & _breed, moeoReplacement < MOEOT > & _replace,
+00073                moeoFitnessAssignment < MOEOT > & _fitnessEval, moeoDiversityAssignment < MOEOT > & _diversityEval, bool _evalFitAndDivBeforeSelection = false)
+00074             :
+00075             continuator(_continuator), eval (_eval), loopEval(_eval), popEval(loopEval), selectTransform(dummySelect, dummyTransform), breed(_breed), mergeReduce(dummyMerge, dummyReduce), replace(_replace),
+00076             fitnessEval(_fitnessEval), diversityEval(_diversityEval), evalFitAndDivBeforeSelection(_evalFitAndDivBeforeSelection)
+00077     {}
+00078 
+00079 
+00090     moeoEasyEA(eoContinue < MOEOT > & _continuator, eoPopEvalFunc < MOEOT > & _popEval, eoBreed < MOEOT > & _breed, moeoReplacement < MOEOT > & _replace,
+00091                moeoFitnessAssignment < MOEOT > & _fitnessEval, moeoDiversityAssignment < MOEOT > & _diversityEval, bool _evalFitAndDivBeforeSelection = false)
+00092             :
+00093             continuator(_continuator), eval (dummyEval), loopEval(dummyEval), popEval(_popEval), selectTransform(dummySelect, dummyTransform), breed(_breed), mergeReduce(dummyMerge, dummyReduce), replace(_replace),
+00094             fitnessEval(_fitnessEval), diversityEval(_diversityEval), evalFitAndDivBeforeSelection(_evalFitAndDivBeforeSelection)
+00095     {}
+00096 
+00097 
+00109     moeoEasyEA(eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoBreed < MOEOT > & _breed, eoMerge < MOEOT > & _merge, eoReduce< MOEOT > & _reduce,
+00110                moeoFitnessAssignment < MOEOT > & _fitnessEval, moeoDiversityAssignment < MOEOT > & _diversityEval, bool _evalFitAndDivBeforeSelection = false)
+00111             :
+00112             continuator(_continuator), eval(_eval), loopEval(_eval), popEval(loopEval), selectTransform(dummySelect, dummyTransform), breed(_breed), mergeReduce(_merge,_reduce), replace(mergeReduce),
+00113             fitnessEval(_fitnessEval), diversityEval(_diversityEval), evalFitAndDivBeforeSelection(_evalFitAndDivBeforeSelection)
+00114     {}
+00115 
+00116 
+00128     moeoEasyEA(eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoSelect < MOEOT > & _select, eoTransform < MOEOT > & _transform, moeoReplacement < MOEOT > & _replace,
+00129                moeoFitnessAssignment < MOEOT > & _fitnessEval, moeoDiversityAssignment < MOEOT > & _diversityEval, bool _evalFitAndDivBeforeSelection = false)
+00130             :
+00131             continuator(_continuator), eval(_eval), loopEval(_eval), popEval(loopEval), selectTransform(_select, _transform), breed(selectTransform), mergeReduce(dummyMerge, dummyReduce), replace(_replace),
+00132             fitnessEval(_fitnessEval), diversityEval(_diversityEval), evalFitAndDivBeforeSelection(_evalFitAndDivBeforeSelection)
+00133     {}
+00134 
+00135 
+00148     moeoEasyEA(eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoSelect < MOEOT > & _select, eoTransform < MOEOT > & _transform, eoMerge < MOEOT > & _merge, eoReduce< MOEOT > & _reduce,
+00149                moeoFitnessAssignment < MOEOT > & _fitnessEval, moeoDiversityAssignment < MOEOT > & _diversityEval, bool _evalFitAndDivBeforeSelection = false)
+00150             :
+00151             continuator(_continuator), eval(_eval), loopEval(_eval), popEval(loopEval), selectTransform(_select, _transform), breed(selectTransform), mergeReduce(_merge,_reduce), replace(mergeReduce),
+00152             fitnessEval(_fitnessEval), diversityEval(_diversityEval), evalFitAndDivBeforeSelection(_evalFitAndDivBeforeSelection)
+00153     {}
+00154 
+00155 
+00160     virtual void operator()(eoPop < MOEOT > & _pop)
+00161     {
+00162         eoPop < MOEOT > offspring, empty_pop;
+00163         popEval(empty_pop, _pop); // A first eval of pop.
+00164         bool firstTime = true;
+00165         do
+00166         {
+00167             try
+00168             {
+00169                 unsigned int pSize = _pop.size();
+00170                 offspring.clear(); // new offspring
+00171                 // fitness and diversity assignment (if you want to or if it is the first generation)
+00172                 if (evalFitAndDivBeforeSelection || firstTime)
+00173                 {
+00174                     firstTime = false;
+00175                     fitnessEval(_pop);
+00176                     diversityEval(_pop);
+00177                 }
+00178                 breed(_pop, offspring);
+00179                 popEval(_pop, offspring); // eval of parents + offspring if necessary
+00180                 replace(_pop, offspring); // after replace, the new pop. is in _pop
+00181                 if (pSize > _pop.size())
+00182                 {
+00183                     throw std::runtime_error("Population shrinking!");
+00184                 }
+00185                 else if (pSize < _pop.size())
+00186                 {
+00187                     throw std::runtime_error("Population growing!");
+00188                 }
+00189             }
+00190             catch (std::exception& e)
+00191             {
+00192                 std::string s = e.what();
+00193                 s.append( " in moeoEasyEA");
+00194                 throw std::runtime_error( s );
+00195             }
+00196         } while (continuator(_pop));
+00197     }
+00198 
+00199 
+00200 protected:
+00201 
+00203     eoContinue < MOEOT > & continuator;
+00205     eoEvalFunc < MOEOT > & eval;
+00207     eoPopLoopEval < MOEOT > loopEval;
+00209     eoPopEvalFunc < MOEOT > & popEval;
+00211     eoSelectTransform < MOEOT > selectTransform;
+00213     eoBreed < MOEOT > & breed;
+00215     eoMergeReduce < MOEOT > mergeReduce;
+00217     moeoReplacement < MOEOT > & replace;
+00219     moeoFitnessAssignment < MOEOT > & fitnessEval;
+00221     moeoDiversityAssignment < MOEOT > & diversityEval;
+00223     bool evalFitAndDivBeforeSelection;
+00225     class eoDummyEval : public eoEvalFunc < MOEOT >
+00226     { public: 
+00227         void operator()(MOEOT &) {}} dummyEval;
+00229     class eoDummySelect : public eoSelect < MOEOT >
+00230     { public: 
+00231         void operator()(const eoPop < MOEOT > &, eoPop < MOEOT > &) {} } dummySelect;
+00233     class eoDummyTransform : public eoTransform < MOEOT >
+00234     { public: 
+00235         void operator()(eoPop < MOEOT > &) {} } dummyTransform;
+00237     eoNoElitism < MOEOT > dummyMerge;
+00239     eoTruncate < MOEOT > dummyReduce;
+00240 
+00241 };
+00242 
+00243 #endif /*MOEOEASYEA_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoElitistReplacement_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoElitistReplacement_8h-source.html index 77d921ff2..4632bda5b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoElitistReplacement_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoElitistReplacement_8h-source.html @@ -21,93 +21,118 @@ -

moeoElitistReplacement.h

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:
+
moeoElitistReplacement.h
00001 /* 
+00002 * <moeoElitistReplacement.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOELITISTREPLACEMENT_H_
+00039 #define MOEOELITISTREPLACEMENT_H_
+00040 
+00041 #include <comparator/moeoComparator.h>
+00042 #include <comparator/moeoFitnessThenDiversityComparator.h>
+00043 #include <diversity/moeoDiversityAssignment.h>
+00044 #include <diversity/moeoDummyDiversityAssignment.h>
+00045 #include <fitness/moeoFitnessAssignment.h>
+00046 #include <replacement/moeoReplacement.h>
+00047 
+00051 template < class MOEOT > class moeoElitistReplacement:public moeoReplacement < MOEOT >
+00052 {
+00053 public:
+00054 
+00061     moeoElitistReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoDiversityAssignment < MOEOT > & _diversityAssignment, moeoComparator < MOEOT > & _comparator) :
+00062             fitnessAssignment (_fitnessAssignment), diversityAssignment (_diversityAssignment), comparator (_comparator)
+00063     {}
+00064 
+00065 
+00071     moeoElitistReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoDiversityAssignment < MOEOT > & _diversityAssignment) :
+00072             fitnessAssignment (_fitnessAssignment), diversityAssignment (_diversityAssignment), comparator (defaultComparator)
+00073     {}
+00074 
+00075 
+00081     moeoElitistReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoComparator < MOEOT > & _comparator) :
+00082             fitnessAssignment (_fitnessAssignment), diversityAssignment (defaultDiversity), comparator (_comparator)
+00083     {}
+00084 
+00085 
+00091     moeoElitistReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment) :
+00092             fitnessAssignment (_fitnessAssignment), diversityAssignment (defaultDiversity), comparator (defaultComparator)
+00093     {}
+00094 
 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_ */
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00101     void operator () (eoPop < MOEOT > &_parents, eoPop < MOEOT > &_offspring)
+00102     {
+00103         unsigned int sz = _parents.size ();
+00104         // merges offspring and parents into a global population
+00105         _parents.reserve (_parents.size () + _offspring.size ());
+00106         std::copy (_offspring.begin (), _offspring.end (), back_inserter (_parents));
+00107         // evaluates the fitness and the diversity of this global population
+00108         fitnessAssignment (_parents);
+00109         diversityAssignment (_parents);
+00110         // sorts the whole population according to the comparator
+00111         std::sort(_parents.begin(), _parents.end(), comparator);
+00112         // finally, resize this global population
+00113         _parents.resize (sz);
+00114         // and clear the offspring population
+00115         _offspring.clear ();
+00116     }
+00117 
+00118 
+00119 protected:
+00120 
+00122     moeoFitnessAssignment < MOEOT > & fitnessAssignment;
+00124     moeoDiversityAssignment < MOEOT > & diversityAssignment;
+00126     moeoDummyDiversityAssignment < MOEOT > defaultDiversity;
+00128     moeoFitnessThenDiversityComparator < MOEOT > defaultComparator;
+00130     class Cmp
+00131     {
+00132     public:
+00137         Cmp(moeoComparator < MOEOT > & _comp) : comp(_comp)
+00138         {}
+00144         bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2)
+00145         {
+00146             return comp(_moeo2,_moeo1);
+00147         }
+00148     private:
+00150         moeoComparator < MOEOT > & comp;
+00151     } comparator;
+00152 
+00153 };
+00154 
+00155 #endif /*MOEOELITISTREPLACEMENT_H_ */
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEntropyMetric_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEntropyMetric_8h-source.html index 4dbcc5a29..cc3a73414 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEntropyMetric_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEntropyMetric_8h-source.html @@ -21,153 +21,178 @@ -

moeoEntropyMetric.h

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 
+
moeoEntropyMetric.h
00001 /* 
+00002 * <moeoEntropyMetric.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Sebastien Cahon, Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOENTROPYMETRIC_H_
+00039 #define MOEOENTROPYMETRIC_H_
+00040 
+00041 #include <vector>
+00042 #include <comparator/moeoParetoObjectiveVectorComparator.h>
+00043 #include <metric/moeoMetric.h>
+00044 
+00049 template < class ObjectiveVector >
+00050 class moeoEntropyMetric : public moeoVectorVsVectorBinaryMetric < ObjectiveVector, double >
+00051 {
+00052 public:
+00053 
+00059     double operator()(const std::vector < ObjectiveVector > & _set1, const std::vector < ObjectiveVector > & _set2) {
+00060         // normalization
+00061         std::vector< ObjectiveVector > set1 = _set1;
+00062         std::vector< ObjectiveVector > set2= _set2;
+00063         removeDominated (set1);
+00064         removeDominated (set2);
+00065         prenormalize (set1);
+00066         normalize (set1);
+00067         normalize (set2);
+00068 
+00069         // making of PO*
+00070         std::vector< ObjectiveVector > star; // rotf :-)
+00071         computeUnion (set1, set2, star);
+00072         removeDominated (star);
+00073 
+00074         // making of PO1 U PO*
+00075         std::vector< ObjectiveVector > union_set1_star; // rotf again ...
+00076         computeUnion (set1, star, union_set1_star);
+00077 
+00078         unsigned int C = union_set1_star.size();
+00079         float omega=0;
+00080         float entropy=0;
+00081 
+00082         for (unsigned int i=0 ; i<C ; i++) {
+00083             unsigned int N_i = howManyInNicheOf (union_set1_star, union_set1_star[i], star.size());
+00084             unsigned int n_i = howManyInNicheOf (set1, union_set1_star[i], star.size());
+00085             if (n_i > 0) {
+00086                 omega += 1.0 / N_i;
+00087                 entropy += (float) n_i / (N_i * C) * log (((float) n_i / C) / log (2.0));
+00088             }
+00089         }
+00090         entropy /= - log (omega);
+00091         entropy *= log (2.0);
+00092         return entropy;
+00093     }
+00094 
+00095 
+00096 private:
+00097 
+00099     std::vector<double> vect_min_val;
+00101     std::vector<double> vect_max_val;
+00103     moeoParetoObjectiveVectorComparator < ObjectiveVector > paretoComparator;
+00104 
+00105 
+00110     void removeDominated(std::vector < ObjectiveVector > & _f) {
+00111         for (unsigned int i=0 ; i<_f.size(); i++) {
+00112             bool dom = false;
+00113             for (unsigned int j=0; j<_f.size(); j++)
+00114                 if (i != j && paretoComparator(_f[i],_f[j]))
+00115                 {
+00116                     dom = true;
+00117                     break;
+00118                 }
+00119             if (dom) {
+00120                 _f[i] = _f.back();
+00121                 _f.pop_back();
+00122                 i--;
+00123             }
+00124         }
+00125     }
+00126 
+00127 
+00132     void prenormalize (const std::vector< ObjectiveVector > & _f) {
+00133         vect_min_val.clear();
+00134         vect_max_val.clear();
 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 };
+00136         for (unsigned int i=0 ; i<ObjectiveVector::nObjectives(); i++) {
+00137             float min_val = _f.front()[i], max_val = min_val;
+00138             for (unsigned int j=1 ; j<_f.size(); j++) {
+00139                 if (_f[j][i] < min_val)
+00140                     min_val = _f[j][i];
+00141                 if (_f[j][i]>max_val)
+00142                     max_val = _f[j][i];
+00143             }
+00144             vect_min_val.push_back(min_val);
+00145             vect_max_val.push_back (max_val);
+00146         }
+00147     }
+00148 
+00149 
+00154     void normalize (std::vector< ObjectiveVector > & _f) {
+00155         for (unsigned int i=0 ; i<ObjectiveVector::nObjectives(); i++)
+00156             for (unsigned int j=0; j<_f.size(); j++)
+00157                 _f[j][i] = (_f[j][i] - vect_min_val[i]) / (vect_max_val[i] - vect_min_val[i]);
+00158     }
+00159 
+00160 
+00167     void computeUnion(const std::vector< ObjectiveVector > & _f1, const std::vector< ObjectiveVector > & _f2, std::vector< ObjectiveVector > & _f) {
+00168         _f = _f1 ;
+00169         for (unsigned int i=0; i<_f2.size(); i++) {
+00170             bool b = false;
+00171             for (unsigned int j=0; j<_f1.size(); j ++)
+00172                 if (_f1[j] == _f2[i]) {
+00173                     b = true;
+00174                     break;
+00175                 }
+00176             if (! b)
+00177                 _f.push_back(_f2[i]);
+00178         }
+00179     }
+00180 
 00181 
-00182 #endif /*MOEOENTROPYMETRIC_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00185     unsigned int howManyInNicheOf (const std::vector< ObjectiveVector > & _f, const ObjectiveVector & _s, unsigned int _size) {
+00186         unsigned int n=0;
+00187         for (unsigned int i=0 ; i<_f.size(); i++) {
+00188             if (euclidianDistance(_f[i], _s) < (_s.size() / (double) _size))
+00189                 n++;
+00190         }
+00191         return n;
+00192     }
+00193 
+00194 
+00198     double euclidianDistance (const ObjectiveVector & _set1, const ObjectiveVector & _to, unsigned int _deg = 2) {
+00199         double dist=0;
+00200         for (unsigned int i=0; i<_set1.size(); i++)
+00201             dist += pow(fabs(_set1[i] - _to[i]), (int)_deg);
+00202         return pow(dist, 1.0 / _deg);
+00203     }
+00204 
+00205 };
+00206 
+00207 #endif /*MOEOENTROPYMETRIC_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEnvironmentalReplacement_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEnvironmentalReplacement_8h-source.html index f2f7a9ad9..e40553b12 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEnvironmentalReplacement_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEnvironmentalReplacement_8h-source.html @@ -21,107 +21,132 @@ -

moeoEnvironmentalReplacement.h

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 
+
moeoEnvironmentalReplacement.h
00001 /* 
+00002 * <moeoEnvironmentalReplacement.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOENVIRONMENTALREPLACEMENT_H_
+00039 #define MOEOENVIRONMENTALREPLACEMENT_H_
+00040 
+00041 #include <comparator/moeoComparator.h>
+00042 #include <comparator/moeoFitnessThenDiversityComparator.h>
+00043 #include <diversity/moeoDiversityAssignment.h>
+00044 #include <fitness/moeoFitnessAssignment.h>
+00045 #include <replacement/moeoReplacement.h>
+00046 
+00051 template < class MOEOT > class moeoEnvironmentalReplacement:public moeoReplacement < MOEOT >
+00052 {
+00053 public:
 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_ */
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00056     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+00057 
+00058 
+00065     moeoEnvironmentalReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoDiversityAssignment < MOEOT > & _diversityAssignment, moeoComparator < MOEOT > & _comparator) :
+00066             fitnessAssignment (_fitnessAssignment), diversityAssignment (_diversityAssignment), comparator (_comparator)
+00067     {}
+00068 
+00069 
+00075     moeoEnvironmentalReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoDiversityAssignment < MOEOT > & _diversityAssignment) :
+00076             fitnessAssignment (_fitnessAssignment), diversityAssignment (_diversityAssignment), comparator (defaultComparator)
+00077     {}
+00078 
+00079 
+00085     moeoEnvironmentalReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoComparator < MOEOT > & _comparator) :
+00086             fitnessAssignment (_fitnessAssignment), diversityAssignment (defaultDiversity), comparator (_comparator)
+00087     {}
+00088 
+00089 
+00095     moeoEnvironmentalReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment) :
+00096             fitnessAssignment (_fitnessAssignment), diversityAssignment (defaultDiversity), comparator (defaultComparator)
+00097     {}
+00098 
+00099 
+00105     void operator () (eoPop < MOEOT > &_parents, eoPop < MOEOT > &_offspring)
+00106     {
+00107         unsigned int sz = _parents.size();
+00108         // merges offspring and parents into a global population
+00109         _parents.reserve (_parents.size() + _offspring.size());
+00110         std::copy (_offspring.begin(), _offspring.end(), back_inserter(_parents));
+00111         // evaluates the fitness and the diversity of this global population
+00112         fitnessAssignment (_parents);
+00113         diversityAssignment (_parents);
+00114         // remove individuals 1 by 1 and update the fitness values
+00115         unsigned int worstIdx;
+00116         ObjectiveVector worstObjVec;
+00117         while (_parents.size() > sz)
+00118         {
+00119             // the individual to delete
+00120             worstIdx = std::min_element(_parents.begin(), _parents.end(), comparator) - _parents.begin();
+00121             worstObjVec = _parents[worstIdx].objectiveVector();
+00122             // remove the woorst individual
+00123             _parents[worstIdx] = _parents.back();
+00124             _parents.pop_back();
+00125             // update of the fitness and diversity values
+00126             fitnessAssignment.updateByDeleting(_parents, worstObjVec);
+00127             diversityAssignment.updateByDeleting(_parents, worstObjVec);
+00128 
+00129         }
+00130         // clear the offspring population
+00131         _offspring.clear ();
+00132     }
+00133 
+00134 
+00135 protected:
+00136 
+00138     moeoFitnessAssignment < MOEOT > & fitnessAssignment;
+00140     moeoDiversityAssignment < MOEOT > & diversityAssignment;
+00142     moeoDummyDiversityAssignment < MOEOT > defaultDiversity;
+00144     moeoFitnessThenDiversityComparator < MOEOT > defaultComparator;
+00146     class Cmp
+00147     {
+00148     public:
+00153         Cmp(moeoComparator < MOEOT > & _comp) : comp(_comp)
+00154         {}
+00160         bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2)
+00161         {
+00162             return comp(_moeo1,_moeo2);
+00163         }
+00164     private:
+00166         moeoComparator < MOEOT > & comp;
+00167     } comparator;
+00168 
+00169 };
+00170 
+00171 #endif /*MOEOENVIRONMENTALREPLACEMENT_H_ */
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEuclideanDistance_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEuclideanDistance_8h-source.html index 081f44008..02f09d100 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEuclideanDistance_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEuclideanDistance_8h-source.html @@ -21,54 +21,79 @@ -

moeoEuclideanDistance.h

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:
+
moeoEuclideanDistance.h
00001 /* 
+00002 * <moeoEuclideanDistance.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOEUCLIDEANDISTANCE_H_
+00039 #define MOEOEUCLIDEANDISTANCE_H_
+00040 
+00041 #include <math.h>
+00042 #include <distance/moeoNormalizedDistance.h>
+00043 
+00048 template < class MOEOT >
+00049 class moeoEuclideanDistance : public moeoNormalizedDistance < MOEOT >
+00050 {
+00051 public:
 00052 
-00054     using moeoNormalizedDistance < MOEOT > :: bounds;
+00054     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
 00055 
-00056 };
-00057 
-00058 #endif /*MOEOEUCLIDEANDISTANCE_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00056 
+00062     const double operator()(const MOEOT & _moeo1, const MOEOT & _moeo2)
+00063     {
+00064         double result = 0.0;
+00065         double tmp1, tmp2;
+00066         for (unsigned int i=0; i<ObjectiveVector::nObjectives(); i++)
+00067         {
+00068             tmp1 = (_moeo1.objectiveVector()[i] - bounds[i].minimum()) / bounds[i].range();
+00069             tmp2 = (_moeo2.objectiveVector()[i] - bounds[i].minimum()) / bounds[i].range();
+00070             result += (tmp1-tmp2) * (tmp1-tmp2);
+00071         }
+00072         return sqrt(result);
+00073     }
+00074 
+00075 
+00076 private:
+00077 
+00079     using moeoNormalizedDistance < MOEOT > :: bounds;
+00080 
+00081 };
+00082 
+00083 #endif /*MOEOEUCLIDEANDISTANCE_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEvalFunc_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEvalFunc_8h-source.html index 8802540b1..98fbe1b83 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEvalFunc_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoEvalFunc_8h-source.html @@ -21,31 +21,56 @@ -

moeoEvalFunc.h

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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

moeoEvalFunc.h

00001 /* 
+00002 * <moeoEvalFunc.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOEVALFUNC_H_
+00039 #define MOEOEVALFUNC_H_
+00040 
+00041 #include <eoEvalFunc.h>
+00042 
+00043 /*
+00044  * Functor that evaluates one MOEO by setting all its objective values.
+00045  */
+00046 template < class MOEOT >
+00047 class moeoEvalFunc : public eoEvalFunc< MOEOT > {};
+00048 
+00049 #endif /*MOEOEVALFUNC_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoExpBinaryIndicatorBasedFitnessAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoExpBinaryIndicatorBasedFitnessAssignment_8h-source.html index 0a40b7a64..2a8a545d3 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoExpBinaryIndicatorBasedFitnessAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoExpBinaryIndicatorBasedFitnessAssignment_8h-source.html @@ -21,164 +21,189 @@ -

moeoExpBinaryIndicatorBasedFitnessAssignment.h

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 
+
moeoExpBinaryIndicatorBasedFitnessAssignment.h
00001 /* 
+00002 * <moeoExpBinaryIndicatorBasedFitnessAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOEXPBINARYINDICATORBASEDFITNESSASSIGNMENT_H_
+00039 #define MOEOEXPBINARYINDICATORBASEDFITNESSASSIGNMENT_H_
+00040 
+00041 #include <math.h>
+00042 #include <vector>
+00043 #include <eoPop.h>
+00044 #include <fitness/moeoBinaryIndicatorBasedFitnessAssignment.h>
+00045 #include <metric/moeoNormalizedSolutionVsSolutionBinaryMetric.h>
+00046 #include <utils/moeoConvertPopToObjectiveVectors.h>
+00047 
+00053 template < class MOEOT >
+00054 class moeoExpBinaryIndicatorBasedFitnessAssignment : public moeoBinaryIndicatorBasedFitnessAssignment < MOEOT >
+00055 {
+00056 public:
+00057 
+00059     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
 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++)
+00061 
+00067     moeoExpBinaryIndicatorBasedFitnessAssignment(moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & _metric, const double _kappa = 0.05) : metric(_metric), kappa(_kappa)
+00068     {}
+00069 
+00070 
+00075     void operator()(eoPop < MOEOT > & _pop)
+00076     {
+00077         // 1 - setting of the bounds
+00078         setup(_pop);
+00079         // 2 - computing every indicator values
+00080         computeValues(_pop);
+00081         // 3 - setting fitnesses
+00082         setFitnesses(_pop);
+00083     }
+00084 
+00085 
+00091     void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec)
+00092     {
+00093         std::vector < double > v;
+00094         v.resize(_pop.size());
+00095         for (unsigned int i=0; i<_pop.size(); i++)
+00096         {
+00097             v[i] = metric(_objVec, _pop[i].objectiveVector());
+00098         }
+00099         for (unsigned int i=0; i<_pop.size(); i++)
+00100         {
+00101             _pop[i].fitness( _pop[i].fitness() + exp(-v[i]/kappa) );
+00102         }
+00103     }
+00104 
+00105 
+00112     double updateByAdding(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec)
+00113     {
+00114         std::vector < double > v;
+00115         // update every fitness values to take the new individual into account
+00116         v.resize(_pop.size());
+00117         for (unsigned int i=0; i<_pop.size(); i++)
+00118         {
+00119             v[i] = metric(_objVec, _pop[i].objectiveVector());
+00120         }
+00121         for (unsigned int i=0; i<_pop.size(); i++)
+00122         {
+00123             _pop[i].fitness( _pop[i].fitness() - exp(-v[i]/kappa) );
+00124         }
+00125         // compute the fitness of the new individual
+00126         v.clear();
+00127         v.resize(_pop.size());
+00128         for (unsigned int i=0; i<_pop.size(); i++)
+00129         {
+00130             v[i] = metric(_pop[i].objectiveVector(), _objVec);
+00131         }
+00132         double result = 0;
+00133         for (unsigned int i=0; i<v.size(); 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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00135             result -= exp(-v[i]/kappa);
+00136         }
+00137         return result;
+00138     }
+00139 
+00140 
+00141 protected:
+00142 
+00144     moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & metric;
+00146     double kappa;
+00148     std::vector < std::vector<double> > values;
+00149 
+00150 
+00155     void setup(const eoPop < MOEOT > & _pop)
+00156     {
+00157         double min, max;
+00158         for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++)
+00159         {
+00160             min = _pop[0].objectiveVector()[i];
+00161             max = _pop[0].objectiveVector()[i];
+00162             for (unsigned int j=1; j<_pop.size(); j++)
+00163             {
+00164                 min = std::min(min, _pop[j].objectiveVector()[i]);
+00165                 max = std::max(max, _pop[j].objectiveVector()[i]);
+00166             }
+00167             // setting of the bounds for the objective i
+00168             metric.setup(min, max, i);
+00169         }
+00170     }
+00171 
+00172 
+00177     void computeValues(const eoPop < MOEOT > & _pop)
+00178     {
+00179         values.clear();
+00180         values.resize(_pop.size());
+00181         for (unsigned int i=0; i<_pop.size(); i++)
+00182         {
+00183             values[i].resize(_pop.size());
+00184             for (unsigned int j=0; j<_pop.size(); j++)
+00185             {
+00186                 if (i != j)
+00187                 {
+00188                     values[i][j] = metric(_pop[i].objectiveVector(), _pop[j].objectiveVector());
+00189                 }
+00190             }
+00191         }
+00192     }
+00193 
+00194 
+00199     void setFitnesses(eoPop < MOEOT > & _pop)
+00200     {
+00201         for (unsigned int i=0; i<_pop.size(); i++)
+00202         {
+00203             _pop[i].fitness(computeFitness(i));
+00204         }
+00205     }
+00206 
+00207 
+00212     double computeFitness(const unsigned int _idx)
+00213     {
+00214         double result = 0;
+00215         for (unsigned int i=0; i<values.size(); i++)
+00216         {
+00217             if (i != _idx)
+00218             {
+00219                 result -= exp(-values[i][_idx]/kappa);
+00220             }
+00221         }
+00222         return result;
+00223     }
+00224 
+00225 };
+00226 
+00227 #endif /*MOEOEXPBINARYINDICATORBASEDFITNESSASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFastNonDominatedSortingFitnessAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFastNonDominatedSortingFitnessAssignment_8h-source.html index afee511d8..6b2d31586 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFastNonDominatedSortingFitnessAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFastNonDominatedSortingFitnessAssignment_8h-source.html @@ -21,201 +21,226 @@ -

moeoFastNonDominatedSortingFitnessAssignment.h

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());
+
moeoFastNonDominatedSortingFitnessAssignment.h
00001 /* 
+00002 * <moeoFastNonDominatedSortingFitnessAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOFASTNONDOMINATEDSORTINGFITNESSASSIGNMENT_H_
+00039 #define MOEOFASTNONDOMINATEDSORTINGFITNESSASSIGNMENT_H_
+00040 
+00041 #include <vector>
+00042 #include <eoPop.h>
+00043 #include <comparator/moeoObjectiveObjectiveVectorComparator.h>
+00044 #include <comparator/moeoObjectiveVectorComparator.h>
+00045 #include <comparator/moeoParetoObjectiveVectorComparator.h>
+00046 #include <fitness/moeoParetoBasedFitnessAssignment.h>
+00047 
+00048 
+00056 template < class MOEOT >
+00057 class moeoFastNonDominatedSortingFitnessAssignment : public moeoParetoBasedFitnessAssignment < MOEOT >
+00058 {
+00059 public:
+00060 
+00062     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+00063 
+00064 
+00068     moeoFastNonDominatedSortingFitnessAssignment() : comparator(paretoComparator)
+00069     {}
+00070 
+00071 
+00076     moeoFastNonDominatedSortingFitnessAssignment(moeoObjectiveVectorComparator < ObjectiveVector > & _comparator) : comparator(_comparator)
+00077     {}
+00078 
+00079 
+00084     void operator()(eoPop < MOEOT > & _pop)
+00085     {
+00086         // number of objectives for the problem under consideration
+00087         unsigned int nObjectives = MOEOT::ObjectiveVector::nObjectives();
+00088         if (nObjectives == 1)
+00089         {
+00090             // one objective
+00091             oneObjective(_pop);
 00092         }
-00093     }
-00094 
-00095 
-00101     void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec)
-00102     {
-00103         for (unsigned int i=0; i<_pop.size(); i++)
+00093         else if (nObjectives == 2)
+00094         {
+00095             // two objectives (the two objectives function is still to implement)
+00096             mObjectives(_pop);
+00097         }
+00098         else if (nObjectives > 2)
+00099         {
+00100             // more than two objectives
+00101             mObjectives(_pop);
+00102         }
+00103         else
 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;
+00105             // problem with the number of objectives
+00106             throw std::runtime_error("Problem with the number of objectives in moeoNonDominatedSortingFitnessAssignment");
+00107         }
+00108         // a higher fitness is better, so the values need to be inverted
+00109         double max = _pop[0].fitness();
+00110         for (unsigned int i=1 ; i<_pop.size() ; i++)
+00111         {
+00112             max = std::max(max, _pop[i].fitness());
+00113         }
+00114         for (unsigned int i=0 ; i<_pop.size() ; i++)
+00115         {
+00116             _pop[i].fitness(max - _pop[i].fitness());
+00117         }
+00118     }
+00119 
+00120 
+00126     void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec)
+00127     {
+00128         for (unsigned int i=0; i<_pop.size(); i++)
+00129         {
+00130             // if _pop[i] is dominated by _objVec
+00131             if ( comparator(_pop[i].objectiveVector(), _objVec) )
+00132             {
+00133                 _pop[i].fitness(_pop[i].fitness()+1);
+00134             }
+00135         }
+00136     }
 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++;
+00139 private:
+00140 
+00142     moeoObjectiveVectorComparator < ObjectiveVector > & comparator;
+00144     moeoParetoObjectiveVectorComparator < ObjectiveVector > paretoComparator;
+00146     class ObjectiveComparator : public moeoComparator < MOEOT >
+00147     {
+00148     public:
+00154          const bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2)
+00155          {
+00156                 return cmp(_moeo1.objectiveVector(), _moeo2.objectiveVector());
+00157          }
+00158     private:
+00160         moeoObjectiveObjectiveVectorComparator < ObjectiveVector > cmp;
+00161     } objComparator;
+00162 
+00163 
+00168     void oneObjective (eoPop < MOEOT > & _pop)
+00169     {
+00170         // sorts the population in the ascending order
+00171         std::sort(_pop.begin(), _pop.end(), objComparator);
+00172         // assign fitness values
+00173         unsigned int rank = 1;
+00174         _pop[_pop.size()-1].fitness(rank);
+00175         for (unsigned int i=_pop.size()-2; i>=0; i--)
+00176         {
+00177             if (_pop[i].objectiveVector() != _pop[i+1].objectiveVector())
+00178             {
+00179                 rank++;
+00180             }
+00181             _pop[i].fitness(rank);
+00182         }
+00183     }
+00184 
+00185 
+00190     void twoObjectives (eoPop < MOEOT > & _pop)
+00191     {
+00192         //... TO DO !
+00193     }
+00194 
+00195 
+00200     void mObjectives (eoPop < MOEOT > & _pop)
+00201     {
+00202         // S[i] = indexes of the individuals dominated by _pop[i]
+00203         std::vector < std::vector<unsigned int> > S(_pop.size());
+00204         // n[i] = number of individuals that dominate the individual _pop[i]
+00205         std::vector < unsigned int > n(_pop.size(), 0);
+00206         // fronts: F[i] = indexes of the individuals contained in the ith front
+00207         std::vector < std::vector<unsigned int> > F(_pop.size()+2);
+00208         // used to store the number of the first front
+00209         F[1].reserve(_pop.size());
+00210         for (unsigned int p=0; p<_pop.size(); p++)
+00211         {
+00212             for (unsigned int q=0; q<_pop.size(); q++)
+00213             {
+00214                 // if q is dominated by p
+00215                 if ( comparator(_pop[q].objectiveVector(), _pop[p].objectiveVector()) )
+00216                 {
+00217                     // add q to the set of solutions dominated by p
+00218                     S[p].push_back(q);
+00219                 }
+00220                 // if p is dominated by q
+00221                 else if  ( comparator(_pop[p].objectiveVector(), _pop[q].objectiveVector()) )
+00222                 {
+00223                     // increment the domination counter of p
+00224                     n[p]++;
+00225                 }
+00226             }
+00227             // if no individual dominates p
+00228             if (n[p] == 0)
+00229             {
+00230                 // p belongs to the first front
+00231                 _pop[p].fitness(1);
+00232                 F[1].push_back(p);
+00233             }
 00234         }
-00235     }
-00236 
-00237 };
-00238 
-00239 #endif /*MOEOFASTNONDOMINATEDSORTINGFITNESSASSIGNMENT_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00235         // front counter
+00236         unsigned int counter=1;
+00237         unsigned int p,q;
+00238         while (! F[counter].empty())
+00239         {
+00240             // used to store the number of the next front
+00241             F[counter+1].reserve(_pop.size());
+00242             for (unsigned int i=0; i<F[counter].size(); i++)
+00243             {
+00244                 p = F[counter][i];
+00245                 for (unsigned int j=0; j<S[p].size(); j++)
+00246                 {
+00247                     q = S[p][j];
+00248                     n[q]--;
+00249                     // if no individual dominates q anymore
+00250                     if (n[q] == 0)
+00251                     {
+00252                         // q belongs to the next front
+00253                         _pop[q].fitness(counter+1);
+00254                         F[counter+1].push_back(q);
+00255                     }
+00256                 }
+00257             }
+00258             counter++;
+00259         }
+00260     }
+00261 
+00262 };
+00263 
+00264 #endif /*MOEOFASTNONDOMINATEDSORTINGFITNESSASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFitnessAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFitnessAssignment_8h-source.html index 97e70c557..bbf291189 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFitnessAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFitnessAssignment_8h-source.html @@ -21,44 +21,69 @@ -

moeoFitnessAssignment.h

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;
+
moeoFitnessAssignment.h
00001 /* 
+00002 * <moeoFitnessAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
 00037 
-00038 
-00044     void updateByDeleting(eoPop < MOEOT > & _pop, MOEOT & _moeo)
-00045     {
-00046         updateByDeleting(_pop, _moeo.objectiveVector());
-00047     }
-00048 
-00049 };
-00050 
-00051 #endif /*MOEOFITNESSASSIGNMENT_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00038 #ifndef MOEOFITNESSASSIGNMENT_H_
+00039 #define MOEOFITNESSASSIGNMENT_H_
+00040 
+00041 #include <eoFunctor.h>
+00042 #include <eoPop.h>
+00043 
+00047 template < class MOEOT >
+00048 class moeoFitnessAssignment : public eoUF < eoPop < MOEOT > &, void >
+00049 {
+00050 public:
+00051 
+00053     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+00054 
+00055 
+00061     virtual void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) = 0;
+00062 
+00063 
+00069     void updateByDeleting(eoPop < MOEOT > & _pop, MOEOT & _moeo)
+00070     {
+00071         updateByDeleting(_pop, _moeo.objectiveVector());
+00072     }
+00073 
+00074 };
+00075 
+00076 #endif /*MOEOFITNESSASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFitnessThenDiversityComparator_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFitnessThenDiversityComparator_8h-source.html index 4bb3eba0d..53bdcd56e 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFitnessThenDiversityComparator_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFitnessThenDiversityComparator_8h-source.html @@ -21,44 +21,69 @@ -

moeoFitnessThenDiversityComparator.h

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     }
+
moeoFitnessThenDiversityComparator.h
00001 /* 
+00002 * <moeoFitnessThenDiversityComparator.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOFITNESSTHENDIVERSITYCOMPARATOR_H_
+00039 #define MOEOFITNESSTHENDIVERSITYCOMPARATOR_H_
+00040 
+00041 #include <comparator/moeoComparator.h>
 00042 
-00043 };
-00044 
-00045 #endif /*MOEOFITNESSTHENDIVERSITYCOMPARATOR_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00046 template < class MOEOT >
+00047 class moeoFitnessThenDiversityComparator : public moeoComparator < MOEOT >
+00048 {
+00049 public:
+00050 
+00056     const bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2)
+00057     {
+00058         if (_moeo1.fitness() == _moeo2.fitness())
+00059         {
+00060             return _moeo1.diversity() < _moeo2.diversity();
+00061         }
+00062         else
+00063         {
+00064             return _moeo1.fitness() < _moeo2.fitness();
+00065         }
+00066     }
+00067 
+00068 };
+00069 
+00070 #endif /*MOEOFITNESSTHENDIVERSITYCOMPARATOR_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFrontByFrontCrowdingDiversityAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFrontByFrontCrowdingDiversityAssignment_8h-source.html index 3fc26adaf..7d8fd4061 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFrontByFrontCrowdingDiversityAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFrontByFrontCrowdingDiversityAssignment_8h-source.html @@ -21,118 +21,143 @@ -

moeoFrontByFrontCrowdingDiversityAssignment.h

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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

moeoFrontByFrontCrowdingDiversityAssignment.h

00001 /* 
+00002 * <moeoFrontByFrontCrowdingDiversityAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOFRONTBYFRONTCROWDINGDIVERSITYASSIGNMENT_H_
+00039 #define MOEOFRONTBYFRONTCROWDINGDIVERSITYASSIGNMENT_H_
+00040 
+00041 #include <diversity/moeoCrowdingDiversityAssignment.h>
+00042 #include <comparator/moeoFitnessThenDiversityComparator.h>
+00043 
+00049 template < class MOEOT >
+00050 class moeoFrontByFrontCrowdingDiversityAssignment : public moeoCrowdingDiversityAssignment < MOEOT >
+00051 {
+00052 public:
+00053 
+00055     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+00056 
+00057 
+00065     void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec)
+00066     {
+00067         std::cout << "WARNING : updateByDeleting not implemented in moeoFrontByFrontCrowdingDistanceDiversityAssignment" << std::endl;
+00068     }
+00069 
+00070 
+00071 private:
+00072 
+00073     using moeoCrowdingDiversityAssignment < MOEOT >::inf;
+00074     using moeoCrowdingDiversityAssignment < MOEOT >::tiny;
+00075 
+00080     void setDistances (eoPop < MOEOT > & _pop)
+00081     {
+00082         unsigned int a,b;
+00083         double min, max, distance;
+00084         unsigned int nObjectives = MOEOT::ObjectiveVector::nObjectives();
+00085         // set diversity to 0 for every individual
+00086         for (unsigned int i=0; i<_pop.size(); i++)
+00087         {
+00088             _pop[i].diversity(0.0);
+00089         }
+00090         // sort the whole pop according to fitness values
+00091         moeoFitnessThenDiversityComparator < MOEOT > fitnessComparator;
+00092         std::sort(_pop.begin(), _pop.end(), fitnessComparator);
+00093         // compute the crowding distance values for every individual "front" by "front" (front : from a to b)
+00094         a = 0;                                  // the front starts at a
+00095         while (a < _pop.size())
+00096         {
+00097             b = lastIndex(_pop,a);      // the front ends at b
+00098             // if there is less than 2 individuals in the front...
+00099             if ((b-a) < 2)
+00100             {
+00101                 for (unsigned int i=a; i<=b; i++)
+00102                 {
+00103                     _pop[i].diversity(inf());
+00104                 }
+00105             }
+00106             // else...
+00107             else
+00108             {
+00109                 // for each objective
+00110                 for (unsigned int obj=0; obj<nObjectives; obj++)
+00111                 {
+00112                     // sort in the descending order using the values of the objective 'obj'
+00113                     moeoOneObjectiveComparator < MOEOT > objComp(obj);
+00114                     std::sort(_pop.begin()+a, _pop.begin()+b+1, objComp);
+00115                     // min & max
+00116                     min = _pop[b].objectiveVector()[obj];
+00117                     max = _pop[a].objectiveVector()[obj];
+00118                     // avoid extreme case
+00119                     if (min == max)
+00120                     {
+00121                         min -= tiny();
+00122                         max += tiny();
+00123                     }
+00124                     // set the diversity value to infiny for min and max
+00125                     _pop[a].diversity(inf());
+00126                     _pop[b].diversity(inf());
+00127                     // set the diversity values for the other individuals
+00128                     for (unsigned int i=a+1; i<b; i++)
+00129                     {
+00130                         distance = (_pop[i-1].objectiveVector()[obj] - _pop[i+1].objectiveVector()[obj]) / (max-min);
+00131                         _pop[i].diversity(_pop[i].diversity() + distance);
+00132                     }
+00133                 }
+00134             }
+00135             // go to the next front
+00136             a = b+1;
+00137         }
+00138     }
+00139 
+00140 
+00146     unsigned int lastIndex (eoPop < MOEOT > & _pop, unsigned int _start)
+00147     {
+00148         unsigned int i=_start;
+00149         while ( (i<_pop.size()-1) && (_pop[i].fitness()==_pop[i+1].fitness()) )
+00150         {
+00151             i++;
+00152         }
+00153         return i;
+00154     }
+00155 
+00156 };
+00157 
+00158 #endif /*MOEOFRONTBYFRONTCROWDINGDIVERSITYASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFrontByFrontSharingDiversityAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFrontByFrontSharingDiversityAssignment_8h-source.html index 95be428b3..f0ed053f6 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFrontByFrontSharingDiversityAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoFrontByFrontSharingDiversityAssignment_8h-source.html @@ -21,87 +21,112 @@ -

moeoFrontByFrontSharingDiversityAssignment.h

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:
+
moeoFrontByFrontSharingDiversityAssignment.h
00001 /* 
+00002 * <moeoFrontByFrontSharingDiversityAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOFRONTBYFRONTSHARINGDIVERSITYASSIGNMENT_H_
+00039 #define MOEOFRONTBYFRONTSHARINGDIVERSITYASSIGNMENT_H_
+00040 
+00041 #include <diversity/moeoSharingDiversityAssignment.h>
+00042 
+00046 template < class MOEOT >
+00047 class moeoFrontByFrontSharingDiversityAssignment : public moeoSharingDiversityAssignment < MOEOT >
+00048 {
+00049 public:
+00050 
+00052     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+00053 
+00054 
+00061     moeoFrontByFrontSharingDiversityAssignment(moeoDistance<MOEOT,double> & _distance, double _nicheSize = 0.5, double _alpha = 2.0) : moeoSharingDiversityAssignment < MOEOT >(_distance, _nicheSize, _alpha)
+00062     {}
 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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00064 
+00070     moeoFrontByFrontSharingDiversityAssignment(double _nicheSize = 0.5, double _alpha = 2.0) : moeoSharingDiversityAssignment < MOEOT >(_nicheSize, _alpha)
+00071     {}
+00072 
+00073 
+00081     void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec)
+00082     {
+00083         std::cout << "WARNING : updateByDeleting not implemented in moeoSharingDiversityAssignment" << std::endl;
+00084     }
+00085 
+00086 
+00087 private:
+00088 
+00089     using moeoSharingDiversityAssignment < MOEOT >::distance;
+00090     using moeoSharingDiversityAssignment < MOEOT >::nicheSize;
+00091     using moeoSharingDiversityAssignment < MOEOT >::sh;
+00092     using moeoSharingDiversityAssignment < MOEOT >::operator();
+00093 
+00094 
+00099     void setSimilarities(eoPop < MOEOT > & _pop)
+00100     {
+00101         // compute distances between every individuals
+00102         moeoDistanceMatrix < MOEOT , double > dMatrix (_pop.size(), distance);
+00103         dMatrix(_pop);
+00104         // sets the distance to bigger than the niche size for every couple of solutions that do not belong to the same front
+00105         for (unsigned int i=0; i<_pop.size(); i++)
+00106         {
+00107             for (unsigned int j=0; j<i; j++)
+00108             {
+00109                 if (_pop[i].fitness() != _pop[j].fitness())
+00110                 {
+00111                     dMatrix[i][j] = nicheSize;
+00112                     dMatrix[j][i] = nicheSize;
+00113                 }
+00114             }
+00115         }
+00116         // compute similarities
+00117         double sum;
+00118         for (unsigned int i=0; i<_pop.size(); i++)
+00119         {
+00120             sum = 0.0;
+00121             for (unsigned int j=0; j<_pop.size(); j++)
+00122             {
+00123                 sum += sh(dMatrix[i][j]);
+00124             }
+00125             _pop[i].diversity(sum);
+00126         }
+00127     }
+00128 
+00129 };
+00130 
+00131 #endif /*MOEOFRONTBYFRONTSHARINGDIVERSITYASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoGDominanceObjectiveVectorComparator_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoGDominanceObjectiveVectorComparator_8h-source.html index 200b0f3c0..a75ec16ce 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoGDominanceObjectiveVectorComparator_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoGDominanceObjectiveVectorComparator_8h-source.html @@ -21,88 +21,113 @@ -

moeoGDominanceObjectiveVectorComparator.h

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             }
+
moeoGDominanceObjectiveVectorComparator.h
00001 /* 
+00002 * <moeoGDominanceObjectiveVectorComparator.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOGDOMINANCEOBJECTIVEVECTORCOMPARATOR_H_
+00039 #define MOEOGDOMINANCEOBJECTIVEVECTORCOMPARATOR_H_
+00040 
+00041 #include <comparator/moeoObjectiveVectorComparator.h>
+00042 
+00049 template < class ObjectiveVector >
+00050 class moeoGDominanceObjectiveVectorComparator : public moeoObjectiveVectorComparator < ObjectiveVector >
+00051 {
+00052 public:
+00053 
+00058     moeoGDominanceObjectiveVectorComparator(ObjectiveVector & _ref) : ref(_ref)
+00059     {}
+00060 
+00061 
+00067     const bool operator()(const ObjectiveVector & _objectiveVector1, const ObjectiveVector & _objectiveVector2)
+00068     {
+00069         unsigned int flag1 = flag(_objectiveVector1);
+00070         unsigned int flag2 = flag(_objectiveVector2);
+00071         if (flag2==0)
+00072         {
+00073             // cannot dominate
+00074             return false;
+00075         }
+00076         else if ( (flag2==1) && (flag1==0) )
+00077         {
+00078             // is dominated
+00079             return true;
+00080         }
+00081         else // (flag1==1) && (flag2==1)
+00082         {
+00083             // both are on the good region, so let's use the classical Pareto dominance
+00084             return paretoComparator(_objectiveVector1, _objectiveVector2);
 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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00086     }
+00087 
+00088 
+00089 private:
+00090 
+00092     ObjectiveVector & ref;
+00094     moeoParetoObjectiveVectorComparator < ObjectiveVector > paretoComparator;
+00095 
+00096 
+00101     unsigned int flag(const ObjectiveVector & _objectiveVector)
+00102     {
+00103         unsigned int result=1;
+00104         for (unsigned int i=0; i<ref.nObjectives(); i++)
+00105         {
+00106             if (_objectiveVector[i] > ref[i])
+00107             {
+00108                 result=0;
+00109             }
+00110         }
+00111         if (result==0)
+00112         {
+00113             result=1;
+00114             for (unsigned int i=0; i<ref.nObjectives(); i++)
+00115             {
+00116                 if (_objectiveVector[i] < ref[i])
+00117                 {
+00118                     result=0;
+00119                 }
+00120             }
+00121         }
+00122         return result;
+00123     }
+00124 
+00125 };
+00126 
+00127 #endif /*MOEOGDOMINANCEOBJECTIVEVECTORCOMPARATOR_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoGenerationalReplacement_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoGenerationalReplacement_8h-source.html index 8faecd2e6..3f7af24c8 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoGenerationalReplacement_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoGenerationalReplacement_8h-source.html @@ -21,38 +21,63 @@ -

moeoGenerationalReplacement.h

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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

moeoGenerationalReplacement.h

00001 /* 
+00002 * <moeoGenerationalReplacement.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOGENERATIONALREPLACEMENT_H_
+00039 #define MOEOGENERATIONALREPLACEMENT_H_
+00040 
+00041 #include <eoReplacement.h>
+00042 #include <replacement/moeoReplacement.h>
+00043 
+00047 template < class MOEOT >
+00048 class moeoGenerationalReplacement : public moeoReplacement < MOEOT >, public eoGenerationalReplacement < MOEOT >
+00049 {
+00050 public:
+00051 
+00057     void operator()(eoPop < MOEOT > & _parents, eoPop < MOEOT > & _offspring)
+00058     {
+00059         eoGenerationalReplacement < MOEOT >::operator ()(_parents, _offspring);
+00060     }
+00061 
+00062 };
+00063 
+00064 #endif /*MOEOGENERATIONALREPLACEMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoHybridLS_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoHybridLS_8h-source.html index 5b280bbf2..7611cbbcb 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoHybridLS_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoHybridLS_8h-source.html @@ -21,65 +21,90 @@ -

moeoHybridLS.h

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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

moeoHybridLS.h

00001 /* 
+00002 * <moeoHybridLS.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Sebastien Cahon, Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOHYBRIDLS_H_
+00039 #define MOEOHYBRIDLS_H_
+00040 
+00041 #include <eoContinue.h>
+00042 #include <eoPop.h>
+00043 #include <eoSelect.h>
+00044 #include <utils/eoUpdater.h>
+00045 #include <algo/moeoLS.h>
+00046 #include <archive/moeoArchive.h>
+00047 
+00052 template < class MOEOT >
+00053 class moeoHybridLS : public eoUpdater
+00054 {
+00055 public:
+00056 
+00064     moeoHybridLS (eoContinue < MOEOT > & _term, eoSelect < MOEOT > & _select, moeoLS < MOEOT, MOEOT > & _mols, moeoArchive < MOEOT > & _arch) :
+00065             term(_term), select(_select), mols(_mols), arch(_arch)
+00066     {}
+00067 
+00068 
+00072     void operator () ()
+00073     {
+00074         if (! term (arch))
+00075         {
+00076             // selection of solutions
+00077             eoPop < MOEOT > selectedSolutions;
+00078             select(arch, selectedSolutions);
+00079             // apply the local search to every selected solution
+00080             for (unsigned int i=0; i<selectedSolutions.size(); i++)
+00081             {
+00082                 mols(selectedSolutions[i], arch);
+00083             }
+00084         }
+00085     }
+00086 
+00087 
+00088 private:
+00089 
+00091     eoContinue < MOEOT > & term;
+00093     eoSelect < MOEOT > & select;
+00095     moeoLS < MOEOT, MOEOT > & mols;
+00097     moeoArchive < MOEOT > & arch;
+00098 
+00099 };
+00100 
+00101 #endif /*MOEOHYBRIDLS_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoHypervolumeBinaryMetric_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoHypervolumeBinaryMetric_8h-source.html index 4ace2ac06..8c8122963 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoHypervolumeBinaryMetric_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoHypervolumeBinaryMetric_8h-source.html @@ -21,120 +21,145 @@ -

moeoHypervolumeBinaryMetric.h

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:
+
moeoHypervolumeBinaryMetric.h
00001 /* 
+00002 * <moeoHypervolumeBinaryMetric.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOHYPERVOLUMEBINARYMETRIC_H_
+00039 #define MOEOHYPERVOLUMEBINARYMETRIC_H_
+00040 
+00041 #include <stdexcept>
+00042 #include <comparator/moeoParetoObjectiveVectorComparator.h>
+00043 #include <metric/moeoNormalizedSolutionVsSolutionBinaryMetric.h>
+00044 
+00053 template < class ObjectiveVector >
+00054 class moeoHypervolumeBinaryMetric : public moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double >
+00055 {
+00056 public:
+00057 
+00062     moeoHypervolumeBinaryMetric(double _rho = 1.1) : rho(_rho)
+00063     {
+00064         // not-a-maximization problem check
+00065         for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++)
+00066         {
+00067             if (ObjectiveVector::Traits::maximizing(i))
+00068             {
+00069                 throw std::runtime_error("Hypervolume binary metric not yet implemented for a maximization problem in moeoHypervolumeBinaryMetric");
+00070             }
+00071         }
+00072         // consistency check
+00073         if (rho < 1)
+00074         {
+00075             std::cout << "Warning, value used to compute the reference point rho for the hypervolume calculation must not be smaller than 1" << std::endl;
+00076             std::cout << "Adjusted to 1" << std::endl;
+00077             rho = 1;
+00078         }
+00079     }
 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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00081 
+00088     double operator()(const ObjectiveVector & _o1, const ObjectiveVector & _o2)
+00089     {
+00090         double result;
+00091         // if _o2 is dominated by _o1
+00092         if ( paretoComparator(_o2,_o1) )
+00093         {
+00094             result = - hypervolume(_o1, _o2, ObjectiveVector::Traits::nObjectives()-1);
+00095         }
+00096         else
+00097         {
+00098             result = hypervolume(_o2, _o1, ObjectiveVector::Traits::nObjectives()-1);
+00099         }
+00100         return result;
+00101     }
+00102 
+00103 
+00104 private:
+00105 
+00107     double rho;
+00109     using moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > :: bounds;
+00111     moeoParetoObjectiveVectorComparator < ObjectiveVector > paretoComparator;
+00112 
+00113 
+00121     double hypervolume(const ObjectiveVector & _o1, const ObjectiveVector & _o2, const unsigned int _obj, const bool _flag = false)
+00122     {
+00123         double result;
+00124         double range = rho * bounds[_obj].range();
+00125         double max = bounds[_obj].minimum() + range;
+00126         // value of _1 for the objective _obj
+00127         double v1 = _o1[_obj];
+00128         // value of _2 for the objective _obj (if _flag=true, v2=max)
+00129         double v2;
+00130         if (_flag)
+00131         {
+00132             v2 = max;
+00133         }
+00134         else
+00135         {
+00136             v2 = _o2[_obj];
+00137         }
+00138         // computation of the volume
+00139         if (_obj == 0)
+00140         {
+00141             if (v1 < v2)
+00142             {
+00143                 result = (v2 - v1) / range;
+00144             }
+00145             else
+00146             {
+00147                 result = 0;
+00148             }
+00149         }
+00150         else
+00151         {
+00152             if (v1 < v2)
+00153             {
+00154                 result = ( hypervolume(_o1, _o2, _obj-1, true) * (v2 - v1) / range ) + ( hypervolume(_o1, _o2, _obj-1) * (max - v2) / range );
+00155             }
+00156             else
+00157             {
+00158                 result = hypervolume(_o1, _o2, _obj-1) * (max - v2) / range;
+00159             }
+00160         }
+00161         return result;
+00162     }
+00163 
+00164 };
+00165 
+00166 #endif /*MOEOHYPERVOLUMEBINARYMETRIC_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoIBEA_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoIBEA_8h-source.html index fe5efae59..f98544109 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoIBEA_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoIBEA_8h-source.html @@ -21,112 +21,137 @@ -

moeoIBEA.h

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:
+
moeoIBEA.h
00001 /* 
+00002 * <moeoIBEA.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOIBEA_H_
+00039 #define MOEOIBEA_H_
+00040 
 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:
+00042 #include <eoBreed.h>
+00043 #include <eoContinue.h>
+00044 #include <eoEvalFunc.h>
+00045 #include <eoGenContinue.h>
+00046 #include <eoGeneralBreeder.h>
+00047 #include <eoGenOp.h>
+00048 #include <eoPopEvalFunc.h>
+00049 #include <eoSGAGenOp.h>
+00050 #include <algo/moeoEA.h>
+00051 #include <diversity/moeoDummyDiversityAssignment.h>
+00052 #include <fitness/moeoIndicatorBasedFitnessAssignment.h>
+00053 #include <metric/moeoNormalizedSolutionVsSolutionBinaryMetric.h>
+00054 #include <replacement/moeoEnvironmentalReplacement.h>
+00055 #include <selection/moeoDetTournamentSelect.h>
+00056 
+00062 template < class MOEOT >
+00063 class moeoIBEA : public moeoEA < MOEOT >
+00064 {
+00065 public:
+00066 
+00068     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+00069 
+00070 
+00079     moeoIBEA (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoGenOp < MOEOT > & _op, moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & _metric, const double _kappa=0.05) :
+00080             defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select(2),
+00081             fitnessAssignment(_metric, _kappa), replace(fitnessAssignment, dummyDiversityAssignment), genBreed(select, _op), breed(genBreed)
+00082     {}
+00083 
+00084 
+00093     moeoIBEA (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoTransform < MOEOT > & _op, moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & _metric, const double _kappa=0.05) :
+00094             defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select(2),
+00095             fitnessAssignment(_metric, _kappa), replace(fitnessAssignment, dummyDiversityAssignment), genBreed(select, _op), breed(genBreed)
+00096     {}
+00097 
+00098 
+00110     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) :
+00111             defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select (2),
+00112             fitnessAssignment(_metric, _kappa), replace (fitnessAssignment, dummyDiversityAssignment), defaultSGAGenOp(_crossover, _pCross, _mutation, _pMut),
+00113             genBreed (select, defaultSGAGenOp), breed (genBreed)
+00114     {}
+00115 
+00116 
+00125     moeoIBEA (eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoGenOp < MOEOT > & _op, moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & _metric, const double _kappa=0.05) :
+00126             continuator(_continuator), popEval(_eval), select(2),
+00127             fitnessAssignment(_metric, _kappa), replace(fitnessAssignment, dummyDiversityAssignment), genBreed(select, _op), breed(genBreed)
+00128     {}
+00129 
+00130 
+00139     moeoIBEA (eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoTransform < MOEOT > & _op, moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & _metric, const double _kappa=0.05) :
+00140             continuator(_continuator), popEval(_eval), select(2),
+00141             fitnessAssignment(_metric, _kappa), replace(fitnessAssignment, dummyDiversityAssignment), genBreed(select, _op), breed(genBreed)
+00142     {}
+00143 
 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 };
+00149     virtual void operator () (eoPop < MOEOT > &_pop)
+00150     {
+00151         eoPop < MOEOT > offspring, empty_pop;
+00152         popEval (empty_pop, _pop);      // a first eval of _pop
+00153         // evaluate fitness and diversity
+00154         fitnessAssignment(_pop);
+00155         dummyDiversityAssignment(_pop);
+00156         do
+00157         {
+00158             // generate offspring, worths are recalculated if necessary
+00159             breed (_pop, offspring);
+00160             // eval of offspring
+00161             popEval (_pop, offspring);
+00162             // after replace, the new pop is in _pop. Worths are recalculated if necessary
+00163             replace (_pop, offspring);
+00164         } while (continuator (_pop));
+00165     }
+00166 
 00167 
-00168 #endif /*MOEOIBEA_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00168 protected:
+00169 
+00171     eoGenContinue < MOEOT > defaultGenContinuator;
+00173     eoContinue < MOEOT > & continuator;
+00175     eoPopLoopEval < MOEOT > popEval;
+00177     moeoDetTournamentSelect < MOEOT > select;
+00179     moeoIndicatorBasedFitnessAssignment < MOEOT > fitnessAssignment;
+00181     moeoDummyDiversityAssignment < MOEOT > dummyDiversityAssignment;
+00183     moeoEnvironmentalReplacement < MOEOT > replace;
+00185     eoSGAGenOp < MOEOT > defaultSGAGenOp;
+00187     eoGeneralBreeder < MOEOT > genBreed;
+00189     eoBreed < MOEOT > & breed;
+00190 
+00191 };
+00192 
+00193 #endif /*MOEOIBEA_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoIBMOLS_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoIBMOLS_8h-source.html deleted file mode 100644 index 3b87f592f..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoIBMOLS_8h-source.html +++ /dev/null @@ -1,469 +0,0 @@ - - -ParadisEO-MOEOMovingObjects: moeoIBMOLS.h Source File - - - - -
-
-

moeoIBMOLS.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // moeoIBMOLS.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 MOEOIBMOLS_H_
-00014 #define MOEOIBMOLS_H_
-00015 
-00016 #include <math.h>
-00017 #include <eoContinue.h>
-00018 #include <eoEvalFunc.h>
-00019 #include <eoPop.h>
-00020 #include <moMove.h>
-00021 #include <moMoveInit.h>
-00022 #include <moNextMove.h>
-00023 #include <algo/moeoLS.h>
-00024 #include <archive/moeoArchive.h>
-00025 #include <fitness/moeoBinaryIndicatorBasedFitnessAssignment.h>
-00026 #include <move/moeoMoveIncrEval.h>
-00027 
-00032 template < class MOEOT, class Move >
-00033 class moeoIBMOLS : public moeoLS < MOEOT, eoPop < MOEOT > & >
-00034 {
-00035 public:
-00036 
-00038     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
-00039 
-00040 
-00050     moeoIBMOLS(
-00051         moMoveInit < Move > & _moveInit,
-00052         moNextMove < Move > & _nextMove,
-00053         eoEvalFunc < MOEOT > & _eval,
-00054         moeoMoveIncrEval < Move > & _moveIncrEval,
-00055         moeoBinaryIndicatorBasedFitnessAssignment < MOEOT > & _fitnessAssignment,
-00056         eoContinue < MOEOT > & _continuator
-00057     ) :
-00058             moveInit(_moveInit),
-00059             nextMove(_nextMove),
-00060             eval(_eval),
-00061             moveIncrEval(_moveIncrEval),
-00062             fitnessAssignment (_fitnessAssignment),
-00063             continuator (_continuator)
-00064     {}
-00065 
-00066 
-00073     void operator() (eoPop < MOEOT > & _pop, moeoArchive < MOEOT > & _arch)
-00074     {
-00075         // evaluation of the objective values
-00076         /*
-00077                 for (unsigned int i=0; i<_pop.size(); i++)
-00078                 {
-00079                     eval(_pop[i]);
-00080                 }
-00081         */
-00082         // fitness assignment for the whole population
-00083         fitnessAssignment(_pop);
-00084         // creation of a local archive
-00085         moeoArchive < MOEOT > archive;
-00086         // creation of another local archive (for the stopping criteria)
-00087         moeoArchive < MOEOT > previousArchive;
-00088         // update the archive with the initial population
-00089         archive.update(_pop);
-00090         do
-00091         {
-00092             previousArchive.update(archive);
-00093             oneStep(_pop);
-00094             archive.update(_pop);
-00095         } while ( (! archive.equals(previousArchive)) && (continuator(_arch)) );
-00096         _arch.update(archive);
-00097     }
-00098 
-00099 
-00100 private:
-00101 
-00103     moMoveInit < Move > & moveInit;
-00105     moNextMove < Move > & nextMove;
-00107     eoEvalFunc < MOEOT > & eval;
-00109     moeoMoveIncrEval < Move > & moveIncrEval;
-00111     moeoBinaryIndicatorBasedFitnessAssignment < MOEOT > & fitnessAssignment;
-00113     eoContinue < MOEOT > & continuator;
-00114 
-00115 
-00120     void oneStep (eoPop < MOEOT > & _pop)
-00121     {
-00122         // the move
-00123         Move move;
-00124         // the objective vector and the fitness of the current solution
-00125         ObjectiveVector x_objVec;
-00126         double x_fitness;
-00127         // the index, the objective vector and the fitness of the worst solution in the population (-1 implies that the worst is the newly created one)
-00128         int worst_idx;
-00129         ObjectiveVector worst_objVec;
-00130         double worst_fitness;
-00132         // the indexes and the objective vectors of the extreme non-dominated points
-00133         int ext_0_idx, ext_1_idx;
-00134         ObjectiveVector ext_0_objVec, ext_1_objVec;
-00135         unsigned int ind;   
-00137         // the index of the current solution to be explored
-00138         unsigned int i=0;
-00139         // initilization of the move for the first individual
-00140         moveInit(move, _pop[i]);
-00141         while (i<_pop.size() && continuator(_pop))
-00142         {
-00143             // x = one neigbour of pop[i]
-00144             // evaluate x in the objective space
-00145             x_objVec = moveIncrEval(move, _pop[i]);
-00146             // update every fitness values to take x into account and compute the fitness of x
-00147             x_fitness = fitnessAssignment.updateByAdding(_pop, x_objVec);
-00148 
-00152                         // extreme solutions (min only!)
-00153             ext_0_idx = -1;
-00154             ext_0_objVec = x_objVec;
-00155             ext_1_idx = -1;
-00156             ext_1_objVec = x_objVec;
-00157             for (unsigned int k=0; k<_pop.size(); k++)
-00158             {
-00159                 // ext_0
-00160                 if (_pop[k].objectiveVector()[0] < ext_0_objVec[0])
-00161                 {
-00162                     ext_0_idx = k;
-00163                     ext_0_objVec = _pop[k].objectiveVector();
-00164                 }
-00165                 else if ( (_pop[k].objectiveVector()[0] == ext_0_objVec[0]) && (_pop[k].objectiveVector()[1] < ext_0_objVec[1]) )
-00166                 {
-00167                     ext_0_idx = k;
-00168                     ext_0_objVec = _pop[k].objectiveVector();
-00169                 }
-00170                 // ext_1
-00171                 else if (_pop[k].objectiveVector()[1] < ext_1_objVec[1])
-00172                 {
-00173                     ext_1_idx = k;
-00174                     ext_1_objVec = _pop[k].objectiveVector();
-00175                 }
-00176                 else if ( (_pop[k].objectiveVector()[1] == ext_1_objVec[1]) && (_pop[k].objectiveVector()[0] < ext_1_objVec[0]) )
-00177                 {
-00178                     ext_1_idx = k;
-00179                     ext_1_objVec = _pop[k].objectiveVector();
-00180                 }
-00181             }
-00182                         // worst init
-00183             if (ext_0_idx == -1)
-00184             {
-00185                 ind = 0;
-00186                 while (ind == ext_1_idx)
-00187                 {
-00188                     ind++;
-00189                 }
-00190                 worst_idx = ind;
-00191                 worst_objVec = _pop[ind].objectiveVector();
-00192                 worst_fitness = _pop[ind].fitness();
-00193             }
-00194             else if (ext_1_idx == -1)
-00195             {
-00196                 ind = 0;
-00197                 while (ind == ext_0_idx)
-00198                 {
-00199                     ind++;
-00200                 }
-00201                 worst_idx = ind;
-00202                 worst_objVec = _pop[ind].objectiveVector();
-00203                 worst_fitness = _pop[ind].fitness();
-00204             }
-00205             else
-00206             {
-00207                 worst_idx = -1;
-00208                 worst_objVec = x_objVec;
-00209                 worst_fitness = x_fitness;
-00210             }
-00214 
-00215             // who is the worst ?
-00216             for (unsigned int j=0; j<_pop.size(); j++)
-00217             {
-00218                 if ( (j!=ext_0_idx) && (j!=ext_1_idx) )
-00219                 {
-00220                     if (_pop[j].fitness() < worst_fitness)
-00221                     {
-00222                         worst_idx = j;
-00223                         worst_objVec = _pop[j].objectiveVector();
-00224                         worst_fitness = _pop[j].fitness();
-00225                     }
-00226                 }
-00227             }
-00228             // if the worst solution is the new one
-00229             if (worst_idx == -1)
-00230             {
-00231                 // if all its neighbours have been explored,
-00232                 // let's explore the neighborhoud of the next individual
-00233                 if (! nextMove(move, _pop[i]))
-00234                 {
-00235                     i++;
-00236                     if (i<_pop.size())
-00237                     {
-00238                         // initilization of the move for the next individual
-00239                         moveInit(move, _pop[i]);
-00240                     }
-00241                 }
-00242             }
-00243             // if the worst solution is located before _pop[i]
-00244             else if (worst_idx <= i)
-00245             {
-00246                 // the new solution takes place insteed of _pop[worst_idx]
-00247                 _pop[worst_idx] = _pop[i];
-00248                 move(_pop[worst_idx]);
-00249                 _pop[worst_idx].objectiveVector(x_objVec);
-00250                 _pop[worst_idx].fitness(x_fitness);
-00251                 // let's explore the neighborhoud of the next individual
-00252                 i++;
-00253                 if (i<_pop.size())
-00254                 {
-00255                     // initilization of the move for the next individual
-00256                     moveInit(move, _pop[i]);
-00257                 }
-00258             }
-00259             // if the worst solution is located after _pop[i]
-00260             else if (worst_idx > i)
-00261             {
-00262                 // the new solution takes place insteed of _pop[i+1] and _pop[worst_idx] is deleted
-00263                 _pop[worst_idx] = _pop[i+1];
-00264                 _pop[i+1] = _pop[i];
-00265                 move(_pop[i+1]);
-00266                 _pop[i+1].objectiveVector(x_objVec);
-00267                 _pop[i+1].fitness(x_fitness);
-00268                 // let's explore the neighborhoud of the individual _pop[i+2]
-00269                 i += 2;
-00270                 if (i<_pop.size())
-00271                 {
-00272                     // initilization of the move for the next individual
-00273                     moveInit(move, _pop[i]);
-00274                 }
-00275             }
-00276             // update fitness values
-00277             fitnessAssignment.updateByDeleting(_pop, worst_objVec);
-00278         }
-00279     }
-00280 
-00281 
-00282 
-00283 
-00284 
-00285 
-00286 
-00287 
-00288 
-00289 
-00290 
-00291 
-00292 
-00293 // INUTILE !!!!
-00294 
-00295 
-00296 
-00297 
-00298 
-00299 
-00304     void new_oneStep (eoPop < MOEOT > & _pop)
-00305     {
-00306         // the move
-00307         Move move;
-00308         // the objective vector and the fitness of the current solution
-00309         ObjectiveVector x_objVec;
-00310         double x_fitness;
-00311         // the index, the objective vector and the fitness of the worst solution in the population (-1 implies that the worst is the newly created one)
-00312         int worst_idx;
-00313         ObjectiveVector worst_objVec;
-00314         double worst_fitness;
-00316         // the index of the extreme non-dominated points
-00317         int ext_0_idx, ext_1_idx;
-00318         unsigned int ind;   
-00320         // the index current of the current solution to be explored
-00321         unsigned int i=0;
-00322         // initilization of the move for the first individual
-00323         moveInit(move, _pop[i]);
-00324         while (i<_pop.size() && continuator(_pop))
-00325         {
-00326             // x = one neigbour of pop[i]
-00327             // evaluate x in the objective space
-00328             x_objVec = moveIncrEval(move, _pop[i]);
-00329             // update every fitness values to take x into account and compute the fitness of x
-00330             x_fitness = fitnessAssignment.updateByAdding(_pop, x_objVec);
-00331 
-00335                         // extremes solutions
-00336             OneObjectiveComparator comp0(0);
-00337             ext_0_idx = std::min_element(_pop.begin(), _pop.end(), comp0) - _pop.begin();
-00338             OneObjectiveComparator comp1(1);
-00339             ext_1_idx = std::min_element(_pop.begin(), _pop.end(), comp1) - _pop.begin();
-00340                         // new = extreme ?
-00341             if (x_objVec[0] < _pop[ext_0_idx].objectiveVector()[0])
-00342             {
-00343                 ext_0_idx = -1;
-00344             }
-00345             else if ( (x_objVec[0] == _pop[ext_0_idx].objectiveVector()[0]) && (x_objVec[1] < _pop[ext_0_idx].objectiveVector()[1]) )
-00346             {
-00347                 ext_0_idx = -1;
-00348             }
-00349             else if (x_objVec[1] < _pop[ext_1_idx].objectiveVector()[1])
-00350             {
-00351                 ext_1_idx = -1;
-00352             }
-00353             else if ( (x_objVec[1] == _pop[ext_1_idx].objectiveVector()[1]) && (x_objVec[0] < _pop[ext_1_idx].objectiveVector()[0]) )
-00354             {
-00355                 ext_1_idx = -1;
-00356             }
-00357             // worst init
-00358             if (ext_0_idx == -1)
-00359             {
-00360                 ind = 0;
-00361                 while (ind == ext_1_idx)
-00362                 {
-00363                     ind++;
-00364                 }
-00365                 worst_idx = ind;
-00366                 worst_objVec = _pop[ind].objectiveVector();
-00367                 worst_fitness = _pop[ind].fitness();
-00368             }
-00369             else if (ext_1_idx == -1)
-00370             {
-00371                 ind = 0;
-00372                 while (ind == ext_0_idx)
-00373                 {
-00374                     ind++;
-00375                 }
-00376                 worst_idx = ind;
-00377                 worst_objVec = _pop[ind].objectiveVector();
-00378                 worst_fitness = _pop[ind].fitness();
-00379             }
-00380             else
-00381             {
-00382                 worst_idx = -1;
-00383                 worst_objVec = x_objVec;
-00384                 worst_fitness = x_fitness;
-00385             }
-00389 
-00390             // who is the worst ?
-00391             for (unsigned int j=0; j<_pop.size(); j++)
-00392             {
-00393                 if ( (j!=ext_0_idx) && (j!=ext_1_idx) )
-00394                 {
-00395                     if (_pop[j].fitness() < worst_fitness)
-00396                     {
-00397                         worst_idx = j;
-00398                         worst_objVec = _pop[j].objectiveVector();
-00399                         worst_fitness = _pop[j].fitness();
-00400                     }
-00401                 }
-00402             }
-00403             // if the worst solution is the new one
-00404             if (worst_idx == -1)
-00405             {
-00406                 // if all its neighbours have been explored,
-00407                 // let's explore the neighborhoud of the next individual
-00408                 if (! nextMove(move, _pop[i]))
-00409                 {
-00410                     i++;
-00411                     if (i<_pop.size())
-00412                     {
-00413                         // initilization of the move for the next individual
-00414                         moveInit(move, _pop[i]);
-00415                     }
-00416                 }
-00417             }
-00418             // if the worst solution is located before _pop[i]
-00419             else if (worst_idx <= i)
-00420             {
-00421                 // the new solution takes place insteed of _pop[worst_idx]
-00422                 _pop[worst_idx] = _pop[i];
-00423                 move(_pop[worst_idx]);
-00424                 _pop[worst_idx].objectiveVector(x_objVec);
-00425                 _pop[worst_idx].fitness(x_fitness);
-00426                 // let's explore the neighborhoud of the next individual
-00427                 i++;
-00428                 if (i<_pop.size())
-00429                 {
-00430                     // initilization of the move for the next individual
-00431                     moveInit(move, _pop[i]);
-00432                 }
-00433             }
-00434             // if the worst solution is located after _pop[i]
-00435             else if (worst_idx > i)
-00436             {
-00437                 // the new solution takes place insteed of _pop[i+1] and _pop[worst_idx] is deleted
-00438                 _pop[worst_idx] = _pop[i+1];
-00439                 _pop[i+1] = _pop[i];
-00440                 move(_pop[i+1]);
-00441                 _pop[i+1].objectiveVector(x_objVec);
-00442                 _pop[i+1].fitness(x_fitness);
-00443                 // let's explore the neighborhoud of the individual _pop[i+2]
-00444                 i += 2;
-00445                 if (i<_pop.size())
-00446                 {
-00447                     // initilization of the move for the next individual
-00448                     moveInit(move, _pop[i]);
-00449                 }
-00450             }
-00451             // update fitness values
-00452             fitnessAssignment.updateByDeleting(_pop, worst_objVec);
-00453         }
-00454     }
-00455 
-00456 
-00457 
-00458 
-00459 
-00460 
-00462 class OneObjectiveComparator : public moeoComparator < MOEOT >
-00463     {
-00464     public:
-00465         OneObjectiveComparator(unsigned int _obj) : obj(_obj)
-00466         {
-00467             if (obj > MOEOT::ObjectiveVector::nObjectives())
-00468             {
-00469                 throw std::runtime_error("Problem with the index of objective in OneObjectiveComparator");
-00470             }
-00471         }
-00472         const bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2)
-00473         {
-00474             if (_moeo1.objectiveVector()[obj] < _moeo2.objectiveVector()[obj])
-00475             {
-00476                 return true;
-00477             }
-00478             else
-00479             {
-00480                 return (_moeo1.objectiveVector()[obj] == _moeo2.objectiveVector()[obj]) && (_moeo1.objectiveVector()[(obj+1)%2] < _moeo2.objectiveVector()[(obj+1)%2]);
-00481             }
-00482         }
-00483     private:
-00484         unsigned int obj;
-00485     };
-00487 
-00488 
-00489 
-00490 
-00491 };
-00492 
-00493 #endif /*MOEOIBMOLS_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  - -doxygen 1.4.7
- - diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoIndicatorBasedFitnessAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoIndicatorBasedFitnessAssignment_8h-source.html index d3628c67f..98b7f01a0 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoIndicatorBasedFitnessAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoIndicatorBasedFitnessAssignment_8h-source.html @@ -21,28 +21,53 @@ -

moeoIndicatorBasedFitnessAssignment.h

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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

moeoIndicatorBasedFitnessAssignment.h

00001 /* 
+00002 * <moeoIndicatorBasedFitnessAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOINDICATORBASEDFITNESSASSIGNMENT_H_
+00039 #define MOEOINDICATORBASEDFITNESSASSIGNMENT_H_
+00040 
+00041 #include <fitness/moeoFitnessAssignment.h>
+00042 
+00046 template < class MOEOT >
+00047 class moeoIndicatorBasedFitnessAssignment : public moeoFitnessAssignment < MOEOT > {};
+00048 
+00049 #endif /*MOEOINDICATORBASEDFITNESSASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoIteratedIBMOLS_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoIteratedIBMOLS_8h-source.html deleted file mode 100644 index 8f03adb31..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoIteratedIBMOLS_8h-source.html +++ /dev/null @@ -1,206 +0,0 @@ - - -ParadisEO-MOEOMovingObjects: moeoIteratedIBMOLS.h Source File - - - - -
-
-

moeoIteratedIBMOLS.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // moeoIteratedIBMOLS.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 MOEOITERATEDIBMOLS_H_
-00014 #define MOEOITERATEDIBMOLS_H_
-00015 
-00016 #include <eoContinue.h>
-00017 #include <eoEvalFunc.h>
-00018 #include <eoOp.h>
-00019 #include <eoPop.h>
-00020 #include <utils/rnd_generators.h>
-00021 #include <moMove.h>
-00022 #include <moMoveInit.h>
-00023 #include <moNextMove.h>
-00024 #include <algo/moeoIBMOLS.h>
-00025 #include <algo/moeoLS.h>
-00026 #include <archive/moeoArchive.h>
-00027 #include <fitness/moeoBinaryIndicatorBasedFitnessAssignment.h>
-00028 #include <move/moeoMoveIncrEval.h>
-00029 
-00030 
-00031 
-00032 //#include <rsCrossQuad.h>
-00033 
-00034 
-00035 
-00040 template < class MOEOT, class Move >
-00041 class moeoIteratedIBMOLS : public moeoLS < MOEOT, eoPop < MOEOT > & >
-00042 {
-00043 public:
-00044 
-00046     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
-00047 
-00048 
-00061     moeoIteratedIBMOLS(
-00062         moMoveInit < Move > & _moveInit,
-00063         moNextMove < Move > & _nextMove,
-00064         eoEvalFunc < MOEOT > & _eval,
-00065         moeoMoveIncrEval < Move > & _moveIncrEval,
-00066         moeoBinaryIndicatorBasedFitnessAssignment < MOEOT > & _fitnessAssignment,
-00067         eoContinue < MOEOT > & _continuator,
-00068         eoMonOp < MOEOT > & _monOp,
-00069         eoMonOp < MOEOT > & _randomMonOp,
-00070         unsigned int _nNoiseIterations=1
-00071     ) :
-00072             ibmols(_moveInit, _nextMove, _eval, _moveIncrEval, _fitnessAssignment, _continuator),
-00073             eval(_eval),
-00074             continuator(_continuator),
-00075             monOp(_monOp),
-00076             randomMonOp(_randomMonOp),
-00077             nNoiseIterations(_nNoiseIterations)
-00078     {}
-00079 
-00080 
-00086     void operator() (eoPop < MOEOT > & _pop, moeoArchive < MOEOT > & _arch)
-00087     {
-00088         _arch.update(_pop);
-00089         ibmols(_pop, _arch);
-00090         while (continuator(_arch))
-00091         {
-00092             // generate new solutions from the archive
-00093             generateNewSolutions(_pop, _arch);
-00094             // apply the local search (the global archive is updated in the sub-function)
-00095             ibmols(_pop, _arch);
-00096         }
-00097     }
-00098 
-00099 
-00100 private:
-00101 
-00103     moeoIBMOLS < MOEOT, Move > ibmols;
-00105     eoEvalFunc < MOEOT > & eval;
-00107     eoContinue < MOEOT > & continuator;
-00109     eoMonOp < MOEOT > & monOp;
-00111     eoMonOp < MOEOT > & randomMonOp;
-00113     unsigned int nNoiseIterations;
-00114 
-00115 
-00121     void generateNewSolutions(eoPop < MOEOT > & _pop, const moeoArchive < MOEOT > & _arch)
-00122     {
-00123         // shuffle vector for the random selection of individuals
-00124         vector<unsigned int> shuffle;
-00125         shuffle.resize(std::max(_pop.size(), _arch.size()));
-00126         // init shuffle
-00127         for (unsigned int i=0; i<shuffle.size(); i++)
-00128         {
-00129             shuffle[i] = i;
-00130         }
-00131         // randomize shuffle
-00132         UF_random_generator <unsigned int> gen;
-00133         std::random_shuffle(shuffle.begin(), shuffle.end(), gen);
-00134         // start the creation of new solutions
-00135         for (unsigned int i=0; i<_pop.size(); i++)
-00136         {
-00137             if (shuffle[i] < _arch.size()) // the given archive contains the individual i
-00138             {
-00139                 // add it to the resulting pop
-00140                 _pop[i] = _arch[shuffle[i]];
-00141                 // apply noise
-00142                 for (unsigned int j=0; j<nNoiseIterations; j++)
-00143                 {
-00144                     monOp(_pop[i]);
-00145                 }
-00146             }
-00147             else // a random solution needs to be added
-00148             {
-00149                 // random initialization
-00150                 randomMonOp(_pop[i]);
-00151             }
-00152             // evaluation of the new individual
-00153             _pop[i].invalidate();
-00154             eval(_pop[i]);
-00155         }
-00156     }
-00157 
-00158 
-00159 
-00160 
-00161 
-00163 // A DEVELOPPER RAPIDEMENT POUR TESTER AVEC CROSSOVER //
-00164     /*
-00165         void generateNewSolutions2(eoPop < MOEOT > & _pop, const moeoArchive < MOEOT > & _arch)
-00166         {
-00167                 // here, we must have a QuadOp !
-00168                 //eoQuadOp < MOEOT > quadOp;
-00169                 rsCrossQuad quadOp;
-00170                 // shuffle vector for the random selection of individuals
-00171                 vector<unsigned int> shuffle;
-00172                 shuffle.resize(_arch.size());
-00173                 // init shuffle
-00174                 for (unsigned int i=0; i<shuffle.size(); i++)
-00175                 {
-00176                         shuffle[i] = i;
-00177                 }
-00178                 // randomize shuffle
-00179                 UF_random_generator <unsigned int int> gen;
-00180                 std::random_shuffle(shuffle.begin(), shuffle.end(), gen);
-00181                 // start the creation of new solutions
-00182                 unsigned int i=0;
-00183                 while ((i<_pop.size()-1) && (i<_arch.size()-1))
-00184                 {
-00185                         _pop[i] = _arch[shuffle[i]];
-00186                         _pop[i+1] = _arch[shuffle[i+1]];
-00187                         // then, apply the operator nIterationsNoise times
-00188                         for (unsigned int j=0; j<nNoiseIterations; j++)
-00189                         {
-00190                                 quadOp(_pop[i], _pop[i+1]);
-00191                         }
-00192                         eval(_pop[i]);
-00193                         eval(_pop[i+1]);
-00194                         i=i+2;
-00195                 }
-00196                 // do we have to add some random solutions ?
-00197                 while (i<_pop.size())
-00198                 {
-00199                         randomMonOp(_pop[i]);
-00200                         eval(_pop[i]);
-00201                         i++;
-00202                 }
-00203         }
-00204         */
-00206 
-00207 
-00208 
-00209 
-00210 
-00211 };
-00212 
-00213 #endif /*MOEOITERATEDIBMOLS_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  - -doxygen 1.4.7
- - diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoLS_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoLS_8h-source.html index e87f08ea0..146ba7da6 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoLS_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoLS_8h-source.html @@ -21,30 +21,55 @@ -

moeoLS.h

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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  +

moeoLS.h

00001 /* 
+00002 * <moeoLS.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Sebastien Cahon, Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOLS_H_
+00039 #define MOEOLS_H_
+00040 
+00041 #include <eoFunctor.h>
+00042 #include <algo/moeoAlgo.h>
+00043 #include <archive/moeoArchive.h>
+00044 
+00049 template < class MOEOT, class Type >
+00050 class moeoLS: public moeoAlgo, public eoBF < Type, moeoArchive < MOEOT > &, void > {};
+00051 
+00052 #endif /*MOEOLS_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoManhattanDistance_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoManhattanDistance_8h-source.html index 7cf3ce194..8f466fb1d 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoManhattanDistance_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoManhattanDistance_8h-source.html @@ -21,54 +21,79 @@ -

moeoManhattanDistance.h

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:
+
moeoManhattanDistance.h
00001 /* 
+00002 * <moeoManhattanDistance.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOMANHATTANDISTANCE_H_
+00039 #define MOEOMANHATTANDISTANCE_H_
+00040 
+00041 #include <math.h>
+00042 #include <distance/moeoNormalizedDistance.h>
+00043 
+00048 template < class MOEOT >
+00049 class moeoManhattanDistance : public moeoNormalizedDistance < MOEOT >
+00050 {
+00051 public:
 00052 
-00054     using moeoNormalizedDistance < MOEOT > :: bounds;
+00054     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
 00055 
-00056 };
-00057 
-00058 #endif /*MOEOMANHATTANDISTANCE_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00056 
+00062     const double operator()(const MOEOT & _moeo1, const MOEOT & _moeo2)
+00063     {
+00064         double result = 0.0;
+00065         double tmp1, tmp2;
+00066         for (unsigned int i=0; i<ObjectiveVector::nObjectives(); i++)
+00067         {
+00068             tmp1 = (_moeo1.objectiveVector()[i] - bounds[i].minimum()) / bounds[i].range();
+00069             tmp2 = (_moeo2.objectiveVector()[i] - bounds[i].minimum()) / bounds[i].range();
+00070             result += fabs(tmp1-tmp2);
+00071         }
+00072         return result;
+00073     }
+00074 
+00075 
+00076 private:
+00077 
+00079     using moeoNormalizedDistance < MOEOT > :: bounds;
+00080 
+00081 };
+00082 
+00083 #endif /*MOEOMANHATTANDISTANCE_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoMetric_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoMetric_8h-source.html index d14b3dbb0..219832df2 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoMetric_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoMetric_8h-source.html @@ -21,53 +21,78 @@ -

moeoMetric.h

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 {};
+
moeoMetric.h
00001 /* 
+00002 * <moeoMetric.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
 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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00038 #ifndef MOEOMETRIC_H_
+00039 #define MOEOMETRIC_H_
+00040 
+00041 #include <vector>
+00042 #include <eoFunctor.h>
+00043 
+00047 class moeoMetric : public eoFunctorBase {};
+00048 
+00049 
+00053 template < class A, class R >
+00054 class moeoUnaryMetric : public eoUF < A, R >, public moeoMetric {};
+00055 
+00056 
+00060 template < class A1, class A2, class R >
+00061 class moeoBinaryMetric : public eoBF < A1, A2, R >, public moeoMetric {};
+00062 
+00063 
+00067 template < class ObjectiveVector, class R >
+00068 class moeoSolutionUnaryMetric : public moeoUnaryMetric < const ObjectiveVector &, R > {};
+00069 
+00070 
+00074 template < class ObjectiveVector, class R >
+00075 class moeoVectorUnaryMetric : public moeoUnaryMetric < const std::vector < ObjectiveVector > &, R > {};
+00076 
+00077 
+00081 template < class ObjectiveVector, class R >
+00082 class moeoSolutionVsSolutionBinaryMetric : public moeoBinaryMetric < const ObjectiveVector &, const ObjectiveVector &, R > {};
+00083 
+00084 
+00088 template < class ObjectiveVector, class R >
+00089 class moeoVectorVsVectorBinaryMetric : public moeoBinaryMetric < const std::vector < ObjectiveVector > &, const std::vector < ObjectiveVector > &, R > {};
+00090 
+00091 
+00092 #endif /*MOEOMETRIC_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoMoveIncrEval_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoMoveIncrEval_8h-source.html deleted file mode 100644 index 884a87bd0..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoMoveIncrEval_8h-source.html +++ /dev/null @@ -1,39 +0,0 @@ - - -ParadisEO-MOEOMovingObjects: moeoMoveIncrEval.h Source File - - - - -
-
-

moeoMoveIncrEval.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 #ifndef _MOEOMOVEINCREVAL_H
-00004 #define _MOEOMOVEINCREVAL_H
-00005 
-00006 #include <eoFunctor.h>
-00007 
-00008 template < class Move >
-00009 class moeoMoveIncrEval : public eoBF < const Move &, const typename Move::EOType &, typename Move::EOType::ObjectiveVector > {};
-00010 
-00011 #endif
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by  - -doxygen 1.4.7
- - diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNSGAII_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNSGAII_8h-source.html index dcf321206..dffb4daac 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNSGAII_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNSGAII_8h-source.html @@ -21,116 +21,141 @@ -

moeoNSGAII.h

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 
-00030 
-00031 #include <eoCloneOps.h>
-00032 
-00039 template < class MOEOT >
-00040 class moeoNSGAII: public moeoEA < MOEOT >
-00041 {
-00042 public:
-00043 
-00050     moeoNSGAII (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoGenOp < MOEOT > & _op) :
-00051             defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select(2),
-00052             replace(fitnessAssignment, diversityAssignment), defaultSGAGenOp(defaultQuadOp, 0.0, defaultMonOp, 0.0),
-00053             genBreed(select, _op), breed(genBreed)
-00054     {}
+
moeoNSGAII.h
00001 /* 
+00002 * <moeoNSGAII.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * AbdelHakim Deneche, Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEONSGAII_H_
+00039 #define MOEONSGAII_H_
+00040 
+00041 #include <eoBreed.h>
+00042 #include <eoContinue.h>
+00043 #include <eoEvalFunc.h>
+00044 #include <eoGenContinue.h>
+00045 #include <eoGeneralBreeder.h>
+00046 #include <eoGenOp.h>
+00047 #include <eoPopEvalFunc.h>
+00048 #include <eoSGAGenOp.h>
+00049 #include <algo/moeoEA.h>
+00050 #include <diversity/moeoFrontByFrontCrowdingDiversityAssignment.h>
+00051 #include <fitness/moeoFastNonDominatedSortingFitnessAssignment.h>
+00052 #include <replacement/moeoElitistReplacement.h>
+00053 #include <selection/moeoDetTournamentSelect.h>
+00054 
 00055 
-00056 
-00063     moeoNSGAII (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoTransform < MOEOT > & _op) :
-00064             defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select(2),
-00065             replace(fitnessAssignment, diversityAssignment), defaultSGAGenOp(defaultQuadOp, 0.0, defaultMonOp, 0.0),
-00066             genBreed(select, _op), breed(genBreed)
-00067     {}
+00056 #include <eoCloneOps.h>
+00057 
+00064 template < class MOEOT >
+00065 class moeoNSGAII: public moeoEA < MOEOT >
+00066 {
+00067 public:
 00068 
-00069 
-00079     moeoNSGAII (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoQuadOp < MOEOT > & _crossover, double _pCross, eoMonOp < MOEOT > & _mutation, double _pMut) :
-00080             defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select (2),
-00081             replace (fitnessAssignment, diversityAssignment), defaultSGAGenOp(_crossover, _pCross, _mutation, _pMut),
-00082             genBreed (select, defaultSGAGenOp), breed (genBreed)
-00083     {}
-00084 
-00085 
-00092     moeoNSGAII (eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoGenOp < MOEOT > & _op) :
-00093             defaultGenContinuator(0), continuator(_continuator), popEval(_eval), select(2),
-00094             replace(fitnessAssignment, diversityAssignment), defaultSGAGenOp(defaultQuadOp, 1.0, defaultMonOp, 1.0),
-00095             genBreed(select, _op), breed(genBreed)
-00096     {}
-00097 
-00098 
-00105     moeoNSGAII (eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoTransform < MOEOT > & _op) :
-00106             continuator(_continuator), popEval(_eval), select(2),
-00107             replace(fitnessAssignment, diversityAssignment), defaultSGAGenOp(defaultQuadOp, 0.0, defaultMonOp, 0.0),
-00108             genBreed(select, _op), breed(genBreed)
-00109     {}
+00075     moeoNSGAII (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoGenOp < MOEOT > & _op) :
+00076             defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select(2),
+00077             replace(fitnessAssignment, diversityAssignment), defaultSGAGenOp(defaultQuadOp, 0.0, defaultMonOp, 0.0),
+00078             genBreed(select, _op), breed(genBreed)
+00079     {}
+00080 
+00081 
+00088     moeoNSGAII (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoTransform < MOEOT > & _op) :
+00089             defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select(2),
+00090             replace(fitnessAssignment, diversityAssignment), defaultSGAGenOp(defaultQuadOp, 0.0, defaultMonOp, 0.0),
+00091             genBreed(select, _op), breed(genBreed)
+00092     {}
+00093 
+00094 
+00104     moeoNSGAII (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoQuadOp < MOEOT > & _crossover, double _pCross, eoMonOp < MOEOT > & _mutation, double _pMut) :
+00105             defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select (2),
+00106             replace (fitnessAssignment, diversityAssignment), defaultSGAGenOp(_crossover, _pCross, _mutation, _pMut),
+00107             genBreed (select, defaultSGAGenOp), breed (genBreed)
+00108     {}
+00109 
 00110 
-00111 
-00116     virtual void operator () (eoPop < MOEOT > &_pop)
-00117     {
-00118         eoPop < MOEOT > offspring, empty_pop;
-00119         popEval (empty_pop, _pop);      // a first eval of _pop
-00120         // evaluate fitness and diversity
-00121         fitnessAssignment(_pop);
-00122         diversityAssignment(_pop);
-00123         do
-00124         {
-00125             // generate offspring, worths are recalculated if necessary
-00126             breed (_pop, offspring);
-00127             // eval of offspring
-00128             popEval (_pop, offspring);
-00129             // after replace, the new pop is in _pop. Worths are recalculated if necessary
-00130             replace (_pop, offspring);
-00131         } while (continuator (_pop));
-00132     }
-00133 
-00134 
-00135 protected:
+00117     moeoNSGAII (eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoGenOp < MOEOT > & _op) :
+00118             defaultGenContinuator(0), continuator(_continuator), popEval(_eval), select(2),
+00119             replace(fitnessAssignment, diversityAssignment), defaultSGAGenOp(defaultQuadOp, 1.0, defaultMonOp, 1.0),
+00120             genBreed(select, _op), breed(genBreed)
+00121     {}
+00122 
+00123 
+00130     moeoNSGAII (eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoTransform < MOEOT > & _op) :
+00131             continuator(_continuator), popEval(_eval), select(2),
+00132             replace(fitnessAssignment, diversityAssignment), defaultSGAGenOp(defaultQuadOp, 0.0, defaultMonOp, 0.0),
+00133             genBreed(select, _op), breed(genBreed)
+00134     {}
+00135 
 00136 
-00138     eoGenContinue < MOEOT > defaultGenContinuator;
-00140     eoContinue < MOEOT > & continuator;
-00142     eoPopLoopEval < MOEOT > popEval;
-00144     moeoDetTournamentSelect < MOEOT > select;
-00146     moeoFastNonDominatedSortingFitnessAssignment < MOEOT > fitnessAssignment;
-00148     moeoFrontByFrontCrowdingDiversityAssignment  < MOEOT > diversityAssignment;
-00150     moeoElitistReplacement < MOEOT > replace;
-00152     eoQuadCloneOp < MOEOT > defaultQuadOp;
-00154     eoMonCloneOp < MOEOT > defaultMonOp;
-00156     eoSGAGenOp < MOEOT > defaultSGAGenOp;
-00158     eoGeneralBreeder < MOEOT > genBreed;
-00160     eoBreed < MOEOT > & breed;
+00141     virtual void operator () (eoPop < MOEOT > &_pop)
+00142     {
+00143         eoPop < MOEOT > offspring, empty_pop;
+00144         popEval (empty_pop, _pop);      // a first eval of _pop
+00145         // evaluate fitness and diversity
+00146         fitnessAssignment(_pop);
+00147         diversityAssignment(_pop);
+00148         do
+00149         {
+00150             // generate offspring, worths are recalculated if necessary
+00151             breed (_pop, offspring);
+00152             // eval of offspring
+00153             popEval (_pop, offspring);
+00154             // after replace, the new pop is in _pop. Worths are recalculated if necessary
+00155             replace (_pop, offspring);
+00156         } while (continuator (_pop));
+00157     }
+00158 
+00159 
+00160 protected:
 00161 
-00162 };
-00163 
-00164 #endif /*MOEONSGAII_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00163     eoGenContinue < MOEOT > defaultGenContinuator;
+00165     eoContinue < MOEOT > & continuator;
+00167     eoPopLoopEval < MOEOT > popEval;
+00169     moeoDetTournamentSelect < MOEOT > select;
+00171     moeoFastNonDominatedSortingFitnessAssignment < MOEOT > fitnessAssignment;
+00173     moeoFrontByFrontCrowdingDiversityAssignment  < MOEOT > diversityAssignment;
+00175     moeoElitistReplacement < MOEOT > replace;
+00177     eoQuadCloneOp < MOEOT > defaultQuadOp;
+00179     eoMonCloneOp < MOEOT > defaultMonOp;
+00181     eoSGAGenOp < MOEOT > defaultSGAGenOp;
+00183     eoGeneralBreeder < MOEOT > genBreed;
+00185     eoBreed < MOEOT > & breed;
+00186 
+00187 };
+00188 
+00189 #endif /*MOEONSGAII_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNSGA_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNSGA_8h-source.html index 074d8c4da..b05c52fb2 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNSGA_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNSGA_8h-source.html @@ -21,107 +21,132 @@ -

moeoNSGA.h

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     {}
+
moeoNSGA.h
00001 /* 
+00002 * <moeoNSGA.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEONSGA_H_
+00039 #define MOEONSGA_H_
+00040 
+00041 #include <eoBreed.h>
+00042 #include <eoContinue.h>
+00043 #include <eoEvalFunc.h>
+00044 #include <eoGenContinue.h>
+00045 #include <eoGeneralBreeder.h>
+00046 #include <eoGenOp.h>
+00047 #include <eoPopEvalFunc.h>
+00048 #include <eoSGAGenOp.h>
+00049 #include <algo/moeoEA.h>
+00050 #include <diversity/moeoFrontByFrontSharingDiversityAssignment.h>
+00051 #include <fitness/moeoFastNonDominatedSortingFitnessAssignment.h>
+00052 #include <replacement/moeoElitistReplacement.h>
+00053 #include <selection/moeoDetTournamentSelect.h>
+00054 
+00061 template < class MOEOT >
+00062 class moeoNSGA: public moeoEA < MOEOT >
+00063 {
+00064 public:
 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     {}
+00073     moeoNSGA (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoGenOp < MOEOT > & _op, double _nicheSize = 0.5) :
+00074             defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select(2),
+00075             diversityAssignment(_nicheSize), replace(fitnessAssignment, diversityAssignment), genBreed(select, _op), breed(genBreed)
+00076     {}
+00077 
+00078 
+00086     moeoNSGA (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoTransform < MOEOT > & _op, double _nicheSize = 0.5) :
+00087             defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select(2),
+00088             diversityAssignment(_nicheSize), replace(fitnessAssignment, diversityAssignment), genBreed(select, _op), breed(genBreed)
+00089     {}
+00090 
+00091 
+00102     moeoNSGA (unsigned int _maxGen, eoEvalFunc < MOEOT > & _eval, eoQuadOp < MOEOT > & _crossover, double _pCross, eoMonOp < MOEOT > & _mutation, double _pMut, double _nicheSize = 0.5) :
+00103             defaultGenContinuator(_maxGen), continuator(defaultGenContinuator), popEval(_eval), select (2),
+00104             diversityAssignment(_nicheSize), replace (fitnessAssignment, diversityAssignment),
+00105             defaultSGAGenOp(_crossover, _pCross, _mutation, _pMut), genBreed (select, defaultSGAGenOp), breed (genBreed)
+00106     {}
+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:
+00116     moeoNSGA (eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoGenOp < MOEOT > & _op, double _nicheSize = 0.5) :
+00117             continuator(_continuator), popEval(_eval), select(2),
+00118             diversityAssignment(_nicheSize), replace(fitnessAssignment, diversityAssignment), genBreed(select, _op), breed(genBreed)
+00119     {}
+00120 
+00121 
+00129     moeoNSGA (eoContinue < MOEOT > & _continuator, eoEvalFunc < MOEOT > & _eval, eoTransform < MOEOT > & _op, double _nicheSize = 0.5) :
+00130             continuator(_continuator), popEval(_eval), select(2),
+00131             diversityAssignment(_nicheSize), replace(fitnessAssignment, diversityAssignment), genBreed(select, _op), breed(genBreed)
+00132     {}
+00133 
 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 };
+00139     virtual void operator () (eoPop < MOEOT > &_pop)
+00140     {
+00141         eoPop < MOEOT > offspring, empty_pop;
+00142         popEval (empty_pop, _pop);      // a first eval of _pop
+00143         // evaluate fitness and diversity
+00144         fitnessAssignment(_pop);
+00145         diversityAssignment(_pop);
+00146         do
+00147         {
+00148             // generate offspring, worths are recalculated if necessary
+00149             breed (_pop, offspring);
+00150             // eval of offspring
+00151             popEval (_pop, offspring);
+00152             // after replace, the new pop is in _pop. Worths are recalculated if necessary
+00153             replace (_pop, offspring);
+00154         } while (continuator (_pop));
+00155     }
+00156 
 00157 
-00158 #endif /*MOEONSGAII_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00158 protected:
+00159 
+00161     eoGenContinue < MOEOT > defaultGenContinuator;
+00163     eoContinue < MOEOT > & continuator;
+00165     eoPopLoopEval < MOEOT > popEval;
+00167     moeoDetTournamentSelect < MOEOT > select;
+00169     moeoFastNonDominatedSortingFitnessAssignment < MOEOT > fitnessAssignment;
+00171     moeoFrontByFrontSharingDiversityAssignment  < MOEOT > diversityAssignment;
+00173     moeoElitistReplacement < MOEOT > replace;
+00175     eoSGAGenOp < MOEOT > defaultSGAGenOp;
+00177     eoGeneralBreeder < MOEOT > genBreed;
+00179     eoBreed < MOEOT > & breed;
+00180 
+00181 };
+00182 
+00183 #endif /*MOEONSGAII_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNormalizedDistance_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNormalizedDistance_8h-source.html index b9a344e9c..cafa69ec9 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNormalizedDistance_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNormalizedDistance_8h-source.html @@ -21,93 +21,118 @@ -

moeoNormalizedDistance.h

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     }
+
moeoNormalizedDistance.h
00001 /* 
+00002 * <moeoNormalizedDistance.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEONORMALIZEDDISTANCE_H_
+00039 #define MOEONORMALIZEDDISTANCE_H_
+00040 
+00041 #include <vector>
+00042 #include <utils/eoRealBounds.h>
+00043 #include <distance/moeoDistance.h>
 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_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00048 template < class MOEOT , class Type = double >
+00049 class moeoNormalizedDistance : public moeoDistance < MOEOT , Type >
+00050 {
+00051 public:
+00052 
+00054     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+00055 
+00056 
+00060     moeoNormalizedDistance()
+00061     {
+00062         bounds.resize(ObjectiveVector::Traits::nObjectives());
+00063         // initialize bounds in case someone does not want to use them
+00064         for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++)
+00065         {
+00066             bounds[i] = eoRealInterval(0,1);
+00067         }
+00068     }
+00069 
+00070 
+00074     static double tiny()
+00075     {
+00076         return 1e-6;
+00077     }
+00078 
+00079 
+00084     virtual void setup(const eoPop < MOEOT > & _pop)
+00085     {
+00086         double min, max;
+00087         for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++)
+00088         {
+00089             min = _pop[0].objectiveVector()[i];
+00090             max = _pop[0].objectiveVector()[i];
+00091             for (unsigned int j=1; j<_pop.size(); j++)
+00092             {
+00093                 min = std::min(min, _pop[j].objectiveVector()[i]);
+00094                 max = std::max(max, _pop[j].objectiveVector()[i]);
+00095             }
+00096             // setting of the bounds for the objective i
+00097             setup(min, max, i);
+00098         }
+00099     }
+00100 
+00101 
+00108     virtual void setup(double _min, double _max, unsigned int _obj)
+00109     {
+00110         if (_min == _max)
+00111         {
+00112             _min -= tiny();
+00113             _max += tiny();
+00114         }
+00115         bounds[_obj] = eoRealInterval(_min, _max);
+00116     }
+00117 
+00118 
+00124     virtual void setup(eoRealInterval _realInterval, unsigned int _obj)
+00125     {
+00126         bounds[_obj] = _realInterval;
+00127     }
+00128 
+00129 
+00130 protected:
+00131 
+00133     std::vector < eoRealInterval > bounds;
+00134 
+00135 };
+00136 
+00137 #endif /*MOEONORMALIZEDDISTANCE_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNormalizedSolutionVsSolutionBinaryMetric_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNormalizedSolutionVsSolutionBinaryMetric_8h-source.html index d53095a5d..b27059a28 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNormalizedSolutionVsSolutionBinaryMetric_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoNormalizedSolutionVsSolutionBinaryMetric_8h-source.html @@ -21,72 +21,97 @@ -

moeoNormalizedSolutionVsSolutionBinaryMetric.h

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()
+
moeoNormalizedSolutionVsSolutionBinaryMetric.h
00001 /* 
+00002 * <moeoNormalizedSolutionVsSolutionBinaryMetric.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEONORMALIZEDSOLUTIONVSSOLUTIONBINARYMETRIC_H_
+00039 #define MOEONORMALIZEDSOLUTIONVSSOLUTIONBINARYMETRIC_H_
+00040 
+00041 #include <vector>
+00042 #include <utils/eoRealBounds.h>
+00043 #include <metric/moeoMetric.h>
+00044 
+00050 template < class ObjectiveVector, class R >
+00051 class moeoNormalizedSolutionVsSolutionBinaryMetric : public moeoSolutionVsSolutionBinaryMetric < ObjectiveVector, R >
+00052 {
+00053 public:
+00054 
+00058     moeoNormalizedSolutionVsSolutionBinaryMetric()
+00059     {
+00060         bounds.resize(ObjectiveVector::Traits::nObjectives());
+00061         // initialize bounds in case someone does not want to use them
+00062         for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++)
+00063         {
+00064             bounds[i] = eoRealInterval(0,1);
+00065         }
+00066     }
+00067 
+00068 
+00075     void setup(double _min, double _max, unsigned int _obj)
 00076     {
-00077         return 1e-6;
-00078     }
-00079 
-00080 
-00081 protected:
-00082 
-00084     std::vector < eoRealInterval > bounds;
+00077         if (_min == _max)
+00078         {
+00079             _min -= tiny();
+00080             _max += tiny();
+00081         }
+00082         bounds[_obj] = eoRealInterval(_min, _max);
+00083     }
+00084 
 00085 
-00086 };
-00087 
-00088 #endif /*MOEONORMALIZEDSOLUTIONVSSOLUTIONBINARYMETRIC_H_*/
-
Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by 
+00091     virtual void setup(eoRealInterval _realInterval, unsigned int _obj)
+00092     {
+00093         bounds[_obj] = _realInterval;
+00094     }
+00095 
+00096 
+00100     static double tiny()
+00101     {
+00102         return 1e-6;
+00103     }
+00104 
+00105 
+00106 protected:
+00107 
+00109     std::vector < eoRealInterval > bounds;
+00110 
+00111 };
+00112 
+00113 #endif /*MOEONORMALIZEDSOLUTIONVSSOLUTIONBINARYMETRIC_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveObjectiveVectorComparator_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveObjectiveVectorComparator_8h-source.html index 255c5ed71..d65d27d66 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveObjectiveVectorComparator_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveObjectiveVectorComparator_8h-source.html @@ -21,51 +21,76 @@ -

moeoObjectiveObjectiveVectorComparator.h

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_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +

moeoObjectiveObjectiveVectorComparator.h

00001 /* 
+00002 * <moeoObjectiveObjectiveVectorComparator.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOOBJECTIVEOBJECTIVEVECTORCOMPARATOR_H_
+00039 #define MOEOOBJECTIVEOBJECTIVEVECTORCOMPARATOR_H_
+00040 
+00041 #include <comparator/moeoObjectiveVectorComparator.h>
+00042 
+00046 template < class ObjectiveVector >
+00047 class moeoObjectiveObjectiveVectorComparator : public moeoObjectiveVectorComparator < ObjectiveVector >
+00048 {
+00049 public:
+00050 
+00056     const bool operator()(const ObjectiveVector & _objectiveVector1, const ObjectiveVector & _objectiveVector2)
+00057     {
+00058         for (unsigned int i=0; i<ObjectiveVector::nObjectives(); i++)
+00059         {
+00060             if ( fabs(_objectiveVector1[i] - _objectiveVector2[i]) > ObjectiveVector::Traits::tolerance() )
+00061             {
+00062                 if (_objectiveVector1[i] < _objectiveVector2[i])
+00063                 {
+00064                     return true;
+00065                 }
+00066                 else
+00067                 {
+00068                     return false;
+00069                 }
+00070             }
+00071         }
+00072         return false;
+00073     }
+00074 
+00075 };
+00076 
+00077 #endif /*MOEOOBJECTIVEOBJECTIVEVECTORCOMPARATOR_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVectorComparator_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVectorComparator_8h-source.html index a98a92730..56a73d90f 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVectorComparator_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVectorComparator_8h-source.html @@ -21,29 +21,54 @@ -

moeoObjectiveVectorComparator.h

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_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +

moeoObjectiveVectorComparator.h

00001 /* 
+00002 * <moeoObjectiveVectorComparator.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOOBJECTIVEVECTORCOMPARATOR_H_
+00039 #define MOEOOBJECTIVEVECTORCOMPARATOR_H_
+00040 
+00041 #include <math.h>
+00042 #include <eoFunctor.h>
+00043 
+00048 template < class ObjectiveVector >
+00049 class moeoObjectiveVectorComparator : public eoBF < const ObjectiveVector &, const ObjectiveVector &, const bool > {};
+00050 
+00051 #endif /*MOEOOBJECTIVEVECTORCOMPARATOR_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVectorTraits_8cpp-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVectorTraits_8cpp-source.html index 04e0e4aeb..ab7fcde8e 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVectorTraits_8cpp-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVectorTraits_8cpp-source.html @@ -21,24 +21,49 @@ -

moeoObjectiveVectorTraits.cpp

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;
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +

moeoObjectiveVectorTraits.cpp

00001 /* 
+00002 * <moeoObjectiveVectorTraits.cpp>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #include <core/moeoObjectiveVectorTraits.h>
+00039 
+00040 // The static variables of the moeoObjectiveVectorTraits class need to be allocated
+00041 unsigned int moeoObjectiveVectorTraits::nObj;
+00042 std::vector < bool > moeoObjectiveVectorTraits::bObj;
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVectorTraits_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVectorTraits_8h-source.html index d3e14e4ab..7d926ecc5 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVectorTraits_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVectorTraits_8h-source.html @@ -21,86 +21,111 @@ -

moeoObjectiveVectorTraits.h

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];
+
moeoObjectiveVectorTraits.h
00001 /* 
+00002 * <moeoObjectiveVectorTraits.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOOBJECTIVEVECTORTRAITS_H_
+00039 #define MOEOOBJECTIVEVECTORTRAITS_H_
+00040 
+00041 #include <iostream>
+00042 #include <stdexcept>
+00043 #include <vector>
+00044 
+00048 class moeoObjectiveVectorTraits
+00049 {
+00050 public:
+00051 
+00057     static void setup(unsigned int _nObjectives, std::vector < bool > & _bObjectives)
+00058     {
+00059         // in case the number of objectives was already set to a different value
+00060         if ( nObj && (nObj != _nObjectives) ) {
+00061             std::cout << "WARNING\n";
+00062             std::cout << "WARNING : the number of objectives are changing\n";
+00063             std::cout << "WARNING : Make sure all existing objects are destroyed\n";
+00064             std::cout << "WARNING\n";
+00065         }
+00066         // number of objectives
+00067         nObj = _nObjectives;
+00068         // min/max vector
+00069         bObj = _bObjectives;
+00070         // in case the number of objectives and the min/max vector size don't match
+00071         if (nObj != bObj.size())
+00072             throw std::runtime_error("Number of objectives and min/max size don't match in moeoObjectiveVectorTraits::setup");
 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;
+00079     static unsigned int nObjectives()
+00080     {
+00081         // in case the number of objectives would not be assigned yet
+00082         if (! nObj)
+00083             throw std::runtime_error("Number of objectives not assigned in moeoObjectiveVectorTraits");
+00084         return nObj;
+00085     }
+00086 
+00087 
+00092     static bool minimizing(unsigned int _i)
+00093     {
+00094         // in case there would be a wrong index
+00095         if (_i >= bObj.size())
+00096             throw std::runtime_error("Wrong index in moeoObjectiveVectorTraits");
+00097         return bObj[_i];
+00098     }
+00099 
 00100 
-00101 };
-00102 
-00103 #endif /*MOEOOBJECTIVEVECTORTRAITS_H_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by 
+00105     static bool maximizing(unsigned int _i) {
+00106         return (! minimizing(_i));
+00107     }
+00108 
+00109 
+00113     static double tolerance()
+00114     {
+00115         return 1e-6;
+00116     }
+00117 
+00118 
+00119 private:
+00120 
+00122     static unsigned int nObj;
+00124     static std::vector < bool > bObj;
+00125 
+00126 };
+00127 
+00128 #endif /*MOEOOBJECTIVEVECTORTRAITS_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVector_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVector_8h-source.html index ab6ebbb2e..3d74c0518 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVector_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoObjectiveVector_8h-source.html @@ -21,67 +21,92 @@ -

moeoObjectiveVector.h

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     }
+
moeoObjectiveVector.h
00001 /* 
+00002 * <moeoObjectiveVector.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOOBJECTIVEVECTOR_H_
+00039 #define MOEOOBJECTIVEVECTOR_H_
+00040 
+00041 #include <vector>
+00042 
+00049 template < class ObjectiveVectorTraits, class ObjectiveVectorType >
+00050 class moeoObjectiveVector : public std::vector < ObjectiveVectorType >
+00051 {
+00052 public:
+00053 
+00055     typedef ObjectiveVectorTraits Traits;
+00057     typedef ObjectiveVectorType Type;
+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_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by 
+00063     moeoObjectiveVector(Type _value = Type()) : std::vector < Type > (ObjectiveVectorTraits::nObjectives(), _value)
+00064     {}
+00065 
+00066 
+00071     moeoObjectiveVector(std::vector < Type > & _v) : std::vector < Type > (_v)
+00072     {}
+00073 
+00074 
+00080     static void setup(unsigned int _nObjectives, std::vector < bool > & _bObjectives)
+00081     {
+00082         ObjectiveVectorTraits::setup(_nObjectives, _bObjectives);
+00083     }
+00084 
+00085 
+00089     static unsigned int nObjectives()
+00090     {
+00091         return ObjectiveVectorTraits::nObjectives();
+00092     }
+00093 
+00094 
+00099     static bool minimizing(unsigned int _i)
+00100     {
+00101         return ObjectiveVectorTraits::minimizing(_i);
+00102     }
+00103 
+00104 
+00109     static bool maximizing(unsigned int _i)
+00110     {
+00111         return ObjectiveVectorTraits::maximizing(_i);
+00112     }
+00113 
+00114 };
+00115 
+00116 #endif /*MOEOOBJECTIVEVECTOR_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoOneObjectiveComparator_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoOneObjectiveComparator_8h-source.html index 36912dc7d..c8e529eab 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoOneObjectiveComparator_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoOneObjectiveComparator_8h-source.html @@ -21,51 +21,76 @@ -

moeoOneObjectiveComparator.h

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     }
+
moeoOneObjectiveComparator.h
00001 /* 
+00002 * <moeoOneObjectiveComparator.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+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_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by 
+00038 #ifndef MOEOONEOBJECTIVECOMPARATOR_H_
+00039 #define MOEOONEOBJECTIVECOMPARATOR_H_
+00040 
+00041 #include <comparator/moeoComparator.h>
+00042 
+00046 template < class MOEOT >
+00047 class moeoOneObjectiveComparator : public moeoComparator < MOEOT >
+00048 {
+00049 public:
+00050 
+00055     moeoOneObjectiveComparator(unsigned int _obj) : obj(_obj)
+00056     {
+00057         if (obj > MOEOT::ObjectiveVector::nObjectives())
+00058         {
+00059             throw std::runtime_error("Problem with the index of objective in moeoOneObjectiveComparator");
+00060         }
+00061     }
+00062 
+00063 
+00069     const bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2)
+00070     {
+00071         return _moeo1.objectiveVector()[obj] < _moeo2.objectiveVector()[obj];
+00072     }
+00073 
+00074 
+00075 private:
+00076 
+00078     unsigned int obj;
+00079 
+00080 };
+00081 
+00082 #endif /*MOEOONEOBJECTIVECOMPARATOR_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoParetoBasedFitnessAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoParetoBasedFitnessAssignment_8h-source.html index 1752b659d..b4bdbabba 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoParetoBasedFitnessAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoParetoBasedFitnessAssignment_8h-source.html @@ -21,28 +21,53 @@ -

moeoParetoBasedFitnessAssignment.h

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_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +

moeoParetoBasedFitnessAssignment.h

00001 /* 
+00002 * <moeoParetoBasedFitnessAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOPARETOBASEDFITNESSASSIGNMENT_H_
+00039 #define MOEOPARETOBASEDFITNESSASSIGNMENT_H_
+00040 
+00041 #include <fitness/moeoFitnessAssignment.h>
+00042 
+00046 template < class MOEOT >
+00047 class moeoParetoBasedFitnessAssignment : public moeoFitnessAssignment < MOEOT > {};
+00048     
+00049 #endif /*MOEOPARETOBASEDFITNESSASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoParetoObjectiveVectorComparator_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoParetoObjectiveVectorComparator_8h-source.html index bfb5babe7..614024493 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoParetoObjectiveVectorComparator_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoParetoObjectiveVectorComparator_8h-source.html @@ -21,69 +21,94 @@ -

moeoParetoObjectiveVectorComparator.h

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_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +

moeoParetoObjectiveVectorComparator.h

00001 /* 
+00002 * <moeoParetoObjectiveVectorComparator.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOPARETOOBJECTIVEVECTORCOMPARATOR_H_
+00039 #define MOEOPARETOOBJECTIVEVECTORCOMPARATOR_H_
+00040 
+00041 #include <comparator/moeoObjectiveVectorComparator.h>
+00042 
+00046 template < class ObjectiveVector >
+00047 class moeoParetoObjectiveVectorComparator : public moeoObjectiveVectorComparator < ObjectiveVector >
+00048 {
+00049 public:
+00050 
+00056     const bool operator()(const ObjectiveVector & _objectiveVector1, const ObjectiveVector & _objectiveVector2)
+00057     {
+00058         bool dom = false;
+00059         for (unsigned int i=0; i<ObjectiveVector::nObjectives(); i++)
+00060         {
+00061             // first, we have to check if the 2 objective values are not equal for the ith objective
+00062             if ( fabs(_objectiveVector1[i] - _objectiveVector2[i]) > ObjectiveVector::Traits::tolerance() )
+00063             {
+00064                 // if the ith objective have to be minimized...
+00065                 if (ObjectiveVector::minimizing(i))
+00066                 {
+00067                     if (_objectiveVector1[i] > _objectiveVector2[i])
+00068                     {
+00069                         dom = true;             //_objectiveVector1[i] is not better than _objectiveVector2[i]
+00070                     }
+00071                     else
+00072                     {
+00073                         return false;   //_objectiveVector2 cannot dominate _objectiveVector1
+00074                     }
+00075                 }
+00076                 // if the ith objective have to be maximized...
+00077                 else if (ObjectiveVector::maximizing(i))
+00078                 {
+00079                     if (_objectiveVector1[i] < _objectiveVector2[i])
+00080                     {
+00081                         dom = true;             //_objectiveVector1[i] is not better than _objectiveVector2[i]
+00082                     }
+00083                     else
+00084                     {
+00085                         return false;   //_objectiveVector2 cannot dominate _objectiveVector1
+00086                     }
+00087                 }
+00088             }
+00089         }
+00090         return dom;
+00091     }
+00092 
+00093 };
+00094 
+00095 #endif /*MOEOPARETOOBJECTIVEVECTORCOMPARATOR_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRandomSelect_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRandomSelect_8h-source.html index 5c4346c29..e4a32061e 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRandomSelect_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRandomSelect_8h-source.html @@ -21,41 +21,66 @@ -

moeoRandomSelect.h

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_ */
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +

moeoRandomSelect.h

00001 /* 
+00002 * <moeoRandomSelect.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEORANDOMSELECT_H_
+00039 #define MOEORANDOMSELECT_H_
+00040 
+00041 #include <eoRandomSelect.h>
+00042 #include <selection/moeoSelectOne.h>
+00043 
+00044 
+00048 template < class MOEOT > class moeoRandomSelect:public moeoSelectOne < MOEOT >, public eoRandomSelect <MOEOT >
+00049 {
+00050 public:
+00051 
+00055     moeoRandomSelect(){}
+00056 
+00057 
+00061     const MOEOT & operator () (const eoPop < MOEOT > &_pop)
+00062     {
+00063         return eoRandomSelect < MOEOT >::operator ()(_pop);
+00064     }
+00065 
+00066 };
+00067 
+00068 #endif /*MOEORANDOMSELECT_H_ */
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRealObjectiveVector_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRealObjectiveVector_8h-source.html index b0a950b9e..3ba5dad61 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRealObjectiveVector_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRealObjectiveVector_8h-source.html @@ -21,119 +21,144 @@ -

moeoRealObjectiveVector.h

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 
+
moeoRealObjectiveVector.h
00001 /* 
+00002 * <moeoRealObjectiveVector.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOREALOBJECTIVEVECTOR_H_
+00039 #define MOEOREALOBJECTIVEVECTOR_H_
+00040 
+00041 #include <iostream>
+00042 #include <math.h>
+00043 #include <comparator/moeoObjectiveObjectiveVectorComparator.h>
+00044 #include <comparator/moeoParetoObjectiveVectorComparator.h>
+00045 #include <core/moeoObjectiveVector.h>
+00046 
+00051 template < class ObjectiveVectorTraits >
+00052 class moeoRealObjectiveVector : public moeoObjectiveVector < ObjectiveVectorTraits, double >
+00053 {
+00054 public:
+00055 
+00056     using moeoObjectiveVector < ObjectiveVectorTraits, double >::size;
+00057     using moeoObjectiveVector < ObjectiveVectorTraits, double >::operator[];
+00058 
+00062     moeoRealObjectiveVector(double _value = 0.0) : moeoObjectiveVector < ObjectiveVectorTraits, double > (_value)
+00063     {}
+00064 
+00065 
+00070     moeoRealObjectiveVector(std::vector < double > & _v) : moeoObjectiveVector < ObjectiveVectorTraits, double > (_v)
+00071     {}
+00072 
+00073 
+00079     bool dominates(const moeoRealObjectiveVector < ObjectiveVectorTraits > & _other) const
+00080     {
+00081         moeoParetoObjectiveVectorComparator < moeoRealObjectiveVector<ObjectiveVectorTraits> > comparator;
+00082         return comparator(_other, *this);
+00083     }
+00084 
+00085 
+00090     bool operator==(const moeoRealObjectiveVector < ObjectiveVectorTraits > & _other) const
+00091     {
+00092         for (unsigned int i=0; i < size(); i++)
+00093         {
+00094             if ( fabs(operator[](i) - _other[i]) > ObjectiveVectorTraits::tolerance() )
+00095             {
+00096                 return false;
+00097             }
+00098         }
+00099         return true;
+00100     }
+00101 
+00102 
+00107     bool operator!=(const moeoRealObjectiveVector < ObjectiveVectorTraits > & _other) const
+00108     {
+00109         return ! operator==(_other);
+00110     }
+00111 
+00112 
+00118     bool operator<(const moeoRealObjectiveVector < ObjectiveVectorTraits > & _other) const
+00119     {
+00120         moeoObjectiveObjectiveVectorComparator < moeoRealObjectiveVector < ObjectiveVectorTraits > > cmp;
+00121         return cmp(*this, _other);
+00122     }
+00123 
+00124 
+00130     bool operator>(const moeoRealObjectiveVector < ObjectiveVectorTraits > & _other) const
+00131     {
+00132         return _other < *this;
+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_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by 
+00135 
+00141     bool operator<=(const moeoRealObjectiveVector < ObjectiveVectorTraits > & _other) const
+00142     {
+00143         return operator==(_other) || operator<(_other);
+00144     }
+00145 
+00146 
+00152     bool operator>=(const moeoRealObjectiveVector < ObjectiveVectorTraits > & _other) const
+00153     {
+00154         return operator==(_other) || operator>(_other);
+00155     }
+00156 
+00157 };
+00158 
+00159 
+00165 template < class ObjectiveVectorTraits >
+00166 std::ostream & operator<<(std::ostream & _os, const moeoRealObjectiveVector < ObjectiveVectorTraits > & _objectiveVector)
+00167 {
+00168     for (unsigned int i=0; i<_objectiveVector.size(); i++)
+00169     {
+00170         _os << _objectiveVector[i] << '\t';
+00171     }
+00172     return _os;
+00173 }
+00174 
+00180 template < class ObjectiveVectorTraits >
+00181 std::istream & operator>>(std::istream & _is, moeoRealObjectiveVector < ObjectiveVectorTraits > & _objectiveVector)
+00182 {
+00183     _objectiveVector = moeoRealObjectiveVector < ObjectiveVectorTraits > ();
+00184     for (unsigned int i=0; i<_objectiveVector.size(); i++)
+00185     {
+00186         _is >> _objectiveVector[i];
+00187     }
+00188     return _is;
+00189 }
+00190 
+00191 #endif /*MOEOREALOBJECTIVEVECTOR_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRealVector_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRealVector_8h-source.html index bc8716902..a16a3abad 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRealVector_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRealVector_8h-source.html @@ -21,41 +21,66 @@ -

moeoRealVector.h

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_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +

moeoRealVector.h

00001 /* 
+00002 * <moeoRealVector.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOREALVECTOR_H_
+00039 #define MOEOREALVECTOR_H_
+00040 
+00041 #include <core/moeoVector.h>
+00042 
+00046 template < class MOEOObjectiveVector, class MOEOFitness, class MOEODiversity >
+00047 class moeoRealVector : public moeoVector < MOEOObjectiveVector, MOEOFitness, MOEODiversity, double >
+00048 {
+00049 public:
+00050 
+00056     moeoRealVector(unsigned int _size = 0, double _value = 0.0) : moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, double >(_size, _value)
+00057     {}
+00058     
+00059     
+00063     virtual std::string className() const
+00064     {
+00065         return "moeoRealVector";
+00066     }
+00067     
+00068 };
+00069 
+00070 #endif /*MOEOREALVECTOR_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoReferencePointIndicatorBasedFitnessAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoReferencePointIndicatorBasedFitnessAssignment_8h-source.html deleted file mode 100644 index 0501f0edf..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoReferencePointIndicatorBasedFitnessAssignment_8h-source.html +++ /dev/null @@ -1,109 +0,0 @@ - - -ParadisEO-MOEOMovingObjects: moeoReferencePointIndicatorBasedFitnessAssignment.h Source File - - - - -
-
-

moeoReferencePointIndicatorBasedFitnessAssignment.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-00002 
-00003 //-----------------------------------------------------------------------------
-00004 // moeoReferencePointIndicatorBasedFitnessAssignment.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 MOEOREFERENCEPOINTINDICATORBASEDFITNESSASSIGNMENT_H_
-00014 #define MOEOREFERENCEPOINTINDICATORBASEDFITNESSASSIGNMENT_H_
-00015 
-00016 #include <math.h>
-00017 #include <eoPop.h>
-00018 #include <fitness/moeoFitnessAssignment.h>
-00019 #include <metric/moeoNormalizedSolutionVsSolutionBinaryMetric.h>
-00020 
-00024 template < class MOEOT >
-00025 class moeoReferencePointIndicatorBasedFitnessAssignment : public moeoFitnessAssignment < MOEOT >
-00026 {
-00027 public:
-00028 
-00030     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
-00031 
-00037     moeoReferencePointIndicatorBasedFitnessAssignment (ObjectiveVector & _refPoint, moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & _metric) :
-00038             refPoint(_refPoint), metric(_metric)
-00039     {}
-00040 
-00041 
-00046     void operator()(eoPop < MOEOT > & _pop)
-00047     {
-00048         // 1 - setting of the bounds
-00049         setup(_pop);
-00050         // 2 - setting fitnesses
-00051         setFitnesses(_pop);
-00052     }
-00053 
-00054 
-00060     void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec)
-00061     {
-00062         // nothing to do  ;-)
-00063     }
-00064 
-00065 
-00066 protected:
-00067 
-00069     ObjectiveVector & refPoint;
-00071     moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & metric;
-00072 
-00073 
-00078     void setup(const eoPop < MOEOT > & _pop)
-00079     {
-00080         double min, max;
-00081         for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++)
-00082         {
-00083             min = refPoint[i];
-00084             max = refPoint[i];
-00085             for (unsigned int j=0; j<_pop.size(); j++)
-00086             {
-00087                 min = std::min(min, _pop[j].objectiveVector()[i]);
-00088                 max = std::max(max, _pop[j].objectiveVector()[i]);
-00089             }
-00090             // setting of the bounds for the objective i
-00091             metric.setup(min, max, i);
-00092         }
-00093     }
-00094 
-00099     void setFitnesses(eoPop < MOEOT > & _pop)
-00100     {
-00101         for (unsigned int i=0; i<_pop.size(); i++)
-00102         {
-00103             _pop[i].fitness(- metric(_pop[i].objectiveVector(), refPoint) );
-00104         }
-00105     }
-00106 
-00107 };
-00108 
-00109 #endif /*MOEOREFERENCEPOINTINDICATORBASEDFITNESSASSIGNMENT_H_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  - -doxygen 1.4.7
- - diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoReplacement_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoReplacement_8h-source.html index 4ddb08da5..1b9d06242 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoReplacement_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoReplacement_8h-source.html @@ -21,28 +21,53 @@ -

moeoReplacement.h

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_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +

moeoReplacement.h

00001 /* 
+00002 * <moeoReplacement.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOREPLACEMENT_H_
+00039 #define MOEOREPLACEMENT_H_
+00040 
+00041 #include <eoReplacement.h>
+00042 
+00046 template < class MOEOT >
+00047 class moeoReplacement : public eoReplacement < MOEOT > {};
+00048 
+00049 #endif /*MOEOREPLACEMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRouletteSelect_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRouletteSelect_8h-source.html index 248181472..679a905d6 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRouletteSelect_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoRouletteSelect_8h-source.html @@ -21,56 +21,81 @@ -

moeoRouletteSelect.h

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 
+
moeoRouletteSelect.h
00001 /* 
+00002 * <moeoRouletteSelect.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOROULETTESELECT_H_
+00039 #define MOEOROULETTESELECT_H_
+00040 
+00041 #include <selection/moeoSelectOne.h>
+00042 #include <selection/moeoSelectors.h>
 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_ */
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by 
+00048 template < class MOEOT >
+00049 class moeoRouletteSelect:public moeoSelectOne < MOEOT >
+00050 {
+00051 public:
+00052 
+00057     moeoRouletteSelect (unsigned int _tSize = 2) : tSize (_tSize)
+00058     {
+00059         // consistency check
+00060         if (tSize < 2)
+00061         {
+00062             std::
+00063             cout << "Warning, Tournament size should be >= 2\nAdjusted to 2\n";
+00064             tSize = 2;
+00065         }
+00066     }
+00067 
+00068 
+00073     const MOEOT & operator  () (const eoPop < MOEOT > & _pop)
+00074     {
+00075         // use the selector
+00076         return mo_roulette_wheel(_pop,tSize);
+00077     }
+00078 
+00079 
+00080 protected:
+00081 
+00083     double & tSize;
+00084 
+00085 };
+00086 
+00087 #endif /*MOEOROULETTESELECT_H_ */
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoScalarFitnessAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoScalarFitnessAssignment_8h-source.html index f06729db6..fbc4309d6 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoScalarFitnessAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoScalarFitnessAssignment_8h-source.html @@ -21,28 +21,53 @@ -

moeoScalarFitnessAssignment.h

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_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +

moeoScalarFitnessAssignment.h

00001 /* 
+00002 * <moeoScalarFitnessAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOSCALARFITNESSASSIGNMENT_H_
+00039 #define MOEOSCALARFITNESSASSIGNMENT_H_
+00040 
+00041 #include <fitness/moeoFitnessAssignment.h>
+00042 
+00046 template < class MOEOT >
+00047 class moeoScalarFitnessAssignment : public moeoFitnessAssignment < MOEOT > {};
+00048     
+00049 #endif /*MOEOSCALARFITNESSASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSelectFromPopAndArch_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSelectFromPopAndArch_8h-source.html index f2f157f23..55aaa858c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSelectFromPopAndArch_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSelectFromPopAndArch_8h-source.html @@ -21,72 +21,97 @@ -

moeoSelectFromPopAndArch.h

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     }
+
moeoSelectFromPopAndArch.h
00001 /* 
+00002 * <moeoSelectFromPopAndArch.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOSELECTONEFROMPOPANDARCH_H_
+00039 #define MOEOSELECTONEFROMPOPANDARCH_H_
+00040 
+00041 #include <eoPop.h>
+00042 #include <utils/eoRNG.h>
+00043 #include <archive/moeoArchive.h>
+00044 #include <selection/moeoSelectOne.h>
+00045 #include <selection/moeoRandomSelect.h>
+00046 
+00050 template < class MOEOT >
+00051 class moeoSelectFromPopAndArch : public moeoSelectOne < MOEOT >
+00052 {
+00053 public:
+00054 
+00062     moeoSelectFromPopAndArch (moeoSelectOne < MOEOT > & _popSelectOne, moeoSelectOne < MOEOT > _archSelectOne, moeoArchive < MOEOT > & _arch, double _ratioFromPop=0.5)
+00063             : popSelectOne(_popSelectOne), archSelectOne(_archSelectOne), arch(_arch), ratioFromPop(_ratioFromPop)
+00064     {}
+00065 
 00066 
-00067 
-00071     virtual void setup (const eoPop < MOEOT > & _pop)
-00072     {
-00073         popSelectOne.setup(_pop);
-00074     }
-00075 
+00073     moeoSelectFromPopAndArch (moeoSelectOne < MOEOT > & _popSelectOne, moeoArchive < MOEOT > & _arch, double _ratioFromPop=0.5)
+00074             : popSelectOne(_popSelectOne), archSelectOne(randomSelectOne), arch(_arch), ratioFromPop(_ratioFromPop)
+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 };
+00077 
+00081     virtual const MOEOT & operator () (const eoPop < MOEOT > & pop)
+00082     {
+00083         if (arch.size() > 0)
+00084             if (rng.flip(ratioFromPop))
+00085                 return popSelectOne(pop);
+00086             else
+00087                 return archSelectOne(arch);
+00088         else
+00089             return popSelectOne(pop);
+00090     }
 00091 
-00092 #endif /*MOEOSELECTONEFROMPOPANDARCH_H_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by 
+00092 
+00096     virtual void setup (const eoPop < MOEOT > & _pop)
+00097     {
+00098         popSelectOne.setup(_pop);
+00099     }
+00100 
+00101 
+00102 private:
+00103 
+00105     moeoSelectOne < MOEOT > & popSelectOne;
+00107     moeoSelectOne < MOEOT > & archSelectOne;
+00109     moeoArchive < MOEOT > & arch;
+00111     double ratioFromPop;
+00113     moeoRandomSelect < MOEOT > randomSelectOne;
+00114 
+00115 };
+00116 
+00117 #endif /*MOEOSELECTONEFROMPOPANDARCH_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSelectOne_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSelectOne_8h-source.html index 5092056d0..0fdc7f370 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSelectOne_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSelectOne_8h-source.html @@ -21,28 +21,53 @@ -

moeoSelectOne.h

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_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +

moeoSelectOne.h

00001 /* 
+00002 * <moeoSelectOne.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOSELECTONE_H_
+00039 #define MOEOSELECTONE_H_
+00040 
+00041 #include <eoSelectOne.h>
+00042 
+00046 template < class MOEOT >
+00047 class moeoSelectOne : public eoSelectOne < MOEOT > {};
+00048 
+00049 #endif /*MOEOSELECTONE_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSelectors_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSelectors_8h-source.html index a655eb3fa..a0bd4bc73 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSelectors_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSelectors_8h-source.html @@ -21,165 +21,190 @@ -

moeoSelectors.h

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 
+
moeoSelectors.h
00001 /* 
+00002 * <moeoSelectors.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOSELECTORS_H_
+00039 #define MOEOSELECTORS_H_
+00040 
+00041 #include <comparator/moeoComparator.h>
 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 }
+00043 
+00044 template <class It,class MOEOT>
+00045 It mo_deterministic_tournament(It _begin, It _end, unsigned int _t_size,moeoComparator<MOEOT>& _comparator ,eoRng& _gen = rng)
+00046 {
+00047     It best = _begin + _gen.random(_end - _begin);
 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 }
+00049     for (unsigned int i = 0; i < _t_size - 1; ++i)
+00050     {
+00051         It competitor = _begin + _gen.random(_end - _begin);
+00052         // compare the two individuals by using the comparator
+00053         if (_comparator(*best, *competitor))
+00054             // best "better" than competitor
+00055             best=competitor;
+00056     }
+00057     return best;
+00058 }
+00059 
+00060 
+00061 template <class MOEOT>
+00062 const MOEOT& mo_deterministic_tournament(const eoPop<MOEOT>& _pop, unsigned int _t_size,moeoComparator<MOEOT>& _comparator, eoRng& _gen = rng)
+00063 {
+00064     return *mo_deterministic_tournament(_pop.begin(), _pop.end(),_t_size,_comparator, _gen);
+00065 }
+00066 
+00067 
+00068 template <class MOEOT>
+00069 MOEOT& mo_deterministic_tournament(eoPop<MOEOT>& _pop, unsigned int _t_size,moeoComparator<MOEOT>& _comparator,eoRng& _gen = rng)
+00070 {
+00071     return *mo_deterministic_tournament(_pop.begin(), _pop.end(), _t_size,_comparator, _gen);
+00072 }
+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 
+00075 template <class It,class MOEOT>
+00076 It mo_stochastic_tournament(It _begin, It _end, double _t_rate,moeoComparator<MOEOT>& _comparator ,eoRng& _gen = rng)
+00077 {
+00078     It i1 = _begin + _gen.random(_end - _begin);
+00079     It i2 = _begin + _gen.random(_end - _begin);
+00080 
+00081     bool return_better = _gen.flip(_t_rate);
 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;
+00083     if (_comparator(*i1, *i2))
+00084     {
+00085         if (return_better) return i2;
+00086         // else
+00087 
+00088         return i1;
+00089     }
+00090     else
+00091     {
+00092         if (return_better) return i1;
+00093         // else
+00094     }
+00095     // else
+00096 
+00097     return i2;
+00098 }
+00099 
 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);
+00101 template <class MOEOT>
+00102 const MOEOT& mo_stochastic_tournament(const eoPop<MOEOT>& _pop, double _t_rate,moeoComparator<MOEOT>& _comparator, eoRng& _gen = rng)
+00103 {
+00104     return *mo_stochastic_tournament(_pop.begin(), _pop.end(), _t_rate,_comparator, _gen);
+00105 }
+00106 
+00107 
+00108 template <class MOEOT>
+00109 MOEOT& mo_stochastic_tournament(eoPop<MOEOT>& _pop, double _t_rate, eoRng& _gen = rng)
+00110 {
+00111     return *mo_stochastic_tournament(_pop.begin(), _pop.end(), _t_rate, _gen);
+00112 }
+00113 
 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);
+00115 template <class It>
+00116 It mo_roulette_wheel(It _begin, It _end, double total, eoRng& _gen = rng)
+00117 {
+00118 
+00119     float roulette = _gen.uniform(total);
+00120 
+00121     if (roulette == 0.0)           // covers the case where total==0.0
+00122         return _begin + _gen.random(_end - _begin); // uniform choice
+00123 
+00124     It i = _begin;
+00125 
+00126     while (roulette > 0.0)
+00127     {
+00128         roulette -= static_cast<double>(*(i++));
+00129     }
+00130 
+00131     return --i;
+00132 }
 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     }
+00134 
+00135 template <class MOEOT>
+00136 const MOEOT& mo_roulette_wheel(const eoPop<MOEOT>& _pop, double total, eoRng& _gen = rng)
+00137 {
+00138     float roulette = _gen.uniform(total);
+00139 
+00140     if (roulette == 0.0)           // covers the case where total==0.0
+00141         return _pop[_gen.random(_pop.size())]; // uniform choice
+00142 
+00143     typename eoPop<MOEOT>::const_iterator i = _pop.begin();
 00144 
-00145     return *--i;
-00146 }
-00147 
-00148 
-00149 #endif /*MOEOSELECTORS_H_*/
-00150 
-00151 
+00145     while (roulette > 0.0)
+00146     {
+00147         roulette -= static_cast<double>((i++)->fitness());
+00148     }
+00149 
+00150     return *--i;
+00151 }
 00152 
 00153 
-00154 
-00155 
-00156 
-00157 
+00154 template <class MOEOT>
+00155 MOEOT& mo_roulette_wheel(eoPop<MOEOT>& _pop, double total, eoRng& _gen = rng)
+00156 {
+00157     float roulette = _gen.uniform(total);
 00158 
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by 
+00159     if (roulette == 0.0)           // covers the case where total==0.0
+00160         return _pop[_gen.random(_pop.size())]; // uniform choice
+00161 
+00162     typename eoPop<MOEOT>::iterator i = _pop.begin();
+00163 
+00164     while (roulette > 0.0)
+00165     {
+00166         // fitness only
+00167         roulette -= static_cast<double>((i++)->fitness());
+00168     }
+00169 
+00170     return *--i;
+00171 }
+00172 
+00173 
+00174 #endif /*MOEOSELECTORS_H_*/
+00175 
+00176 
+00177 
+00178 
+00179 
+00180 
+00181 
+00182 
+00183 
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSharingDiversityAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSharingDiversityAssignment_8h-source.html index 153c05a60..d5d997c3c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSharingDiversityAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoSharingDiversityAssignment_8h-source.html @@ -21,110 +21,135 @@ -

moeoSharingDiversityAssignment.h

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;
+
moeoSharingDiversityAssignment.h
00001 /* 
+00002 * <moeoSharingDiversityAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOSHARINGDIVERSITYASSIGNMENT_H_
+00039 #define MOEOSHARINGDIVERSITYASSIGNMENT_H_
+00040 
+00041 #include <eoPop.h>
+00042 #include <comparator/moeoDiversityThenFitnessComparator.h>
+00043 #include <distance/moeoDistance.h>
+00044 #include <distance/moeoDistanceMatrix.h>
+00045 #include <distance/moeoEuclideanDistance.h>
+00046 #include <diversity/moeoDiversityAssignment.h>
+00047 
+00052 template < class MOEOT >
+00053 class moeoSharingDiversityAssignment : public moeoDiversityAssignment < MOEOT >
+00054 {
+00055 public:
+00056 
+00058     typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+00059 
+00060 
+00067     moeoSharingDiversityAssignment(moeoDistance<MOEOT,double> & _distance, double _nicheSize = 0.5, double _alpha = 1.0) : distance(_distance), nicheSize(_nicheSize), alpha(_alpha)
+00068     {}
+00069 
+00070 
+00076     moeoSharingDiversityAssignment(double _nicheSize = 0.5, double _alpha = 1.0) : distance(defaultDistance), nicheSize(_nicheSize), alpha(_alpha)
+00077     {}
+00078 
+00079 
+00084     void operator()(eoPop < MOEOT > & _pop)
+00085     {
+00086         // 1 - set simuilarities
+00087         setSimilarities(_pop);
+00088         // 2 - a higher diversity is better, so the values need to be inverted
+00089         moeoDiversityThenFitnessComparator < MOEOT > divComparator;
+00090         double max = std::max_element(_pop.begin(), _pop.end(), divComparator)->diversity();
+00091         for (unsigned int i=0 ; i<_pop.size() ; i++)
+00092         {
+00093             _pop[i].diversity(max - _pop[i].diversity());
+00094         }
+00095     }
 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_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by 
+00105     void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec)
+00106     {
+00107         std::cout << "WARNING : updateByDeleting not implemented in moeoSharingDiversityAssignment" << std::endl;
+00108     }
+00109 
+00110 
+00111 protected:
+00112 
+00114     moeoDistance < MOEOT , double > & distance;
+00116     moeoEuclideanDistance < MOEOT > defaultDistance;
+00118     double nicheSize;
+00120     double alpha;
+00121 
+00122 
+00127     virtual void setSimilarities(eoPop < MOEOT > & _pop)
+00128     {
+00129         // compute distances between every individuals
+00130         moeoDistanceMatrix < MOEOT , double > dMatrix (_pop.size(), distance);
+00131         dMatrix(_pop);
+00132         // compute similarities
+00133         double sum;
+00134         for (unsigned int i=0; i<_pop.size(); i++)
+00135         {
+00136             sum = 0.0;
+00137             for (unsigned int j=0; j<_pop.size(); j++)
+00138             {
+00139                 sum += sh(dMatrix[i][j]);
+00140             }
+00141             _pop[i].diversity(sum);
+00142         }
+00143     }
+00144 
+00145 
+00150     double sh(double _dist)
+00151     {
+00152         double result;
+00153         if (_dist < nicheSize)
+00154         {
+00155             result = 1.0 - pow(_dist / nicheSize, alpha);
+00156         }
+00157         else
+00158         {
+00159             result = 0.0;
+00160         }
+00161         return result;
+00162     }
+00163 
+00164 };
+00165 
+00166 
+00167 #endif /*MOEOSHARINGDIVERSITYASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoStochTournamentSelect_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoStochTournamentSelect_8h-source.html index 7b7549759..8cb5485f7 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoStochTournamentSelect_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoStochTournamentSelect_8h-source.html @@ -21,79 +21,104 @@ -

moeoStochTournamentSelect.h

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)
+
moeoStochTournamentSelect.h
00001 /* 
+00002 * <moeoStochTournamentSelect.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOSTOCHTOURNAMENTSELECT_H_
+00039 #define MOEOSTOCHTOURNAMENTSELECT_H_
+00040 
+00041 #include <comparator/moeoComparator.h>
+00042 #include <comparator/moeoFitnessThenDiversityComparator.h>
+00043 #include <selection/moeoSelectOne.h>
+00044 #include <selection/moeoSelectors.h>
+00045 
+00049 template < class MOEOT > class moeoStochTournamentSelect:public moeoSelectOne <MOEOT>
+00050 {
+00051 public:
+00052 
+00058     moeoStochTournamentSelect (moeoComparator < MOEOT > & _comparator, double _tRate = 1.0) : comparator (_comparator), tRate (_tRate)
+00059     {
+00060         // consistency checks
+00061         if (tRate < 0.5)
 00062         {
-00063             std::cerr << "Warning, Tournament rate should be < 1\nAdjusted to 1\n";
-00064             tRate = 1;
+00063             std::cerr << "Warning, Tournament rate should be > 0.5\nAdjusted to 0.55\n";
+00064             tRate = 0.55;
 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_ */
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by 
+00066         if (tRate > 1)
+00067         {
+00068             std::cerr << "Warning, Tournament rate should be < 1\nAdjusted to 1\n";
+00069             tRate = 1;
+00070         }
+00071     }
+00072     
+00073 
+00078     moeoStochTournamentSelect (double _tRate = 1.0) : comparator (defaultComparator), tRate (_tRate)
+00079     {
+00080         // consistency checks
+00081         if (tRate < 0.5)
+00082         {
+00083             std::cerr << "Warning, Tournament rate should be > 0.5\nAdjusted to 0.55\n";
+00084             tRate = 0.55;
+00085         }
+00086         if (tRate > 1)
+00087         {
+00088             std::cerr << "Warning, Tournament rate should be < 1\nAdjusted to 1\n";
+00089             tRate = 1;
+00090         }
+00091     }
+00092 
+00093 
+00098     const MOEOT & operator() (const eoPop < MOEOT > &_pop)
+00099     {
+00100         // use the selector
+00101         return mo_stochastic_tournament(_pop,tRate,comparator);
+00102     }
+00103 
+00104 
+00105 protected:
+00106 
+00108     moeoComparator < MOEOT > & comparator;
+00110     moeoFitnessThenDiversityComparator < MOEOT > defaultComparator;
+00112     double tRate;
+00113 
+00114 };
+00115 
+00116 #endif /*MOEOSTOCHTOURNAMENTSELECT_H_ */
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoUnaryIndicatorBasedFitnessAssignment_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoUnaryIndicatorBasedFitnessAssignment_8h-source.html index 1861d4c5c..dd4da74c7 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoUnaryIndicatorBasedFitnessAssignment_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoUnaryIndicatorBasedFitnessAssignment_8h-source.html @@ -21,28 +21,53 @@ -

moeoUnaryIndicatorBasedFitnessAssignment.h

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_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +

moeoUnaryIndicatorBasedFitnessAssignment.h

00001 /* 
+00002 * <moeoUnaryIndicatorBasedFitnessAssignment.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOUNARYINDICATORBASEDFITNESSASSIGNMENT_H_
+00039 #define MOEOUNARYINDICATORBASEDFITNESSASSIGNMENT_H_
+00040 
+00041 #include <fitness/moeoIndicatorBasedFitnessAssignment.h>
+00042 
+00046 template < class MOEOT >
+00047 class moeoUnaryIndicatorBasedFitnessAssignment : public moeoIndicatorBasedFitnessAssignment < MOEOT > {};
+00048 
+00049 #endif /*MOEOINDICATORBASEDFITNESSASSIGNMENT_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoVector_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoVector_8h-source.html index b98c8225f..1e047b595 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoVector_8h-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/moeoVector_8h-source.html @@ -21,113 +21,138 @@ -

moeoVector.h

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_*/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +

moeoVector.h

00001 /* 
+00002 * <moeoVector.h>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #ifndef MOEOVECTOR_H_
+00039 #define MOEOVECTOR_H_
+00040 
+00041 #include <iterator>
+00042 #include <vector>
+00043 #include <core/MOEO.h>
+00044 
+00049 template < class MOEOObjectiveVector, class MOEOFitness, class MOEODiversity, class GeneType >
+00050 class moeoVector : public MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity >, public std::vector < GeneType >
+00051 {
+00052 public:
+00053 
+00054     using MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity > :: invalidate;
+00055     using std::vector < GeneType > :: operator[];
+00056     using std::vector < GeneType > :: begin;
+00057     using std::vector < GeneType > :: end;
+00058     using std::vector < GeneType > :: resize;
+00059     using std::vector < GeneType > :: size;
+00060 
+00062     typedef GeneType AtomType;
+00064     typedef std::vector < GeneType > ContainerType;
+00065 
+00066 
+00072     moeoVector(unsigned int _size = 0, GeneType _value = GeneType()) :
+00073             MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity >(), std::vector<GeneType>(_size, _value)
+00074     {}
+00075      
+00076     
+00081     void value(const std::vector < GeneType > & _v)
+00082     {
+00083         if (_v.size() != size())           // safety check
+00084         {
+00085             if (size())            // NOT an initial empty std::vector
+00086             {
+00087                 std::cout << "Warning: Changing size in moeoVector assignation"<<std::endl;
+00088                 resize(_v.size());
+00089             }
+00090             else
+00091             {
+00092                 throw std::runtime_error("Size not initialized in moeoVector");
+00093             }
+00094         }
+00095         std::copy(_v.begin(), _v.end(), begin());
+00096         invalidate();
+00097     }
+00098 
+00099 
+00104     bool operator<(const moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType> & _moeo) const
+00105     {
+00106         return MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity >::operator<(_moeo);
+00107     }
+00108 
+00109 
+00114     virtual void printOn(std::ostream & _os) const
+00115     {
+00116         MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity >::printOn(_os);
+00117         _os << ' ';
+00118         _os << size() << ' ';
+00119         std::copy(begin(), end(), std::ostream_iterator<AtomType>(_os, " "));
+00120     }
+00121 
+00122 
+00127     virtual void readFrom(std::istream & _is)
+00128     {
+00129         MOEO < MOEOObjectiveVector, MOEOFitness, MOEODiversity >::readFrom(_is);
+00130         unsigned int sz;
+00131         _is >> sz;
+00132         resize(sz);
+00133         unsigned int i;
+00134         for (i = 0; i < sz; ++i)
+00135         {
+00136             AtomType atom;
+00137             _is >> atom;
+00138             operator[](i) = atom;
+00139         }
+00140     }
+00141 
+00142 };
+00143 
+00144 
+00150 template < class MOEOObjectiveVector, class MOEOFitness, class MOEODiversity, class GeneType >
+00151 bool operator<(const moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType> & _moeo1, const moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType> & _moeo2)
+00152 {
+00153     return _moeo1.operator<(_moeo2);
+00154 }
+00155 
+00156 
+00162 template < class MOEOObjectiveVector, class MOEOFitness, class MOEODiversity, class GeneType >
+00163 bool operator>(const moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType> & _moeo1, const moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType> & _moeo2)
+00164 {
+00165     return _moeo1.operator>(_moeo2);
+00166 }
+00167 
+00168 #endif /*MOEOVECTOR_H_*/
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/pmoeoEA_8h-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/pmoeoEA_8h-source.html deleted file mode 100644 index 4b15a4c07..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/pmoeoEA_8h-source.html +++ /dev/null @@ -1,127 +0,0 @@ - - -ParadisEO-MOEOMovingObjects: pmoeoEA.h Source File - - - - -
-
-

pmoeoEA.h

00001 // "pmoeoEA.h"
-00002 
-00003 // (c) OPAC Team, LIFL, August 2005
-00004 
-00005 /* 
-00006    Contact: paradiseo-help@lists.gforge.inria.fr
-00007 */
-00008 
-00009 #ifndef __pmoeoEA_h
-00010 #define __pmoeoEA_h
-00011 
-00012 #include <eoContinue.h>
-00013 #include <eoEvalFunc.h>
-00014 #include <eoSelect.h>
-00015 #include <eoPopEvalFunc.h>
-00016 #include <eoReplacement.h>
-00017 
-00018 #include "peoPopEval.h"
-00019 #include "peoTransform.h"
-00020 #include "core/runner.h"
-00021 #include "core/peo_debug.h"
-00022 
-00024 
-00054 template < class EOT > class peoEA : public Runner {
-00055 
-00056 public:
-00057 
-00069         peoEA( 
-00070                 eoContinue< EOT >& __cont,
-00071                 peoPopEval< EOT >& __pop_eval,
-00072                 eoSelect< EOT >& __select,
-00073                 peoTransform< EOT >& __trans,
-00074                 eoReplacement< EOT >& __replace 
-00075         );
-00076 
-00079         void run();
-00080         
-00084         void operator()( eoPop< EOT >& __pop );
-00085 
-00086 private:
-00087 
-00088 
-00089         eoContinue< EOT >& cont;
-00090         peoPopEval< EOT >& pop_eval;
-00091         eoSelect< EOT >& select;
-00092         peoTransform< EOT >& trans;
-00093         eoReplacement< EOT >& replace;
-00094         eoPop< EOT >* pop;
-00095 };
-00096 
-00097 
-00098 template < class EOT > peoEA< EOT > :: peoEA( 
-00099 
-00100                                 eoContinue< EOT >& __cont, 
-00101                                 peoPopEval< EOT >& __pop_eval, 
-00102                                 eoSelect< EOT >& __select, 
-00103                                 peoTransform< EOT >& __trans, 
-00104                                 eoReplacement< EOT >& __replace
-00105 
-00106                 ) : cont( __cont ), pop_eval( __pop_eval ), select( __select ), trans( __trans ), replace( __replace )
-00107 {
-00108 
-00109         trans.setOwner( *this );
-00110         pop_eval.setOwner( *this );
-00111 }
-00112 
-00113 
-00114 template< class EOT > void peoEA< EOT > :: operator ()( eoPop< EOT >& __pop ) {
-00115 
-00116         pop = &__pop;
-00117 }
-00118 
-00119 
-00120 template< class EOT > void peoEA< EOT > :: run() {
-00121 
-00122         printDebugMessage( "performing the first evaluation of the population." );
-00123         pop_eval( *pop );
-00124         
-00125         do {
-00126 
-00127                 eoPop< EOT > off;
-00128 
-00129                 printDebugMessage( "performing the selection step." );
-00130                 select( *pop, off );
-00131                 trans( off );
-00132 
-00133                 printDebugMessage( "performing the evaluation of the population." );
-00134                 pop_eval( off );
-00135 
-00136                 printDebugMessage( "performing the replacement of the population." );
-00137                 replace( *pop, off );
-00138 
-00139                 printDebugMessage( "deciding of the continuation." );
-00140         
-00141         } while ( cont( *pop ) );
-00142 }
-00143 
-00144 
-00145 #endif
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  - -doxygen 1.4.7
- - diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/search.idx b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/search.idx index 2a5d8f760..fe72f5d7b 100644 Binary files a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/search.idx and b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/search.idx differ diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/search.php b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/search.php index d5134ce42..52d31b963 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/search.php +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/search.php @@ -374,7 +374,7 @@ main(); ?> -
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +
Generated on Mon Oct 8 16:37:10 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/t-moeo_8cpp-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/t-moeo_8cpp-source.html index 40719a90e..b4deba274 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/t-moeo_8cpp-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/t-moeo_8cpp-source.html @@ -21,26 +21,61 @@ -

t-moeo.cpp

00001 //-----------------------------------------------------------------------------
-00002 // t-moeo.cpp
-00003 //-----------------------------------------------------------------------------
-00004 
-00005 #include <core/MOEO.h>  // MOEO
-00006 
-00007 //-----------------------------------------------------------------------------
-00008 
-00009 
-00010 //-----------------------------------------------------------------------------
-00011 
-00012 int main()
-00013 {
-00014   std::cout << "Please fill the test" << std::endl;
-00015 
-00016   return 0;
-00017 }
-00018 
-00019 //-----------------------------------------------------------------------------
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +

t-moeo.cpp

00001 /* 
+00002 * <t-moeo.cpp>
+00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+00004 * (C) OPAC Team, LIFL, 2002-2007
+00005 *
+00006 * Arnaud Liefooghe
+00007 *
+00008 * This software is governed by the CeCILL license under French law and
+00009 * abiding by the rules of distribution of free software.  You can  use,
+00010 * modify and/ or redistribute the software under the terms of the CeCILL
+00011 * license as circulated by CEA, CNRS and INRIA at the following URL
+00012 * "http://www.cecill.info".
+00013 *
+00014 * As a counterpart to the access to the source code and  rights to copy,
+00015 * modify and redistribute granted by the license, users are provided only
+00016 * with a limited warranty  and the software's author,  the holder of the
+00017 * economic rights,  and the successive licensors  have only  limited liability.
+00018 *
+00019 * In this respect, the user's attention is drawn to the risks associated
+00020 * with loading,  using,  modifying and/or developing or reproducing the
+00021 * software by the user in light of its specific status of free software,
+00022 * that may mean  that it is complicated to manipulate,  and  that  also
+00023 * therefore means  that it is reserved for developers  and  experienced
+00024 * professionals having in-depth computer knowledge. Users are therefore
+00025 * encouraged to load and test the software's suitability as regards their
+00026 * requirements in conditions enabling the security of their systems and/or
+00027 * data to be ensured and,  more generally, to use and operate it in the
+00028 * same conditions as regards security.
+00029 * The fact that you are presently reading this means that you have had
+00030 * knowledge of the CeCILL license and that you accept its terms.
+00031 *
+00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+00033 * Contact: paradiseo-help@lists.gforge.inria.fr
+00034 *
+00035 */
+00036 //-----------------------------------------------------------------------------
+00037 // t-moeo.cpp
+00038 //-----------------------------------------------------------------------------
+00039 
+00040 #include <core/MOEO.h>  // MOEO
+00041 
+00042 //-----------------------------------------------------------------------------
+00043 
+00044 
+00045 //-----------------------------------------------------------------------------
+00046 
+00047 int main()
+00048 {
+00049   std::cout << "Please fill the test" << std::endl;
+00050 
+00051   return 0;
+00052 }
+00053 
+00054 //-----------------------------------------------------------------------------
+
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/tree.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/tree.html index 36bfdd4d9..715c87755 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/tree.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/tree.html @@ -123,14 +123,10 @@

|o*moeoHybridLS< MOEOT >

|o*moeoHypervolumeBinaryMetric< ObjectiveVector >

|o*moeoIBEA< MOEOT >

-

|o*moeoIBMOLS< MOEOT, Move >

-

|o*moeoIBMOLS< MOEOT, Move >::OneObjectiveComparator

|o*moeoIndicatorBasedFitnessAssignment< MOEOT >

-

|o*moeoIteratedIBMOLS< MOEOT, Move >

|o*moeoLS< MOEOT, Type >

|o*moeoManhattanDistance< MOEOT >

|o*moeoMetric

-

|o*moeoMoveIncrEval< Move >

|o*moeoNormalizedDistance< MOEOT, Type >

|o*moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R >

|o*moeoNSGA< MOEOT >

@@ -145,7 +141,6 @@

|o*moeoRandomSelect< MOEOT >

|o*moeoRealObjectiveVector< ObjectiveVectorTraits >

|o*moeoRealVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >

-

|o*moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >

|o*moeoReplacement< MOEOT >

|o*moeoRouletteSelect< MOEOT >

|o*moeoScalarFitnessAssignment< MOEOT >

@@ -160,7 +155,6 @@

|o*moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >

|o*moeoVectorUnaryMetric< ObjectiveVector, R >

|o*moeoVectorVsVectorBinaryMetric< ObjectiveVector, R >

-

|o*peoEA< EOT >

|o*Sch1

|o*Sch1Eval

|\*Sch1ObjectiveVectorTraits

@@ -218,7 +212,6 @@

||||o*moeoDiversityThenFitnessComparator< MOEOT >

||||o*moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator

||||o*moeoFitnessThenDiversityComparator< MOEOT >

-

||||o*moeoIBMOLS< MOEOT, Move >::OneObjectiveComparator

||||\*moeoOneObjectiveComparator< MOEOT >

|||o+moeoDistance< MOEOT, Type >

@@ -233,7 +226,6 @@

|||| \*moeoManhattanDistance< MOEOT >

-

|||o*moeoMoveIncrEval< Move >

|||\+moeoObjectiveVectorComparator< ObjectiveVector >

||| o*moeoGDominanceObjectiveVectorComparator< ObjectiveVector >

@@ -257,85 +249,77 @@ -

||o+eoBF< eoPop< MOEOT > &, moeoArchive< MOEOT > &, void > [external]

-

||o*eoBF< EOType &, EOType &, bool > [external]

-

||o+eoBF< FlowShop &, FlowShop &, bool > [external]

-
-

|||\+eoQuadOp< FlowShop > [external]

-
+

||o+eoBF< FlowShop &, FlowShop &, bool > [external]

+ -

||o+eoBF< Type, moeoArchive< MOEOT > &, void > [external]

-
-

|||\+moeoLS< MOEOT, Type >

-
+

||o+eoBF< Type, moeoArchive< MOEOT > &, void > [external]

+ -

||o+eoF< void > [external]

-
-

|||\+eoUpdater [external]

-
+

||o+eoF< void > [external]

+ -

||o+eoUF< A1, R > [external]

-
-

|||o+eoAlgo< MOEOT > [external]

-
-

||||\+moeoEA< MOEOT >

-
+

||o+eoUF< A1, R > [external]

+
+

|||o+eoAlgo< MOEOT > [external]

+ -

|||o+eoEvalFunc< FlowShop > [external]

-
-

||||\+moeoEvalFunc< FlowShop >

-
+

|||o+eoEvalFunc< FlowShop > [external]

+ -

|||o+eoEvalFunc< MOEOT > [external]

-
+

|||o+eoEvalFunc< MOEOT > [external]

+ -

|||o+eoEvalFunc< Sch1 > [external]

-
-

||||\+moeoEvalFunc< Sch1 >

-
+

|||o+eoEvalFunc< Sch1 > [external]

+ -

|||o+eoInit< FlowShop > [external]

-
+

|||o+eoInit< FlowShop > [external]

+ -

|||o+eoSelectOne< EOT, WorthT > [external]

-
-

||||\+eoRandomSelect< MOEOT > [external]

-
+

|||o+eoSelectOne< EOT, WorthT > [external]

+ -

|||o+eoSelectOne< MOEOT > [external]

-
-

||||\+moeoSelectOne< MOEOT >

-
+

|||o+eoSelectOne< MOEOT > [external]

+ -

|||o+eoTransform< MOEOT > [external]

- -

||o+eoUF< A, R > [external]

-
+

||o+eoUF< A, R > [external]

+ -

||o+eoUF< const eoPop< MOEOT > &, void > [external]

-
+

||o+eoUF< const eoPop< MOEOT > &, void > [external]

+ -

||o+eoUF< const ObjectiveVector &, R > [external]

-
-

|||\+moeoUnaryMetric< const ObjectiveVector &, R >

-
+

||o+eoUF< const ObjectiveVector &, R > [external]

+ -

||o+eoUF< const std::vector< ObjectiveVector > &, R > [external]

-
-

|||\+moeoUnaryMetric< const std::vector< ObjectiveVector > &, R >

-
+

||o+eoUF< const std::vector< ObjectiveVector > &, R > [external]

+ -

||o+eoUF< eoPop< MOEOT > &, void > [external]

-
-

|||o+moeoDiversityAssignment< MOEOT >

-
-

||||o+moeoCrowdingDiversityAssignment< MOEOT >

-
+

||o+eoUF< eoPop< MOEOT > &, void > [external]

+
+

|||o+moeoDiversityAssignment< MOEOT >

+
+

||||o+moeoCrowdingDiversityAssignment< MOEOT >

+

||||o*moeoDummyDiversityAssignment< MOEOT >

-

||||\+moeoSharingDiversityAssignment< MOEOT >

- -

|||\+moeoFitnessAssignment< MOEOT >

-
+

|||\+moeoFitnessAssignment< MOEOT >

+

||| o*moeoCriterionBasedFitnessAssignment< MOEOT >

||| o*moeoDummyFitnessAssignment< MOEOT >

-

||| o+moeoIndicatorBasedFitnessAssignment< MOEOT >

-
-

||| |o+moeoBinaryIndicatorBasedFitnessAssignment< MOEOT >

-
+

||| o+moeoIndicatorBasedFitnessAssignment< MOEOT >

+ -

||| o+moeoParetoBasedFitnessAssignment< MOEOT >

-

||o*eoUF< EOType &, bool > [external]

-

||o+eoUF< FlowShop &, bool > [external]

-
-

|||\+eoMonOp< FlowShop > [external]

-
+

||o+eoUF< FlowShop &, bool > [external]

+ -

||\+moeoMetric

- -

|o+eoObject [external]

-
-

||o+EO< MOEOObjectiveVector > [external]

-
-

|||\+MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >

-
-

||| o+moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >

-
+

|o+eoObject [external]

+
+

||o+EO< MOEOObjectiveVector > [external]

+
+

|||\+MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >

+
+

||| o+moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >

+ -

||| o+moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool >

-
+

||| o+moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool >

+ -

||| \+moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, double >

- -

||o+EO< moeoRealObjectiveVector< FlowShopObjectiveVectorTraits > > [external]

-
-

|||\+MOEO< moeoRealObjectiveVector< FlowShopObjectiveVectorTraits >, double, double >

-
+

||o+EO< moeoRealObjectiveVector< FlowShopObjectiveVectorTraits > > [external]

+ -

||o+EO< moeoRealObjectiveVector< Sch1ObjectiveVectorTraits > > [external]

-
-

|||\+MOEO< moeoRealObjectiveVector< Sch1ObjectiveVectorTraits >, double, double >

-
-

||| \+moeoVector< moeoRealObjectiveVector< Sch1ObjectiveVectorTraits >, double, double, double >

-
+

||o+EO< moeoRealObjectiveVector< Sch1ObjectiveVectorTraits > > [external]

+ -

||\+eoPop< MOEOT > [external]

- -

|o+eoOp< EOType > [external]

-
+

|o+eoOp< EOType > [external]

+

||o*eoMonOp< FlowShop > [external]

||\*eoQuadOp< FlowShop > [external]

-

|o+eoPrintable [external]

-
-

||\+eoPersistent [external]

-
+

|o+eoPrintable [external]

+

|o*FlowShopBenchmarkParser

-

|o+moeoAlgo

-
+

|o+moeoAlgo

+

|o*moeoElitistReplacement< MOEOT >::Cmp

|o*moeoEnvironmentalReplacement< MOEOT >::Cmp

|o*moeoObjectiveVector< ObjectiveVectorTraits, ObjectiveVectorType >

-

|o+moeoObjectiveVector< ObjectiveVectorTraits, double >

-
+

|o+moeoObjectiveVector< ObjectiveVectorTraits, double >

+ -

|o+moeoObjectiveVectorTraits

-

o*Class Members

-

\+File List

-
+

\+File List

+

 o*FlowShop.cpp

 o*FlowShop.h

 o*FlowShopBenchmarkParser.cpp

@@ -537,7 +518,6 @@

 o*make_ea_moeo.h

 o*make_eval_FlowShop.h

 o*make_genotype_FlowShop.h

-

 o*make_ls_moeo.h

 o*make_op_FlowShop.h

 o*MOEO.h

 o*moeoAchievementFitnessAssignment.h

@@ -581,13 +561,10 @@

 o*moeoHybridLS.h

 o*moeoHypervolumeBinaryMetric.h

 o*moeoIBEA.h

-

 o*moeoIBMOLS.h

 o*moeoIndicatorBasedFitnessAssignment.h

-

 o*moeoIteratedIBMOLS.h

 o*moeoLS.h

 o*moeoManhattanDistance.h

 o*moeoMetric.h

-

 o*moeoMoveIncrEval.h

 o*moeoNormalizedDistance.h

 o*moeoNormalizedSolutionVsSolutionBinaryMetric.h

 o*moeoNSGA.h

@@ -603,7 +580,6 @@

 o*moeoRandomSelect.h

 o*moeoRealObjectiveVector.h

 o*moeoRealVector.h

-

 o*moeoReferencePointIndicatorBasedFitnessAssignment.h

 o*moeoReplacement.h

 o*moeoRouletteSelect.h

 o*moeoScalarFitnessAssignment.h

@@ -614,7 +590,6 @@

 o*moeoStochTournamentSelect.h

 o*moeoUnaryIndicatorBasedFitnessAssignment.h

 o*moeoVector.h

-

 o*pmoeoEA.h

 o*README

 o*tutorial/examples/flowshop/benchs/README

 o*Sch1.cpp

diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/tutorial_2examples_2flowshop_2benchs_2README-source.html b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/tutorial_2examples_2flowshop_2benchs_2README-source.html index 38fba453c..9982c158e 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/tutorial_2examples_2flowshop_2benchs_2README-source.html +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/html/tutorial_2examples_2flowshop_2benchs_2README-source.html @@ -22,7 +22,7 @@

README

00001 Further benchmarks for the bi-objective flow-shop scheduling problem are available at http://www.lifl.fr/~liefooga/benchmarks/
-
Generated on Mon Oct 8 10:35:52 2007 for ParadisEO-MOEOMovingObjects by  +
Generated on Mon Oct 8 16:37:09 2007 for ParadisEO-MOEOMovingObjects by  doxygen 1.4.7
diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/index.h b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/index.h index baa27ba28..a2b5e9878 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/index.h +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/index.h @@ -1,6 +1,6 @@ /** @mainpage Welcome to ParadisEO-MOEO -@section Introduction +@section Introduction Introduction ParadisEO-MOEO is a white-box object-oriented generic framework dedicated to the flexible design of evolutionary multi-objective algorithms. This paradigm-free software embeds some features and techniques for Pareto-based resolution and @@ -16,7 +16,7 @@ using the whole version of ParadisEO. @section tutorials Tutorials -Tutorials for ParadisEO-MOEO are available here. +Tutorials for ParadisEO-MOEO are available here. @@ -33,7 +33,7 @@ For an introduction to the design of ParadisEO-MOEO, you can look at the ParadisEO website. -@section LICENCE +@section LICENSE This software is governed by the CeCILL license under French law and abiding by the rules of distribution of free software. You can use, diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/annotated.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/annotated.tex index 23f446b65..f61665e63 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/annotated.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/annotated.tex @@ -57,14 +57,10 @@ Here are the classes, structs, unions and interfaces with brief descriptions:\be \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\-IBMOLS$<$ MOEOT, Move $>$} (Indicator-Based Multi-Objective Local Search (IBMOLS) as described in Basseur M., Burke K )}{\pageref{classmoeoIBMOLS}}{} -\item\contentsline{section}{\bf{moeo\-IBMOLS$<$ MOEOT, Move $>$::One\-Objective\-Comparator} }{\pageref{classmoeoIBMOLS_1_1OneObjectiveComparator}}{} \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\-Iterated\-IBMOLS$<$ MOEOT, Move $>$} (Iterated version of IBMOLS as described in Basseur M., Burke K )}{\pageref{classmoeoIteratedIBMOLS}}{} \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\-Move\-Incr\-Eval$<$ Move $>$} }{\pageref{classmoeoMoveIncrEval}}{} \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}}{} @@ -79,7 +75,6 @@ Here are the classes, structs, unions and interfaces with brief descriptions:\be \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\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$} (Fitness assignment sheme based a Reference Point and a Quality Indicator )}{\pageref{classmoeoReferencePointIndicatorBasedFitnessAssignment}}{} \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}}{} @@ -94,7 +89,6 @@ Here are the classes, structs, unions and interfaces with brief descriptions:\be \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}}{} -\item\contentsline{section}{\bf{peo\-EA$<$ EOT $>$} (The \doxyref{peo\-EA}{p.}{classpeoEA} class offers an elementary evolutionary algorithm implementation )}{\pageref{classpeoEA}}{} \item\contentsline{section}{\bf{Sch1} }{\pageref{classSch1}}{} \item\contentsline{section}{\bf{Sch1Eval} }{\pageref{classSch1Eval}}{} \item\contentsline{section}{\bf{Sch1Objective\-Vector\-Traits} }{\pageref{classSch1ObjectiveVectorTraits}}{} diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShop.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShop.tex index 59a46d8fb..ea86d60fa 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShop.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShop.tex @@ -24,7 +24,7 @@ Structure of the genotype for the flow-shop scheduling problem: a vector of unsi -Definition at line 22 of file Flow\-Shop.h. +Definition at line 47 of file Flow\-Shop.h. The documentation for this class was generated from the following files:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopBenchmarkParser.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopBenchmarkParser.tex index b80948da4..a70888b3f 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopBenchmarkParser.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopBenchmarkParser.tex @@ -51,7 +51,7 @@ Class to handle parameters of a flow-shop instance from a benchmark file. -Definition at line 23 of file Flow\-Shop\-Benchmark\-Parser.h. +Definition at line 48 of file Flow\-Shop\-Benchmark\-Parser.h. \subsection{Constructor \& Destructor Documentation} \index{FlowShopBenchmarkParser@{Flow\-Shop\-Benchmark\-Parser}!FlowShopBenchmarkParser@{FlowShopBenchmarkParser}} @@ -68,7 +68,7 @@ Ctor. \end{Desc} -Definition at line 16 of file Flow\-Shop\-Benchmark\-Parser.cpp. +Definition at line 41 of file Flow\-Shop\-Benchmark\-Parser.cpp. References init(). @@ -82,7 +82,7 @@ printing. .. -Definition at line 46 of file Flow\-Shop\-Benchmark\-Parser.cpp. +Definition at line 71 of file Flow\-Shop\-Benchmark\-Parser.cpp. References d, M, N, and p.\index{FlowShopBenchmarkParser@{Flow\-Shop\-Benchmark\-Parser}!init@{init}} \index{init@{init}!FlowShopBenchmarkParser@{Flow\-Shop\-Benchmark\-Parser}} @@ -98,7 +98,7 @@ Initialisation of the parameters with the data contained in the benchmark file. \end{Desc} -Definition at line 64 of file Flow\-Shop\-Benchmark\-Parser.cpp. +Definition at line 89 of file Flow\-Shop\-Benchmark\-Parser.cpp. References d, M, N, and p. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopEval.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopEval.tex index 1e7306dd5..d05076f90 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopEval.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopEval.tex @@ -49,7 +49,7 @@ Evaluation of the objective vector a (multi-objective) \doxyref{Flow\-Shop}{p.}{ -Definition at line 23 of file Flow\-Shop\-Eval.h. +Definition at line 48 of file Flow\-Shop\-Eval.h. \subsection{Constructor \& Destructor Documentation} \index{FlowShopEval@{Flow\-Shop\-Eval}!FlowShopEval@{FlowShopEval}} @@ -66,7 +66,7 @@ Ctor. \end{Desc} -Definition at line 16 of file Flow\-Shop\-Eval.cpp. +Definition at line 41 of file Flow\-Shop\-Eval.cpp. \subsection{Member Function Documentation} \index{FlowShopEval@{Flow\-Shop\-Eval}!operator()@{operator()}} @@ -83,7 +83,7 @@ computation of the multi-objective evaluation of a \doxyref{Flow\-Shop}{p.}{clas \end{Desc} -Definition at line 21 of file Flow\-Shop\-Eval.cpp. +Definition at line 46 of file Flow\-Shop\-Eval.cpp. References makespan(), MOEO$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$::objective\-Vector(), and tardiness().\index{FlowShopEval@{Flow\-Shop\-Eval}!makespan@{makespan}} \index{makespan@{makespan}!FlowShopEval@{Flow\-Shop\-Eval}} @@ -99,7 +99,7 @@ computation of the makespan \end{Desc} -Definition at line 31 of file Flow\-Shop\-Eval.cpp. +Definition at line 56 of file Flow\-Shop\-Eval.cpp. References completion\-Time(), M, and N. @@ -117,7 +117,7 @@ computation of the tardiness \end{Desc} -Definition at line 40 of file Flow\-Shop\-Eval.cpp. +Definition at line 65 of file Flow\-Shop\-Eval.cpp. References completion\-Time(), d, M, and N. @@ -135,7 +135,7 @@ computation of the completion times of a scheduling (for each job on each machin \end{Desc} -Definition at line 53 of file Flow\-Shop\-Eval.cpp. +Definition at line 78 of file Flow\-Shop\-Eval.cpp. References M, N, and p. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopInit.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopInit.tex index 0ae13d5d8..27a0b2f9b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopInit.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopInit.tex @@ -31,7 +31,7 @@ Initialization of a random genotype built by the default constructor of the \dox -Definition at line 22 of file Flow\-Shop\-Init.h. +Definition at line 47 of file Flow\-Shop\-Init.h. \subsection{Constructor \& Destructor Documentation} \index{FlowShopInit@{Flow\-Shop\-Init}!FlowShopInit@{FlowShopInit}} @@ -48,7 +48,7 @@ Ctor. \end{Desc} -Definition at line 16 of file Flow\-Shop\-Init.cpp. +Definition at line 41 of file Flow\-Shop\-Init.cpp. \subsection{Member Function Documentation} \index{FlowShopInit@{Flow\-Shop\-Init}!operator()@{operator()}} @@ -65,7 +65,7 @@ builds a random genotype \end{Desc} -Definition at line 20 of file Flow\-Shop\-Init.cpp. +Definition at line 45 of file Flow\-Shop\-Init.cpp. References MOEO$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$::invalidate(), N, eo\-Rng::uniform(), and moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, Gene\-Type $>$::value(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopObjectiveVectorTraits.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopObjectiveVectorTraits.tex index 828d5a702..e3fbee435 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopObjectiveVectorTraits.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopObjectiveVectorTraits.tex @@ -28,7 +28,7 @@ Definition of the objective vector traits for multi-objective flow-shop problems -Definition at line 21 of file Flow\-Shop\-Objective\-Vector\-Traits.h. +Definition at line 46 of file Flow\-Shop\-Objective\-Vector\-Traits.h. \subsection{Member Function Documentation} \index{FlowShopObjectiveVectorTraits@{Flow\-Shop\-Objective\-Vector\-Traits}!minimizing@{minimizing}} @@ -45,7 +45,7 @@ Returns true if the \_\-ith objective have to be minimzed. \end{Desc} -Definition at line 16 of file Flow\-Shop\-Objective\-Vector\-Traits.cpp.\index{FlowShopObjectiveVectorTraits@{Flow\-Shop\-Objective\-Vector\-Traits}!maximizing@{maximizing}} +Definition at line 41 of file Flow\-Shop\-Objective\-Vector\-Traits.cpp.\index{FlowShopObjectiveVectorTraits@{Flow\-Shop\-Objective\-Vector\-Traits}!maximizing@{maximizing}} \index{maximizing@{maximizing}!FlowShopObjectiveVectorTraits@{Flow\-Shop\-Objective\-Vector\-Traits}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}bool Flow\-Shop\-Objective\-Vector\-Traits::maximizing (int {\em \_\-i})\hspace{0.3cm}{\tt [static]}}\label{classFlowShopObjectiveVectorTraits_229fbb4cc19d289637891c1b49f3eaba} @@ -59,7 +59,7 @@ Returns true if the \_\-ith objective have to be maximzed. \end{Desc} -Definition at line 22 of file Flow\-Shop\-Objective\-Vector\-Traits.cpp. +Definition at line 47 of file Flow\-Shop\-Objective\-Vector\-Traits.cpp. The documentation for this class was generated from the following files:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopOpCrossoverQuad.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopOpCrossoverQuad.tex index 058ee679e..80788667a 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopOpCrossoverQuad.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopOpCrossoverQuad.tex @@ -31,7 +31,7 @@ Quadratic crossover operator for flow-shop (modify the both genotypes). -Definition at line 22 of file Flow\-Shop\-Op\-Crossover\-Quad.h. +Definition at line 47 of file Flow\-Shop\-Op\-Crossover\-Quad.h. \subsection{Member Function Documentation} \index{FlowShopOpCrossoverQuad@{Flow\-Shop\-Op\-Crossover\-Quad}!operator()@{operator()}} @@ -50,7 +50,7 @@ eo\-Quad crossover - \_\-flowshop1 and \_\-flowshop2 are the (future) offspring, Implements \bf{eo\-BF$<$ Flow\-Shop \&, Flow\-Shop \&, bool $>$}. -Definition at line 22 of file Flow\-Shop\-Op\-Crossover\-Quad.cpp. +Definition at line 47 of file Flow\-Shop\-Op\-Crossover\-Quad.cpp. References generate\-Offspring(), eo\-Rng::random(), and moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, Gene\-Type $>$::value().\index{FlowShopOpCrossoverQuad@{Flow\-Shop\-Op\-Crossover\-Quad}!generateOffspring@{generateOffspring}} \index{generateOffspring@{generateOffspring}!FlowShopOpCrossoverQuad@{Flow\-Shop\-Op\-Crossover\-Quad}} @@ -66,7 +66,7 @@ generation of an offspring by a 2 points crossover \end{Desc} -Definition at line 54 of file Flow\-Shop\-Op\-Crossover\-Quad.cpp. +Definition at line 79 of file Flow\-Shop\-Op\-Crossover\-Quad.cpp. Referenced by operator()(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopOpMutationExchange.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopOpMutationExchange.tex index 0faf123cc..5bd1fa265 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopOpMutationExchange.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopOpMutationExchange.tex @@ -26,7 +26,7 @@ Exchange mutation operator for the flow-shop. -Definition at line 22 of file Flow\-Shop\-Op\-Mutation\-Exchange.h. +Definition at line 47 of file Flow\-Shop\-Op\-Mutation\-Exchange.h. \subsection{Member Function Documentation} \index{FlowShopOpMutationExchange@{Flow\-Shop\-Op\-Mutation\-Exchange}!operator()@{operator()}} @@ -45,7 +45,7 @@ modifies the parent with an exchange mutation Implements \bf{eo\-UF$<$ Flow\-Shop \&, bool $>$}. -Definition at line 22 of file Flow\-Shop\-Op\-Mutation\-Exchange.cpp. +Definition at line 47 of file Flow\-Shop\-Op\-Mutation\-Exchange.cpp. References eo\-Rng::random(), and moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, Gene\-Type $>$::value(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopOpMutationShift.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopOpMutationShift.tex index 1c2c41671..485308832 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopOpMutationShift.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classFlowShopOpMutationShift.tex @@ -26,7 +26,7 @@ Shift mutation operator for flow-shop. -Definition at line 22 of file Flow\-Shop\-Op\-Mutation\-Shift.h. +Definition at line 47 of file Flow\-Shop\-Op\-Mutation\-Shift.h. \subsection{Member Function Documentation} \index{FlowShopOpMutationShift@{Flow\-Shop\-Op\-Mutation\-Shift}!operator()@{operator()}} @@ -45,7 +45,7 @@ modifies the parent with a shift mutation Implements \bf{eo\-UF$<$ Flow\-Shop \&, bool $>$}. -Definition at line 22 of file Flow\-Shop\-Op\-Mutation\-Shift.cpp. +Definition at line 47 of file Flow\-Shop\-Op\-Mutation\-Shift.cpp. References eo\-Rng::random(), and moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, Gene\-Type $>$::value(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classMOEO.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classMOEO.tex index cd3cba99c..db07cb0bd 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classMOEO.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classMOEO.tex @@ -112,7 +112,7 @@ The template argument MOEOObjective\-Vector allows to represent the solution in -Definition at line 34 of file MOEO.h. +Definition at line 59 of file MOEO.h. \subsection{Member Function Documentation} \index{MOEO@{MOEO}!objectiveVector@{objectiveVector}} @@ -129,7 +129,7 @@ Sets the objective vector of the current solution. \end{Desc} -Definition at line 85 of file MOEO.h.\index{MOEO@{MOEO}!fitness@{fitness}} +Definition at line 110 of file MOEO.h.\index{MOEO@{MOEO}!fitness@{fitness}} \index{fitness@{fitness}!MOEO@{MOEO}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOObjective\-Vector, class MOEOFitness, class MOEODiversity$>$ void \bf{MOEO}$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$::fitness (const \bf{Fitness} \& {\em \_\-fitness\-Value})\hspace{0.3cm}{\tt [inline]}}\label{classMOEO_4dc05ded73bb60d1a51e282006c8942d} @@ -143,7 +143,7 @@ Sets the fitness value of the current solution. \end{Desc} -Definition at line 127 of file MOEO.h.\index{MOEO@{MOEO}!diversity@{diversity}} +Definition at line 152 of file MOEO.h.\index{MOEO@{MOEO}!diversity@{diversity}} \index{diversity@{diversity}!MOEO@{MOEO}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOObjective\-Vector, class MOEOFitness, class MOEODiversity$>$ void \bf{MOEO}$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$::diversity (const \bf{Diversity} \& {\em \_\-diversity\-Value})\hspace{0.3cm}{\tt [inline]}}\label{classMOEO_1f0a391984cd14bcf930d1d81dd4848e} @@ -157,7 +157,7 @@ Sets the diversity value of the current solution. \end{Desc} -Definition at line 169 of file MOEO.h.\index{MOEO@{MOEO}!operator<@{operator$<$}} +Definition at line 194 of file MOEO.h.\index{MOEO@{MOEO}!operator<@{operator$<$}} \index{operator<@{operator$<$}!MOEO@{MOEO}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOObjective\-Vector, class MOEOFitness, class MOEODiversity$>$ bool \bf{MOEO}$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$::operator$<$ (const \bf{MOEO}$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$ \& {\em \_\-other}) const\hspace{0.3cm}{\tt [inline]}}\label{classMOEO_119ef916de4955298febaf3e1c8ad705} @@ -171,7 +171,7 @@ You should implement another function in the sub-class of \doxyref{MOEO}{p.}{cla \end{Desc} -Definition at line 220 of file MOEO.h.\index{MOEO@{MOEO}!printOn@{printOn}} +Definition at line 245 of file MOEO.h.\index{MOEO@{MOEO}!printOn@{printOn}} \index{printOn@{printOn}!MOEO@{MOEO}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOObjective\-Vector, class MOEOFitness, class MOEODiversity$>$ virtual void \bf{MOEO}$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt [inline, virtual]}}\label{classMOEO_a3b6074b3289585bf4dc6998e8397e24} @@ -189,7 +189,7 @@ Reimplemented from \bf{EO$<$ MOEOObjective\-Vector $>$}. Reimplemented in \bf{moeo\-Bit\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$} \doxyref{p.}{classmoeoBitVector_78f821c548cf46d8bcd30aa8a52ffb7c}, \bf{moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, Gene\-Type $>$} \doxyref{p.}{classmoeoVector_d0a92cb26483ffab754ac4a0efb76308}, \bf{moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, bool $>$} \doxyref{p.}{classmoeoVector_d0a92cb26483ffab754ac4a0efb76308}, \bf{moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, double $>$} \doxyref{p.}{classmoeoVector_d0a92cb26483ffab754ac4a0efb76308}, \bf{moeo\-Vector$<$ moeo\-Real\-Objective\-Vector$<$ Flow\-Shop\-Objective\-Vector\-Traits $>$, double, double, unsigned int $>$} \doxyref{p.}{classmoeoVector_d0a92cb26483ffab754ac4a0efb76308}, and \bf{moeo\-Vector$<$ moeo\-Real\-Objective\-Vector$<$ Sch1Objective\-Vector\-Traits $>$, double, double, double $>$} \doxyref{p.}{classmoeoVector_d0a92cb26483ffab754ac4a0efb76308}. -Definition at line 239 of file MOEO.h.\index{MOEO@{MOEO}!readFrom@{readFrom}} +Definition at line 264 of file MOEO.h.\index{MOEO@{MOEO}!readFrom@{readFrom}} \index{readFrom@{readFrom}!MOEO@{MOEO}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOObjective\-Vector, class MOEOFitness, class MOEODiversity$>$ virtual void \bf{MOEO}$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classMOEO_1bbd9cb1a7709592bf4bc29dff8c5273} @@ -207,7 +207,7 @@ Reimplemented from \bf{EO$<$ MOEOObjective\-Vector $>$}. Reimplemented in \bf{moeo\-Bit\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$} \doxyref{p.}{classmoeoBitVector_31cd3f894615d0a27dd116a5c8082521}, \bf{moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, Gene\-Type $>$} \doxyref{p.}{classmoeoVector_cd8ee0fe79bb9515b29e2a4d3fee5ab9}, \bf{moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, bool $>$} \doxyref{p.}{classmoeoVector_cd8ee0fe79bb9515b29e2a4d3fee5ab9}, \bf{moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, double $>$} \doxyref{p.}{classmoeoVector_cd8ee0fe79bb9515b29e2a4d3fee5ab9}, \bf{moeo\-Vector$<$ moeo\-Real\-Objective\-Vector$<$ Flow\-Shop\-Objective\-Vector\-Traits $>$, double, double, unsigned int $>$} \doxyref{p.}{classmoeoVector_cd8ee0fe79bb9515b29e2a4d3fee5ab9}, and \bf{moeo\-Vector$<$ moeo\-Real\-Objective\-Vector$<$ Sch1Objective\-Vector\-Traits $>$, double, double, double $>$} \doxyref{p.}{classmoeoVector_cd8ee0fe79bb9515b29e2a4d3fee5ab9}. -Definition at line 256 of file MOEO.h. +Definition at line 281 of file MOEO.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classSch1.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classSch1.tex index ab886bbb8..5b765f13d 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classSch1.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classSch1.tex @@ -19,7 +19,7 @@ Inheritance diagram for Sch1::\begin{figure}[H] -Definition at line 44 of file Sch1.cpp. +Definition at line 69 of file Sch1.cpp. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classSch1Eval.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classSch1Eval.tex index cb664fb89..80e64339c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classSch1Eval.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classSch1Eval.tex @@ -19,7 +19,7 @@ void \bf{operator()} (\bf{Sch1} \&\_\-sch1)\label{classSch1Eval_4f806a964f7bafa9 -Definition at line 52 of file Sch1.cpp. +Definition at line 77 of file Sch1.cpp. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classSch1ObjectiveVectorTraits.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classSch1ObjectiveVectorTraits.tex index 1455866e5..bc20dbdad 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classSch1ObjectiveVectorTraits.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classSch1ObjectiveVectorTraits.tex @@ -25,7 +25,7 @@ static unsigned int \bf{n\-Objectives} ()\label{classSch1ObjectiveVectorTraits_5 -Definition at line 21 of file Sch1.cpp. +Definition at line 46 of file Sch1.cpp. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAchievementFitnessAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAchievementFitnessAssignment.tex index 71218a65c..473652f30 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAchievementFitnessAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAchievementFitnessAssignment.tex @@ -59,7 +59,7 @@ Fitness assignment sheme based on the achievement scalarizing function propozed -Definition at line 24 of file moeo\-Achievement\-Fitness\-Assignment.h. +Definition at line 49 of file moeo\-Achievement\-Fitness\-Assignment.h. \subsection{Constructor \& Destructor Documentation} \index{moeoAchievementFitnessAssignment@{moeo\-Achievement\-Fitness\-Assignment}!moeoAchievementFitnessAssignment@{moeoAchievementFitnessAssignment}} @@ -76,7 +76,7 @@ Default ctor. \end{Desc} -Definition at line 38 of file moeo\-Achievement\-Fitness\-Assignment.h. +Definition at line 63 of file moeo\-Achievement\-Fitness\-Assignment.h. References moeo\-Achievement\-Fitness\-Assignment$<$ MOEOT $>$::spn.\index{moeoAchievementFitnessAssignment@{moeo\-Achievement\-Fitness\-Assignment}!moeoAchievementFitnessAssignment@{moeoAchievementFitnessAssignment}} \index{moeoAchievementFitnessAssignment@{moeoAchievementFitnessAssignment}!moeoAchievementFitnessAssignment@{moeo\-Achievement\-Fitness\-Assignment}} @@ -92,7 +92,7 @@ Ctor with default values for lambdas (1/n\-Objectives). \end{Desc} -Definition at line 54 of file moeo\-Achievement\-Fitness\-Assignment.h. +Definition at line 79 of file moeo\-Achievement\-Fitness\-Assignment.h. References moeo\-Achievement\-Fitness\-Assignment$<$ MOEOT $>$::lambdas, and moeo\-Achievement\-Fitness\-Assignment$<$ MOEOT $>$::spn. @@ -113,7 +113,7 @@ Sets the fitness values for every solution contained in the population \_\-pop. Implements \bf{eo\-UF$<$ eo\-Pop$<$ MOEOT $>$ \&, void $>$}. -Definition at line 75 of file moeo\-Achievement\-Fitness\-Assignment.h. +Definition at line 100 of file moeo\-Achievement\-Fitness\-Assignment.h. References moeo\-Achievement\-Fitness\-Assignment$<$ MOEOT $>$::compute().\index{moeoAchievementFitnessAssignment@{moeo\-Achievement\-Fitness\-Assignment}!updateByDeleting@{updateByDeleting}} \index{updateByDeleting@{updateByDeleting}!moeoAchievementFitnessAssignment@{moeo\-Achievement\-Fitness\-Assignment}} @@ -131,7 +131,7 @@ Updates the fitness values of the whole population \_\-pop by taking the deletio Implements \bf{moeo\-Fitness\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoFitnessAssignment_4922629569eddc9be049b3ead1ab0269}. -Definition at line 89 of file moeo\-Achievement\-Fitness\-Assignment.h.\index{moeoAchievementFitnessAssignment@{moeo\-Achievement\-Fitness\-Assignment}!setReference@{setReference}} +Definition at line 114 of file moeo\-Achievement\-Fitness\-Assignment.h.\index{moeoAchievementFitnessAssignment@{moeo\-Achievement\-Fitness\-Assignment}!setReference@{setReference}} \index{setReference@{setReference}!moeoAchievementFitnessAssignment@{moeo\-Achievement\-Fitness\-Assignment}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ void \bf{moeo\-Achievement\-Fitness\-Assignment}$<$ MOEOT $>$::set\-Reference (const \bf{Objective\-Vector} \& {\em \_\-reference})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoAchievementFitnessAssignment_d200530e3fbdf847dca970ac2265d83d} @@ -145,7 +145,7 @@ Sets the reference point. \end{Desc} -Definition at line 99 of file moeo\-Achievement\-Fitness\-Assignment.h. +Definition at line 124 of file moeo\-Achievement\-Fitness\-Assignment.h. References moeo\-Achievement\-Fitness\-Assignment$<$ MOEOT $>$::reference.\index{moeoAchievementFitnessAssignment@{moeo\-Achievement\-Fitness\-Assignment}!compute@{compute}} \index{compute@{compute}!moeoAchievementFitnessAssignment@{moeo\-Achievement\-Fitness\-Assignment}} @@ -161,7 +161,7 @@ Computes the fitness value for a solution. \end{Desc} -Definition at line 128 of file moeo\-Achievement\-Fitness\-Assignment.h. +Definition at line 153 of file moeo\-Achievement\-Fitness\-Assignment.h. References moeo\-Achievement\-Fitness\-Assignment$<$ MOEOT $>$::inf(), moeo\-Achievement\-Fitness\-Assignment$<$ MOEOT $>$::lambdas, moeo\-Achievement\-Fitness\-Assignment$<$ MOEOT $>$::reference, and moeo\-Achievement\-Fitness\-Assignment$<$ MOEOT $>$::spn. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAdditiveEpsilonBinaryMetric.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAdditiveEpsilonBinaryMetric.tex index 7f652f420..4fee48c95 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAdditiveEpsilonBinaryMetric.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAdditiveEpsilonBinaryMetric.tex @@ -32,7 +32,7 @@ M., Grunert da Fonseca V.: Performance Assessment of Multiobjective Optimizers: -Definition at line 24 of file moeo\-Additive\-Epsilon\-Binary\-Metric.h. +Definition at line 49 of file moeo\-Additive\-Epsilon\-Binary\-Metric.h. \subsection{Member Function Documentation} \index{moeoAdditiveEpsilonBinaryMetric@{moeo\-Additive\-Epsilon\-Binary\-Metric}!operator()@{operator()}} @@ -51,7 +51,7 @@ Returns the minimal distance by which the objective vector \_\-o1 must be transl \end{Desc} -Definition at line 35 of file moeo\-Additive\-Epsilon\-Binary\-Metric.h. +Definition at line 60 of file moeo\-Additive\-Epsilon\-Binary\-Metric.h. References moeo\-Additive\-Epsilon\-Binary\-Metric$<$ Objective\-Vector $>$::epsilon().\index{moeoAdditiveEpsilonBinaryMetric@{moeo\-Additive\-Epsilon\-Binary\-Metric}!epsilon@{epsilon}} \index{epsilon@{epsilon}!moeoAdditiveEpsilonBinaryMetric@{moeo\-Additive\-Epsilon\-Binary\-Metric}} @@ -67,7 +67,7 @@ Returns the epsilon value by which the objective vector \_\-o1 must be translate \end{Desc} -Definition at line 64 of file moeo\-Additive\-Epsilon\-Binary\-Metric.h. +Definition at line 89 of file moeo\-Additive\-Epsilon\-Binary\-Metric.h. References moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric$<$ Objective\-Vector, double $>$::bounds. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAggregativeComparator.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAggregativeComparator.tex index 1455c58cf..b0670d3f4 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAggregativeComparator.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAggregativeComparator.tex @@ -36,7 +36,7 @@ Functor allowing to compare two solutions according to their fitness and diversi -Definition at line 22 of file moeo\-Aggregative\-Comparator.h. +Definition at line 47 of file moeo\-Aggregative\-Comparator.h. \subsection{Constructor \& Destructor Documentation} \index{moeoAggregativeComparator@{moeo\-Aggregative\-Comparator}!moeoAggregativeComparator@{moeoAggregativeComparator}} @@ -53,7 +53,7 @@ Ctor. \end{Desc} -Definition at line 31 of file moeo\-Aggregative\-Comparator.h. +Definition at line 56 of file moeo\-Aggregative\-Comparator.h. \subsection{Member Function Documentation} \index{moeoAggregativeComparator@{moeo\-Aggregative\-Comparator}!operator()@{operator()}} @@ -70,7 +70,7 @@ Returns true if \_\-moeo1 $<$ \_\-moeo2 according to the aggregation of their fi \end{Desc} -Definition at line 40 of file moeo\-Aggregative\-Comparator.h. +Definition at line 65 of file moeo\-Aggregative\-Comparator.h. References moeo\-Aggregative\-Comparator$<$ MOEOT $>$::weight\-Diversity, and moeo\-Aggregative\-Comparator$<$ MOEOT $>$::weight\-Fitness. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAlgo.eps b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAlgo.eps index f3de925d3..a43467b12 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAlgo.eps +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAlgo.eps @@ -5,7 +5,7 @@ %%For: %Magnification: 1.00 %%Orientation: Portrait -%%BoundingBox: 0 0 500 32.4675 +%%BoundingBox: 0 0 500 52.6316 %%Pages: 0 %%BeginSetup %%EndSetup @@ -19,13 +19,13 @@ /marginwidth 10 def /distx 20 def /disty 40 def -/boundaspect 15.4 def % aspect ratio of the BoundingBox (width/height) +/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 7 def +/cols 5 def /scalefactor 0 def /boxfont /Times-Roman findfont fontheight scalefont def @@ -176,14 +176,11 @@ boxfont setfont (moeoAlgo) cw (moeoEA< MOEOT >) cw (moeoLS< MOEOT, Type >) cw -(moeoLS< MOEOT, eoPop< MOEOT > & >) cw (moeoEasyEA< MOEOT >) cw (moeoIBEA< MOEOT >) cw (moeoNSGA< MOEOT >) cw (moeoNSGAII< MOEOT >) cw (moeoCombinedLS< MOEOT, Type >) cw -(moeoIBMOLS< MOEOT, Move >) cw -(moeoIteratedIBMOLS< MOEOT, Move >) cw /boxwidth boxwidth marginwidth 2 mul add def /xspacing boxwidth distx add def /yspacing boxheight disty add def @@ -195,24 +192,21 @@ boundx scalefactor div boundy scalefactor div scale % ----- classes ----- - (moeoAlgo) 4 2 box + (moeoAlgo) 2.75 2 box (moeoEA< MOEOT >) 1.5 1 box (moeoLS< MOEOT, Type >) 4 1 box - (moeoLS< MOEOT, eoPop< MOEOT > & >) 5.5 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 - (moeoIBMOLS< MOEOT, Move >) 5 0 box - (moeoIteratedIBMOLS< MOEOT, Move >) 6 0 box % ----- relations ----- solid -1 4 1.25 out +1 2.75 1.25 out solid -1.5 5.5 2 conn +1.5 4 2 conn solid 0 1.5 1.75 in solid @@ -224,12 +218,6 @@ solid solid 1 4 0.25 out solid -0 5.5 1.75 in -solid -1 5.5 0.25 out -solid -5 6 1 conn -solid 0 0 0.75 in solid 0 1 0.75 in @@ -239,7 +227,3 @@ solid 0 3 0.75 in solid 0 4 0.75 in -solid -0 5 0.75 in -solid -0 6 0.75 in diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAlgo.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAlgo.tex index 36963082a..948b23791 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAlgo.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoAlgo.tex @@ -8,7 +8,7 @@ Abstract class for multi-objective algorithms. Inheritance diagram for moeo\-Algo::\begin{figure}[H] \begin{center} \leavevmode -\includegraphics[height=0.909091cm]{classmoeoAlgo} +\includegraphics[height=1.47368cm]{classmoeoAlgo} \end{center} \end{figure} @@ -18,7 +18,7 @@ Abstract class for multi-objective algorithms. -Definition at line 19 of file moeo\-Algo.h. +Definition at line 44 of file moeo\-Algo.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoArchive.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoArchive.tex index c6a5b447c..a0c5aa813 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoArchive.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoArchive.tex @@ -52,7 +52,7 @@ An archive is a secondary population that stores non-dominated solutions. -Definition at line 24 of file moeo\-Archive.h. +Definition at line 49 of file moeo\-Archive.h. \subsection{Constructor \& Destructor Documentation} \index{moeoArchive@{moeo\-Archive}!moeoArchive@{moeoArchive}} @@ -64,7 +64,7 @@ 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}} +Definition at line 69 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} @@ -78,7 +78,7 @@ Ctor. \end{Desc} -Definition at line 52 of file moeo\-Archive.h. +Definition at line 77 of file moeo\-Archive.h. \subsection{Member Function Documentation} \index{moeoArchive@{moeo\-Archive}!dominates@{dominates}} @@ -95,7 +95,7 @@ Returns true if the current archive dominates \_\-objective\-Vector according to \end{Desc} -Definition at line 60 of file moeo\-Archive.h. +Definition at line 85 of file moeo\-Archive.h. References moeo\-Archive$<$ MOEOT $>$::comparator.\index{moeoArchive@{moeo\-Archive}!contains@{contains}} \index{contains@{contains}!moeoArchive@{moeo\-Archive}} @@ -111,7 +111,7 @@ Returns true if the current archive already contains a solution with the same ob \end{Desc} -Definition at line 78 of file moeo\-Archive.h. +Definition at line 103 of file moeo\-Archive.h. Referenced by moeo\-Archive$<$ MOEOT $>$::equals().\index{moeoArchive@{moeo\-Archive}!update@{update}} \index{update@{update}!moeoArchive@{moeo\-Archive}} @@ -127,11 +127,11 @@ Updates the archive with a given individual \_\-moeo. \end{Desc} -Definition at line 95 of file moeo\-Archive.h. +Definition at line 120 of file moeo\-Archive.h. References moeo\-Archive$<$ MOEOT $>$::comparator. -Referenced by moeo\-Iterated\-IBMOLS$<$ MOEOT, Move $>$::operator()(), moeo\-IBMOLS$<$ MOEOT, Move $>$::operator()(), and moeo\-Archive$<$ MOEOT $>$::update().\index{moeoArchive@{moeo\-Archive}!update@{update}} +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} @@ -145,7 +145,7 @@ Updates the archive with a given population \_\-pop. \end{Desc} -Definition at line 138 of file moeo\-Archive.h. +Definition at line 163 of file moeo\-Archive.h. References moeo\-Archive$<$ MOEOT $>$::update().\index{moeoArchive@{moeo\-Archive}!equals@{equals}} \index{equals@{equals}!moeoArchive@{moeo\-Archive}} @@ -161,12 +161,10 @@ Returns true if the current archive contains the same objective vectors than the \end{Desc} -Definition at line 151 of file moeo\-Archive.h. +Definition at line 176 of file moeo\-Archive.h. References moeo\-Archive$<$ MOEOT $>$::contains(). -Referenced by moeo\-IBMOLS$<$ MOEOT, Move $>$::operator()(). - The documentation for this class was generated from the following file:\begin{CompactItemize} \item moeo\-Archive.h\end{CompactItemize} diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoArchiveObjectiveVectorSavingUpdater.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoArchiveObjectiveVectorSavingUpdater.tex index 8faaea295..25d0524a7 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoArchiveObjectiveVectorSavingUpdater.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoArchiveObjectiveVectorSavingUpdater.tex @@ -46,7 +46,7 @@ This class allows to save the objective vectors of the solutions contained in an -Definition at line 28 of file moeo\-Archive\-Objective\-Vector\-Saving\-Updater.h. +Definition at line 53 of file moeo\-Archive\-Objective\-Vector\-Saving\-Updater.h. \subsection{Constructor \& Destructor Documentation} \index{moeoArchiveObjectiveVectorSavingUpdater@{moeo\-Archive\-Objective\-Vector\-Saving\-Updater}!moeoArchiveObjectiveVectorSavingUpdater@{moeoArchiveObjectiveVectorSavingUpdater}} @@ -63,7 +63,7 @@ Ctor. \end{Desc} -Definition at line 39 of file moeo\-Archive\-Objective\-Vector\-Saving\-Updater.h. +Definition at line 64 of file moeo\-Archive\-Objective\-Vector\-Saving\-Updater.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoArchiveUpdater.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoArchiveUpdater.tex index 8336f6069..63a4f64e7 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoArchiveUpdater.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoArchiveUpdater.tex @@ -37,7 +37,7 @@ This class allows to update the archive at each generation with newly found non- -Definition at line 24 of file moeo\-Archive\-Updater.h. +Definition at line 49 of file moeo\-Archive\-Updater.h. \subsection{Constructor \& Destructor Documentation} \index{moeoArchiveUpdater@{moeo\-Archive\-Updater}!moeoArchiveUpdater@{moeoArchiveUpdater}} @@ -54,7 +54,7 @@ Ctor. \end{Desc} -Definition at line 33 of file moeo\-Archive\-Updater.h. +Definition at line 58 of file moeo\-Archive\-Updater.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBinaryIndicatorBasedFitnessAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBinaryIndicatorBasedFitnessAssignment.tex index 7f000298c..5a538eeee 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBinaryIndicatorBasedFitnessAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBinaryIndicatorBasedFitnessAssignment.tex @@ -31,7 +31,7 @@ virtual double \bf{update\-By\-Adding} (\bf{eo\-Pop}$<$ MOEOT $>$ \&\_\-pop, \bf -Definition at line 22 of file moeo\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. +Definition at line 47 of file moeo\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. \subsection{Member Function Documentation} \index{moeoBinaryIndicatorBasedFitnessAssignment@{moeo\-Binary\-Indicator\-Based\-Fitness\-Assignment}!updateByAdding@{updateByAdding}} diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBinaryMetric.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBinaryMetric.tex index b803fc3ef..504091e7f 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBinaryMetric.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBinaryMetric.tex @@ -20,7 +20,7 @@ Base class for binary metrics. -Definition at line 36 of file moeo\-Metric.h. +Definition at line 61 of file moeo\-Metric.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBinaryMetricSavingUpdater.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBinaryMetricSavingUpdater.tex index 73030a896..45bbecb02 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBinaryMetricSavingUpdater.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBinaryMetricSavingUpdater.tex @@ -55,7 +55,7 @@ This class allows to save the progression of a binary metric comparing the objec -Definition at line 28 of file moeo\-Binary\-Metric\-Saving\-Updater.h. +Definition at line 53 of file moeo\-Binary\-Metric\-Saving\-Updater.h. \subsection{Constructor \& Destructor Documentation} \index{moeoBinaryMetricSavingUpdater@{moeo\-Binary\-Metric\-Saving\-Updater}!moeoBinaryMetricSavingUpdater@{moeoBinaryMetricSavingUpdater}} @@ -72,7 +72,7 @@ Ctor. \end{Desc} -Definition at line 42 of file moeo\-Binary\-Metric\-Saving\-Updater.h. +Definition at line 67 of file moeo\-Binary\-Metric\-Saving\-Updater.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBitVector.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBitVector.tex index a980f804a..d2dff5fe6 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBitVector.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoBitVector.tex @@ -32,7 +32,7 @@ This class is an implementationeo of a simple bit-valued \doxyref{moeo\-Vector}{ -Definition at line 22 of file moeo\-Bit\-Vector.h. +Definition at line 47 of file moeo\-Bit\-Vector.h. \subsection{Constructor \& Destructor Documentation} \index{moeoBitVector@{moeo\-Bit\-Vector}!moeoBitVector@{moeoBitVector}} @@ -49,7 +49,7 @@ Ctor. \end{Desc} -Definition at line 37 of file moeo\-Bit\-Vector.h. +Definition at line 62 of file moeo\-Bit\-Vector.h. \subsection{Member Function Documentation} \index{moeoBitVector@{moeo\-Bit\-Vector}!printOn@{printOn}} @@ -68,7 +68,7 @@ Writing object. Reimplemented from \bf{moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, bool $>$} \doxyref{p.}{classmoeoVector_d0a92cb26483ffab754ac4a0efb76308}. -Definition at line 54 of file moeo\-Bit\-Vector.h.\index{moeoBitVector@{moeo\-Bit\-Vector}!readFrom@{readFrom}} +Definition at line 79 of file moeo\-Bit\-Vector.h.\index{moeoBitVector@{moeo\-Bit\-Vector}!readFrom@{readFrom}} \index{readFrom@{readFrom}!moeoBitVector@{moeo\-Bit\-Vector}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOObjective\-Vector, class MOEOFitness, class MOEODiversity$>$ virtual void \bf{moeo\-Bit\-Vector}$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classmoeoBitVector_31cd3f894615d0a27dd116a5c8082521} @@ -84,7 +84,7 @@ Reading object. Reimplemented from \bf{moeo\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, bool $>$} \doxyref{p.}{classmoeoVector_cd8ee0fe79bb9515b29e2a4d3fee5ab9}. -Definition at line 67 of file moeo\-Bit\-Vector.h. +Definition at line 92 of file moeo\-Bit\-Vector.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoCombinedLS.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoCombinedLS.tex index 462b057d7..3a7bb557b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoCombinedLS.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoCombinedLS.tex @@ -35,7 +35,7 @@ This class allows to embed a set of local searches that are sequentially applied -Definition at line 25 of file moeo\-Combined\-LS.h. +Definition at line 50 of file moeo\-Combined\-LS.h. \subsection{Constructor \& Destructor Documentation} \index{moeoCombinedLS@{moeo\-Combined\-LS}!moeoCombinedLS@{moeoCombinedLS}} @@ -52,7 +52,7 @@ Ctor. \end{Desc} -Definition at line 33 of file moeo\-Combined\-LS.h. +Definition at line 58 of file moeo\-Combined\-LS.h. References moeo\-Combined\-LS$<$ MOEOT, Type $>$::combined\-LS. @@ -71,7 +71,7 @@ Adds a new local search to combine. \end{Desc} -Definition at line 42 of file moeo\-Combined\-LS.h. +Definition at line 67 of file moeo\-Combined\-LS.h. References moeo\-Combined\-LS$<$ MOEOT, Type $>$::combined\-LS.\index{moeoCombinedLS@{moeo\-Combined\-LS}!operator()@{operator()}} \index{operator()@{operator()}!moeoCombinedLS@{moeo\-Combined\-LS}} @@ -89,7 +89,7 @@ The new non-dominated solutions are added to the archive \begin{Desc} Implements \bf{eo\-BF$<$ Type, moeo\-Archive$<$ MOEOT $>$ \&, void $>$}. -Definition at line 53 of file moeo\-Combined\-LS.h. +Definition at line 78 of file moeo\-Combined\-LS.h. References moeo\-Combined\-LS$<$ MOEOT, Type $>$::combined\-LS. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoComparator.eps b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoComparator.eps index 6628dcaf9..c87d0fa42 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoComparator.eps +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoComparator.eps @@ -5,7 +5,7 @@ %%For: %Magnification: 1.00 %%Orientation: Portrait -%%BoundingBox: 0 0 500 26.8817 +%%BoundingBox: 0 0 500 32.2581 %%Pages: 0 %%BeginSetup %%EndSetup @@ -19,13 +19,13 @@ /marginwidth 10 def /distx 20 def /disty 40 def -/boundaspect 18.6 def % aspect ratio of the BoundingBox (width/height) +/boundaspect 15.5 def % aspect ratio of the BoundingBox (width/height) /boundx 500 def /boundy boundx boundaspect div def /xspacing 0 def /yspacing 0 def /rows 4 def -/cols 6 def +/cols 5 def /scalefactor 0 def /boxfont /Times-Roman findfont fontheight scalefont def @@ -180,7 +180,6 @@ boxfont setfont (moeoDiversityThenFitnessComparator< MOEOT >) cw (moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator) cw (moeoFitnessThenDiversityComparator< MOEOT >) cw -(moeoIBMOLS< MOEOT, Move >::OneObjectiveComparator) cw (moeoOneObjectiveComparator< MOEOT >) cw /boxwidth boxwidth marginwidth 2 mul add def /xspacing boxwidth distx add def @@ -193,30 +192,29 @@ boundx scalefactor div boundy scalefactor div scale % ----- classes ----- - (moeoComparator< MOEOT >) 2.5 1 box - (eoBF< A1, A2, R >) 2.5 2 box - (eoFunctorBase) 2.5 3 box + (moeoComparator< MOEOT >) 2 1 box + (eoBF< A1, A2, R >) 2 2 box + (eoFunctorBase) 2 3 box (moeoAggregativeComparator< MOEOT >) 0 0 box (moeoDiversityThenFitnessComparator< MOEOT >) 1 0 box (moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator) 2 0 box (moeoFitnessThenDiversityComparator< MOEOT >) 3 0 box - (moeoIBMOLS< MOEOT, Move >::OneObjectiveComparator) 4 0 box - (moeoOneObjectiveComparator< MOEOT >) 5 0 box + (moeoOneObjectiveComparator< MOEOT >) 4 0 box % ----- relations ----- solid -0 2.5 1 out +0 2 1 out solid -1 2.5 2 in +1 2 2 in solid -0 2.5 2 out +0 2 2 out solid -1 2.5 3 in +1 2 3 in solid -1 2.5 0.25 out +1 2 0.25 out solid -0 5 1 conn +0 4 1 conn solid 0 0 0.75 in solid @@ -227,5 +225,3 @@ solid 0 3 0.75 in solid 0 4 0.75 in -solid -0 5 0.75 in diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoComparator.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoComparator.tex index 85d1b9766..40f1d1a08 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoComparator.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoComparator.tex @@ -8,7 +8,7 @@ Functor allowing to compare two solutions. Inheritance diagram for moeo\-Comparator$<$ MOEOT $>$::\begin{figure}[H] \begin{center} \leavevmode -\includegraphics[height=0.752688cm]{classmoeoComparator} +\includegraphics[height=0.903226cm]{classmoeoComparator} \end{center} \end{figure} @@ -20,7 +20,7 @@ Functor allowing to compare two solutions. -Definition at line 22 of file moeo\-Comparator.h. +Definition at line 47 of file moeo\-Comparator.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoContributionMetric.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoContributionMetric.tex index 9ecca0f4b..710747c4c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoContributionMetric.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoContributionMetric.tex @@ -42,7 +42,7 @@ of the 2000 Congress on Evolutionary Computation, IEEE Press, pp. 317-324) -Definition at line 24 of file moeo\-Contribution\-Metric.h. +Definition at line 49 of file moeo\-Contribution\-Metric.h. \subsection{Member Function Documentation} \index{moeoContributionMetric@{moeo\-Contribution\-Metric}!operator()@{operator()}} @@ -59,7 +59,7 @@ Returns the contribution of the Pareto set '\_\-set1' relatively to the Pareto s \end{Desc} -Definition at line 33 of file moeo\-Contribution\-Metric.h. +Definition at line 58 of file moeo\-Contribution\-Metric.h. References moeo\-Contribution\-Metric$<$ Objective\-Vector $>$::card\_\-C(), moeo\-Contribution\-Metric$<$ Objective\-Vector $>$::card\_\-N(), and moeo\-Contribution\-Metric$<$ Objective\-Vector $>$::card\_\-W().\index{moeoContributionMetric@{moeo\-Contribution\-Metric}!card_C@{card\_\-C}} \index{card_C@{card\_\-C}!moeoContributionMetric@{moeo\-Contribution\-Metric}} @@ -75,7 +75,7 @@ Returns the number of solutions both in '\_\-set1' and '\_\-set2'. \end{Desc} -Definition at line 54 of file moeo\-Contribution\-Metric.h. +Definition at line 79 of file moeo\-Contribution\-Metric.h. Referenced by moeo\-Contribution\-Metric$<$ Objective\-Vector $>$::operator()().\index{moeoContributionMetric@{moeo\-Contribution\-Metric}!card_W@{card\_\-W}} \index{card_W@{card\_\-W}!moeoContributionMetric@{moeo\-Contribution\-Metric}} @@ -91,7 +91,7 @@ Returns the number of solutions in '\_\-set1' dominating at least one solution o \end{Desc} -Definition at line 71 of file moeo\-Contribution\-Metric.h. +Definition at line 96 of file moeo\-Contribution\-Metric.h. References moeo\-Contribution\-Metric$<$ Objective\-Vector $>$::pareto\-Comparator. @@ -109,7 +109,7 @@ Returns the number of solutions in '\_\-set1' having no relation of dominance wi \end{Desc} -Definition at line 89 of file moeo\-Contribution\-Metric.h. +Definition at line 114 of file moeo\-Contribution\-Metric.h. References moeo\-Contribution\-Metric$<$ Objective\-Vector $>$::pareto\-Comparator. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoConvertPopToObjectiveVectors.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoConvertPopToObjectiveVectors.tex index 92b954b37..b2ee4593f 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoConvertPopToObjectiveVectors.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoConvertPopToObjectiveVectors.tex @@ -25,7 +25,7 @@ Functor allowing to get a vector of objective vectors from a population. -Definition at line 23 of file moeo\-Convert\-Pop\-To\-Objective\-Vectors.h. +Definition at line 48 of file moeo\-Convert\-Pop\-To\-Objective\-Vectors.h. \subsection{Member Function Documentation} \index{moeoConvertPopToObjectiveVectors@{moeo\-Convert\-Pop\-To\-Objective\-Vectors}!operator()@{operator()}} @@ -42,7 +42,7 @@ Returns a vector of the objective vectors from the population \_\-pop. \end{Desc} -Definition at line 31 of file moeo\-Convert\-Pop\-To\-Objective\-Vectors.h. +Definition at line 56 of file moeo\-Convert\-Pop\-To\-Objective\-Vectors.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoCriterionBasedFitnessAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoCriterionBasedFitnessAssignment.tex index ed43820ca..10a06b76b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoCriterionBasedFitnessAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoCriterionBasedFitnessAssignment.tex @@ -20,7 +20,7 @@ Inheritance diagram for moeo\-Criterion\-Based\-Fitness\-Assignment$<$ MOEOT $>$ -Definition at line 22 of file moeo\-Criterion\-Based\-Fitness\-Assignment.h. +Definition at line 47 of file moeo\-Criterion\-Based\-Fitness\-Assignment.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoCrowdingDiversityAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoCrowdingDiversityAssignment.tex index be11b8f3a..0bc8af1d4 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoCrowdingDiversityAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoCrowdingDiversityAssignment.tex @@ -46,7 +46,7 @@ Deb, A. Pratap, S. Agarwal, T. Meyarivan, \char`\"{}A Fast and Elitist Multi-Obj -Definition at line 25 of file moeo\-Crowding\-Diversity\-Assignment.h. +Definition at line 50 of file moeo\-Crowding\-Diversity\-Assignment.h. \subsection{Member Function Documentation} \index{moeoCrowdingDiversityAssignment@{moeo\-Crowding\-Diversity\-Assignment}!operator()@{operator()}} @@ -65,7 +65,7 @@ Computes diversity values for every solution contained in the population \_\-pop Implements \bf{eo\-UF$<$ eo\-Pop$<$ MOEOT $>$ \&, void $>$}. -Definition at line 55 of file moeo\-Crowding\-Diversity\-Assignment.h. +Definition at line 80 of file moeo\-Crowding\-Diversity\-Assignment.h. References moeo\-Crowding\-Diversity\-Assignment$<$ MOEOT $>$::inf(), and moeo\-Crowding\-Diversity\-Assignment$<$ MOEOT $>$::set\-Distances().\index{moeoCrowdingDiversityAssignment@{moeo\-Crowding\-Diversity\-Assignment}!updateByDeleting@{updateByDeleting}} \index{updateByDeleting@{updateByDeleting}!moeoCrowdingDiversityAssignment@{moeo\-Crowding\-Diversity\-Assignment}} @@ -87,7 +87,7 @@ Implements \bf{moeo\-Diversity\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoD Reimplemented in \bf{moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoFrontByFrontCrowdingDiversityAssignment_f73ff88bd29c49260e2ca859250e4b68}. -Definition at line 78 of file moeo\-Crowding\-Diversity\-Assignment.h.\index{moeoCrowdingDiversityAssignment@{moeo\-Crowding\-Diversity\-Assignment}!setDistances@{setDistances}} +Definition at line 103 of file moeo\-Crowding\-Diversity\-Assignment.h.\index{moeoCrowdingDiversityAssignment@{moeo\-Crowding\-Diversity\-Assignment}!setDistances@{setDistances}} \index{setDistances@{setDistances}!moeoCrowdingDiversityAssignment@{moeo\-Crowding\-Diversity\-Assignment}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ virtual void \bf{moeo\-Crowding\-Diversity\-Assignment}$<$ MOEOT $>$::set\-Distances (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt [inline, protected, virtual]}}\label{classmoeoCrowdingDiversityAssignment_acbe3e03404ecc67dd5e83f00576c255} @@ -103,7 +103,7 @@ Sets the distance values. Reimplemented in \bf{moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoFrontByFrontCrowdingDiversityAssignment_1aa0ec7b94fbbf952636bcc21e1a9d16}. -Definition at line 90 of file moeo\-Crowding\-Diversity\-Assignment.h. +Definition at line 115 of file moeo\-Crowding\-Diversity\-Assignment.h. References moeo\-Crowding\-Diversity\-Assignment$<$ MOEOT $>$::inf(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDetTournamentSelect.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDetTournamentSelect.tex index 113c14ff7..ed690caa2 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDetTournamentSelect.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDetTournamentSelect.tex @@ -41,7 +41,7 @@ Selection strategy that selects ONE individual by deterministic tournament. -Definition at line 24 of file moeo\-Det\-Tournament\-Select.h. +Definition at line 49 of file moeo\-Det\-Tournament\-Select.h. \subsection{Constructor \& Destructor Documentation} \index{moeoDetTournamentSelect@{moeo\-Det\-Tournament\-Select}!moeoDetTournamentSelect@{moeoDetTournamentSelect}} @@ -58,7 +58,7 @@ Full Ctor. \end{Desc} -Definition at line 33 of file moeo\-Det\-Tournament\-Select.h. +Definition at line 58 of file moeo\-Det\-Tournament\-Select.h. References moeo\-Det\-Tournament\-Select$<$ MOEOT $>$::t\-Size.\index{moeoDetTournamentSelect@{moeo\-Det\-Tournament\-Select}!moeoDetTournamentSelect@{moeoDetTournamentSelect}} \index{moeoDetTournamentSelect@{moeoDetTournamentSelect}!moeoDetTournamentSelect@{moeo\-Det\-Tournament\-Select}} @@ -74,7 +74,7 @@ A \doxyref{moeo\-Fitness\-Then\-Diversity\-Comparator}{p.}{classmoeoFitnessThenD \end{Desc} -Definition at line 49 of file moeo\-Det\-Tournament\-Select.h. +Definition at line 74 of file moeo\-Det\-Tournament\-Select.h. References moeo\-Det\-Tournament\-Select$<$ MOEOT $>$::t\-Size. @@ -93,7 +93,7 @@ Apply the tournament to the given population. \end{Desc} -Definition at line 65 of file moeo\-Det\-Tournament\-Select.h. +Definition at line 90 of file moeo\-Det\-Tournament\-Select.h. References moeo\-Det\-Tournament\-Select$<$ MOEOT $>$::comparator, and moeo\-Det\-Tournament\-Select$<$ MOEOT $>$::t\-Size. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDistance.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDistance.tex index b01cae414..2ffef7fad 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDistance.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDistance.tex @@ -29,7 +29,7 @@ The base class for distance computation. -Definition at line 22 of file moeo\-Distance.h. +Definition at line 47 of file moeo\-Distance.h. \subsection{Member Function Documentation} \index{moeoDistance@{moeo\-Distance}!setup@{setup}} @@ -48,7 +48,7 @@ Nothing to do. Reimplemented in \bf{moeo\-Normalized\-Distance$<$ MOEOT, Type $>$} \doxyref{p.}{classmoeoNormalizedDistance_b99ffed3c0ce6c9c10aef0a76d983bb1}, and \bf{moeo\-Normalized\-Distance$<$ MOEOT $>$} \doxyref{p.}{classmoeoNormalizedDistance_b99ffed3c0ce6c9c10aef0a76d983bb1}. -Definition at line 30 of file moeo\-Distance.h.\index{moeoDistance@{moeo\-Distance}!setup@{setup}} +Definition at line 55 of file moeo\-Distance.h.\index{moeoDistance@{moeo\-Distance}!setup@{setup}} \index{setup@{setup}!moeoDistance@{moeo\-Distance}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT, class Type$>$ virtual void \bf{moeo\-Distance}$<$ MOEOT, Type $>$::setup (double {\em \_\-min}, double {\em \_\-max}, unsigned int {\em \_\-obj})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classmoeoDistance_341c4fa39652871761053e85914a16ad} @@ -64,7 +64,7 @@ Nothing to do. Reimplemented in \bf{moeo\-Normalized\-Distance$<$ MOEOT, Type $>$} \doxyref{p.}{classmoeoNormalizedDistance_e58bbf9eb90a8d2704f88d774d3fe1e1}, and \bf{moeo\-Normalized\-Distance$<$ MOEOT $>$} \doxyref{p.}{classmoeoNormalizedDistance_e58bbf9eb90a8d2704f88d774d3fe1e1}. -Definition at line 40 of file moeo\-Distance.h.\index{moeoDistance@{moeo\-Distance}!setup@{setup}} +Definition at line 65 of file moeo\-Distance.h.\index{moeoDistance@{moeo\-Distance}!setup@{setup}} \index{setup@{setup}!moeoDistance@{moeo\-Distance}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT, class Type$>$ virtual void \bf{moeo\-Distance}$<$ MOEOT, Type $>$::setup (\bf{eo\-Real\-Interval} {\em \_\-real\-Interval}, unsigned int {\em \_\-obj})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classmoeoDistance_b08e7b8c1bedb2993669ec0315fb2b73} @@ -80,7 +80,7 @@ Nothing to do. Reimplemented in \bf{moeo\-Normalized\-Distance$<$ MOEOT, Type $>$} \doxyref{p.}{classmoeoNormalizedDistance_dda4f95d7f6cae9dd1f4bf6cd8fb7c1c}, and \bf{moeo\-Normalized\-Distance$<$ MOEOT $>$} \doxyref{p.}{classmoeoNormalizedDistance_dda4f95d7f6cae9dd1f4bf6cd8fb7c1c}. -Definition at line 49 of file moeo\-Distance.h. +Definition at line 74 of file moeo\-Distance.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDistanceMatrix.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDistanceMatrix.tex index 670658e13..f8d86fdc5 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDistanceMatrix.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDistanceMatrix.tex @@ -33,7 +33,7 @@ A matrix to compute distances between every pair of individuals contained in a p -Definition at line 24 of file moeo\-Distance\-Matrix.h. +Definition at line 49 of file moeo\-Distance\-Matrix.h. \subsection{Constructor \& Destructor Documentation} \index{moeoDistanceMatrix@{moeo\-Distance\-Matrix}!moeoDistanceMatrix@{moeoDistanceMatrix}} @@ -50,7 +50,7 @@ Ctor. \end{Desc} -Definition at line 37 of file moeo\-Distance\-Matrix.h. +Definition at line 62 of file moeo\-Distance\-Matrix.h. \subsection{Member Function Documentation} \index{moeoDistanceMatrix@{moeo\-Distance\-Matrix}!operator()@{operator()}} @@ -69,7 +69,7 @@ Sets the distance between every pair of individuals contained in the population Implements \bf{eo\-UF$<$ const eo\-Pop$<$ MOEOT $>$ \&, void $>$}. -Definition at line 51 of file moeo\-Distance\-Matrix.h. +Definition at line 76 of file moeo\-Distance\-Matrix.h. References moeo\-Distance\-Matrix$<$ MOEOT, Type $>$::distance. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDiversityAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDiversityAssignment.tex index 152d28c7d..31d05b1c4 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDiversityAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDiversityAssignment.tex @@ -33,7 +33,7 @@ Functor that sets the diversity values of a whole population. -Definition at line 23 of file moeo\-Diversity\-Assignment.h. +Definition at line 48 of file moeo\-Diversity\-Assignment.h. \subsection{Member Function Documentation} \index{moeoDiversityAssignment@{moeo\-Diversity\-Assignment}!updateByDeleting@{updateByDeleting}} @@ -66,7 +66,7 @@ Updates the diversity values of the whole population \_\-pop by taking the delet \end{Desc} -Definition at line 44 of file moeo\-Diversity\-Assignment.h. +Definition at line 69 of file moeo\-Diversity\-Assignment.h. References moeo\-Diversity\-Assignment$<$ MOEOT $>$::update\-By\-Deleting(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDiversityThenFitnessComparator.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDiversityThenFitnessComparator.tex index e094536aa..9620d314b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDiversityThenFitnessComparator.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDiversityThenFitnessComparator.tex @@ -25,7 +25,7 @@ Functor allowing to compare two solutions according to their diversity values, t -Definition at line 22 of file moeo\-Diversity\-Then\-Fitness\-Comparator.h. +Definition at line 47 of file moeo\-Diversity\-Then\-Fitness\-Comparator.h. \subsection{Member Function Documentation} \index{moeoDiversityThenFitnessComparator@{moeo\-Diversity\-Then\-Fitness\-Comparator}!operator()@{operator()}} @@ -42,7 +42,7 @@ Returns true if \_\-moeo1 $<$ \_\-moeo2 according to their diversity values, the \end{Desc} -Definition at line 31 of file moeo\-Diversity\-Then\-Fitness\-Comparator.h. +Definition at line 56 of file moeo\-Diversity\-Then\-Fitness\-Comparator.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDummyDiversityAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDummyDiversityAssignment.tex index d96ccf59c..244e82cb5 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDummyDiversityAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDummyDiversityAssignment.tex @@ -33,7 +33,7 @@ void \bf{update\-By\-Deleting} (\bf{eo\-Pop}$<$ MOEOT $>$ \&\_\-pop, \bf{Objecti -Definition at line 22 of file moeo\-Dummy\-Diversity\-Assignment.h. +Definition at line 47 of file moeo\-Dummy\-Diversity\-Assignment.h. \subsection{Member Function Documentation} \index{moeoDummyDiversityAssignment@{moeo\-Dummy\-Diversity\-Assignment}!operator()@{operator()}} @@ -52,7 +52,7 @@ Sets the diversity to '0' for every individuals of the population \_\-pop if it Implements \bf{eo\-UF$<$ eo\-Pop$<$ MOEOT $>$ \&, void $>$}. -Definition at line 34 of file moeo\-Dummy\-Diversity\-Assignment.h.\index{moeoDummyDiversityAssignment@{moeo\-Dummy\-Diversity\-Assignment}!updateByDeleting@{updateByDeleting}} +Definition at line 59 of file moeo\-Dummy\-Diversity\-Assignment.h.\index{moeoDummyDiversityAssignment@{moeo\-Dummy\-Diversity\-Assignment}!updateByDeleting@{updateByDeleting}} \index{updateByDeleting@{updateByDeleting}!moeoDummyDiversityAssignment@{moeo\-Dummy\-Diversity\-Assignment}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ void \bf{moeo\-Dummy\-Diversity\-Assignment}$<$ MOEOT $>$::update\-By\-Deleting (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop}, \bf{Objective\-Vector} \& {\em \_\-obj\-Vec})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classmoeoDummyDiversityAssignment_3382b59e2b8bbdc840dc25463649f1e4} @@ -68,7 +68,7 @@ Updates the diversity values of the whole population \_\-pop by taking the delet Implements \bf{moeo\-Diversity\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoDiversityAssignment_57f400263b36664df6269f1b522cfdcb}. -Definition at line 52 of file moeo\-Dummy\-Diversity\-Assignment.h. +Definition at line 77 of file moeo\-Dummy\-Diversity\-Assignment.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDummyFitnessAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDummyFitnessAssignment.tex index 3f8969533..dc3ef173c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDummyFitnessAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoDummyFitnessAssignment.tex @@ -33,7 +33,7 @@ void \bf{update\-By\-Deleting} (\bf{eo\-Pop}$<$ MOEOT $>$ \&\_\-pop, \bf{Objecti -Definition at line 22 of file moeo\-Dummy\-Fitness\-Assignment.h. +Definition at line 47 of file moeo\-Dummy\-Fitness\-Assignment.h. \subsection{Member Function Documentation} \index{moeoDummyFitnessAssignment@{moeo\-Dummy\-Fitness\-Assignment}!operator()@{operator()}} @@ -52,7 +52,7 @@ Sets the fitness to '0' for every individuals of the population \_\-pop if it is Implements \bf{eo\-UF$<$ eo\-Pop$<$ MOEOT $>$ \&, void $>$}. -Definition at line 34 of file moeo\-Dummy\-Fitness\-Assignment.h.\index{moeoDummyFitnessAssignment@{moeo\-Dummy\-Fitness\-Assignment}!updateByDeleting@{updateByDeleting}} +Definition at line 59 of file moeo\-Dummy\-Fitness\-Assignment.h.\index{moeoDummyFitnessAssignment@{moeo\-Dummy\-Fitness\-Assignment}!updateByDeleting@{updateByDeleting}} \index{updateByDeleting@{updateByDeleting}!moeoDummyFitnessAssignment@{moeo\-Dummy\-Fitness\-Assignment}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ void \bf{moeo\-Dummy\-Fitness\-Assignment}$<$ MOEOT $>$::update\-By\-Deleting (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop}, \bf{Objective\-Vector} \& {\em \_\-obj\-Vec})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classmoeoDummyFitnessAssignment_6e87d4a8ff8f43a7001a21a13795d00e} @@ -68,7 +68,7 @@ Updates the fitness values of the whole population \_\-pop by taking the deletio Implements \bf{moeo\-Fitness\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoFitnessAssignment_4922629569eddc9be049b3ead1ab0269}. -Definition at line 52 of file moeo\-Dummy\-Fitness\-Assignment.h. +Definition at line 77 of file moeo\-Dummy\-Fitness\-Assignment.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEA.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEA.tex index c6de2bc08..639661498 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEA.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEA.tex @@ -20,7 +20,7 @@ Abstract class for multi-objective evolutionary algorithms. -Definition at line 23 of file moeo\-EA.h. +Definition at line 48 of file moeo\-EA.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA.tex index 4ea751dcc..defba3ddd 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA.tex @@ -95,7 +95,7 @@ An easy class to design multi-objective evolutionary algorithms. -Definition at line 33 of file moeo\-Easy\-EA.h. +Definition at line 58 of file moeo\-Easy\-EA.h. \subsection{Constructor \& Destructor Documentation} \index{moeoEasyEA@{moeo\-Easy\-EA}!moeoEasyEA@{moeoEasyEA}} @@ -112,7 +112,7 @@ Ctor taking a breed and merge. \end{Desc} -Definition at line 47 of file moeo\-Easy\-EA.h.\index{moeoEasyEA@{moeo\-Easy\-EA}!moeoEasyEA@{moeoEasyEA}} +Definition at line 72 of file moeo\-Easy\-EA.h.\index{moeoEasyEA@{moeo\-Easy\-EA}!moeoEasyEA@{moeoEasyEA}} \index{moeoEasyEA@{moeoEasyEA}!moeoEasyEA@{moeo\-Easy\-EA}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Easy\-EA}$<$ MOEOT $>$::\bf{moeo\-Easy\-EA} (\bf{eo\-Continue}$<$ MOEOT $>$ \& {\em \_\-continuator}, \bf{eo\-Pop\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-pop\-Eval}, \bf{eo\-Breed}$<$ MOEOT $>$ \& {\em \_\-breed}, \bf{moeo\-Replacement}$<$ MOEOT $>$ \& {\em \_\-replace}, \bf{moeo\-Fitness\-Assignment}$<$ MOEOT $>$ \& {\em \_\-fitness\-Eval}, \bf{moeo\-Diversity\-Assignment}$<$ MOEOT $>$ \& {\em \_\-diversity\-Eval}, bool {\em \_\-eval\-Fit\-And\-Div\-Before\-Selection} = {\tt false})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoEasyEA_6cdebc72ce0134ce1680dafdf94740a1} @@ -126,7 +126,7 @@ Ctor taking a breed, a merge and a eo\-Pop\-Eval. \end{Desc} -Definition at line 65 of file moeo\-Easy\-EA.h.\index{moeoEasyEA@{moeo\-Easy\-EA}!moeoEasyEA@{moeoEasyEA}} +Definition at line 90 of file moeo\-Easy\-EA.h.\index{moeoEasyEA@{moeo\-Easy\-EA}!moeoEasyEA@{moeoEasyEA}} \index{moeoEasyEA@{moeoEasyEA}!moeoEasyEA@{moeo\-Easy\-EA}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Easy\-EA}$<$ MOEOT $>$::\bf{moeo\-Easy\-EA} (\bf{eo\-Continue}$<$ MOEOT $>$ \& {\em \_\-continuator}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{eo\-Breed}$<$ MOEOT $>$ \& {\em \_\-breed}, \bf{eo\-Merge}$<$ MOEOT $>$ \& {\em \_\-merge}, \bf{eo\-Reduce}$<$ MOEOT $>$ \& {\em \_\-reduce}, \bf{moeo\-Fitness\-Assignment}$<$ MOEOT $>$ \& {\em \_\-fitness\-Eval}, \bf{moeo\-Diversity\-Assignment}$<$ MOEOT $>$ \& {\em \_\-diversity\-Eval}, bool {\em \_\-eval\-Fit\-And\-Div\-Before\-Selection} = {\tt false})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoEasyEA_65c1069eeed979ca433e6caee3b5e942} @@ -140,7 +140,7 @@ Ctor taking a breed, a merge and a reduce. \end{Desc} -Definition at line 84 of file moeo\-Easy\-EA.h.\index{moeoEasyEA@{moeo\-Easy\-EA}!moeoEasyEA@{moeoEasyEA}} +Definition at line 109 of file moeo\-Easy\-EA.h.\index{moeoEasyEA@{moeo\-Easy\-EA}!moeoEasyEA@{moeoEasyEA}} \index{moeoEasyEA@{moeoEasyEA}!moeoEasyEA@{moeo\-Easy\-EA}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Easy\-EA}$<$ MOEOT $>$::\bf{moeo\-Easy\-EA} (\bf{eo\-Continue}$<$ MOEOT $>$ \& {\em \_\-continuator}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{eo\-Select}$<$ MOEOT $>$ \& {\em \_\-select}, \bf{eo\-Transform}$<$ MOEOT $>$ \& {\em \_\-transform}, \bf{moeo\-Replacement}$<$ MOEOT $>$ \& {\em \_\-replace}, \bf{moeo\-Fitness\-Assignment}$<$ MOEOT $>$ \& {\em \_\-fitness\-Eval}, \bf{moeo\-Diversity\-Assignment}$<$ MOEOT $>$ \& {\em \_\-diversity\-Eval}, bool {\em \_\-eval\-Fit\-And\-Div\-Before\-Selection} = {\tt false})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoEasyEA_27f0db7a608636c904305afa11cd6ae1} @@ -154,7 +154,7 @@ Ctor taking a select, a transform and a replacement. \end{Desc} -Definition at line 103 of file moeo\-Easy\-EA.h.\index{moeoEasyEA@{moeo\-Easy\-EA}!moeoEasyEA@{moeoEasyEA}} +Definition at line 128 of file moeo\-Easy\-EA.h.\index{moeoEasyEA@{moeo\-Easy\-EA}!moeoEasyEA@{moeoEasyEA}} \index{moeoEasyEA@{moeoEasyEA}!moeoEasyEA@{moeo\-Easy\-EA}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Easy\-EA}$<$ MOEOT $>$::\bf{moeo\-Easy\-EA} (\bf{eo\-Continue}$<$ MOEOT $>$ \& {\em \_\-continuator}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{eo\-Select}$<$ MOEOT $>$ \& {\em \_\-select}, \bf{eo\-Transform}$<$ MOEOT $>$ \& {\em \_\-transform}, \bf{eo\-Merge}$<$ MOEOT $>$ \& {\em \_\-merge}, \bf{eo\-Reduce}$<$ MOEOT $>$ \& {\em \_\-reduce}, \bf{moeo\-Fitness\-Assignment}$<$ MOEOT $>$ \& {\em \_\-fitness\-Eval}, \bf{moeo\-Diversity\-Assignment}$<$ MOEOT $>$ \& {\em \_\-diversity\-Eval}, bool {\em \_\-eval\-Fit\-And\-Div\-Before\-Selection} = {\tt false})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoEasyEA_564a3291a8239515328cf0a6b40f3c99} @@ -168,7 +168,7 @@ Ctor taking a select, a transform, a merge and a reduce. \end{Desc} -Definition at line 123 of file moeo\-Easy\-EA.h. +Definition at line 148 of file moeo\-Easy\-EA.h. \subsection{Member Function Documentation} \index{moeoEasyEA@{moeo\-Easy\-EA}!operator()@{operator()}} @@ -185,7 +185,7 @@ Applies a few generation of evolution to the population \_\-pop. \end{Desc} -Definition at line 135 of file moeo\-Easy\-EA.h. +Definition at line 160 of file moeo\-Easy\-EA.h. References moeo\-Easy\-EA$<$ MOEOT $>$::breed, moeo\-Easy\-EA$<$ MOEOT $>$::continuator, moeo\-Easy\-EA$<$ MOEOT $>$::diversity\-Eval, moeo\-Easy\-EA$<$ MOEOT $>$::eval\-Fit\-And\-Div\-Before\-Selection, moeo\-Easy\-EA$<$ MOEOT $>$::fitness\-Eval, moeo\-Easy\-EA$<$ MOEOT $>$::pop\-Eval, and moeo\-Easy\-EA$<$ MOEOT $>$::replace. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA_1_1eoDummyEval.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA_1_1eoDummyEval.tex index a29cf04b9..e6e1e9a51 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA_1_1eoDummyEval.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA_1_1eoDummyEval.tex @@ -26,7 +26,7 @@ a dummy eval -Definition at line 200 of file moeo\-Easy\-EA.h. +Definition at line 225 of file moeo\-Easy\-EA.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA_1_1eoDummySelect.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA_1_1eoDummySelect.tex index 50599fe9b..481699154 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA_1_1eoDummySelect.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA_1_1eoDummySelect.tex @@ -26,7 +26,7 @@ a dummy select -Definition at line 204 of file moeo\-Easy\-EA.h. +Definition at line 229 of file moeo\-Easy\-EA.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA_1_1eoDummyTransform.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA_1_1eoDummyTransform.tex index 495ae6b6c..7655e4a5d 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA_1_1eoDummyTransform.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEasyEA_1_1eoDummyTransform.tex @@ -26,7 +26,7 @@ a dummy transform -Definition at line 208 of file moeo\-Easy\-EA.h. +Definition at line 233 of file moeo\-Easy\-EA.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoElitistReplacement.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoElitistReplacement.tex index 7b71765f9..a74972b00 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoElitistReplacement.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoElitistReplacement.tex @@ -56,7 +56,7 @@ Elitist replacement strategy that consists in keeping the N best individuals. -Definition at line 26 of file moeo\-Elitist\-Replacement.h. +Definition at line 51 of file moeo\-Elitist\-Replacement.h. \subsection{Constructor \& Destructor Documentation} \index{moeoElitistReplacement@{moeo\-Elitist\-Replacement}!moeoElitistReplacement@{moeoElitistReplacement}} @@ -73,7 +73,7 @@ Full constructor. \end{Desc} -Definition at line 36 of file moeo\-Elitist\-Replacement.h.\index{moeoElitistReplacement@{moeo\-Elitist\-Replacement}!moeoElitistReplacement@{moeoElitistReplacement}} +Definition at line 61 of file moeo\-Elitist\-Replacement.h.\index{moeoElitistReplacement@{moeo\-Elitist\-Replacement}!moeoElitistReplacement@{moeoElitistReplacement}} \index{moeoElitistReplacement@{moeoElitistReplacement}!moeoElitistReplacement@{moeo\-Elitist\-Replacement}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Elitist\-Replacement}$<$ MOEOT $>$::\bf{moeo\-Elitist\-Replacement} (\bf{moeo\-Fitness\-Assignment}$<$ MOEOT $>$ \& {\em \_\-fitness\-Assignment}, \bf{moeo\-Diversity\-Assignment}$<$ MOEOT $>$ \& {\em \_\-diversity\-Assignment})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoElitistReplacement_d7122be0519207c7496852284ed24514} @@ -87,7 +87,7 @@ A moeo\-Fit\-Then\-Div\-Comparator is used as default. \begin{Desc} \end{Desc} -Definition at line 46 of file moeo\-Elitist\-Replacement.h.\index{moeoElitistReplacement@{moeo\-Elitist\-Replacement}!moeoElitistReplacement@{moeoElitistReplacement}} +Definition at line 71 of file moeo\-Elitist\-Replacement.h.\index{moeoElitistReplacement@{moeo\-Elitist\-Replacement}!moeoElitistReplacement@{moeoElitistReplacement}} \index{moeoElitistReplacement@{moeoElitistReplacement}!moeoElitistReplacement@{moeo\-Elitist\-Replacement}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Elitist\-Replacement}$<$ MOEOT $>$::\bf{moeo\-Elitist\-Replacement} (\bf{moeo\-Fitness\-Assignment}$<$ MOEOT $>$ \& {\em \_\-fitness\-Assignment}, \bf{moeo\-Comparator}$<$ MOEOT $>$ \& {\em \_\-comparator})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoElitistReplacement_81b7b8e0cac6cbed36e47688adf1466c} @@ -101,7 +101,7 @@ A dummy diversity is used as default. \begin{Desc} \end{Desc} -Definition at line 56 of file moeo\-Elitist\-Replacement.h.\index{moeoElitistReplacement@{moeo\-Elitist\-Replacement}!moeoElitistReplacement@{moeoElitistReplacement}} +Definition at line 81 of file moeo\-Elitist\-Replacement.h.\index{moeoElitistReplacement@{moeo\-Elitist\-Replacement}!moeoElitistReplacement@{moeoElitistReplacement}} \index{moeoElitistReplacement@{moeoElitistReplacement}!moeoElitistReplacement@{moeo\-Elitist\-Replacement}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Elitist\-Replacement}$<$ MOEOT $>$::\bf{moeo\-Elitist\-Replacement} (\bf{moeo\-Fitness\-Assignment}$<$ MOEOT $>$ \& {\em \_\-fitness\-Assignment})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoElitistReplacement_2ef7c199d779d473a9d35cee21556794} @@ -115,7 +115,7 @@ A moeo\-Fit\-Then\-Div\-Comparator and a dummy diversity are used as default. \b \end{Desc} -Definition at line 66 of file moeo\-Elitist\-Replacement.h. +Definition at line 91 of file moeo\-Elitist\-Replacement.h. \subsection{Member Function Documentation} \index{moeoElitistReplacement@{moeo\-Elitist\-Replacement}!operator()@{operator()}} @@ -132,7 +132,7 @@ Replaces the first population by adding the individuals of the second one, sorti \end{Desc} -Definition at line 76 of file moeo\-Elitist\-Replacement.h. +Definition at line 101 of file moeo\-Elitist\-Replacement.h. References moeo\-Elitist\-Replacement$<$ MOEOT $>$::comparator, moeo\-Elitist\-Replacement$<$ MOEOT $>$::diversity\-Assignment, and moeo\-Elitist\-Replacement$<$ MOEOT $>$::fitness\-Assignment. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoElitistReplacement_1_1Cmp.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoElitistReplacement_1_1Cmp.tex index e3d9c7dec..aeee67c57 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoElitistReplacement_1_1Cmp.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoElitistReplacement_1_1Cmp.tex @@ -28,7 +28,7 @@ this object is used to compare solutions in order to sort the population -Definition at line 105 of file moeo\-Elitist\-Replacement.h. +Definition at line 130 of file moeo\-Elitist\-Replacement.h. \subsection{Constructor \& Destructor Documentation} \index{moeoElitistReplacement::Cmp@{moeo\-Elitist\-Replacement::Cmp}!Cmp@{Cmp}} @@ -45,7 +45,7 @@ Ctor. \end{Desc} -Definition at line 112 of file moeo\-Elitist\-Replacement.h. +Definition at line 137 of file moeo\-Elitist\-Replacement.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEntropyMetric.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEntropyMetric.tex index eaf9016ca..de1aa0972 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEntropyMetric.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEntropyMetric.tex @@ -56,7 +56,7 @@ of the 2002 Congress on Evolutionary Computation, IEEE Press, pp. 1155-1156) -Definition at line 25 of file moeo\-Entropy\-Metric.h. +Definition at line 50 of file moeo\-Entropy\-Metric.h. \subsection{Member Function Documentation} \index{moeoEntropyMetric@{moeo\-Entropy\-Metric}!operator()@{operator()}} @@ -73,7 +73,7 @@ Returns the entropy of the Pareto set '\_\-set1' relatively to the Pareto set '\ \end{Desc} -Definition at line 34 of file moeo\-Entropy\-Metric.h. +Definition at line 59 of file moeo\-Entropy\-Metric.h. References moeo\-Entropy\-Metric$<$ Objective\-Vector $>$::compute\-Union(), moeo\-Entropy\-Metric$<$ Objective\-Vector $>$::how\-Many\-In\-Niche\-Of(), moeo\-Entropy\-Metric$<$ Objective\-Vector $>$::normalize(), moeo\-Entropy\-Metric$<$ Objective\-Vector $>$::prenormalize(), and moeo\-Entropy\-Metric$<$ Objective\-Vector $>$::remove\-Dominated().\index{moeoEntropyMetric@{moeo\-Entropy\-Metric}!removeDominated@{removeDominated}} \index{removeDominated@{removeDominated}!moeoEntropyMetric@{moeo\-Entropy\-Metric}} @@ -89,7 +89,7 @@ Removes the dominated individuals contained in \_\-f. \end{Desc} -Definition at line 85 of file moeo\-Entropy\-Metric.h. +Definition at line 110 of file moeo\-Entropy\-Metric.h. References moeo\-Entropy\-Metric$<$ Objective\-Vector $>$::pareto\-Comparator. @@ -107,7 +107,7 @@ Prenormalization. \end{Desc} -Definition at line 107 of file moeo\-Entropy\-Metric.h. +Definition at line 132 of file moeo\-Entropy\-Metric.h. References moeo\-Entropy\-Metric$<$ Objective\-Vector $>$::vect\_\-max\_\-val, and moeo\-Entropy\-Metric$<$ Objective\-Vector $>$::vect\_\-min\_\-val. @@ -125,7 +125,7 @@ Normalization. \end{Desc} -Definition at line 129 of file moeo\-Entropy\-Metric.h. +Definition at line 154 of file moeo\-Entropy\-Metric.h. References moeo\-Entropy\-Metric$<$ Objective\-Vector $>$::vect\_\-max\_\-val, and moeo\-Entropy\-Metric$<$ Objective\-Vector $>$::vect\_\-min\_\-val. @@ -143,7 +143,7 @@ Computation of the union of \_\-f1 and \_\-f2 in \_\-f. \end{Desc} -Definition at line 142 of file moeo\-Entropy\-Metric.h. +Definition at line 167 of file moeo\-Entropy\-Metric.h. Referenced by moeo\-Entropy\-Metric$<$ Objective\-Vector $>$::operator()(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEnvironmentalReplacement.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEnvironmentalReplacement.tex index 4b64e667d..b1cba5910 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEnvironmentalReplacement.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEnvironmentalReplacement.tex @@ -62,7 +62,7 @@ Environmental replacement strategy that consists in keeping the N best individua -Definition at line 26 of file moeo\-Environmental\-Replacement.h. +Definition at line 51 of file moeo\-Environmental\-Replacement.h. \subsection{Constructor \& Destructor Documentation} \index{moeoEnvironmentalReplacement@{moeo\-Environmental\-Replacement}!moeoEnvironmentalReplacement@{moeoEnvironmentalReplacement}} @@ -79,7 +79,7 @@ Full constructor. \end{Desc} -Definition at line 40 of file moeo\-Environmental\-Replacement.h.\index{moeoEnvironmentalReplacement@{moeo\-Environmental\-Replacement}!moeoEnvironmentalReplacement@{moeoEnvironmentalReplacement}} +Definition at line 65 of file moeo\-Environmental\-Replacement.h.\index{moeoEnvironmentalReplacement@{moeo\-Environmental\-Replacement}!moeoEnvironmentalReplacement@{moeoEnvironmentalReplacement}} \index{moeoEnvironmentalReplacement@{moeoEnvironmentalReplacement}!moeoEnvironmentalReplacement@{moeo\-Environmental\-Replacement}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Environmental\-Replacement}$<$ MOEOT $>$::\bf{moeo\-Environmental\-Replacement} (\bf{moeo\-Fitness\-Assignment}$<$ MOEOT $>$ \& {\em \_\-fitness\-Assignment}, \bf{moeo\-Diversity\-Assignment}$<$ MOEOT $>$ \& {\em \_\-diversity\-Assignment})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoEnvironmentalReplacement_9199a29cf89cd6b01bb9be304f344940} @@ -93,7 +93,7 @@ A moeo\-Fit\-Then\-Div\-Comparator is used as default. \begin{Desc} \end{Desc} -Definition at line 50 of file moeo\-Environmental\-Replacement.h.\index{moeoEnvironmentalReplacement@{moeo\-Environmental\-Replacement}!moeoEnvironmentalReplacement@{moeoEnvironmentalReplacement}} +Definition at line 75 of file moeo\-Environmental\-Replacement.h.\index{moeoEnvironmentalReplacement@{moeo\-Environmental\-Replacement}!moeoEnvironmentalReplacement@{moeoEnvironmentalReplacement}} \index{moeoEnvironmentalReplacement@{moeoEnvironmentalReplacement}!moeoEnvironmentalReplacement@{moeo\-Environmental\-Replacement}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Environmental\-Replacement}$<$ MOEOT $>$::\bf{moeo\-Environmental\-Replacement} (\bf{moeo\-Fitness\-Assignment}$<$ MOEOT $>$ \& {\em \_\-fitness\-Assignment}, \bf{moeo\-Comparator}$<$ MOEOT $>$ \& {\em \_\-comparator})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoEnvironmentalReplacement_7512641b5d58c96a148a75fd4dc95bf7} @@ -107,7 +107,7 @@ A dummy diversity is used as default. \begin{Desc} \end{Desc} -Definition at line 60 of file moeo\-Environmental\-Replacement.h.\index{moeoEnvironmentalReplacement@{moeo\-Environmental\-Replacement}!moeoEnvironmentalReplacement@{moeoEnvironmentalReplacement}} +Definition at line 85 of file moeo\-Environmental\-Replacement.h.\index{moeoEnvironmentalReplacement@{moeo\-Environmental\-Replacement}!moeoEnvironmentalReplacement@{moeoEnvironmentalReplacement}} \index{moeoEnvironmentalReplacement@{moeoEnvironmentalReplacement}!moeoEnvironmentalReplacement@{moeo\-Environmental\-Replacement}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Environmental\-Replacement}$<$ MOEOT $>$::\bf{moeo\-Environmental\-Replacement} (\bf{moeo\-Fitness\-Assignment}$<$ MOEOT $>$ \& {\em \_\-fitness\-Assignment})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoEnvironmentalReplacement_2dfa5d51660039b4f90196e7885ed586} @@ -121,7 +121,7 @@ A moeo\-Fit\-Then\-Div\-Comparator and a dummy diversity are used as default. \b \end{Desc} -Definition at line 70 of file moeo\-Environmental\-Replacement.h. +Definition at line 95 of file moeo\-Environmental\-Replacement.h. \subsection{Member Function Documentation} \index{moeoEnvironmentalReplacement@{moeo\-Environmental\-Replacement}!operator()@{operator()}} @@ -138,7 +138,7 @@ Replaces the first population by adding the individuals of the second one, sorti \end{Desc} -Definition at line 80 of file moeo\-Environmental\-Replacement.h. +Definition at line 105 of file moeo\-Environmental\-Replacement.h. References moeo\-Environmental\-Replacement$<$ MOEOT $>$::comparator, moeo\-Environmental\-Replacement$<$ MOEOT $>$::diversity\-Assignment, and moeo\-Environmental\-Replacement$<$ MOEOT $>$::fitness\-Assignment. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEnvironmentalReplacement_1_1Cmp.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEnvironmentalReplacement_1_1Cmp.tex index 9d597aa51..96631fd40 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEnvironmentalReplacement_1_1Cmp.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEnvironmentalReplacement_1_1Cmp.tex @@ -28,7 +28,7 @@ this object is used to compare solutions in order to sort the population -Definition at line 121 of file moeo\-Environmental\-Replacement.h. +Definition at line 146 of file moeo\-Environmental\-Replacement.h. \subsection{Constructor \& Destructor Documentation} \index{moeoEnvironmentalReplacement::Cmp@{moeo\-Environmental\-Replacement::Cmp}!Cmp@{Cmp}} @@ -45,7 +45,7 @@ Ctor. \end{Desc} -Definition at line 128 of file moeo\-Environmental\-Replacement.h. +Definition at line 153 of file moeo\-Environmental\-Replacement.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEuclideanDistance.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEuclideanDistance.tex index 19ed853ed..9863bab45 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEuclideanDistance.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEuclideanDistance.tex @@ -33,7 +33,7 @@ between 0 and 1). A distance value then lies between 0 and sqrt(n\-Objectives). -Definition at line 24 of file moeo\-Euclidean\-Distance.h. +Definition at line 49 of file moeo\-Euclidean\-Distance.h. \subsection{Member Function Documentation} \index{moeoEuclideanDistance@{moeo\-Euclidean\-Distance}!operator()@{operator()}} @@ -50,7 +50,7 @@ Returns the euclidian distance between \_\-moeo1 and \_\-moeo2 in the objective \end{Desc} -Definition at line 37 of file moeo\-Euclidean\-Distance.h. +Definition at line 62 of file moeo\-Euclidean\-Distance.h. References moeo\-Normalized\-Distance$<$ MOEOT $>$::bounds. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEvalFunc.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEvalFunc.tex index a935b8a71..8613dea33 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEvalFunc.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoEvalFunc.tex @@ -15,7 +15,7 @@ Inheritance diagram for moeo\-Eval\-Func$<$ MOEOT $>$::\begin{figure}[H] -Definition at line 22 of file moeo\-Eval\-Func.h. +Definition at line 47 of file moeo\-Eval\-Func.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoExpBinaryIndicatorBasedFitnessAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoExpBinaryIndicatorBasedFitnessAssignment.tex index bc7b57224..9914f0de9 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoExpBinaryIndicatorBasedFitnessAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoExpBinaryIndicatorBasedFitnessAssignment.tex @@ -62,7 +62,7 @@ Zitzler, S. K\~{A} -Definition at line 29 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. +Definition at line 54 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. \subsection{Constructor \& Destructor Documentation} \index{moeoExpBinaryIndicatorBasedFitnessAssignment@{moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment}!moeoExpBinaryIndicatorBasedFitnessAssignment@{moeoExpBinaryIndicatorBasedFitnessAssignment}} @@ -79,7 +79,7 @@ Ctor. \end{Desc} -Definition at line 42 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. +Definition at line 67 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. \subsection{Member Function Documentation} \index{moeoExpBinaryIndicatorBasedFitnessAssignment@{moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment}!operator()@{operator()}} @@ -98,7 +98,7 @@ Sets the fitness values for every solution contained in the population \_\-pop. Implements \bf{eo\-UF$<$ eo\-Pop$<$ MOEOT $>$ \&, void $>$}. -Definition at line 50 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. +Definition at line 75 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. References moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::compute\-Values(), moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::set\-Fitnesses(), and moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::setup().\index{moeoExpBinaryIndicatorBasedFitnessAssignment@{moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment}!updateByDeleting@{updateByDeleting}} \index{updateByDeleting@{updateByDeleting}!moeoExpBinaryIndicatorBasedFitnessAssignment@{moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment}} @@ -116,7 +116,7 @@ Updates the fitness values of the whole population \_\-pop by taking the deletio Implements \bf{moeo\-Fitness\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoFitnessAssignment_4922629569eddc9be049b3ead1ab0269}. -Definition at line 66 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. +Definition at line 91 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. References moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::kappa, and moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::metric.\index{moeoExpBinaryIndicatorBasedFitnessAssignment@{moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment}!updateByAdding@{updateByAdding}} \index{updateByAdding@{updateByAdding}!moeoExpBinaryIndicatorBasedFitnessAssignment@{moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment}} @@ -134,7 +134,7 @@ Updates the fitness values of the whole population \_\-pop by taking the adding Implements \bf{moeo\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoBinaryIndicatorBasedFitnessAssignment_809b25abb9756c53525e3006e0ae2c70}. -Definition at line 87 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. +Definition at line 112 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. References moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::kappa, and moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::metric.\index{moeoExpBinaryIndicatorBasedFitnessAssignment@{moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment}!setup@{setup}} \index{setup@{setup}!moeoExpBinaryIndicatorBasedFitnessAssignment@{moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment}} @@ -150,7 +150,7 @@ Sets the bounds for every objective using the min and the max value for every ob \end{Desc} -Definition at line 130 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. +Definition at line 155 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. References moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::metric, and moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric$<$ Objective\-Vector, R $>$::setup(). @@ -168,7 +168,7 @@ Compute every indicator value in values (values[i] = I(\_\-v[i], \_\-o)). \end{Desc} -Definition at line 152 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. +Definition at line 177 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. References moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::metric, and moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::values. @@ -186,7 +186,7 @@ Sets the fitness value of the whple population. \end{Desc} -Definition at line 174 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. +Definition at line 199 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. References moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::compute\-Fitness(). @@ -204,7 +204,7 @@ Returns the fitness value of the \_\-idx th individual of the population. \end{Desc} -Definition at line 187 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. +Definition at line 212 of file moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment.h. References moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::kappa, and moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::values. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFastNonDominatedSortingFitnessAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFastNonDominatedSortingFitnessAssignment.tex index 04c3317a1..60c5a63cc 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFastNonDominatedSortingFitnessAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFastNonDominatedSortingFitnessAssignment.tex @@ -66,7 +66,7 @@ Srinivas, K. Deb, \char`\"{}Multiobjective Optimization Using Nondominated Sorti -Definition at line 32 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. +Definition at line 57 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. \subsection{Constructor \& Destructor Documentation} \index{moeoFastNonDominatedSortingFitnessAssignment@{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment}!moeoFastNonDominatedSortingFitnessAssignment@{moeoFastNonDominatedSortingFitnessAssignment}} @@ -83,7 +83,7 @@ Ctor where you can choose your own way to compare objective vectors. \end{Desc} -Definition at line 51 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. +Definition at line 76 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. \subsection{Member Function Documentation} \index{moeoFastNonDominatedSortingFitnessAssignment@{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment}!operator()@{operator()}} @@ -102,7 +102,7 @@ Sets the fitness values for every solution contained in the population \_\-pop. Implements \bf{eo\-UF$<$ eo\-Pop$<$ MOEOT $>$ \&, void $>$}. -Definition at line 59 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. +Definition at line 84 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. References moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment$<$ MOEOT $>$::m\-Objectives(), and moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment$<$ MOEOT $>$::one\-Objective().\index{moeoFastNonDominatedSortingFitnessAssignment@{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment}!updateByDeleting@{updateByDeleting}} \index{updateByDeleting@{updateByDeleting}!moeoFastNonDominatedSortingFitnessAssignment@{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment}} @@ -120,7 +120,7 @@ Updates the fitness values of the whole population \_\-pop by taking the deletio Implements \bf{moeo\-Fitness\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoFitnessAssignment_4922629569eddc9be049b3ead1ab0269}. -Definition at line 101 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. +Definition at line 126 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. References moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment$<$ MOEOT $>$::comparator.\index{moeoFastNonDominatedSortingFitnessAssignment@{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment}!oneObjective@{oneObjective}} \index{oneObjective@{oneObjective}!moeoFastNonDominatedSortingFitnessAssignment@{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment}} @@ -136,7 +136,7 @@ Sets the fitness values for mono-objective problems. \end{Desc} -Definition at line 143 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. +Definition at line 168 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. References moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment$<$ MOEOT $>$::obj\-Comparator. @@ -154,7 +154,7 @@ Sets the fitness values for bi-objective problems with a complexity of O(n log n \end{Desc} -Definition at line 165 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h.\index{moeoFastNonDominatedSortingFitnessAssignment@{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment}!mObjectives@{mObjectives}} +Definition at line 190 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h.\index{moeoFastNonDominatedSortingFitnessAssignment@{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment}!mObjectives@{mObjectives}} \index{mObjectives@{mObjectives}!moeoFastNonDominatedSortingFitnessAssignment@{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ void \bf{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment}$<$ MOEOT $>$::m\-Objectives (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt [inline, private]}}\label{classmoeoFastNonDominatedSortingFitnessAssignment_f28ad92fe565e13b8d38a3beb30e1e29} @@ -168,7 +168,7 @@ Sets the fitness values for problems with more than two objectives with a comple \end{Desc} -Definition at line 175 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. +Definition at line 200 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. References moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment$<$ MOEOT $>$::comparator. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFastNonDominatedSortingFitnessAssignment_1_1ObjectiveComparator.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFastNonDominatedSortingFitnessAssignment_1_1ObjectiveComparator.tex index 1d9464262..6cc844d55 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFastNonDominatedSortingFitnessAssignment_1_1ObjectiveComparator.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFastNonDominatedSortingFitnessAssignment_1_1ObjectiveComparator.tex @@ -29,7 +29,7 @@ Functor allowing to compare two solutions according to their first objective val -Definition at line 121 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. +Definition at line 146 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. \subsection{Member Function Documentation} \index{moeoFastNonDominatedSortingFitnessAssignment::ObjectiveComparator@{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment::Objective\-Comparator}!operator()@{operator()}} @@ -46,7 +46,7 @@ Returns true if \_\-moeo1 $<$ \_\-moeo2 on the first objective, then on the seco \end{Desc} -Definition at line 129 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. +Definition at line 154 of file moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment.h. References moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment$<$ MOEOT $>$::Objective\-Comparator::cmp. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFitnessAssignment.eps b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFitnessAssignment.eps index 29d6978a5..3756f7262 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFitnessAssignment.eps +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFitnessAssignment.eps @@ -5,7 +5,7 @@ %%For: %Magnification: 1.00 %%Orientation: Portrait -%%BoundingBox: 0 0 500 43.3996 +%%BoundingBox: 0 0 500 54.0541 %%Pages: 0 %%BeginSetup %%EndSetup @@ -19,13 +19,13 @@ /marginwidth 10 def /distx 20 def /disty 40 def -/boundaspect 11.5208 def % aspect ratio of the BoundingBox (width/height) +/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 7 def +/cols 6 def /scalefactor 0 def /boxfont /Times-Roman findfont fontheight scalefont def @@ -180,7 +180,6 @@ boxfont setfont (moeoDummyFitnessAssignment< MOEOT >) cw (moeoIndicatorBasedFitnessAssignment< MOEOT >) cw (moeoParetoBasedFitnessAssignment< MOEOT >) cw -(moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >) cw (moeoScalarFitnessAssignment< MOEOT >) cw (moeoBinaryIndicatorBasedFitnessAssignment< MOEOT >) cw (moeoUnaryIndicatorBasedFitnessAssignment< MOEOT >) cw @@ -198,35 +197,34 @@ boundx scalefactor div boundy scalefactor div scale % ----- classes ----- - (moeoFitnessAssignment< MOEOT >) 2.75 3 box - (eoUF< eoPop< MOEOT > &, void >) 2.75 4 box - (eoFunctorBase) 2.75 5 box + (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 - (moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >) 4.5 2 box - (moeoScalarFitnessAssignment< MOEOT >) 5.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 >) 5.5 1 box + (moeoAchievementFitnessAssignment< MOEOT >) 4.5 1 box (moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >) 1.5 0 box % ----- relations ----- solid -0 2.75 3 out +0 2 3 out solid -1 2.75 4 in +1 2 4 in solid -0 2.75 4 out +0 2 4 out solid -1 2.75 5 in +1 2 5 in solid -1 2.75 2.25 out +1 2 2.25 out solid -0 5.5 3 conn +0 4.5 3 conn solid 0 0 2.75 in solid @@ -244,9 +242,7 @@ solid solid 0 4.5 2.75 in solid -0 5.5 2.75 in -solid -1 5.5 1.25 out +1 4.5 1.25 out solid 0 1.5 1.75 in solid @@ -256,6 +252,6 @@ solid solid 0 3.5 1.75 in solid -0 5.5 1.75 in +0 4.5 1.75 in solid 0 1.5 0.75 in diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFitnessAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFitnessAssignment.tex index 788de71b4..667356dc6 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFitnessAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFitnessAssignment.tex @@ -8,7 +8,7 @@ Functor that sets the fitness values of a whole population. Inheritance diagram for moeo\-Fitness\-Assignment$<$ MOEOT $>$::\begin{figure}[H] \begin{center} \leavevmode -\includegraphics[height=1.21519cm]{classmoeoFitnessAssignment} +\includegraphics[height=1.51351cm]{classmoeoFitnessAssignment} \end{center} \end{figure} \subsection*{Public Types} @@ -33,7 +33,7 @@ Functor that sets the fitness values of a whole population. -Definition at line 23 of file moeo\-Fitness\-Assignment.h. +Definition at line 48 of file moeo\-Fitness\-Assignment.h. \subsection{Member Function Documentation} \index{moeoFitnessAssignment@{moeo\-Fitness\-Assignment}!updateByDeleting@{updateByDeleting}} @@ -50,7 +50,7 @@ Updates the fitness values of the whole population \_\-pop by taking the deletio \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}, \bf{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoFastNonDominatedSortingFitnessAssignment_8d16de444f6c7a73c28c9087b652656e}, and \bf{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoReferencePointIndicatorBasedFitnessAssignment_ba47422dd4f82274af2f69c0b5f95d3a}. +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}} @@ -66,7 +66,7 @@ Updates the fitness values of the whole population \_\-pop by taking the deletio \end{Desc} -Definition at line 44 of file moeo\-Fitness\-Assignment.h. +Definition at line 69 of file moeo\-Fitness\-Assignment.h. References moeo\-Fitness\-Assignment$<$ MOEOT $>$::update\-By\-Deleting(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFitnessThenDiversityComparator.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFitnessThenDiversityComparator.tex index 467c9ba75..36ae3ff35 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFitnessThenDiversityComparator.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFitnessThenDiversityComparator.tex @@ -25,7 +25,7 @@ Functor allowing to compare two solutions according to their fitness values, the -Definition at line 22 of file moeo\-Fitness\-Then\-Diversity\-Comparator.h. +Definition at line 47 of file moeo\-Fitness\-Then\-Diversity\-Comparator.h. \subsection{Member Function Documentation} \index{moeoFitnessThenDiversityComparator@{moeo\-Fitness\-Then\-Diversity\-Comparator}!operator()@{operator()}} @@ -42,7 +42,7 @@ Returns true if \_\-moeo1 $<$ \_\-moeo2 according to their fitness values, then \end{Desc} -Definition at line 31 of file moeo\-Fitness\-Then\-Diversity\-Comparator.h. +Definition at line 56 of file moeo\-Fitness\-Then\-Diversity\-Comparator.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFrontByFrontCrowdingDiversityAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFrontByFrontCrowdingDiversityAssignment.tex index 8296d2833..18a280ab3 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFrontByFrontCrowdingDiversityAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFrontByFrontCrowdingDiversityAssignment.tex @@ -40,7 +40,7 @@ Deb, A. Pratap, S. Agarwal, T. Meyarivan, \char`\"{}A Fast and Elitist Multi-Obj -Definition at line 25 of file moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment.h. +Definition at line 50 of file moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment.h. \subsection{Member Function Documentation} \index{moeoFrontByFrontCrowdingDiversityAssignment@{moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment}!updateByDeleting@{updateByDeleting}} @@ -61,7 +61,7 @@ Definition at line 25 of file moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assig Reimplemented from \bf{moeo\-Crowding\-Diversity\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoCrowdingDiversityAssignment_ba1d60c8e59fbe2c12e9eef33863f012}. -Definition at line 40 of file moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment.h.\index{moeoFrontByFrontCrowdingDiversityAssignment@{moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment}!setDistances@{setDistances}} +Definition at line 65 of file moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment.h.\index{moeoFrontByFrontCrowdingDiversityAssignment@{moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment}!setDistances@{setDistances}} \index{setDistances@{setDistances}!moeoFrontByFrontCrowdingDiversityAssignment@{moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ void \bf{moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment}$<$ MOEOT $>$::set\-Distances (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt [inline, private, virtual]}}\label{classmoeoFrontByFrontCrowdingDiversityAssignment_1aa0ec7b94fbbf952636bcc21e1a9d16} @@ -77,7 +77,7 @@ Sets the distance values. Reimplemented from \bf{moeo\-Crowding\-Diversity\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoCrowdingDiversityAssignment_acbe3e03404ecc67dd5e83f00576c255}. -Definition at line 55 of file moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment.h. +Definition at line 80 of file moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment.h. References moeo\-Crowding\-Diversity\-Assignment$<$ MOEOT $>$::inf(), moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment$<$ MOEOT $>$::last\-Index(), and moeo\-Crowding\-Diversity\-Assignment$<$ MOEOT $>$::tiny().\index{moeoFrontByFrontCrowdingDiversityAssignment@{moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment}!lastIndex@{lastIndex}} \index{lastIndex@{lastIndex}!moeoFrontByFrontCrowdingDiversityAssignment@{moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment}} @@ -93,7 +93,7 @@ Returns the index of the last individual having the same fitness value than \_\- \end{Desc} -Definition at line 121 of file moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment.h. +Definition at line 146 of file moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment.h. Referenced by moeo\-Front\-By\-Front\-Crowding\-Diversity\-Assignment$<$ MOEOT $>$::set\-Distances(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFrontByFrontSharingDiversityAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFrontByFrontSharingDiversityAssignment.tex index cb17edb2b..0dc78721c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFrontByFrontSharingDiversityAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoFrontByFrontSharingDiversityAssignment.tex @@ -40,7 +40,7 @@ Sharing assignment scheme on the way it is used in NSGA. -Definition at line 22 of file moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment.h. +Definition at line 47 of file moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment.h. \subsection{Constructor \& Destructor Documentation} \index{moeoFrontByFrontSharingDiversityAssignment@{moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment}!moeoFrontByFrontSharingDiversityAssignment@{moeoFrontByFrontSharingDiversityAssignment}} @@ -57,7 +57,7 @@ Ctor. \end{Desc} -Definition at line 36 of file moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment.h.\index{moeoFrontByFrontSharingDiversityAssignment@{moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment}!moeoFrontByFrontSharingDiversityAssignment@{moeoFrontByFrontSharingDiversityAssignment}} +Definition at line 61 of file moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment.h.\index{moeoFrontByFrontSharingDiversityAssignment@{moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment}!moeoFrontByFrontSharingDiversityAssignment@{moeoFrontByFrontSharingDiversityAssignment}} \index{moeoFrontByFrontSharingDiversityAssignment@{moeoFrontByFrontSharingDiversityAssignment}!moeoFrontByFrontSharingDiversityAssignment@{moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment}$<$ MOEOT $>$::\bf{moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment} (double {\em \_\-niche\-Size} = {\tt 0.5}, double {\em \_\-alpha} = {\tt 2.0})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoFrontByFrontSharingDiversityAssignment_fec74d6b140ff6bb98e80ca13d57b6d7} @@ -71,7 +71,7 @@ Ctor with an euclidean distance (with normalized objective values) in the object \end{Desc} -Definition at line 45 of file moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment.h. +Definition at line 70 of file moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment.h. \subsection{Member Function Documentation} \index{moeoFrontByFrontSharingDiversityAssignment@{moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment}!updateByDeleting@{updateByDeleting}} @@ -92,7 +92,7 @@ Definition at line 45 of file moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assign Reimplemented from \bf{moeo\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoSharingDiversityAssignment_21c8d6e020af23b2be219b7e02248300}. -Definition at line 56 of file moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment.h.\index{moeoFrontByFrontSharingDiversityAssignment@{moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment}!setSimilarities@{setSimilarities}} +Definition at line 81 of file moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment.h.\index{moeoFrontByFrontSharingDiversityAssignment@{moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment}!setSimilarities@{setSimilarities}} \index{setSimilarities@{setSimilarities}!moeoFrontByFrontSharingDiversityAssignment@{moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ void \bf{moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment}$<$ MOEOT $>$::set\-Similarities (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt [inline, private, virtual]}}\label{classmoeoFrontByFrontSharingDiversityAssignment_a0f6c045237aba2857c4a9ec25679e69} @@ -108,7 +108,7 @@ Sets similarities FRONT BY FRONT for every solution contained in the population Reimplemented from \bf{moeo\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoSharingDiversityAssignment_c01f6ac1abba3799f5c4b6c0608dac55}. -Definition at line 74 of file moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment.h. +Definition at line 99 of file moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment.h. References moeo\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$::distance, moeo\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$::niche\-Size, and moeo\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$::sh(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoGDominanceObjectiveVectorComparator.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoGDominanceObjectiveVectorComparator.tex index 0d7c46fe4..e22a78673 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoGDominanceObjectiveVectorComparator.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoGDominanceObjectiveVectorComparator.tex @@ -43,7 +43,7 @@ The concept of g-dominance as been introduced in: J. Molina, L. V. Santana, A. G -Definition at line 25 of file moeo\-GDominance\-Objective\-Vector\-Comparator.h. +Definition at line 50 of file moeo\-GDominance\-Objective\-Vector\-Comparator.h. \subsection{Constructor \& Destructor Documentation} \index{moeoGDominanceObjectiveVectorComparator@{moeo\-GDominance\-Objective\-Vector\-Comparator}!moeoGDominanceObjectiveVectorComparator@{moeoGDominanceObjectiveVectorComparator}} @@ -60,7 +60,7 @@ Ctor. \end{Desc} -Definition at line 33 of file moeo\-GDominance\-Objective\-Vector\-Comparator.h. +Definition at line 58 of file moeo\-GDominance\-Objective\-Vector\-Comparator.h. \subsection{Member Function Documentation} \index{moeoGDominanceObjectiveVectorComparator@{moeo\-GDominance\-Objective\-Vector\-Comparator}!operator()@{operator()}} @@ -77,7 +77,7 @@ Returns true if \_\-objective\-Vector1 is g-dominated by \_\-objective\-Vector2. \end{Desc} -Definition at line 42 of file moeo\-GDominance\-Objective\-Vector\-Comparator.h. +Definition at line 67 of file moeo\-GDominance\-Objective\-Vector\-Comparator.h. References moeo\-GDominance\-Objective\-Vector\-Comparator$<$ Objective\-Vector $>$::flag(), and moeo\-GDominance\-Objective\-Vector\-Comparator$<$ Objective\-Vector $>$::pareto\-Comparator.\index{moeoGDominanceObjectiveVectorComparator@{moeo\-GDominance\-Objective\-Vector\-Comparator}!flag@{flag}} \index{flag@{flag}!moeoGDominanceObjectiveVectorComparator@{moeo\-GDominance\-Objective\-Vector\-Comparator}} @@ -93,7 +93,7 @@ Returns the flag of \_\-objective\-Vector according to the reference point. \end{Desc} -Definition at line 76 of file moeo\-GDominance\-Objective\-Vector\-Comparator.h. +Definition at line 101 of file moeo\-GDominance\-Objective\-Vector\-Comparator.h. References moeo\-GDominance\-Objective\-Vector\-Comparator$<$ Objective\-Vector $>$::ref. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoGenerationalReplacement.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoGenerationalReplacement.tex index 9ebd8d44b..b4f59891b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoGenerationalReplacement.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoGenerationalReplacement.tex @@ -25,7 +25,7 @@ Generational replacement: only the new individuals are preserved. -Definition at line 23 of file moeo\-Generational\-Replacement.h. +Definition at line 48 of file moeo\-Generational\-Replacement.h. \subsection{Member Function Documentation} \index{moeoGenerationalReplacement@{moeo\-Generational\-Replacement}!operator()@{operator()}} @@ -44,7 +44,7 @@ Swaps \_\-parents and \_\-offspring. Reimplemented from \bf{eo\-Generational\-Replacement$<$ MOEOT $>$}. -Definition at line 32 of file moeo\-Generational\-Replacement.h. +Definition at line 57 of file moeo\-Generational\-Replacement.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoHybridLS.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoHybridLS.tex index 3834f08e0..3717b365c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoHybridLS.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoHybridLS.tex @@ -43,7 +43,7 @@ This class allows to apply a multi-objective local search to a number of selecte -Definition at line 28 of file moeo\-Hybrid\-LS.h. +Definition at line 53 of file moeo\-Hybrid\-LS.h. \subsection{Constructor \& Destructor Documentation} \index{moeoHybridLS@{moeo\-Hybrid\-LS}!moeoHybridLS@{moeoHybridLS}} @@ -60,7 +60,7 @@ Ctor. \end{Desc} -Definition at line 39 of file moeo\-Hybrid\-LS.h. +Definition at line 64 of file moeo\-Hybrid\-LS.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoHypervolumeBinaryMetric.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoHypervolumeBinaryMetric.tex index ecc5cb8a0..d5f57d0b3 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoHypervolumeBinaryMetric.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoHypervolumeBinaryMetric.tex @@ -43,7 +43,7 @@ Hypervolume binary metric allowing to compare two objective vectors as proposed -Definition at line 29 of file moeo\-Hypervolume\-Binary\-Metric.h. +Definition at line 54 of file moeo\-Hypervolume\-Binary\-Metric.h. \subsection{Constructor \& Destructor Documentation} \index{moeoHypervolumeBinaryMetric@{moeo\-Hypervolume\-Binary\-Metric}!moeoHypervolumeBinaryMetric@{moeoHypervolumeBinaryMetric}} @@ -60,7 +60,7 @@ Ctor. \end{Desc} -Definition at line 37 of file moeo\-Hypervolume\-Binary\-Metric.h. +Definition at line 62 of file moeo\-Hypervolume\-Binary\-Metric.h. References moeo\-Hypervolume\-Binary\-Metric$<$ Objective\-Vector $>$::rho. @@ -81,7 +81,7 @@ Returns the volume of the space that is dominated by \_\-o2 but not by \_\-o1 wi \end{Desc} -Definition at line 63 of file moeo\-Hypervolume\-Binary\-Metric.h. +Definition at line 88 of file moeo\-Hypervolume\-Binary\-Metric.h. References moeo\-Hypervolume\-Binary\-Metric$<$ Objective\-Vector $>$::hypervolume(), and moeo\-Hypervolume\-Binary\-Metric$<$ Objective\-Vector $>$::pareto\-Comparator.\index{moeoHypervolumeBinaryMetric@{moeo\-Hypervolume\-Binary\-Metric}!hypervolume@{hypervolume}} \index{hypervolume@{hypervolume}!moeoHypervolumeBinaryMetric@{moeo\-Hypervolume\-Binary\-Metric}} @@ -97,7 +97,7 @@ Returns the volume of the space that is dominated by \_\-o2 but not by \_\-o1 wi \end{Desc} -Definition at line 96 of file moeo\-Hypervolume\-Binary\-Metric.h. +Definition at line 121 of file moeo\-Hypervolume\-Binary\-Metric.h. References moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric$<$ Objective\-Vector, double $>$::bounds, and moeo\-Hypervolume\-Binary\-Metric$<$ Objective\-Vector $>$::rho. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBEA.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBEA.tex index 9289ceb87..70c99a070 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBEA.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBEA.tex @@ -76,7 +76,7 @@ Zitzler, S. K\~{A} -Definition at line 38 of file moeo\-IBEA.h. +Definition at line 63 of file moeo\-IBEA.h. \subsection{Constructor \& Destructor Documentation} \index{moeoIBEA@{moeo\-IBEA}!moeoIBEA@{moeoIBEA}} @@ -93,7 +93,7 @@ Simple ctor with a \doxyref{eo\-Gen\-Op}. \end{Desc} -Definition at line 54 of file moeo\-IBEA.h.\index{moeoIBEA@{moeo\-IBEA}!moeoIBEA@{moeoIBEA}} +Definition at line 79 of file moeo\-IBEA.h.\index{moeoIBEA@{moeo\-IBEA}!moeoIBEA@{moeoIBEA}} \index{moeoIBEA@{moeoIBEA}!moeoIBEA@{moeo\-IBEA}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-IBEA}$<$ MOEOT $>$::\bf{moeo\-IBEA} (unsigned int {\em \_\-max\-Gen}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{eo\-Transform}$<$ MOEOT $>$ \& {\em \_\-op}, \bf{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric}$<$ \bf{Objective\-Vector}, double $>$ \& {\em \_\-metric}, const double {\em \_\-kappa} = {\tt 0.05})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoIBEA_cbc97868f6eb817d95127c43231c7540} @@ -107,7 +107,7 @@ Simple ctor with a \doxyref{eo\-Transform}. \end{Desc} -Definition at line 68 of file moeo\-IBEA.h.\index{moeoIBEA@{moeo\-IBEA}!moeoIBEA@{moeoIBEA}} +Definition at line 93 of file moeo\-IBEA.h.\index{moeoIBEA@{moeo\-IBEA}!moeoIBEA@{moeoIBEA}} \index{moeoIBEA@{moeoIBEA}!moeoIBEA@{moeo\-IBEA}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-IBEA}$<$ MOEOT $>$::\bf{moeo\-IBEA} (unsigned int {\em \_\-max\-Gen}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{eo\-Quad\-Op}$<$ MOEOT $>$ \& {\em \_\-crossover}, double {\em \_\-p\-Cross}, \bf{eo\-Mon\-Op}$<$ MOEOT $>$ \& {\em \_\-mutation}, double {\em \_\-p\-Mut}, \bf{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric}$<$ \bf{Objective\-Vector}, double $>$ \& {\em \_\-metric}, const double {\em \_\-kappa} = {\tt 0.05})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoIBEA_b0c051de75326b11a391aaacdb324dac} @@ -121,7 +121,7 @@ Ctor with a crossover, a mutation and their corresponding rates. \end{Desc} -Definition at line 85 of file moeo\-IBEA.h.\index{moeoIBEA@{moeo\-IBEA}!moeoIBEA@{moeoIBEA}} +Definition at line 110 of file moeo\-IBEA.h.\index{moeoIBEA@{moeo\-IBEA}!moeoIBEA@{moeoIBEA}} \index{moeoIBEA@{moeoIBEA}!moeoIBEA@{moeo\-IBEA}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-IBEA}$<$ MOEOT $>$::\bf{moeo\-IBEA} (\bf{eo\-Continue}$<$ MOEOT $>$ \& {\em \_\-continuator}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{eo\-Gen\-Op}$<$ MOEOT $>$ \& {\em \_\-op}, \bf{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric}$<$ \bf{Objective\-Vector}, double $>$ \& {\em \_\-metric}, const double {\em \_\-kappa} = {\tt 0.05})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoIBEA_9b59ebf11f896198264ab5594dbaaefd} @@ -135,7 +135,7 @@ Ctor with a continuator (instead of \_\-max\-Gen) and a \doxyref{eo\-Gen\-Op}. \end{Desc} -Definition at line 100 of file moeo\-IBEA.h.\index{moeoIBEA@{moeo\-IBEA}!moeoIBEA@{moeoIBEA}} +Definition at line 125 of file moeo\-IBEA.h.\index{moeoIBEA@{moeo\-IBEA}!moeoIBEA@{moeoIBEA}} \index{moeoIBEA@{moeoIBEA}!moeoIBEA@{moeo\-IBEA}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-IBEA}$<$ MOEOT $>$::\bf{moeo\-IBEA} (\bf{eo\-Continue}$<$ MOEOT $>$ \& {\em \_\-continuator}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{eo\-Transform}$<$ MOEOT $>$ \& {\em \_\-op}, \bf{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric}$<$ \bf{Objective\-Vector}, double $>$ \& {\em \_\-metric}, const double {\em \_\-kappa} = {\tt 0.05})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoIBEA_654c67d0bd74ea798580ec4c81435f92} @@ -149,7 +149,7 @@ Ctor with a continuator (instead of \_\-max\-Gen) and a \doxyref{eo\-Transform}. \end{Desc} -Definition at line 114 of file moeo\-IBEA.h. +Definition at line 139 of file moeo\-IBEA.h. \subsection{Member Function Documentation} \index{moeoIBEA@{moeo\-IBEA}!operator()@{operator()}} @@ -166,7 +166,7 @@ Apply a few generation of evolution to the population \_\-pop until the stopping \end{Desc} -Definition at line 124 of file moeo\-IBEA.h. +Definition at line 149 of file moeo\-IBEA.h. References moeo\-IBEA$<$ MOEOT $>$::breed, moeo\-IBEA$<$ MOEOT $>$::continuator, moeo\-IBEA$<$ MOEOT $>$::dummy\-Diversity\-Assignment, moeo\-IBEA$<$ MOEOT $>$::fitness\-Assignment, moeo\-IBEA$<$ MOEOT $>$::pop\-Eval, and moeo\-IBEA$<$ MOEOT $>$::replace. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBMOLS.eps b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBMOLS.eps deleted file mode 100644 index e4e6c44f5..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBMOLS.eps +++ /dev/null @@ -1,215 +0,0 @@ -%!PS-Adobe-2.0 EPSF-2.0 -%%Title: ClassName -%%Creator: Doxygen -%%CreationDate: Time -%%For: -%Magnification: 1.00 -%%Orientation: Portrait -%%BoundingBox: 0 0 500 101.266 -%%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 4.9375 def % aspect ratio of the BoundingBox (width/height) -/boundx 500 def -/boundy boundx boundaspect div def -/xspacing 0 def -/yspacing 0 def -/rows 4 def -/cols 2 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 -(moeoIBMOLS< MOEOT, Move >) cw -(moeoLS< MOEOT, eoPop< MOEOT > & >) cw -(moeoAlgo) cw -(eoBF< eoPop< MOEOT > &, moeoArchive< MOEOT > &, void >) cw -(eoFunctorBase) 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 ----- - - (moeoIBMOLS< MOEOT, Move >) 0.5 0 box - (moeoLS< MOEOT, eoPop< MOEOT > & >) 0.5 1 box - (moeoAlgo) 0 2 box - (eoBF< eoPop< MOEOT > &, moeoArchive< MOEOT > &, void >) 1 2 box - (eoFunctorBase) 1 3 box - -% ----- relations ----- - -solid -0 0.5 0 out -solid -1 0.5 1 in -solid -0 0.5 1 out -solid -0 1 2 conn -solid -1 0 2 in -solid -1 1 2 in -solid -0 1 2 out -solid -1 1 3 in diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBMOLS.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBMOLS.tex deleted file mode 100644 index 3ba2aec88..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBMOLS.tex +++ /dev/null @@ -1,147 +0,0 @@ -\section{moeo\-IBMOLS$<$ MOEOT, Move $>$ Class Template Reference} -\label{classmoeoIBMOLS}\index{moeoIBMOLS@{moeoIBMOLS}} -Indicator-Based Multi-Objective Local Search (IBMOLS) as described in Basseur M., Burke K. - - -{\tt \#include $<$moeo\-IBMOLS.h$>$} - -Inheritance diagram for moeo\-IBMOLS$<$ MOEOT, Move $>$::\begin{figure}[H] -\begin{center} -\leavevmode -\includegraphics[height=2.83544cm]{classmoeoIBMOLS} -\end{center} -\end{figure} -\subsection*{Public Types} -\begin{CompactItemize} -\item -typedef MOEOT::Objective\-Vector \bf{Objective\-Vector}\label{classmoeoIBMOLS_d3433001dcc9a6e2a967aa5d64163935} - -\begin{CompactList}\small\item\em The type of objective vector. \item\end{CompactList}\end{CompactItemize} -\subsection*{Public Member Functions} -\begin{CompactItemize} -\item -\bf{moeo\-IBMOLS} (mo\-Move\-Init$<$ Move $>$ \&\_\-move\-Init, mo\-Next\-Move$<$ Move $>$ \&\_\-next\-Move, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \&\_\-eval, \bf{moeo\-Move\-Incr\-Eval}$<$ Move $>$ \&\_\-move\-Incr\-Eval, \bf{moeo\-Binary\-Indicator\-Based\-Fitness\-Assignment}$<$ MOEOT $>$ \&\_\-fitness\-Assignment, \bf{eo\-Continue}$<$ MOEOT $>$ \&\_\-continuator) -\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item -void \bf{operator()} (\bf{eo\-Pop}$<$ MOEOT $>$ \&\_\-pop, \bf{moeo\-Archive}$<$ MOEOT $>$ \&\_\-arch) -\begin{CompactList}\small\item\em Apply the local search until a local archive does not change or another stopping criteria is met and update the archive \_\-arch with new non-dominated solutions. \item\end{CompactList}\end{CompactItemize} -\subsection*{Private Member Functions} -\begin{CompactItemize} -\item -void \bf{one\-Step} (\bf{eo\-Pop}$<$ MOEOT $>$ \&\_\-pop) -\begin{CompactList}\small\item\em Apply one step of the local search to the population \_\-pop. \item\end{CompactList}\item -void \bf{new\_\-one\-Step} (\bf{eo\-Pop}$<$ MOEOT $>$ \&\_\-pop) -\begin{CompactList}\small\item\em Apply one step of the local search to the population \_\-pop. \item\end{CompactList}\end{CompactItemize} -\subsection*{Private Attributes} -\begin{CompactItemize} -\item -mo\-Move\-Init$<$ Move $>$ \& \bf{move\-Init}\label{classmoeoIBMOLS_b4b4908b893edd52d6fa24085d2a89e5} - -\begin{CompactList}\small\item\em the move initializer \item\end{CompactList}\item -mo\-Next\-Move$<$ Move $>$ \& \bf{next\-Move}\label{classmoeoIBMOLS_8b8ebbd6eb6c82caa796160b4be2a86b} - -\begin{CompactList}\small\item\em the neighborhood explorer \item\end{CompactList}\item -\bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& \bf{eval}\label{classmoeoIBMOLS_e9acda4b2f61f8960109a8c6fd52551e} - -\begin{CompactList}\small\item\em the full evaluation \item\end{CompactList}\item -\bf{moeo\-Move\-Incr\-Eval}$<$ Move $>$ \& \bf{move\-Incr\-Eval}\label{classmoeoIBMOLS_6c38636061bd03c4be809277e2dc257a} - -\begin{CompactList}\small\item\em the incremental evaluation \item\end{CompactList}\item -\bf{moeo\-Binary\-Indicator\-Based\-Fitness\-Assignment}$<$ MOEOT $>$ \& \bf{fitness\-Assignment}\label{classmoeoIBMOLS_0c858da33922736b74d9875766cec9d7} - -\begin{CompactList}\small\item\em the fitness assignment strategy \item\end{CompactList}\item -\bf{eo\-Continue}$<$ MOEOT $>$ \& \bf{continuator}\label{classmoeoIBMOLS_c15985c0bb5d9ba835f35d99d7c42b14} - -\begin{CompactList}\small\item\em the stopping criteria \item\end{CompactList}\end{CompactItemize} -\subsection*{Classes} -\begin{CompactItemize} -\item -class \bf{One\-Objective\-Comparator} -\end{CompactItemize} - - -\subsection{Detailed Description} -\subsubsection*{template$<$class MOEOT, class Move$>$ class moeo\-IBMOLS$<$ MOEOT, Move $>$} - -Indicator-Based Multi-Objective Local Search (IBMOLS) as described in Basseur M., Burke K. - -: \char`\"{}Indicator-Based Multi-Objective Local Search\char`\"{} (2007). - - - -Definition at line 33 of file moeo\-IBMOLS.h. - -\subsection{Constructor \& Destructor Documentation} -\index{moeoIBMOLS@{moeo\-IBMOLS}!moeoIBMOLS@{moeoIBMOLS}} -\index{moeoIBMOLS@{moeoIBMOLS}!moeoIBMOLS@{moeo\-IBMOLS}} -\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT, class Move$>$ \bf{moeo\-IBMOLS}$<$ MOEOT, Move $>$::\bf{moeo\-IBMOLS} (mo\-Move\-Init$<$ Move $>$ \& {\em \_\-move\-Init}, mo\-Next\-Move$<$ Move $>$ \& {\em \_\-next\-Move}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{moeo\-Move\-Incr\-Eval}$<$ Move $>$ \& {\em \_\-move\-Incr\-Eval}, \bf{moeo\-Binary\-Indicator\-Based\-Fitness\-Assignment}$<$ MOEOT $>$ \& {\em \_\-fitness\-Assignment}, \bf{eo\-Continue}$<$ MOEOT $>$ \& {\em \_\-continuator})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoIBMOLS_6d6a39ad3d5e4c298d450d801098e274} - - -Ctor. - -\begin{Desc} -\item[Parameters:] -\begin{description} -\item[{\em \_\-move\-Init}]the move initializer \item[{\em \_\-next\-Move}]the neighborhood explorer \item[{\em \_\-eval}]the full evaluation \item[{\em \_\-move\-Incr\-Eval}]the incremental evaluation \item[{\em \_\-fitness\-Assignment}]the fitness assignment strategy \item[{\em \_\-continuator}]the stopping criteria \end{description} -\end{Desc} - - -Definition at line 50 of file moeo\-IBMOLS.h. - -\subsection{Member Function Documentation} -\index{moeoIBMOLS@{moeo\-IBMOLS}!operator()@{operator()}} -\index{operator()@{operator()}!moeoIBMOLS@{moeo\-IBMOLS}} -\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT, class Move$>$ void \bf{moeo\-IBMOLS}$<$ MOEOT, Move $>$::operator() (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop}, \bf{moeo\-Archive}$<$ MOEOT $>$ \& {\em \_\-arch})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classmoeoIBMOLS_fd788bbc4f956dec932dba2a4d4479b6} - - -Apply the local search until a local archive does not change or another stopping criteria is met and update the archive \_\-arch with new non-dominated solutions. - -\begin{Desc} -\item[Parameters:] -\begin{description} -\item[{\em \_\-pop}]the initial population \item[{\em \_\-arch}]the (updated) archive \end{description} -\end{Desc} - - -Implements \bf{eo\-BF$<$ eo\-Pop$<$ MOEOT $>$ \&, moeo\-Archive$<$ MOEOT $>$ \&, void $>$}. - -Definition at line 73 of file moeo\-IBMOLS.h. - -References moeo\-IBMOLS$<$ MOEOT, Move $>$::continuator, moeo\-Archive$<$ MOEOT $>$::equals(), moeo\-IBMOLS$<$ MOEOT, Move $>$::fitness\-Assignment, moeo\-IBMOLS$<$ MOEOT, Move $>$::one\-Step(), and moeo\-Archive$<$ MOEOT $>$::update().\index{moeoIBMOLS@{moeo\-IBMOLS}!oneStep@{oneStep}} -\index{oneStep@{oneStep}!moeoIBMOLS@{moeo\-IBMOLS}} -\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT, class Move$>$ void \bf{moeo\-IBMOLS}$<$ MOEOT, Move $>$::one\-Step (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt [inline, private]}}\label{classmoeoIBMOLS_fce770398602972b5d67c52638687d43} - - -Apply one step of the local search to the population \_\-pop. - -\begin{Desc} -\item[Parameters:] -\begin{description} -\item[{\em \_\-pop}]the population \end{description} -\end{Desc} - - -Definition at line 120 of file moeo\-IBMOLS.h. - -References moeo\-IBMOLS$<$ MOEOT, Move $>$::continuator, moeo\-IBMOLS$<$ MOEOT, Move $>$::fitness\-Assignment, moeo\-IBMOLS$<$ MOEOT, Move $>$::move\-Incr\-Eval, moeo\-IBMOLS$<$ MOEOT, Move $>$::move\-Init, and moeo\-IBMOLS$<$ MOEOT, Move $>$::next\-Move. - -Referenced by moeo\-IBMOLS$<$ MOEOT, Move $>$::operator()().\index{moeoIBMOLS@{moeo\-IBMOLS}!new_oneStep@{new\_\-oneStep}} -\index{new_oneStep@{new\_\-oneStep}!moeoIBMOLS@{moeo\-IBMOLS}} -\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT, class Move$>$ void \bf{moeo\-IBMOLS}$<$ MOEOT, Move $>$::new\_\-one\-Step (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt [inline, private]}}\label{classmoeoIBMOLS_9d811733d8e7508a7c48615c8ff0f990} - - -Apply one step of the local search to the population \_\-pop. - -\begin{Desc} -\item[Parameters:] -\begin{description} -\item[{\em \_\-pop}]the population \end{description} -\end{Desc} - - -Definition at line 304 of file moeo\-IBMOLS.h. - -References moeo\-IBMOLS$<$ MOEOT, Move $>$::continuator, moeo\-IBMOLS$<$ MOEOT, Move $>$::fitness\-Assignment, moeo\-IBMOLS$<$ MOEOT, Move $>$::move\-Incr\-Eval, moeo\-IBMOLS$<$ MOEOT, Move $>$::move\-Init, and moeo\-IBMOLS$<$ MOEOT, Move $>$::next\-Move. - -The documentation for this class was generated from the following file:\begin{CompactItemize} -\item -moeo\-IBMOLS.h\end{CompactItemize} diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBMOLS_1_1OneObjectiveComparator.eps b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBMOLS_1_1OneObjectiveComparator.eps deleted file mode 100644 index ffa490e53..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBMOLS_1_1OneObjectiveComparator.eps +++ /dev/null @@ -1,209 +0,0 @@ -%!PS-Adobe-2.0 EPSF-2.0 -%%Title: ClassName -%%Creator: Doxygen -%%CreationDate: Time -%%For: -%Magnification: 1.00 -%%Orientation: Portrait -%%BoundingBox: 0 0 500 223.464 -%%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 2.2375 def % aspect ratio of the BoundingBox (width/height) -/boundx 500 def -/boundy boundx boundaspect div def -/xspacing 0 def -/yspacing 0 def -/rows 4 def -/cols 1 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 -(moeoIBMOLS< MOEOT, Move >::OneObjectiveComparator) cw -(moeoComparator< MOEOT >) cw -(eoBF< A1, A2, R >) cw -(eoFunctorBase) 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 ----- - - (moeoIBMOLS< MOEOT, Move >::OneObjectiveComparator) 0 0 box - (moeoComparator< MOEOT >) 0 1 box - (eoBF< A1, A2, R >) 0 2 box - (eoFunctorBase) 0 3 box - -% ----- relations ----- - -solid -0 0 0 out -solid -1 0 1 in -solid -0 0 1 out -solid -1 0 2 in -solid -0 0 2 out -solid -1 0 3 in diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBMOLS_1_1OneObjectiveComparator.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBMOLS_1_1OneObjectiveComparator.tex deleted file mode 100644 index 08cd609bb..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIBMOLS_1_1OneObjectiveComparator.tex +++ /dev/null @@ -1,37 +0,0 @@ -\section{moeo\-IBMOLS$<$ MOEOT, Move $>$::One\-Objective\-Comparator Class Reference} -\label{classmoeoIBMOLS_1_1OneObjectiveComparator}\index{moeoIBMOLS::OneObjectiveComparator@{moeoIBMOLS::OneObjectiveComparator}} -Inheritance diagram for moeo\-IBMOLS$<$ MOEOT, Move $>$::One\-Objective\-Comparator::\begin{figure}[H] -\begin{center} -\leavevmode -\includegraphics[height=4cm]{classmoeoIBMOLS_1_1OneObjectiveComparator} -\end{center} -\end{figure} -\subsection*{Public Member Functions} -\begin{CompactItemize} -\item -\bf{One\-Objective\-Comparator} (unsigned int \_\-obj)\label{classmoeoIBMOLS_1_1OneObjectiveComparator_09ee419d143aa29bb05d48c358655bb1} - -\item -const bool \bf{operator()} (const MOEOT \&\_\-moeo1, const MOEOT \&\_\-moeo2)\label{classmoeoIBMOLS_1_1OneObjectiveComparator_44685d0ab08fede366bb404fe7f36302} - -\end{CompactItemize} -\subsection*{Private Attributes} -\begin{CompactItemize} -\item -unsigned int \bf{obj}\label{classmoeoIBMOLS_1_1OneObjectiveComparator_724ca0379e42fdffe4ec0d788cd52f43} - -\end{CompactItemize} - - -\subsection{Detailed Description} -\subsubsection*{template$<$class MOEOT, class Move$>$ class moeo\-IBMOLS$<$ MOEOT, Move $>$::One\-Objective\-Comparator} - - - - - -Definition at line 462 of file moeo\-IBMOLS.h. - -The documentation for this class was generated from the following file:\begin{CompactItemize} -\item -moeo\-IBMOLS.h\end{CompactItemize} diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIndicatorBasedFitnessAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIndicatorBasedFitnessAssignment.tex index 1946f7512..92e072a45 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIndicatorBasedFitnessAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIndicatorBasedFitnessAssignment.tex @@ -20,7 +20,7 @@ Inheritance diagram for moeo\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$ -Definition at line 22 of file moeo\-Indicator\-Based\-Fitness\-Assignment.h. +Definition at line 47 of file moeo\-Indicator\-Based\-Fitness\-Assignment.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIteratedIBMOLS.eps b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIteratedIBMOLS.eps deleted file mode 100644 index 9957b08e2..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIteratedIBMOLS.eps +++ /dev/null @@ -1,215 +0,0 @@ -%!PS-Adobe-2.0 EPSF-2.0 -%%Title: ClassName -%%Creator: Doxygen -%%CreationDate: Time -%%For: -%Magnification: 1.00 -%%Orientation: Portrait -%%BoundingBox: 0 0 500 101.266 -%%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 4.9375 def % aspect ratio of the BoundingBox (width/height) -/boundx 500 def -/boundy boundx boundaspect div def -/xspacing 0 def -/yspacing 0 def -/rows 4 def -/cols 2 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 -(moeoIteratedIBMOLS< MOEOT, Move >) cw -(moeoLS< MOEOT, eoPop< MOEOT > & >) cw -(moeoAlgo) cw -(eoBF< eoPop< MOEOT > &, moeoArchive< MOEOT > &, void >) cw -(eoFunctorBase) 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 ----- - - (moeoIteratedIBMOLS< MOEOT, Move >) 0.5 0 box - (moeoLS< MOEOT, eoPop< MOEOT > & >) 0.5 1 box - (moeoAlgo) 0 2 box - (eoBF< eoPop< MOEOT > &, moeoArchive< MOEOT > &, void >) 1 2 box - (eoFunctorBase) 1 3 box - -% ----- relations ----- - -solid -0 0.5 0 out -solid -1 0.5 1 in -solid -0 0.5 1 out -solid -0 1 2 conn -solid -1 0 2 in -solid -1 1 2 in -solid -0 1 2 out -solid -1 1 3 in diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIteratedIBMOLS.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIteratedIBMOLS.tex deleted file mode 100644 index b0e826ed2..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoIteratedIBMOLS.tex +++ /dev/null @@ -1,124 +0,0 @@ -\section{moeo\-Iterated\-IBMOLS$<$ MOEOT, Move $>$ Class Template Reference} -\label{classmoeoIteratedIBMOLS}\index{moeoIteratedIBMOLS@{moeoIteratedIBMOLS}} -Iterated version of IBMOLS as described in Basseur M., Burke K. - - -{\tt \#include $<$moeo\-Iterated\-IBMOLS.h$>$} - -Inheritance diagram for moeo\-Iterated\-IBMOLS$<$ MOEOT, Move $>$::\begin{figure}[H] -\begin{center} -\leavevmode -\includegraphics[height=2.83544cm]{classmoeoIteratedIBMOLS} -\end{center} -\end{figure} -\subsection*{Public Types} -\begin{CompactItemize} -\item -typedef MOEOT::Objective\-Vector \bf{Objective\-Vector}\label{classmoeoIteratedIBMOLS_bc0f8dff81be56b23376995aace92a01} - -\begin{CompactList}\small\item\em The type of objective vector. \item\end{CompactList}\end{CompactItemize} -\subsection*{Public Member Functions} -\begin{CompactItemize} -\item -\bf{moeo\-Iterated\-IBMOLS} (mo\-Move\-Init$<$ Move $>$ \&\_\-move\-Init, mo\-Next\-Move$<$ Move $>$ \&\_\-next\-Move, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \&\_\-eval, \bf{moeo\-Move\-Incr\-Eval}$<$ Move $>$ \&\_\-move\-Incr\-Eval, \bf{moeo\-Binary\-Indicator\-Based\-Fitness\-Assignment}$<$ MOEOT $>$ \&\_\-fitness\-Assignment, \bf{eo\-Continue}$<$ MOEOT $>$ \&\_\-continuator, \bf{eo\-Mon\-Op}$<$ MOEOT $>$ \&\_\-mon\-Op, \bf{eo\-Mon\-Op}$<$ MOEOT $>$ \&\_\-random\-Mon\-Op, unsigned int \_\-n\-Noise\-Iterations=1) -\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item -void \bf{operator()} (\bf{eo\-Pop}$<$ MOEOT $>$ \&\_\-pop, \bf{moeo\-Archive}$<$ MOEOT $>$ \&\_\-arch) -\begin{CompactList}\small\item\em Apply the local search iteratively until the stopping criteria is met. \item\end{CompactList}\end{CompactItemize} -\subsection*{Private Member Functions} -\begin{CompactItemize} -\item -void \bf{generate\-New\-Solutions} (\bf{eo\-Pop}$<$ MOEOT $>$ \&\_\-pop, const \bf{moeo\-Archive}$<$ MOEOT $>$ \&\_\-arch) -\begin{CompactList}\small\item\em Creates new population randomly initialized and/or initialized from the archive \_\-arch. \item\end{CompactList}\end{CompactItemize} -\subsection*{Private Attributes} -\begin{CompactItemize} -\item -\bf{moeo\-IBMOLS}$<$ MOEOT, Move $>$ \bf{ibmols}\label{classmoeoIteratedIBMOLS_6b1351f1faa391a1f095d1f9d4dba915} - -\begin{CompactList}\small\item\em the local search to iterate \item\end{CompactList}\item -\bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& \bf{eval}\label{classmoeoIteratedIBMOLS_7abdd0c1433ec4671522c8d5edc9fe61} - -\begin{CompactList}\small\item\em the full evaluation \item\end{CompactList}\item -\bf{eo\-Continue}$<$ MOEOT $>$ \& \bf{continuator}\label{classmoeoIteratedIBMOLS_964e5df65c7aa33dd84eed3180d5e0a3} - -\begin{CompactList}\small\item\em the stopping criteria \item\end{CompactList}\item -\bf{eo\-Mon\-Op}$<$ MOEOT $>$ \& \bf{mon\-Op}\label{classmoeoIteratedIBMOLS_77851daa2f2230000c0012beef3b8558} - -\begin{CompactList}\small\item\em the monary operator \item\end{CompactList}\item -\bf{eo\-Mon\-Op}$<$ MOEOT $>$ \& \bf{random\-Mon\-Op}\label{classmoeoIteratedIBMOLS_89df3bfa7069c06c7e7cf4b30ccc5535} - -\begin{CompactList}\small\item\em the random monary operator (or random initializer) \item\end{CompactList}\item -unsigned int \bf{n\-Noise\-Iterations}\label{classmoeoIteratedIBMOLS_a50f25daf2847fb9d299ef65baf3bda7} - -\begin{CompactList}\small\item\em the number of iterations to apply the random noise \item\end{CompactList}\end{CompactItemize} - - -\subsection{Detailed Description} -\subsubsection*{template$<$class MOEOT, class Move$>$ class moeo\-Iterated\-IBMOLS$<$ MOEOT, Move $>$} - -Iterated version of IBMOLS as described in Basseur M., Burke K. - -: \char`\"{}Indicator-Based Multi-Objective Local Search\char`\"{} (2007). - - - -Definition at line 41 of file moeo\-Iterated\-IBMOLS.h. - -\subsection{Constructor \& Destructor Documentation} -\index{moeoIteratedIBMOLS@{moeo\-Iterated\-IBMOLS}!moeoIteratedIBMOLS@{moeoIteratedIBMOLS}} -\index{moeoIteratedIBMOLS@{moeoIteratedIBMOLS}!moeoIteratedIBMOLS@{moeo\-Iterated\-IBMOLS}} -\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT, class Move$>$ \bf{moeo\-Iterated\-IBMOLS}$<$ MOEOT, Move $>$::\bf{moeo\-Iterated\-IBMOLS} (mo\-Move\-Init$<$ Move $>$ \& {\em \_\-move\-Init}, mo\-Next\-Move$<$ Move $>$ \& {\em \_\-next\-Move}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{moeo\-Move\-Incr\-Eval}$<$ Move $>$ \& {\em \_\-move\-Incr\-Eval}, \bf{moeo\-Binary\-Indicator\-Based\-Fitness\-Assignment}$<$ MOEOT $>$ \& {\em \_\-fitness\-Assignment}, \bf{eo\-Continue}$<$ MOEOT $>$ \& {\em \_\-continuator}, \bf{eo\-Mon\-Op}$<$ MOEOT $>$ \& {\em \_\-mon\-Op}, \bf{eo\-Mon\-Op}$<$ MOEOT $>$ \& {\em \_\-random\-Mon\-Op}, unsigned int {\em \_\-n\-Noise\-Iterations} = {\tt 1})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoIteratedIBMOLS_67352bb5d797f20e767a4f0fa6d80f93} - - -Ctor. - -\begin{Desc} -\item[Parameters:] -\begin{description} -\item[{\em \_\-move\-Init}]the move initializer \item[{\em \_\-next\-Move}]the neighborhood explorer \item[{\em \_\-eval}]the full evaluation \item[{\em \_\-move\-Incr\-Eval}]the incremental evaluation \item[{\em \_\-fitness\-Assignment}]the fitness assignment strategy \item[{\em \_\-continuator}]the stopping criteria \item[{\em \_\-mon\-Op}]the monary operator \item[{\em \_\-random\-Mon\-Op}]the random monary operator (or random initializer) \item[{\em \_\-n\-Noise\-Iterations}]the number of iterations to apply the random noise \end{description} -\end{Desc} - - -Definition at line 61 of file moeo\-Iterated\-IBMOLS.h. - -\subsection{Member Function Documentation} -\index{moeoIteratedIBMOLS@{moeo\-Iterated\-IBMOLS}!operator()@{operator()}} -\index{operator()@{operator()}!moeoIteratedIBMOLS@{moeo\-Iterated\-IBMOLS}} -\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT, class Move$>$ void \bf{moeo\-Iterated\-IBMOLS}$<$ MOEOT, Move $>$::operator() (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop}, \bf{moeo\-Archive}$<$ MOEOT $>$ \& {\em \_\-arch})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classmoeoIteratedIBMOLS_52d4aa19a93c69ed0c2246c62821e76e} - - -Apply the local search iteratively until the stopping criteria is met. - -\begin{Desc} -\item[Parameters:] -\begin{description} -\item[{\em \_\-pop}]the initial population \item[{\em \_\-arch}]the (updated) archive \end{description} -\end{Desc} - - -Implements \bf{eo\-BF$<$ eo\-Pop$<$ MOEOT $>$ \&, moeo\-Archive$<$ MOEOT $>$ \&, void $>$}. - -Definition at line 86 of file moeo\-Iterated\-IBMOLS.h. - -References moeo\-Iterated\-IBMOLS$<$ MOEOT, Move $>$::continuator, moeo\-Iterated\-IBMOLS$<$ MOEOT, Move $>$::generate\-New\-Solutions(), moeo\-Iterated\-IBMOLS$<$ MOEOT, Move $>$::ibmols, and moeo\-Archive$<$ MOEOT $>$::update().\index{moeoIteratedIBMOLS@{moeo\-Iterated\-IBMOLS}!generateNewSolutions@{generateNewSolutions}} -\index{generateNewSolutions@{generateNewSolutions}!moeoIteratedIBMOLS@{moeo\-Iterated\-IBMOLS}} -\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT, class Move$>$ void \bf{moeo\-Iterated\-IBMOLS}$<$ MOEOT, Move $>$::generate\-New\-Solutions (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop}, const \bf{moeo\-Archive}$<$ MOEOT $>$ \& {\em \_\-arch})\hspace{0.3cm}{\tt [inline, private]}}\label{classmoeoIteratedIBMOLS_2826cf283f6670b3c46da5ac6b6def18} - - -Creates new population randomly initialized and/or initialized from the archive \_\-arch. - -\begin{Desc} -\item[Parameters:] -\begin{description} -\item[{\em \_\-pop}]the output population \item[{\em \_\-arch}]the archive \end{description} -\end{Desc} - - -Definition at line 121 of file moeo\-Iterated\-IBMOLS.h. - -References moeo\-Iterated\-IBMOLS$<$ MOEOT, Move $>$::eval, eo\-Pop$<$ EOT $>$::invalidate(), moeo\-Iterated\-IBMOLS$<$ MOEOT, Move $>$::mon\-Op, moeo\-Iterated\-IBMOLS$<$ MOEOT, Move $>$::n\-Noise\-Iterations, and moeo\-Iterated\-IBMOLS$<$ MOEOT, Move $>$::random\-Mon\-Op. - -Referenced by moeo\-Iterated\-IBMOLS$<$ MOEOT, Move $>$::operator()(). - -The documentation for this class was generated from the following file:\begin{CompactItemize} -\item -moeo\-Iterated\-IBMOLS.h\end{CompactItemize} diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoLS.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoLS.tex index a768f0a79..f1eec4c8c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoLS.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoLS.tex @@ -22,7 +22,7 @@ Starting from a Type (i.e.: an individual, a pop, an archive...), it produces a -Definition at line 25 of file moeo\-LS.h. +Definition at line 50 of file moeo\-LS.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoManhattanDistance.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoManhattanDistance.tex index b53cc6973..2ddedaa67 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoManhattanDistance.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoManhattanDistance.tex @@ -33,7 +33,7 @@ between 0 and 1). A distance value then lies between 0 and n\-Objectives. -Definition at line 24 of file moeo\-Manhattan\-Distance.h. +Definition at line 49 of file moeo\-Manhattan\-Distance.h. \subsection{Member Function Documentation} \index{moeoManhattanDistance@{moeo\-Manhattan\-Distance}!operator()@{operator()}} @@ -50,7 +50,7 @@ Returns the Manhattan distance between \_\-moeo1 and \_\-moeo2 in the objective \end{Desc} -Definition at line 37 of file moeo\-Manhattan\-Distance.h. +Definition at line 62 of file moeo\-Manhattan\-Distance.h. References moeo\-Normalized\-Distance$<$ MOEOT $>$::bounds. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoMetric.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoMetric.tex index a181e5345..3d853405a 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoMetric.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoMetric.tex @@ -18,7 +18,7 @@ Base class for performance metrics (also known as quality indicators). -Definition at line 22 of file moeo\-Metric.h. +Definition at line 47 of file moeo\-Metric.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoMoveIncrEval.eps b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoMoveIncrEval.eps deleted file mode 100644 index 769d2fb57..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoMoveIncrEval.eps +++ /dev/null @@ -1,203 +0,0 @@ -%!PS-Adobe-2.0 EPSF-2.0 -%%Title: ClassName -%%Creator: Doxygen -%%CreationDate: Time -%%For: -%Magnification: 1.00 -%%Orientation: Portrait -%%BoundingBox: 0 0 500 324.324 -%%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 1.54167 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 1 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 -(moeoMoveIncrEval< Move >) cw -(eoBF< A1, A2, R >) cw -(eoFunctorBase) 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 ----- - - (moeoMoveIncrEval< Move >) 0 0 box - (eoBF< A1, A2, R >) 0 1 box - (eoFunctorBase) 0 2 box - -% ----- relations ----- - -solid -0 0 0 out -solid -1 0 1 in -solid -0 0 1 out -solid -1 0 2 in diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoMoveIncrEval.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoMoveIncrEval.tex deleted file mode 100644 index 0e0a807a0..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoMoveIncrEval.tex +++ /dev/null @@ -1,22 +0,0 @@ -\section{moeo\-Move\-Incr\-Eval$<$ Move $>$ Class Template Reference} -\label{classmoeoMoveIncrEval}\index{moeoMoveIncrEval@{moeoMoveIncrEval}} -Inheritance diagram for moeo\-Move\-Incr\-Eval$<$ Move $>$::\begin{figure}[H] -\begin{center} -\leavevmode -\includegraphics[height=3cm]{classmoeoMoveIncrEval} -\end{center} -\end{figure} - - -\subsection{Detailed Description} -\subsubsection*{template$<$class Move$>$ class moeo\-Move\-Incr\-Eval$<$ Move $>$} - - - - - -Definition at line 9 of file moeo\-Move\-Incr\-Eval.h. - -The documentation for this class was generated from the following file:\begin{CompactItemize} -\item -moeo\-Move\-Incr\-Eval.h\end{CompactItemize} diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNSGA.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNSGA.tex index b4f2680ac..50e6a3cbc 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNSGA.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNSGA.tex @@ -70,7 +70,7 @@ Srinivas, K. Deb, \char`\"{}Multiobjective Optimization Using Nondominated Sorti -Definition at line 37 of file moeo\-NSGA.h. +Definition at line 62 of file moeo\-NSGA.h. \subsection{Constructor \& Destructor Documentation} \index{moeoNSGA@{moeo\-NSGA}!moeoNSGA@{moeoNSGA}} @@ -87,7 +87,7 @@ Simple ctor with a \doxyref{eo\-Gen\-Op}. \end{Desc} -Definition at line 48 of file moeo\-NSGA.h.\index{moeoNSGA@{moeo\-NSGA}!moeoNSGA@{moeoNSGA}} +Definition at line 73 of file moeo\-NSGA.h.\index{moeoNSGA@{moeo\-NSGA}!moeoNSGA@{moeoNSGA}} \index{moeoNSGA@{moeoNSGA}!moeoNSGA@{moeo\-NSGA}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-NSGA}$<$ MOEOT $>$::\bf{moeo\-NSGA} (unsigned int {\em \_\-max\-Gen}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{eo\-Transform}$<$ MOEOT $>$ \& {\em \_\-op}, double {\em \_\-niche\-Size} = {\tt 0.5})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoNSGA_177e825966d70e7f697a52be7819e830} @@ -101,7 +101,7 @@ Simple ctor with a \doxyref{eo\-Transform}. \end{Desc} -Definition at line 61 of file moeo\-NSGA.h.\index{moeoNSGA@{moeo\-NSGA}!moeoNSGA@{moeoNSGA}} +Definition at line 86 of file moeo\-NSGA.h.\index{moeoNSGA@{moeo\-NSGA}!moeoNSGA@{moeoNSGA}} \index{moeoNSGA@{moeoNSGA}!moeoNSGA@{moeo\-NSGA}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-NSGA}$<$ MOEOT $>$::\bf{moeo\-NSGA} (unsigned int {\em \_\-max\-Gen}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{eo\-Quad\-Op}$<$ MOEOT $>$ \& {\em \_\-crossover}, double {\em \_\-p\-Cross}, \bf{eo\-Mon\-Op}$<$ MOEOT $>$ \& {\em \_\-mutation}, double {\em \_\-p\-Mut}, double {\em \_\-niche\-Size} = {\tt 0.5})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoNSGA_7c7b4bb55b7ee74da780f20a943809fd} @@ -115,7 +115,7 @@ Ctor with a crossover, a mutation and their corresponding rates. \end{Desc} -Definition at line 77 of file moeo\-NSGA.h.\index{moeoNSGA@{moeo\-NSGA}!moeoNSGA@{moeoNSGA}} +Definition at line 102 of file moeo\-NSGA.h.\index{moeoNSGA@{moeo\-NSGA}!moeoNSGA@{moeoNSGA}} \index{moeoNSGA@{moeoNSGA}!moeoNSGA@{moeo\-NSGA}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-NSGA}$<$ MOEOT $>$::\bf{moeo\-NSGA} (\bf{eo\-Continue}$<$ MOEOT $>$ \& {\em \_\-continuator}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{eo\-Gen\-Op}$<$ MOEOT $>$ \& {\em \_\-op}, double {\em \_\-niche\-Size} = {\tt 0.5})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoNSGA_5f8a315499cb7e65911af0c7587144d8} @@ -129,7 +129,7 @@ Ctor with a continuator (instead of \_\-max\-Gen) and a \doxyref{eo\-Gen\-Op}. \end{Desc} -Definition at line 91 of file moeo\-NSGA.h.\index{moeoNSGA@{moeo\-NSGA}!moeoNSGA@{moeoNSGA}} +Definition at line 116 of file moeo\-NSGA.h.\index{moeoNSGA@{moeo\-NSGA}!moeoNSGA@{moeoNSGA}} \index{moeoNSGA@{moeoNSGA}!moeoNSGA@{moeo\-NSGA}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-NSGA}$<$ MOEOT $>$::\bf{moeo\-NSGA} (\bf{eo\-Continue}$<$ MOEOT $>$ \& {\em \_\-continuator}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{eo\-Transform}$<$ MOEOT $>$ \& {\em \_\-op}, double {\em \_\-niche\-Size} = {\tt 0.5})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoNSGA_eacee61268618c12d44d2f07cf7a796c} @@ -143,7 +143,7 @@ Ctor with a continuator (instead of \_\-max\-Gen) and a \doxyref{eo\-Transform}. \end{Desc} -Definition at line 104 of file moeo\-NSGA.h. +Definition at line 129 of file moeo\-NSGA.h. \subsection{Member Function Documentation} \index{moeoNSGA@{moeo\-NSGA}!operator()@{operator()}} @@ -160,7 +160,7 @@ Apply a few generation of evolution to the population \_\-pop until the stopping \end{Desc} -Definition at line 114 of file moeo\-NSGA.h. +Definition at line 139 of file moeo\-NSGA.h. References moeo\-NSGA$<$ MOEOT $>$::breed, moeo\-NSGA$<$ MOEOT $>$::continuator, moeo\-NSGA$<$ MOEOT $>$::diversity\-Assignment, moeo\-NSGA$<$ MOEOT $>$::fitness\-Assignment, moeo\-NSGA$<$ MOEOT $>$::pop\-Eval, and moeo\-NSGA$<$ MOEOT $>$::replace. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNSGAII.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNSGAII.tex index d9339b600..0da1a2d53 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNSGAII.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNSGAII.tex @@ -76,7 +76,7 @@ Agrawal, A. Pratap, and T. Meyarivan : \char`\"{}A fast elitist non-dominated so -Definition at line 40 of file moeo\-NSGAII.h. +Definition at line 65 of file moeo\-NSGAII.h. \subsection{Constructor \& Destructor Documentation} \index{moeoNSGAII@{moeo\-NSGAII}!moeoNSGAII@{moeoNSGAII}} @@ -93,7 +93,7 @@ Simple ctor with a \doxyref{eo\-Gen\-Op}. \end{Desc} -Definition at line 50 of file moeo\-NSGAII.h.\index{moeoNSGAII@{moeo\-NSGAII}!moeoNSGAII@{moeoNSGAII}} +Definition at line 75 of file moeo\-NSGAII.h.\index{moeoNSGAII@{moeo\-NSGAII}!moeoNSGAII@{moeoNSGAII}} \index{moeoNSGAII@{moeoNSGAII}!moeoNSGAII@{moeo\-NSGAII}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-NSGAII}$<$ MOEOT $>$::\bf{moeo\-NSGAII} (unsigned int {\em \_\-max\-Gen}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{eo\-Transform}$<$ MOEOT $>$ \& {\em \_\-op})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoNSGAII_56a2b2ab62b2a4025f1d122e3cfa2aa2} @@ -107,7 +107,7 @@ Simple ctor with a \doxyref{eo\-Transform}. \end{Desc} -Definition at line 63 of file moeo\-NSGAII.h.\index{moeoNSGAII@{moeo\-NSGAII}!moeoNSGAII@{moeoNSGAII}} +Definition at line 88 of file moeo\-NSGAII.h.\index{moeoNSGAII@{moeo\-NSGAII}!moeoNSGAII@{moeoNSGAII}} \index{moeoNSGAII@{moeoNSGAII}!moeoNSGAII@{moeo\-NSGAII}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-NSGAII}$<$ MOEOT $>$::\bf{moeo\-NSGAII} (unsigned int {\em \_\-max\-Gen}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{eo\-Quad\-Op}$<$ MOEOT $>$ \& {\em \_\-crossover}, double {\em \_\-p\-Cross}, \bf{eo\-Mon\-Op}$<$ MOEOT $>$ \& {\em \_\-mutation}, double {\em \_\-p\-Mut})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoNSGAII_996e1b2683378ae1880b7520814aa9c9} @@ -121,7 +121,7 @@ Ctor with a crossover, a mutation and their corresponding rates. \end{Desc} -Definition at line 79 of file moeo\-NSGAII.h.\index{moeoNSGAII@{moeo\-NSGAII}!moeoNSGAII@{moeoNSGAII}} +Definition at line 104 of file moeo\-NSGAII.h.\index{moeoNSGAII@{moeo\-NSGAII}!moeoNSGAII@{moeoNSGAII}} \index{moeoNSGAII@{moeoNSGAII}!moeoNSGAII@{moeo\-NSGAII}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-NSGAII}$<$ MOEOT $>$::\bf{moeo\-NSGAII} (\bf{eo\-Continue}$<$ MOEOT $>$ \& {\em \_\-continuator}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{eo\-Gen\-Op}$<$ MOEOT $>$ \& {\em \_\-op})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoNSGAII_1797f01afde01d155e559522df12ae05} @@ -135,7 +135,7 @@ Ctor with a continuator (instead of \_\-max\-Gen) and a \doxyref{eo\-Gen\-Op}. \end{Desc} -Definition at line 92 of file moeo\-NSGAII.h.\index{moeoNSGAII@{moeo\-NSGAII}!moeoNSGAII@{moeoNSGAII}} +Definition at line 117 of file moeo\-NSGAII.h.\index{moeoNSGAII@{moeo\-NSGAII}!moeoNSGAII@{moeoNSGAII}} \index{moeoNSGAII@{moeoNSGAII}!moeoNSGAII@{moeo\-NSGAII}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-NSGAII}$<$ MOEOT $>$::\bf{moeo\-NSGAII} (\bf{eo\-Continue}$<$ MOEOT $>$ \& {\em \_\-continuator}, \bf{eo\-Eval\-Func}$<$ MOEOT $>$ \& {\em \_\-eval}, \bf{eo\-Transform}$<$ MOEOT $>$ \& {\em \_\-op})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoNSGAII_a2b8d5b2ca7e7fd5845c6cda896b75c6} @@ -149,7 +149,7 @@ Ctor with a continuator (instead of \_\-max\-Gen) and a \doxyref{eo\-Transform}. \end{Desc} -Definition at line 105 of file moeo\-NSGAII.h. +Definition at line 130 of file moeo\-NSGAII.h. \subsection{Member Function Documentation} \index{moeoNSGAII@{moeo\-NSGAII}!operator()@{operator()}} @@ -166,7 +166,7 @@ Apply a few generation of evolution to the population \_\-pop until the stopping \end{Desc} -Definition at line 116 of file moeo\-NSGAII.h. +Definition at line 141 of file moeo\-NSGAII.h. References moeo\-NSGAII$<$ MOEOT $>$::breed, moeo\-NSGAII$<$ MOEOT $>$::continuator, moeo\-NSGAII$<$ MOEOT $>$::diversity\-Assignment, moeo\-NSGAII$<$ MOEOT $>$::fitness\-Assignment, moeo\-NSGAII$<$ MOEOT $>$::pop\-Eval, and moeo\-NSGAII$<$ MOEOT $>$::replace. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNormalizedDistance.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNormalizedDistance.tex index cacbcda7e..046b77e96 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNormalizedDistance.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNormalizedDistance.tex @@ -52,7 +52,7 @@ between 0 and 1). -Definition at line 24 of file moeo\-Normalized\-Distance.h. +Definition at line 49 of file moeo\-Normalized\-Distance.h. \subsection{Member Function Documentation} \index{moeoNormalizedDistance@{moeo\-Normalized\-Distance}!setup@{setup}} @@ -71,7 +71,7 @@ Sets the lower and the upper bounds for every objective using extremes values fo Reimplemented from \bf{moeo\-Distance$<$ MOEOT, Type $>$} \doxyref{p.}{classmoeoDistance_1834a67c2a7a96f0c9a3c408108a8f8c}. -Definition at line 59 of file moeo\-Normalized\-Distance.h. +Definition at line 84 of file moeo\-Normalized\-Distance.h. Referenced by moeo\-Normalized\-Distance$<$ MOEOT $>$::setup().\index{moeoNormalizedDistance@{moeo\-Normalized\-Distance}!setup@{setup}} \index{setup@{setup}!moeoNormalizedDistance@{moeo\-Normalized\-Distance}} @@ -89,7 +89,7 @@ Sets the lower bound (\_\-min) and the upper bound (\_\-max) for the objective \ Reimplemented from \bf{moeo\-Distance$<$ MOEOT, Type $>$} \doxyref{p.}{classmoeoDistance_341c4fa39652871761053e85914a16ad}. -Definition at line 83 of file moeo\-Normalized\-Distance.h.\index{moeoNormalizedDistance@{moeo\-Normalized\-Distance}!setup@{setup}} +Definition at line 108 of file moeo\-Normalized\-Distance.h.\index{moeoNormalizedDistance@{moeo\-Normalized\-Distance}!setup@{setup}} \index{setup@{setup}!moeoNormalizedDistance@{moeo\-Normalized\-Distance}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT, class Type = double$>$ virtual void \bf{moeo\-Normalized\-Distance}$<$ MOEOT, Type $>$::setup (\bf{eo\-Real\-Interval} {\em \_\-real\-Interval}, unsigned int {\em \_\-obj})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classmoeoNormalizedDistance_dda4f95d7f6cae9dd1f4bf6cd8fb7c1c} @@ -105,7 +105,7 @@ Sets the lower bound and the upper bound for the objective \_\-obj using a \doxy Reimplemented from \bf{moeo\-Distance$<$ MOEOT, Type $>$} \doxyref{p.}{classmoeoDistance_b08e7b8c1bedb2993669ec0315fb2b73}. -Definition at line 99 of file moeo\-Normalized\-Distance.h. +Definition at line 124 of file moeo\-Normalized\-Distance.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNormalizedSolutionVsSolutionBinaryMetric.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNormalizedSolutionVsSolutionBinaryMetric.tex index 9e85985bc..94dbd0137 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNormalizedSolutionVsSolutionBinaryMetric.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoNormalizedSolutionVsSolutionBinaryMetric.tex @@ -44,7 +44,7 @@ Then, indicator values lie in the interval [-1,1]. Note that you have to set the -Definition at line 26 of file moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric.h. +Definition at line 51 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}} @@ -61,9 +61,9 @@ Sets the lower bound (\_\-min) and the upper bound (\_\-max) for the objective \ \end{Desc} -Definition at line 50 of file moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric.h. +Definition at line 75 of file moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric.h. -Referenced by moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::setup(), and moeo\-Exp\-Binary\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::setup().\index{moeoNormalizedSolutionVsSolutionBinaryMetric@{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric}!setup@{setup}} +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} @@ -77,7 +77,7 @@ Sets the lower bound and the upper bound for the objective \_\-obj using a \doxy \end{Desc} -Definition at line 66 of file moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric.h. +Definition at line 91 of file moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveObjectiveVectorComparator.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveObjectiveVectorComparator.tex index 6117be6be..a8761f59f 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveObjectiveVectorComparator.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveObjectiveVectorComparator.tex @@ -25,7 +25,7 @@ Functor allowing to compare two objective vectors according to their first objec -Definition at line 22 of file moeo\-Objective\-Objective\-Vector\-Comparator.h. +Definition at line 47 of file moeo\-Objective\-Objective\-Vector\-Comparator.h. \subsection{Member Function Documentation} \index{moeoObjectiveObjectiveVectorComparator@{moeo\-Objective\-Objective\-Vector\-Comparator}!operator()@{operator()}} @@ -42,7 +42,7 @@ Returns true if \_\-objective\-Vector1 $<$ \_\-objective\-Vector2 on the first o \end{Desc} -Definition at line 31 of file moeo\-Objective\-Objective\-Vector\-Comparator.h. +Definition at line 56 of file moeo\-Objective\-Objective\-Vector\-Comparator.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveVector.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveVector.tex index f97618af4..15ab5c582 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveVector.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveVector.tex @@ -45,7 +45,7 @@ The template argument Objective\-Vector\-Traits defaults to \doxyref{moeo\-Objec -Definition at line 25 of file moeo\-Objective\-Vector.h. +Definition at line 50 of file moeo\-Objective\-Vector.h. \subsection{Constructor \& Destructor Documentation} \index{moeoObjectiveVector@{moeo\-Objective\-Vector}!moeoObjectiveVector@{moeoObjectiveVector}} @@ -62,7 +62,7 @@ Ctor from a vector of Type. \end{Desc} -Definition at line 46 of file moeo\-Objective\-Vector.h. +Definition at line 71 of file moeo\-Objective\-Vector.h. \subsection{Member Function Documentation} \index{moeoObjectiveVector@{moeo\-Objective\-Vector}!setup@{setup}} @@ -79,7 +79,7 @@ Definition at line 46 of file moeo\-Objective\-Vector.h. \end{Desc} -Definition at line 55 of file moeo\-Objective\-Vector.h.\index{moeoObjectiveVector@{moeo\-Objective\-Vector}!minimizing@{minimizing}} +Definition at line 80 of file moeo\-Objective\-Vector.h.\index{moeoObjectiveVector@{moeo\-Objective\-Vector}!minimizing@{minimizing}} \index{minimizing@{minimizing}!moeoObjectiveVector@{moeo\-Objective\-Vector}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Objective\-Vector\-Traits, class Objective\-Vector\-Type$>$ static bool \bf{moeo\-Objective\-Vector}$<$ Objective\-Vector\-Traits, Objective\-Vector\-Type $>$::minimizing (unsigned int {\em \_\-i})\hspace{0.3cm}{\tt [inline, static]}}\label{classmoeoObjectiveVector_decaf6e3b9a9ac97461d2b271facfc5f} @@ -93,7 +93,7 @@ Returns true if the \_\-ith objective have to be minimized. \end{Desc} -Definition at line 74 of file moeo\-Objective\-Vector.h.\index{moeoObjectiveVector@{moeo\-Objective\-Vector}!maximizing@{maximizing}} +Definition at line 99 of file moeo\-Objective\-Vector.h.\index{moeoObjectiveVector@{moeo\-Objective\-Vector}!maximizing@{maximizing}} \index{maximizing@{maximizing}!moeoObjectiveVector@{moeo\-Objective\-Vector}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Objective\-Vector\-Traits, class Objective\-Vector\-Type$>$ static bool \bf{moeo\-Objective\-Vector}$<$ Objective\-Vector\-Traits, Objective\-Vector\-Type $>$::maximizing (unsigned int {\em \_\-i})\hspace{0.3cm}{\tt [inline, static]}}\label{classmoeoObjectiveVector_b62231b0e1c6bb6bab43d6d058871ce3} @@ -107,7 +107,7 @@ Returns true if the \_\-ith objective have to be maximized. \end{Desc} -Definition at line 84 of file moeo\-Objective\-Vector.h. +Definition at line 109 of file moeo\-Objective\-Vector.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveVectorComparator.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveVectorComparator.tex index 9bfde27f5..a27861415 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveVectorComparator.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveVectorComparator.tex @@ -22,7 +22,7 @@ The template argument Objective\-Vector have to be a \doxyref{moeo\-Objective\-V -Definition at line 24 of file moeo\-Objective\-Vector\-Comparator.h. +Definition at line 49 of file moeo\-Objective\-Vector\-Comparator.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveVectorTraits.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveVectorTraits.tex index f53f03527..972dc3d64 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveVectorTraits.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoObjectiveVectorTraits.tex @@ -42,7 +42,7 @@ A traits class for \doxyref{moeo\-Objective\-Vector}{p.}{classmoeoObjectiveVecto -Definition at line 23 of file moeo\-Objective\-Vector\-Traits.h. +Definition at line 48 of file moeo\-Objective\-Vector\-Traits.h. \subsection{Member Function Documentation} \index{moeoObjectiveVectorTraits@{moeo\-Objective\-Vector\-Traits}!setup@{setup}} @@ -59,7 +59,7 @@ Definition at line 23 of file moeo\-Objective\-Vector\-Traits.h. \end{Desc} -Definition at line 32 of file moeo\-Objective\-Vector\-Traits.h. +Definition at line 57 of file moeo\-Objective\-Vector\-Traits.h. References b\-Obj, and n\-Obj.\index{moeoObjectiveVectorTraits@{moeo\-Objective\-Vector\-Traits}!minimizing@{minimizing}} \index{minimizing@{minimizing}!moeoObjectiveVectorTraits@{moeo\-Objective\-Vector\-Traits}} @@ -75,7 +75,7 @@ Returns true if the \_\-ith objective have to be minimized. \end{Desc} -Definition at line 67 of file moeo\-Objective\-Vector\-Traits.h. +Definition at line 92 of file moeo\-Objective\-Vector\-Traits.h. References b\-Obj. @@ -93,7 +93,7 @@ Returns true if the \_\-ith objective have to be maximized. \end{Desc} -Definition at line 80 of file moeo\-Objective\-Vector\-Traits.h. +Definition at line 105 of file moeo\-Objective\-Vector\-Traits.h. References minimizing(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoOneObjectiveComparator.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoOneObjectiveComparator.tex index 8b59cdb14..dc5d9f460 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoOneObjectiveComparator.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoOneObjectiveComparator.tex @@ -33,7 +33,7 @@ Functor allowing to compare two solutions according to one objective. -Definition at line 22 of file moeo\-One\-Objective\-Comparator.h. +Definition at line 47 of file moeo\-One\-Objective\-Comparator.h. \subsection{Constructor \& Destructor Documentation} \index{moeoOneObjectiveComparator@{moeo\-One\-Objective\-Comparator}!moeoOneObjectiveComparator@{moeoOneObjectiveComparator}} @@ -50,7 +50,7 @@ Ctor. \end{Desc} -Definition at line 30 of file moeo\-One\-Objective\-Comparator.h. +Definition at line 55 of file moeo\-One\-Objective\-Comparator.h. References moeo\-One\-Objective\-Comparator$<$ MOEOT $>$::obj. @@ -69,7 +69,7 @@ Returns true if \_\-moeo1 $<$ \_\-moeo2 on the obj objective. \end{Desc} -Definition at line 44 of file moeo\-One\-Objective\-Comparator.h. +Definition at line 69 of file moeo\-One\-Objective\-Comparator.h. References moeo\-One\-Objective\-Comparator$<$ MOEOT $>$::obj. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoParetoBasedFitnessAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoParetoBasedFitnessAssignment.tex index 742a285c3..883517804 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoParetoBasedFitnessAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoParetoBasedFitnessAssignment.tex @@ -20,7 +20,7 @@ Inheritance diagram for moeo\-Pareto\-Based\-Fitness\-Assignment$<$ MOEOT $>$::\ -Definition at line 22 of file moeo\-Pareto\-Based\-Fitness\-Assignment.h. +Definition at line 47 of file moeo\-Pareto\-Based\-Fitness\-Assignment.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoParetoObjectiveVectorComparator.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoParetoObjectiveVectorComparator.tex index fe17076c3..c9e5af8d6 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoParetoObjectiveVectorComparator.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoParetoObjectiveVectorComparator.tex @@ -25,7 +25,7 @@ This functor class allows to compare 2 objective vectors according to Pareto dom -Definition at line 22 of file moeo\-Pareto\-Objective\-Vector\-Comparator.h. +Definition at line 47 of file moeo\-Pareto\-Objective\-Vector\-Comparator.h. \subsection{Member Function Documentation} \index{moeoParetoObjectiveVectorComparator@{moeo\-Pareto\-Objective\-Vector\-Comparator}!operator()@{operator()}} @@ -42,7 +42,7 @@ Returns true if \_\-objective\-Vector1 is dominated by \_\-objective\-Vector2. \end{Desc} -Definition at line 31 of file moeo\-Pareto\-Objective\-Vector\-Comparator.h. +Definition at line 56 of file moeo\-Pareto\-Objective\-Vector\-Comparator.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRandomSelect.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRandomSelect.tex index 8209cde07..eb78e2954 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRandomSelect.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRandomSelect.tex @@ -29,7 +29,7 @@ Selection strategy that selects only one element randomly from a whole populatio -Definition at line 23 of file moeo\-Random\-Select.h. +Definition at line 48 of file moeo\-Random\-Select.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRealObjectiveVector.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRealObjectiveVector.tex index 2d68acf46..085217b7a 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRealObjectiveVector.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRealObjectiveVector.tex @@ -44,7 +44,7 @@ that an objective value is represented using a double, and this for any objectiv -Definition at line 27 of file moeo\-Real\-Objective\-Vector.h. +Definition at line 52 of file moeo\-Real\-Objective\-Vector.h. \subsection{Constructor \& Destructor Documentation} \index{moeoRealObjectiveVector@{moeo\-Real\-Objective\-Vector}!moeoRealObjectiveVector@{moeoRealObjectiveVector}} @@ -61,7 +61,7 @@ Ctor from a vector of doubles. \end{Desc} -Definition at line 45 of file moeo\-Real\-Objective\-Vector.h. +Definition at line 70 of file moeo\-Real\-Objective\-Vector.h. \subsection{Member Function Documentation} \index{moeoRealObjectiveVector@{moeo\-Real\-Objective\-Vector}!dominates@{dominates}} @@ -78,7 +78,7 @@ Returns true if the current objective vector dominates \_\-other according to th \end{Desc} -Definition at line 54 of file moeo\-Real\-Objective\-Vector.h.\index{moeoRealObjectiveVector@{moeo\-Real\-Objective\-Vector}!operator==@{operator==}} +Definition at line 79 of file moeo\-Real\-Objective\-Vector.h.\index{moeoRealObjectiveVector@{moeo\-Real\-Objective\-Vector}!operator==@{operator==}} \index{operator==@{operator==}!moeoRealObjectiveVector@{moeo\-Real\-Objective\-Vector}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Objective\-Vector\-Traits$>$ bool \bf{moeo\-Real\-Objective\-Vector}$<$ Objective\-Vector\-Traits $>$::operator== (const \bf{moeo\-Real\-Objective\-Vector}$<$ Objective\-Vector\-Traits $>$ \& {\em \_\-other}) const\hspace{0.3cm}{\tt [inline]}}\label{classmoeoRealObjectiveVector_e2f1665239fac279784a7c2d4e030a0a} @@ -92,7 +92,7 @@ Returns true if the current objective vector is equal to \_\-other (according to \end{Desc} -Definition at line 65 of file moeo\-Real\-Objective\-Vector.h. +Definition at line 90 of file moeo\-Real\-Objective\-Vector.h. Referenced by moeo\-Real\-Objective\-Vector$<$ Objective\-Vector\-Traits $>$::operator!=(), and moeo\-Real\-Objective\-Vector$<$ Objective\-Vector\-Traits $>$::operator$>$=().\index{moeoRealObjectiveVector@{moeo\-Real\-Objective\-Vector}!operator"!=@{operator"!=}} \index{operator"!=@{operator"!=}!moeoRealObjectiveVector@{moeo\-Real\-Objective\-Vector}} @@ -108,7 +108,7 @@ Returns true if the current objective vector is different than \_\-other (accord \end{Desc} -Definition at line 82 of file moeo\-Real\-Objective\-Vector.h. +Definition at line 107 of file moeo\-Real\-Objective\-Vector.h. References moeo\-Real\-Objective\-Vector$<$ Objective\-Vector\-Traits $>$::operator==().\index{moeoRealObjectiveVector@{moeo\-Real\-Objective\-Vector}!operator<@{operator$<$}} \index{operator<@{operator$<$}!moeoRealObjectiveVector@{moeo\-Real\-Objective\-Vector}} @@ -124,7 +124,7 @@ Returns true if the current objective vector is smaller than \_\-other on the fi \end{Desc} -Definition at line 93 of file moeo\-Real\-Objective\-Vector.h. +Definition at line 118 of file moeo\-Real\-Objective\-Vector.h. Referenced by moeo\-Real\-Objective\-Vector$<$ Objective\-Vector\-Traits $>$::operator$<$=().\index{moeoRealObjectiveVector@{moeo\-Real\-Objective\-Vector}!operator>@{operator$>$}} \index{operator>@{operator$>$}!moeoRealObjectiveVector@{moeo\-Real\-Objective\-Vector}} @@ -140,7 +140,7 @@ Returns true if the current objective vector is greater than \_\-other on the fi \end{Desc} -Definition at line 105 of file moeo\-Real\-Objective\-Vector.h. +Definition at line 130 of file moeo\-Real\-Objective\-Vector.h. Referenced by moeo\-Real\-Objective\-Vector$<$ Objective\-Vector\-Traits $>$::operator$>$=().\index{moeoRealObjectiveVector@{moeo\-Real\-Objective\-Vector}!operator<=@{operator$<$=}} \index{operator<=@{operator$<$=}!moeoRealObjectiveVector@{moeo\-Real\-Objective\-Vector}} @@ -156,7 +156,7 @@ Returns true if the current objective vector is smaller than or equal to \_\-oth \end{Desc} -Definition at line 116 of file moeo\-Real\-Objective\-Vector.h. +Definition at line 141 of file moeo\-Real\-Objective\-Vector.h. References moeo\-Real\-Objective\-Vector$<$ Objective\-Vector\-Traits $>$::operator$<$().\index{moeoRealObjectiveVector@{moeo\-Real\-Objective\-Vector}!operator>=@{operator$>$=}} \index{operator>=@{operator$>$=}!moeoRealObjectiveVector@{moeo\-Real\-Objective\-Vector}} @@ -172,7 +172,7 @@ Returns true if the current objective vector is greater than or equal to \_\-oth \end{Desc} -Definition at line 127 of file moeo\-Real\-Objective\-Vector.h. +Definition at line 152 of file moeo\-Real\-Objective\-Vector.h. References moeo\-Real\-Objective\-Vector$<$ Objective\-Vector\-Traits $>$::operator==(), and moeo\-Real\-Objective\-Vector$<$ Objective\-Vector\-Traits $>$::operator$>$(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRealVector.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRealVector.tex index ffe7e146f..7a5c2fe22 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRealVector.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRealVector.tex @@ -28,7 +28,7 @@ This class is an implementation of a simple double-valued \doxyref{moeo\-Vector} -Definition at line 22 of file moeo\-Real\-Vector.h. +Definition at line 47 of file moeo\-Real\-Vector.h. \subsection{Constructor \& Destructor Documentation} \index{moeoRealVector@{moeo\-Real\-Vector}!moeoRealVector@{moeoRealVector}} @@ -45,7 +45,7 @@ Ctor. \end{Desc} -Definition at line 31 of file moeo\-Real\-Vector.h. +Definition at line 56 of file moeo\-Real\-Vector.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoReferencePointIndicatorBasedFitnessAssignment.eps b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoReferencePointIndicatorBasedFitnessAssignment.eps deleted file mode 100644 index c1feb7742..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoReferencePointIndicatorBasedFitnessAssignment.eps +++ /dev/null @@ -1,209 +0,0 @@ -%!PS-Adobe-2.0 EPSF-2.0 -%%Title: ClassName -%%Creator: Doxygen -%%CreationDate: Time -%%For: -%Magnification: 1.00 -%%Orientation: Portrait -%%BoundingBox: 0 0 500 202.532 -%%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 2.46875 def % aspect ratio of the BoundingBox (width/height) -/boundx 500 def -/boundy boundx boundaspect div def -/xspacing 0 def -/yspacing 0 def -/rows 4 def -/cols 1 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 -(moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >) cw -(moeoFitnessAssignment< MOEOT >) cw -(eoUF< eoPop< MOEOT > &, void >) cw -(eoFunctorBase) 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 ----- - - (moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >) 0 0 box - (moeoFitnessAssignment< MOEOT >) 0 1 box - (eoUF< eoPop< MOEOT > &, void >) 0 2 box - (eoFunctorBase) 0 3 box - -% ----- relations ----- - -solid -0 0 0 out -solid -1 0 1 in -solid -0 0 1 out -solid -1 0 2 in -solid -0 0 2 out -solid -1 0 3 in diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoReferencePointIndicatorBasedFitnessAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoReferencePointIndicatorBasedFitnessAssignment.tex deleted file mode 100644 index 0ba580737..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoReferencePointIndicatorBasedFitnessAssignment.tex +++ /dev/null @@ -1,148 +0,0 @@ -\section{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$ Class Template Reference} -\label{classmoeoReferencePointIndicatorBasedFitnessAssignment}\index{moeoReferencePointIndicatorBasedFitnessAssignment@{moeoReferencePointIndicatorBasedFitnessAssignment}} -Fitness assignment sheme based a Reference Point and a Quality Indicator. - - -{\tt \#include $<$moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment.h$>$} - -Inheritance diagram for moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::\begin{figure}[H] -\begin{center} -\leavevmode -\includegraphics[height=4cm]{classmoeoReferencePointIndicatorBasedFitnessAssignment} -\end{center} -\end{figure} -\subsection*{Public Types} -\begin{CompactItemize} -\item -typedef MOEOT::Objective\-Vector \bf{Objective\-Vector}\label{classmoeoReferencePointIndicatorBasedFitnessAssignment_51ae5507dca3e934f7db36eef78df556} - -\begin{CompactList}\small\item\em The type of objective vector. \item\end{CompactList}\end{CompactItemize} -\subsection*{Public Member Functions} -\begin{CompactItemize} -\item -\bf{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment} (\bf{Objective\-Vector} \&\_\-ref\-Point, \bf{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric}$<$ \bf{Objective\-Vector}, double $>$ \&\_\-metric) -\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item -void \bf{operator()} (\bf{eo\-Pop}$<$ MOEOT $>$ \&\_\-pop) -\begin{CompactList}\small\item\em Sets the fitness values for every solution contained in the population \_\-pop. \item\end{CompactList}\item -void \bf{update\-By\-Deleting} (\bf{eo\-Pop}$<$ MOEOT $>$ \&\_\-pop, \bf{Objective\-Vector} \&\_\-obj\-Vec) -\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}\end{CompactItemize} -\subsection*{Protected Member Functions} -\begin{CompactItemize} -\item -void \bf{setup} (const \bf{eo\-Pop}$<$ MOEOT $>$ \&\_\-pop) -\begin{CompactList}\small\item\em Sets the bounds for every objective using the min and the max value for every objective vector of \_\-pop (and the reference point). \item\end{CompactList}\item -void \bf{set\-Fitnesses} (\bf{eo\-Pop}$<$ MOEOT $>$ \&\_\-pop) -\begin{CompactList}\small\item\em Sets the fitness of every individual contained in the population \_\-pop. \item\end{CompactList}\end{CompactItemize} -\subsection*{Protected Attributes} -\begin{CompactItemize} -\item -\bf{Objective\-Vector} \& \bf{ref\-Point}\label{classmoeoReferencePointIndicatorBasedFitnessAssignment_73dc1eb66e46b28b7ee283f7367f427b} - -\begin{CompactList}\small\item\em the reference point \item\end{CompactList}\item -\bf{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric}$<$ \bf{Objective\-Vector}, double $>$ \& \bf{metric}\label{classmoeoReferencePointIndicatorBasedFitnessAssignment_9adf4fd353f44f15d3722ef26aa81832} - -\begin{CompactList}\small\item\em the quality indicator \item\end{CompactList}\end{CompactItemize} - - -\subsection{Detailed Description} -\subsubsection*{template$<$class MOEOT$>$ class moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$} - -Fitness assignment sheme based a Reference Point and a Quality Indicator. - - - -Definition at line 25 of file moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment.h. - -\subsection{Constructor \& Destructor Documentation} -\index{moeoReferencePointIndicatorBasedFitnessAssignment@{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment}!moeoReferencePointIndicatorBasedFitnessAssignment@{moeoReferencePointIndicatorBasedFitnessAssignment}} -\index{moeoReferencePointIndicatorBasedFitnessAssignment@{moeoReferencePointIndicatorBasedFitnessAssignment}!moeoReferencePointIndicatorBasedFitnessAssignment@{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment}} -\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment}$<$ MOEOT $>$::\bf{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment} (\bf{Objective\-Vector} \& {\em \_\-ref\-Point}, \bf{moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric}$<$ \bf{Objective\-Vector}, double $>$ \& {\em \_\-metric})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoReferencePointIndicatorBasedFitnessAssignment_67a5e91e08f89f27ad5aad989898c425} - - -Ctor. - -\begin{Desc} -\item[Parameters:] -\begin{description} -\item[{\em \_\-ref\-Point}]the reference point \item[{\em \_\-metric}]the quality indicator \end{description} -\end{Desc} - - -Definition at line 37 of file moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment.h. - -\subsection{Member Function Documentation} -\index{moeoReferencePointIndicatorBasedFitnessAssignment@{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment}!operator()@{operator()}} -\index{operator()@{operator()}!moeoReferencePointIndicatorBasedFitnessAssignment@{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment}} -\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ void \bf{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment}$<$ MOEOT $>$::operator() (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classmoeoReferencePointIndicatorBasedFitnessAssignment_d122ebb7cda54b283d6736dc5e57da7d} - - -Sets the fitness values for every solution contained in the population \_\-pop. - -\begin{Desc} -\item[Parameters:] -\begin{description} -\item[{\em \_\-pop}]the population \end{description} -\end{Desc} - - -Implements \bf{eo\-UF$<$ eo\-Pop$<$ MOEOT $>$ \&, void $>$}. - -Definition at line 46 of file moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment.h. - -References moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::set\-Fitnesses(), and moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::setup().\index{moeoReferencePointIndicatorBasedFitnessAssignment@{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment}!updateByDeleting@{updateByDeleting}} -\index{updateByDeleting@{updateByDeleting}!moeoReferencePointIndicatorBasedFitnessAssignment@{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment}} -\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ void \bf{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment}$<$ MOEOT $>$::update\-By\-Deleting (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop}, \bf{Objective\-Vector} \& {\em \_\-obj\-Vec})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classmoeoReferencePointIndicatorBasedFitnessAssignment_ba47422dd4f82274af2f69c0b5f95d3a} - - -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} - - -Implements \bf{moeo\-Fitness\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoFitnessAssignment_4922629569eddc9be049b3ead1ab0269}. - -Definition at line 60 of file moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment.h.\index{moeoReferencePointIndicatorBasedFitnessAssignment@{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment}!setup@{setup}} -\index{setup@{setup}!moeoReferencePointIndicatorBasedFitnessAssignment@{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment}} -\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ void \bf{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment}$<$ MOEOT $>$::setup (const \bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt [inline, protected]}}\label{classmoeoReferencePointIndicatorBasedFitnessAssignment_67bfa12f97d247c15f3e28f923646b78} - - -Sets the bounds for every objective using the min and the max value for every objective vector of \_\-pop (and the reference point). - -\begin{Desc} -\item[Parameters:] -\begin{description} -\item[{\em \_\-pop}]the population \end{description} -\end{Desc} - - -Definition at line 78 of file moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment.h. - -References moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::metric, moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::ref\-Point, and moeo\-Normalized\-Solution\-Vs\-Solution\-Binary\-Metric$<$ Objective\-Vector, R $>$::setup(). - -Referenced by moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::operator()().\index{moeoReferencePointIndicatorBasedFitnessAssignment@{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment}!setFitnesses@{setFitnesses}} -\index{setFitnesses@{setFitnesses}!moeoReferencePointIndicatorBasedFitnessAssignment@{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment}} -\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ void \bf{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment}$<$ MOEOT $>$::set\-Fitnesses (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt [inline, protected]}}\label{classmoeoReferencePointIndicatorBasedFitnessAssignment_b1ca358eeb6dac0afe902a3978e1219a} - - -Sets the fitness of every individual contained in the population \_\-pop. - -\begin{Desc} -\item[Parameters:] -\begin{description} -\item[{\em \_\-pop}]the population \end{description} -\end{Desc} - - -Definition at line 99 of file moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment.h. - -References moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::metric, and moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::ref\-Point. - -Referenced by moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$::operator()(). - -The documentation for this class was generated from the following file:\begin{CompactItemize} -\item -moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment.h\end{CompactItemize} diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoReplacement.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoReplacement.tex index 2a3aeebb4..c9fe21315 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoReplacement.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoReplacement.tex @@ -20,7 +20,7 @@ Replacement strategy for multi-objective optimization. -Definition at line 22 of file moeo\-Replacement.h. +Definition at line 47 of file moeo\-Replacement.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRouletteSelect.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRouletteSelect.tex index 83ad8f48c..4c9e8f336 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRouletteSelect.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoRouletteSelect.tex @@ -37,7 +37,7 @@ Selection strategy that selects ONE individual by using roulette wheel process. -Definition at line 24 of file moeo\-Roulette\-Select.h. +Definition at line 49 of file moeo\-Roulette\-Select.h. \subsection{Constructor \& Destructor Documentation} \index{moeoRouletteSelect@{moeo\-Roulette\-Select}!moeoRouletteSelect@{moeoRouletteSelect}} @@ -54,7 +54,7 @@ Ctor. \end{Desc} -Definition at line 32 of file moeo\-Roulette\-Select.h. +Definition at line 57 of file moeo\-Roulette\-Select.h. References moeo\-Roulette\-Select$<$ MOEOT $>$::t\-Size. @@ -73,7 +73,7 @@ Apply the tournament to the given population. \end{Desc} -Definition at line 48 of file moeo\-Roulette\-Select.h. +Definition at line 73 of file moeo\-Roulette\-Select.h. References moeo\-Roulette\-Select$<$ MOEOT $>$::t\-Size. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoScalarFitnessAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoScalarFitnessAssignment.tex index 39534c2a6..243208ed4 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoScalarFitnessAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoScalarFitnessAssignment.tex @@ -20,7 +20,7 @@ Inheritance diagram for moeo\-Scalar\-Fitness\-Assignment$<$ MOEOT $>$::\begin{f -Definition at line 22 of file moeo\-Scalar\-Fitness\-Assignment.h. +Definition at line 47 of file moeo\-Scalar\-Fitness\-Assignment.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSelectFromPopAndArch.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSelectFromPopAndArch.tex index 6f2be7c04..55c70d2a2 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSelectFromPopAndArch.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSelectFromPopAndArch.tex @@ -51,7 +51,7 @@ Elitist selection process that consists in choosing individuals in the archive a -Definition at line 26 of file moeo\-Select\-From\-Pop\-And\-Arch.h. +Definition at line 51 of file moeo\-Select\-From\-Pop\-And\-Arch.h. \subsection{Constructor \& Destructor Documentation} \index{moeoSelectFromPopAndArch@{moeo\-Select\-From\-Pop\-And\-Arch}!moeoSelectFromPopAndArch@{moeoSelectFromPopAndArch}} @@ -68,7 +68,7 @@ Ctor. \end{Desc} -Definition at line 37 of file moeo\-Select\-From\-Pop\-And\-Arch.h.\index{moeoSelectFromPopAndArch@{moeo\-Select\-From\-Pop\-And\-Arch}!moeoSelectFromPopAndArch@{moeoSelectFromPopAndArch}} +Definition at line 62 of file moeo\-Select\-From\-Pop\-And\-Arch.h.\index{moeoSelectFromPopAndArch@{moeo\-Select\-From\-Pop\-And\-Arch}!moeoSelectFromPopAndArch@{moeoSelectFromPopAndArch}} \index{moeoSelectFromPopAndArch@{moeoSelectFromPopAndArch}!moeoSelectFromPopAndArch@{moeo\-Select\-From\-Pop\-And\-Arch}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Select\-From\-Pop\-And\-Arch}$<$ MOEOT $>$::\bf{moeo\-Select\-From\-Pop\-And\-Arch} (\bf{moeo\-Select\-One}$<$ MOEOT $>$ \& {\em \_\-pop\-Select\-One}, \bf{moeo\-Archive}$<$ MOEOT $>$ \& {\em \_\-arch}, double {\em \_\-ratio\-From\-Pop} = {\tt 0.5})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoSelectFromPopAndArch_1c225b5f7b5a5ce6e87b46a7ea4a4cd0} @@ -82,7 +82,7 @@ Defaulr ctor - the archive's selection operator is a random selector. \end{Desc} -Definition at line 48 of file moeo\-Select\-From\-Pop\-And\-Arch.h. +Definition at line 73 of file moeo\-Select\-From\-Pop\-And\-Arch.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSelectOne.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSelectOne.tex index fc3c2f417..0349fe63d 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSelectOne.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSelectOne.tex @@ -20,7 +20,7 @@ Selection strategy for multi-objective optimization that selects only one elemen -Definition at line 22 of file moeo\-Select\-One.h. +Definition at line 47 of file moeo\-Select\-One.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSharingDiversityAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSharingDiversityAssignment.tex index a26431630..0425f8ead 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSharingDiversityAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSharingDiversityAssignment.tex @@ -61,7 +61,7 @@ E. Goldberg, \char`\"{}Genetic Algorithms in Search, Optimization and Machine Le -Definition at line 28 of file moeo\-Sharing\-Diversity\-Assignment.h. +Definition at line 53 of file moeo\-Sharing\-Diversity\-Assignment.h. \subsection{Constructor \& Destructor Documentation} \index{moeoSharingDiversityAssignment@{moeo\-Sharing\-Diversity\-Assignment}!moeoSharingDiversityAssignment@{moeoSharingDiversityAssignment}} @@ -78,7 +78,7 @@ Ctor. \end{Desc} -Definition at line 42 of file moeo\-Sharing\-Diversity\-Assignment.h.\index{moeoSharingDiversityAssignment@{moeo\-Sharing\-Diversity\-Assignment}!moeoSharingDiversityAssignment@{moeoSharingDiversityAssignment}} +Definition at line 67 of file moeo\-Sharing\-Diversity\-Assignment.h.\index{moeoSharingDiversityAssignment@{moeo\-Sharing\-Diversity\-Assignment}!moeoSharingDiversityAssignment@{moeoSharingDiversityAssignment}} \index{moeoSharingDiversityAssignment@{moeoSharingDiversityAssignment}!moeoSharingDiversityAssignment@{moeo\-Sharing\-Diversity\-Assignment}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ \bf{moeo\-Sharing\-Diversity\-Assignment}$<$ MOEOT $>$::\bf{moeo\-Sharing\-Diversity\-Assignment} (double {\em \_\-niche\-Size} = {\tt 0.5}, double {\em \_\-alpha} = {\tt 1.0})\hspace{0.3cm}{\tt [inline]}}\label{classmoeoSharingDiversityAssignment_ccc66529da0cacd3f11a019ebe646668} @@ -92,7 +92,7 @@ Ctor with an euclidean distance (with normalized objective values) in the object \end{Desc} -Definition at line 51 of file moeo\-Sharing\-Diversity\-Assignment.h. +Definition at line 76 of file moeo\-Sharing\-Diversity\-Assignment.h. \subsection{Member Function Documentation} \index{moeoSharingDiversityAssignment@{moeo\-Sharing\-Diversity\-Assignment}!operator()@{operator()}} @@ -111,7 +111,7 @@ Sets diversity values for every solution contained in the population \_\-pop. Implements \bf{eo\-UF$<$ eo\-Pop$<$ MOEOT $>$ \&, void $>$}. -Definition at line 59 of file moeo\-Sharing\-Diversity\-Assignment.h. +Definition at line 84 of file moeo\-Sharing\-Diversity\-Assignment.h. References moeo\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$::set\-Similarities().\index{moeoSharingDiversityAssignment@{moeo\-Sharing\-Diversity\-Assignment}!updateByDeleting@{updateByDeleting}} \index{updateByDeleting@{updateByDeleting}!moeoSharingDiversityAssignment@{moeo\-Sharing\-Diversity\-Assignment}} @@ -133,7 +133,7 @@ Implements \bf{moeo\-Diversity\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoD Reimplemented in \bf{moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoFrontByFrontSharingDiversityAssignment_623489a246f86cf24cc5860d32caa743}. -Definition at line 80 of file moeo\-Sharing\-Diversity\-Assignment.h.\index{moeoSharingDiversityAssignment@{moeo\-Sharing\-Diversity\-Assignment}!setSimilarities@{setSimilarities}} +Definition at line 105 of file moeo\-Sharing\-Diversity\-Assignment.h.\index{moeoSharingDiversityAssignment@{moeo\-Sharing\-Diversity\-Assignment}!setSimilarities@{setSimilarities}} \index{setSimilarities@{setSimilarities}!moeoSharingDiversityAssignment@{moeo\-Sharing\-Diversity\-Assignment}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOT$>$ virtual void \bf{moeo\-Sharing\-Diversity\-Assignment}$<$ MOEOT $>$::set\-Similarities (\bf{eo\-Pop}$<$ MOEOT $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt [inline, protected, virtual]}}\label{classmoeoSharingDiversityAssignment_c01f6ac1abba3799f5c4b6c0608dac55} @@ -149,7 +149,7 @@ Sets similarities for every solution contained in the population \_\-pop. Reimplemented in \bf{moeo\-Front\-By\-Front\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$} \doxyref{p.}{classmoeoFrontByFrontSharingDiversityAssignment_a0f6c045237aba2857c4a9ec25679e69}. -Definition at line 102 of file moeo\-Sharing\-Diversity\-Assignment.h. +Definition at line 127 of file moeo\-Sharing\-Diversity\-Assignment.h. References moeo\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$::distance, and moeo\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$::sh(). @@ -167,7 +167,7 @@ Sharing function. \end{Desc} -Definition at line 125 of file moeo\-Sharing\-Diversity\-Assignment.h. +Definition at line 150 of file moeo\-Sharing\-Diversity\-Assignment.h. References moeo\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$::alpha, and moeo\-Sharing\-Diversity\-Assignment$<$ MOEOT $>$::niche\-Size. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSolutionUnaryMetric.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSolutionUnaryMetric.tex index 71e3e9d58..7764b8b93 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSolutionUnaryMetric.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSolutionUnaryMetric.tex @@ -20,7 +20,7 @@ Base class for unary metrics dedicated to the performance evaluation of a single -Definition at line 43 of file moeo\-Metric.h. +Definition at line 68 of file moeo\-Metric.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSolutionVsSolutionBinaryMetric.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSolutionVsSolutionBinaryMetric.tex index f98bbe8a7..57fa78238 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSolutionVsSolutionBinaryMetric.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoSolutionVsSolutionBinaryMetric.tex @@ -20,7 +20,7 @@ Base class for binary metrics dedicated to the performance comparison between tw -Definition at line 57 of file moeo\-Metric.h. +Definition at line 82 of file moeo\-Metric.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoStochTournamentSelect.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoStochTournamentSelect.tex index 0215c08f2..f78fcd67a 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoStochTournamentSelect.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoStochTournamentSelect.tex @@ -41,7 +41,7 @@ Selection strategy that selects ONE individual by stochastic tournament. -Definition at line 24 of file moeo\-Stoch\-Tournament\-Select.h. +Definition at line 49 of file moeo\-Stoch\-Tournament\-Select.h. \subsection{Constructor \& Destructor Documentation} \index{moeoStochTournamentSelect@{moeo\-Stoch\-Tournament\-Select}!moeoStochTournamentSelect@{moeoStochTournamentSelect}} @@ -58,7 +58,7 @@ Full Ctor. \end{Desc} -Definition at line 33 of file moeo\-Stoch\-Tournament\-Select.h. +Definition at line 58 of file moeo\-Stoch\-Tournament\-Select.h. References moeo\-Stoch\-Tournament\-Select$<$ MOEOT $>$::t\-Rate.\index{moeoStochTournamentSelect@{moeo\-Stoch\-Tournament\-Select}!moeoStochTournamentSelect@{moeoStochTournamentSelect}} \index{moeoStochTournamentSelect@{moeoStochTournamentSelect}!moeoStochTournamentSelect@{moeo\-Stoch\-Tournament\-Select}} @@ -74,7 +74,7 @@ A \doxyref{moeo\-Fitness\-Then\-Diversity\-Comparator}{p.}{classmoeoFitnessThenD \end{Desc} -Definition at line 53 of file moeo\-Stoch\-Tournament\-Select.h. +Definition at line 78 of file moeo\-Stoch\-Tournament\-Select.h. References moeo\-Stoch\-Tournament\-Select$<$ MOEOT $>$::t\-Rate. @@ -93,7 +93,7 @@ Apply the tournament to the given population. \end{Desc} -Definition at line 73 of file moeo\-Stoch\-Tournament\-Select.h. +Definition at line 98 of file moeo\-Stoch\-Tournament\-Select.h. References moeo\-Stoch\-Tournament\-Select$<$ MOEOT $>$::comparator, and moeo\-Stoch\-Tournament\-Select$<$ MOEOT $>$::t\-Rate. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoUnaryIndicatorBasedFitnessAssignment.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoUnaryIndicatorBasedFitnessAssignment.tex index 3186f1ddb..341251020 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoUnaryIndicatorBasedFitnessAssignment.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoUnaryIndicatorBasedFitnessAssignment.tex @@ -20,7 +20,7 @@ Inheritance diagram for moeo\-Unary\-Indicator\-Based\-Fitness\-Assignment$<$ MO -Definition at line 22 of file moeo\-Unary\-Indicator\-Based\-Fitness\-Assignment.h. +Definition at line 47 of file moeo\-Unary\-Indicator\-Based\-Fitness\-Assignment.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoUnaryMetric.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoUnaryMetric.tex index 33a9a8088..7c77b942c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoUnaryMetric.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoUnaryMetric.tex @@ -20,7 +20,7 @@ Base class for unary metrics. -Definition at line 29 of file moeo\-Metric.h. +Definition at line 54 of file moeo\-Metric.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoVector.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoVector.tex index b435a0756..c528c09d4 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoVector.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoVector.tex @@ -44,7 +44,7 @@ Gene\-Type must have the following methods: void ctor (needed for the std::vecto -Definition at line 25 of file moeo\-Vector.h. +Definition at line 50 of file moeo\-Vector.h. \subsection{Constructor \& Destructor Documentation} \index{moeoVector@{moeo\-Vector}!moeoVector@{moeoVector}} @@ -61,7 +61,7 @@ Default ctor. \end{Desc} -Definition at line 47 of file moeo\-Vector.h. +Definition at line 72 of file moeo\-Vector.h. \subsection{Member Function Documentation} \index{moeoVector@{moeo\-Vector}!value@{value}} @@ -78,7 +78,7 @@ We can't have a Ctor from a std::vector as it would create ambiguity with the co \end{Desc} -Definition at line 56 of file moeo\-Vector.h. +Definition at line 81 of file moeo\-Vector.h. Referenced by Flow\-Shop\-Op\-Mutation\-Shift::operator()(), Flow\-Shop\-Op\-Mutation\-Exchange::operator()(), Flow\-Shop\-Op\-Crossover\-Quad::operator()(), and Flow\-Shop\-Init::operator()().\index{moeoVector@{moeo\-Vector}!operator<@{operator$<$}} \index{operator<@{operator$<$}!moeoVector@{moeo\-Vector}} @@ -94,7 +94,7 @@ To avoid conflicts between \doxyref{MOEO::operator$<$}{p.}{classMOEO_119ef916de4 \end{Desc} -Definition at line 79 of file moeo\-Vector.h.\index{moeoVector@{moeo\-Vector}!printOn@{printOn}} +Definition at line 104 of file moeo\-Vector.h.\index{moeoVector@{moeo\-Vector}!printOn@{printOn}} \index{printOn@{printOn}!moeoVector@{moeo\-Vector}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOObjective\-Vector, class MOEOFitness, class MOEODiversity, class Gene\-Type$>$ virtual void \bf{moeo\-Vector}$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, Gene\-Type $>$::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt [inline, virtual]}}\label{classmoeoVector_d0a92cb26483ffab754ac4a0efb76308} @@ -112,7 +112,7 @@ Reimplemented from \bf{MOEO$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity Reimplemented in \bf{moeo\-Bit\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$} \doxyref{p.}{classmoeoBitVector_78f821c548cf46d8bcd30aa8a52ffb7c}. -Definition at line 89 of file moeo\-Vector.h.\index{moeoVector@{moeo\-Vector}!readFrom@{readFrom}} +Definition at line 114 of file moeo\-Vector.h.\index{moeoVector@{moeo\-Vector}!readFrom@{readFrom}} \index{readFrom@{readFrom}!moeoVector@{moeo\-Vector}} \subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class MOEOObjective\-Vector, class MOEOFitness, class MOEODiversity, class Gene\-Type$>$ virtual void \bf{moeo\-Vector}$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity, Gene\-Type $>$::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classmoeoVector_cd8ee0fe79bb9515b29e2a4d3fee5ab9} @@ -130,7 +130,7 @@ Reimplemented from \bf{MOEO$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity Reimplemented in \bf{moeo\-Bit\-Vector$<$ MOEOObjective\-Vector, MOEOFitness, MOEODiversity $>$} \doxyref{p.}{classmoeoBitVector_31cd3f894615d0a27dd116a5c8082521}. -Definition at line 102 of file moeo\-Vector.h. +Definition at line 127 of file moeo\-Vector.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoVectorUnaryMetric.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoVectorUnaryMetric.tex index c805f24f2..43d3e5ebc 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoVectorUnaryMetric.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoVectorUnaryMetric.tex @@ -20,7 +20,7 @@ Base class for unary metrics dedicated to the performance evaluation of a Pareto -Definition at line 50 of file moeo\-Metric.h. +Definition at line 75 of file moeo\-Metric.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoVectorVsVectorBinaryMetric.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoVectorVsVectorBinaryMetric.tex index bcb97e8c4..1e9ed791b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoVectorVsVectorBinaryMetric.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classmoeoVectorVsVectorBinaryMetric.tex @@ -20,7 +20,7 @@ Base class for binary metrics dedicated to the performance comparison between tw -Definition at line 64 of file moeo\-Metric.h. +Definition at line 89 of file moeo\-Metric.h. The documentation for this class was generated from the following file:\begin{CompactItemize} \item diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classpeoEA.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classpeoEA.tex deleted file mode 100644 index d1a3e09cf..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/classpeoEA.tex +++ /dev/null @@ -1,119 +0,0 @@ -\section{peo\-EA$<$ EOT $>$ Class Template Reference} -\label{classpeoEA}\index{peoEA@{peoEA}} -The \doxyref{peo\-EA}{p.}{classpeoEA} class offers an elementary evolutionary algorithm implementation. - - -{\tt \#include $<$pmoeo\-EA.h$>$} - -\subsection*{Public Member Functions} -\begin{CompactItemize} -\item -\bf{peo\-EA} (\bf{eo\-Continue}$<$ EOT $>$ \&\_\-\_\-cont, peo\-Pop\-Eval$<$ EOT $>$ \&\_\-\_\-pop\_\-eval, \bf{eo\-Select}$<$ EOT $>$ \&\_\-\_\-select, peo\-Transform$<$ EOT $>$ \&\_\-\_\-trans, \bf{eo\-Replacement}$<$ EOT $>$ \&\_\-\_\-replace) -\begin{CompactList}\small\item\em Constructor for the evolutionary algorithm object - several basic parameters have to be specified, allowing for different levels of parallelism. \item\end{CompactList}\item -void \bf{run} ()\label{classpeoEA_6ab8c321d29350634143a2a01cf2ad24} - -\begin{CompactList}\small\item\em Evolutionary algorithm function - a side effect of the fact that the class is derived from the {\bf Runner} class, thus requiring the existence of a {\em run\/} function, the algorithm being executed on a distinct thread. \item\end{CompactList}\item -void \bf{operator()} (\bf{eo\-Pop}$<$ EOT $>$ \&\_\-\_\-pop) -\begin{CompactList}\small\item\em \doxyref{Function} operator for specifying the population to be associated with the algorithm. \item\end{CompactList}\end{CompactItemize} -\subsection*{Private Attributes} -\begin{CompactItemize} -\item -\bf{eo\-Continue}$<$ EOT $>$ \& \bf{cont}\label{classpeoEA_5f015eebf42f176b9fe322488c446c2a} - -\item -peo\-Pop\-Eval$<$ EOT $>$ \& \bf{pop\_\-eval}\label{classpeoEA_9140259f50c9186edcb062b023624c96} - -\item -\bf{eo\-Select}$<$ EOT $>$ \& \bf{select}\label{classpeoEA_2d8428d69fdd6aefefbaf543fdd46d19} - -\item -peo\-Transform$<$ EOT $>$ \& \bf{trans}\label{classpeoEA_713c77935eb8aafebfb9488cfaa4a363} - -\item -\bf{eo\-Replacement}$<$ EOT $>$ \& \bf{replace}\label{classpeoEA_9bd2d4356cf7e69e3141dc269213aa8a} - -\item -\bf{eo\-Pop}$<$ EOT $>$ $\ast$ \bf{pop}\label{classpeoEA_c0b110e410bc16283e8339f24b733772} - -\end{CompactItemize} - - -\subsection{Detailed Description} -\subsubsection*{template$<$class EOT$>$ class peo\-EA$<$ EOT $>$} - -The \doxyref{peo\-EA}{p.}{classpeoEA} class offers an elementary evolutionary algorithm implementation. - -In addition, as compared with the algorithms provided by the \doxyref{EO} framework, the \doxyref{peo\-EA}{p.}{classpeoEA} class has the underlying necessary structure for including, for example, parallel evaluation and parallel transformation operators, migration operators etc. Although there is no restriction on using the algorithms provided by the \doxyref{EO} framework, the drawback resides in the fact that the \doxyref{EO} implementation is exclusively sequential and, in consequence, no parallelism is provided. A simple example for constructing a \doxyref{peo\-EA}{p.}{classpeoEA} object: - -\begin{TabularC}{2} -\hline -... ~ &~ \\\hline -eo\-Pop$<$ EOT $>$ population( POP\_\-SIZE, pop\-Initializer ); ~ &// creation of a population with POP\_\-SIZE individuals - the pop\-Initializer is a functor to be called for each individual \\\hline -~ &~ \\\hline -eo\-Gen\-Continue$<$ EOT $>$ ea\-Cont( NUM\_\-GEN ); ~ &// number of generations for the evolutionary algorithm \\\hline -eo\-Check\-Point$<$ EOT $>$ ea\-Checkpoint\-Continue( ea\-Cont ); ~ &// checkpoint incorporating the continuation criterion - startpoint for adding other checkpoint objects \\\hline -~ &~ \\\hline -peo\-Seq\-Pop\-Eval$<$ EOT $>$ ea\-Pop\-Eval( eval\-Function ); ~ &// sequential evaluation functor wrapper - eval\-Function represents the actual evaluation functor \\\hline -~ &~ \\\hline -eo\-Ranking\-Select$<$ EOT $>$ selection\-Strategy; ~ &// selection strategy for creating the offspring population - a simple ranking selection in this case \\\hline -eo\-Select\-Number$<$ EOT $>$ ea\-Select( selection\-Strategy, POP\_\-SIZE ); ~ &// the number of individuals to be selected for creating the offspring population \\\hline -eo\-Ranking\-Select$<$ EOT $>$ selection\-Strategy; ~ &// selection strategy for creating the offspring population - a simple ranking selection in this case \\\hline -~ &~ \\\hline -eo\-SGATransform$<$ EOT $>$ transform( crossover, CROSS\_\-RATE, mutation, MUT\_\-RATE ); ~ &// transformation operator - crossover and mutation operators with their associated probabilities \\\hline -peo\-Seq\-Transform$<$ EOT $>$ ea\-Transform( transform ); ~ &// Paradis\-EO specific sequential operator - a parallel version may be specified in the same manner \\\hline -~ &~ \\\hline -eo\-Plus\-Replacement$<$ EOT $>$ ea\-Replace; ~ &// replacement strategy - for integrating the offspring resulting individuals in the initial population \\\hline -~ &~ \\\hline -peo\-EA$<$ EOT $>$ ea\-Alg( ea\-Checkpoint\-Continue, ea\-Pop\-Eval, ea\-Select, ea\-Transform, ea\-Replace ); ~ &// Paradis\-EO evolutionary algorithm integrating the above defined objects \\\hline -ea\-Alg( population ); ~ &// specifying the initial population for the algorithm \\\hline -... ~ &~ \\\hline -\end{TabularC} - - - - -Definition at line 54 of file pmoeo\-EA.h. - -\subsection{Constructor \& Destructor Documentation} -\index{peoEA@{peo\-EA}!peoEA@{peoEA}} -\index{peoEA@{peoEA}!peoEA@{peo\-EA}} -\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ \bf{peo\-EA}$<$ EOT $>$::\bf{peo\-EA} (\bf{eo\-Continue}$<$ EOT $>$ \& {\em \_\-\_\-cont}, peo\-Pop\-Eval$<$ EOT $>$ \& {\em \_\-\_\-pop\_\-eval}, \bf{eo\-Select}$<$ EOT $>$ \& {\em \_\-\_\-select}, peo\-Transform$<$ EOT $>$ \& {\em \_\-\_\-trans}, \bf{eo\-Replacement}$<$ EOT $>$ \& {\em \_\-\_\-replace})}\label{classpeoEA_dbfc4f8907bef234602149229f132371} - - -Constructor for the evolutionary algorithm object - several basic parameters have to be specified, allowing for different levels of parallelism. - -Depending on the requirements, a sequential or a parallel evaluation operator may be specified or, in the same manner, a sequential or a parallel transformation operator may be given as parameter. Out of the box objects may be provided, from the \doxyref{EO} package, for example, or custom defined ones may be specified, provided that they are derived from the correct base classes. - -\begin{Desc} -\item[Parameters:] -\begin{description} -\item[{\em eo\-Continue$<$}]EOT $>$\& \_\-\_\-cont - continuation criterion specifying whether the algorithm should continue or not; \item[{\em peo\-Pop\-Eval$<$}]EOT $>$\& \_\-\_\-pop\_\-eval - evaluation operator; it allows the specification of parallel evaluation operators, aggregate evaluation functions, etc.; \item[{\em eo\-Select$<$}]EOT $>$\& \_\-\_\-select - selection strategy to be applied for constructing a list of offspring individuals; \item[{\em peo\-Transform$<$}]EOT $>$\& \_\-\_\-trans - transformation operator, i.e. crossover and mutation; allows for sequential or parallel transform; \item[{\em eo\-Replacement$<$}]EOT $>$\& \_\-\_\-replace - replacement strategy for integrating the offspring individuals in the initial population; \end{description} -\end{Desc} - - -Definition at line 98 of file pmoeo\-EA.h. - -References peo\-EA$<$ EOT $>$::pop\_\-eval, and peo\-EA$<$ EOT $>$::trans. - -\subsection{Member Function Documentation} -\index{peoEA@{peo\-EA}!operator()@{operator()}} -\index{operator()@{operator()}!peoEA@{peo\-EA}} -\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void \bf{peo\-EA}$<$ EOT $>$::operator() (\bf{eo\-Pop}$<$ EOT $>$ \& {\em \_\-\_\-pop})}\label{classpeoEA_3c709e3b2491147d26fee36138644613} - - -\doxyref{Function} operator for specifying the population to be associated with the algorithm. - -\begin{Desc} -\item[Parameters:] -\begin{description} -\item[{\em eo\-Pop$<$}]EOT $>$\& \_\-\_\-pop - initial population of the algorithm, to be iteratively evolved; \end{description} -\end{Desc} - - -Definition at line 114 of file pmoeo\-EA.h. - -References peo\-EA$<$ EOT $>$::pop. - -The documentation for this class was generated from the following file:\begin{CompactItemize} -\item -pmoeo\-EA.h\end{CompactItemize} diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/doxygen.sty b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/doxygen.sty index ce4be2fee..7feb3250c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/doxygen.sty +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/doxygen.sty @@ -10,8 +10,8 @@ {\fancyplain{}{\bfseries\rightmark}} \rhead[\fancyplain{}{\bfseries\leftmark}] {\fancyplain{}{\bfseries\thepage}} -\rfoot[\fancyplain{}{\bfseries\scriptsize Generated on Mon Oct 8 10:35:51 2007 for Paradis\-EO-MOEOMoving\-Objects by Doxygen }]{} -\lfoot[]{\fancyplain{}{\bfseries\scriptsize Generated on Mon Oct 8 10:35:51 2007 for Paradis\-EO-MOEOMoving\-Objects by Doxygen }} +\rfoot[\fancyplain{}{\bfseries\scriptsize Generated on Mon Oct 8 16:37:09 2007 for Paradis\-EO-MOEOMoving\-Objects by Doxygen }]{} +\lfoot[]{\fancyplain{}{\bfseries\scriptsize Generated on Mon Oct 8 16:37:09 2007 for Paradis\-EO-MOEOMoving\-Objects by Doxygen }} \cfoot{} \newenvironment{Code} {\footnotesize} diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/hierarchy.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/hierarchy.tex index e2ff7aef0..f69c9ff97 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/hierarchy.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/hierarchy.tex @@ -45,7 +45,6 @@ This inheritance list is sorted roughly, but not completely, alphabetically:\beg \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\-IBMOLS$<$ MOEOT, Move $>$::One\-Objective\-Comparator}{\pageref{classmoeoIBMOLS_1_1OneObjectiveComparator}}{} \item \contentsline{section}{moeo\-One\-Objective\-Comparator$<$ MOEOT $>$}{\pageref{classmoeoOneObjectiveComparator}}{} \end{CompactList} \item \contentsline{section}{moeo\-Distance$<$ MOEOT, Type $>$}{\pageref{classmoeoDistance}}{} @@ -60,7 +59,6 @@ This inheritance list is sorted roughly, but not completely, alphabetically:\beg \item \contentsline{section}{moeo\-Manhattan\-Distance$<$ MOEOT $>$}{\pageref{classmoeoManhattanDistance}}{} \end{CompactList} \end{CompactList} -\item \contentsline{section}{moeo\-Move\-Incr\-Eval$<$ Move $>$}{\pageref{classmoeoMoveIncrEval}}{} \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}}{} @@ -80,13 +78,6 @@ This inheritance list is sorted roughly, but not completely, alphabetically:\beg \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$<$ eo\-Pop$<$ MOEOT $>$ \&, moeo\-Archive$<$ MOEOT $>$ \&, void $>${\tt [external]}\begin{CompactList} -\item \contentsline{section}{moeo\-LS$<$ MOEOT, eo\-Pop$<$ MOEOT $>$ \& $>$}{\pageref{classmoeoLS}}{} -\begin{CompactList} -\item \contentsline{section}{moeo\-IBMOLS$<$ MOEOT, Move $>$}{\pageref{classmoeoIBMOLS}}{} -\item \contentsline{section}{moeo\-Iterated\-IBMOLS$<$ MOEOT, Move $>$}{\pageref{classmoeoIteratedIBMOLS}}{} -\end{CompactList} -\end{CompactList} \item eo\-BF$<$ EOType \&, EOType \&, bool $>${\tt [external]}\item eo\-BF$<$ Flow\-Shop \&, Flow\-Shop \&, bool $>${\tt [external]}\begin{CompactList} \item eo\-Quad\-Op$<$ Flow\-Shop $>${\tt [external]}\begin{CompactList} \item \contentsline{section}{Flow\-Shop\-Op\-Crossover\-Quad}{\pageref{classFlowShopOpCrossoverQuad}}{} @@ -202,7 +193,6 @@ This inheritance list is sorted roughly, but not completely, alphabetically:\beg \begin{CompactList} \item \contentsline{section}{moeo\-Fast\-Non\-Dominated\-Sorting\-Fitness\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoFastNonDominatedSortingFitnessAssignment}}{} \end{CompactList} -\item \contentsline{section}{moeo\-Reference\-Point\-Indicator\-Based\-Fitness\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoReferencePointIndicatorBasedFitnessAssignment}}{} \item \contentsline{section}{moeo\-Scalar\-Fitness\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoScalarFitnessAssignment}}{} \begin{CompactList} \item \contentsline{section}{moeo\-Achievement\-Fitness\-Assignment$<$ MOEOT $>$}{\pageref{classmoeoAchievementFitnessAssignment}}{} @@ -278,7 +268,6 @@ This inheritance list is sorted roughly, but not completely, alphabetically:\beg \begin{CompactList} \item \contentsline{section}{moeo\-EA$<$ MOEOT $>$}{\pageref{classmoeoEA}}{} \item \contentsline{section}{moeo\-LS$<$ MOEOT, Type $>$}{\pageref{classmoeoLS}}{} -\item \contentsline{section}{moeo\-LS$<$ MOEOT, eo\-Pop$<$ MOEOT $>$ \& $>$}{\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}}{} @@ -292,5 +281,4 @@ This inheritance list is sorted roughly, but not completely, alphabetically:\beg \item \contentsline{section}{Flow\-Shop\-Objective\-Vector\-Traits}{\pageref{classFlowShopObjectiveVectorTraits}}{} \item \contentsline{section}{Sch1Objective\-Vector\-Traits}{\pageref{classSch1ObjectiveVectorTraits}}{} \end{CompactList} -\item \contentsline{section}{peo\-EA$<$ EOT $>$}{\pageref{classpeoEA}}{} \end{CompactList} diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/main.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/main.tex index 5a84598cc..2a7600c7e 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/main.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/main.tex @@ -2,7 +2,7 @@ Paradis\-EO-MOEO is a white-box object-oriented generic framework dedicated to the flexible design of evolutionary multi-objective algorithms. This paradigm-free software embeds some features and techniques for Pareto-based resolution and aims to provide a set of classes allowing to ease and speed up the development of computationally efficient programs. It is based on a clear conceptual distinction between the solution methods and the multi-objective problems they are intended to solve. This separation confers a maximum design and code reuse. Paradis\-EO-MOEO provides a broad range of archive-related features (such as elitism or performance metrics) and the most common Pareto-based fitness assignment strategies (MOGA, NSGA, SPEA, IBEA and more). Furthermore, parallel and distributed models as well as hybridization mechanisms can be applied to an algorithm designed within Paradis\-EO-MOEO using the whole version of Paradis\-EO.\section{Tutorials}\label{main_tutorials} Tutorials for Paradis\-EO-MOEO are available {\tt here}.\section{Installation}\label{main_Installation} The installation procedure of the package is detailed in the README file in the top-directory of the source-tree.\section{Design}\label{main_Design} -For an introduction to the design of Paradis\-EO-MOEO, you can look at the {\tt Paradis\-EO website}.\section{LICENCE}\label{main_LICENCE} +For an introduction to the design of Paradis\-EO-MOEO, you can look at the {\tt Paradis\-EO website}.\section{LICENSE}\label{main_LICENSE} This software is governed by the Ce\-CILL license under French law and abiding by the rules of distribution of free software. You can use, modify and/ or redistribute the software under the terms of the Ce\-CILL license as circulated by CEA, CNRS and INRIA at the following URL \char`\"{}http://www.cecill.info\char`\"{}. As a counterpart to the access to the source code and rights to copy, modify and redistribute granted by the license, users are provided only with a limited warranty and the software's author, the holder of the economic rights, and the successive licensors have only limited liability. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/refman.tex b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/refman.tex index 3d88d9191..e235ea212 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/refman.tex +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/latex/refman.tex @@ -19,7 +19,7 @@ \vspace*{1cm} {\large Generated by Doxygen 1.4.7}\\ \vspace*{0.5cm} -{\small Mon Oct 8 10:35:51 2007}\\ +{\small Mon Oct 8 16:37:09 2007}\\ \end{center} \end{titlepage} \clearemptydoublepage @@ -91,14 +91,10 @@ \include{classmoeoHybridLS} \include{classmoeoHypervolumeBinaryMetric} \include{classmoeoIBEA} -\include{classmoeoIBMOLS} -\include{classmoeoIBMOLS_1_1OneObjectiveComparator} \include{classmoeoIndicatorBasedFitnessAssignment} -\include{classmoeoIteratedIBMOLS} \include{classmoeoLS} \include{classmoeoManhattanDistance} \include{classmoeoMetric} -\include{classmoeoMoveIncrEval} \include{classmoeoNormalizedDistance} \include{classmoeoNormalizedSolutionVsSolutionBinaryMetric} \include{classmoeoNSGA} @@ -113,7 +109,6 @@ \include{classmoeoRandomSelect} \include{classmoeoRealObjectiveVector} \include{classmoeoRealVector} -\include{classmoeoReferencePointIndicatorBasedFitnessAssignment} \include{classmoeoReplacement} \include{classmoeoRouletteSelect} \include{classmoeoScalarFitnessAssignment} @@ -128,7 +123,6 @@ \include{classmoeoVector} \include{classmoeoVectorUnaryMetric} \include{classmoeoVectorVsVectorBinaryMetric} -\include{classpeoEA} \include{classSch1} \include{classSch1Eval} \include{classSch1ObjectiveVectorTraits} diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShop.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShop.3 index 9e706c47c..56d651aff 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShop.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShop.3 @@ -24,7 +24,7 @@ Inherits \fBmoeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneTyp .PP Structure of the genotype for the flow-shop scheduling problem: a vector of unsigned int int. .PP -Definition at line 22 of file FlowShop.h. +Definition at line 47 of file FlowShop.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopBenchmarkParser.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopBenchmarkParser.3 index f72583422..e4be99837 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopBenchmarkParser.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopBenchmarkParser.3 @@ -70,7 +70,7 @@ FlowShopBenchmarkParser \- Class to handle parameters of a flow-shop instance fr .PP Class to handle parameters of a flow-shop instance from a benchmark file. .PP -Definition at line 23 of file FlowShopBenchmarkParser.h. +Definition at line 48 of file FlowShopBenchmarkParser.h. .SH "Constructor & Destructor Documentation" .PP .SS "FlowShopBenchmarkParser::FlowShopBenchmarkParser (const std::string _benchmarkFileName)" @@ -84,7 +84,7 @@ Ctor. .PP .PP -Definition at line 16 of file FlowShopBenchmarkParser.cpp. +Definition at line 41 of file FlowShopBenchmarkParser.cpp. .PP References init(). .SH "Member Function Documentation" @@ -95,7 +95,7 @@ printing. .PP .. .PP -Definition at line 46 of file FlowShopBenchmarkParser.cpp. +Definition at line 71 of file FlowShopBenchmarkParser.cpp. .PP References d, M, N, and p. .SS "void FlowShopBenchmarkParser::init (const std::string _benchmarkFileName)\fC [private]\fP" @@ -109,7 +109,7 @@ Initialisation of the parameters with the data contained in the benchmark file. .PP .PP -Definition at line 64 of file FlowShopBenchmarkParser.cpp. +Definition at line 89 of file FlowShopBenchmarkParser.cpp. .PP References d, M, N, and p. .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopEval.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopEval.3 index 494aa09b5..7b58de67e 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopEval.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopEval.3 @@ -64,7 +64,7 @@ Inherits \fBmoeoEvalFunc< FlowShop >\fP. .PP Evaluation of the objective vector a (multi-objective) \fBFlowShop\fP object. .PP -Definition at line 23 of file FlowShopEval.h. +Definition at line 48 of file FlowShopEval.h. .SH "Constructor & Destructor Documentation" .PP .SS "FlowShopEval::FlowShopEval (unsigned int _M, unsigned int _N, const std::vector< std::vector< unsigned int > > & _p, const std::vector< unsigned int > & _d)" @@ -84,7 +84,7 @@ Ctor. .PP .PP -Definition at line 16 of file FlowShopEval.cpp. +Definition at line 41 of file FlowShopEval.cpp. .SH "Member Function Documentation" .PP .SS "void FlowShopEval::operator() (\fBFlowShop\fP & _flowshop)" @@ -98,7 +98,7 @@ computation of the multi-objective evaluation of a \fBFlowShop\fP object .PP .PP -Definition at line 21 of file FlowShopEval.cpp. +Definition at line 46 of file FlowShopEval.cpp. .PP References makespan(), MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::objectiveVector(), and tardiness(). .SS "double FlowShopEval::makespan (const \fBFlowShop\fP & _flowshop)\fC [private]\fP" @@ -112,7 +112,7 @@ computation of the makespan .PP .PP -Definition at line 31 of file FlowShopEval.cpp. +Definition at line 56 of file FlowShopEval.cpp. .PP References completionTime(), M, and N. .PP @@ -128,7 +128,7 @@ computation of the tardiness .PP .PP -Definition at line 40 of file FlowShopEval.cpp. +Definition at line 65 of file FlowShopEval.cpp. .PP References completionTime(), d, M, and N. .PP @@ -144,7 +144,7 @@ computation of the completion times of a scheduling (for each job on each machin .PP .PP -Definition at line 53 of file FlowShopEval.cpp. +Definition at line 78 of file FlowShopEval.cpp. .PP References M, N, and p. .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopInit.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopInit.3 index daac1acff..da9967a5d 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopInit.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopInit.3 @@ -36,7 +36,7 @@ Inherits \fBeoInit< FlowShop >\fP. .PP Initialization of a random genotype built by the default constructor of the \fBFlowShop\fP class. .PP -Definition at line 22 of file FlowShopInit.h. +Definition at line 47 of file FlowShopInit.h. .SH "Constructor & Destructor Documentation" .PP .SS "FlowShopInit::FlowShopInit (unsigned int _N)" @@ -50,7 +50,7 @@ Ctor. .PP .PP -Definition at line 16 of file FlowShopInit.cpp. +Definition at line 41 of file FlowShopInit.cpp. .SH "Member Function Documentation" .PP .SS "void FlowShopInit::operator() (\fBFlowShop\fP & _flowshop)" @@ -64,7 +64,7 @@ builds a random genotype .PP .PP -Definition at line 20 of file FlowShopInit.cpp. +Definition at line 45 of file FlowShopInit.cpp. .PP References MOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::invalidate(), N, eoRng::uniform(), and moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >::value(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopObjectiveVectorTraits.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopObjectiveVectorTraits.3 index c0037a4a5..c638aaf9b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopObjectiveVectorTraits.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopObjectiveVectorTraits.3 @@ -32,7 +32,7 @@ Inherits \fBmoeoObjectiveVectorTraits\fP. .PP Definition of the objective vector traits for multi-objective flow-shop problems. .PP -Definition at line 21 of file FlowShopObjectiveVectorTraits.h. +Definition at line 46 of file FlowShopObjectiveVectorTraits.h. .SH "Member Function Documentation" .PP .SS "bool FlowShopObjectiveVectorTraits::minimizing (int _i)\fC [static]\fP" @@ -46,7 +46,7 @@ Returns true if the _ith objective have to be minimzed. .PP .PP -Definition at line 16 of file FlowShopObjectiveVectorTraits.cpp. +Definition at line 41 of file FlowShopObjectiveVectorTraits.cpp. .SS "bool FlowShopObjectiveVectorTraits::maximizing (int _i)\fC [static]\fP" .PP Returns true if the _ith objective have to be maximzed. @@ -58,7 +58,7 @@ Returns true if the _ith objective have to be maximzed. .PP .PP -Definition at line 22 of file FlowShopObjectiveVectorTraits.cpp. +Definition at line 47 of file FlowShopObjectiveVectorTraits.cpp. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopOpCrossoverQuad.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopOpCrossoverQuad.3 index 145fb7989..71d330a14 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopOpCrossoverQuad.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopOpCrossoverQuad.3 @@ -36,7 +36,7 @@ Inherits \fBeoQuadOp< FlowShop >\fP. .PP Quadratic crossover operator for flow-shop (modify the both genotypes). .PP -Definition at line 22 of file FlowShopOpCrossoverQuad.h. +Definition at line 47 of file FlowShopOpCrossoverQuad.h. .SH "Member Function Documentation" .PP .SS "bool FlowShopOpCrossoverQuad::operator() (\fBFlowShop\fP & _flowshop1, \fBFlowShop\fP & _flowshop2)\fC [virtual]\fP" @@ -56,7 +56,7 @@ _copies_ of the parents .PP Implements \fBeoBF< FlowShop &, FlowShop &, bool >\fP. .PP -Definition at line 22 of file FlowShopOpCrossoverQuad.cpp. +Definition at line 47 of file FlowShopOpCrossoverQuad.cpp. .PP References generateOffspring(), eoRng::random(), and moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >::value(). .SS "\fBFlowShop\fP FlowShopOpCrossoverQuad::generateOffspring (const \fBFlowShop\fP & _parent1, const \fBFlowShop\fP & _parent2, unsigned int _point1, unsigned int _point2)\fC [private]\fP" @@ -76,7 +76,7 @@ generation of an offspring by a 2 points crossover .PP .PP -Definition at line 54 of file FlowShopOpCrossoverQuad.cpp. +Definition at line 79 of file FlowShopOpCrossoverQuad.cpp. .PP Referenced by operator()(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopOpMutationExchange.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopOpMutationExchange.3 index b91193066..427573c5f 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopOpMutationExchange.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopOpMutationExchange.3 @@ -28,7 +28,7 @@ Inherits \fBeoMonOp< FlowShop >\fP. .PP Exchange mutation operator for the flow-shop. .PP -Definition at line 22 of file FlowShopOpMutationExchange.h. +Definition at line 47 of file FlowShopOpMutationExchange.h. .SH "Member Function Documentation" .PP .SS "bool FlowShopOpMutationExchange::operator() (\fBFlowShop\fP & _flowshop)\fC [virtual]\fP" @@ -44,7 +44,7 @@ modifies the parent with an exchange mutation .PP Implements \fBeoUF< FlowShop &, bool >\fP. .PP -Definition at line 22 of file FlowShopOpMutationExchange.cpp. +Definition at line 47 of file FlowShopOpMutationExchange.cpp. .PP References eoRng::random(), and moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >::value(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopOpMutationShift.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopOpMutationShift.3 index 0c9fe814d..13c8dac32 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopOpMutationShift.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/FlowShopOpMutationShift.3 @@ -28,7 +28,7 @@ Inherits \fBeoMonOp< FlowShop >\fP. .PP Shift mutation operator for flow-shop. .PP -Definition at line 22 of file FlowShopOpMutationShift.h. +Definition at line 47 of file FlowShopOpMutationShift.h. .SH "Member Function Documentation" .PP .SS "bool FlowShopOpMutationShift::operator() (\fBFlowShop\fP & _flowshop)\fC [virtual]\fP" @@ -44,7 +44,7 @@ modifies the parent with a shift mutation .PP Implements \fBeoUF< FlowShop &, bool >\fP. .PP -Definition at line 22 of file FlowShopOpMutationShift.cpp. +Definition at line 47 of file FlowShopOpMutationShift.cpp. .PP References eoRng::random(), and moeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >::value(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/MOEO.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/MOEO.3 index 9742ed138..7f97c079b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/MOEO.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/MOEO.3 @@ -150,7 +150,7 @@ Base class allowing to represent a solution (an individual) for multi-objective The template argument MOEOObjectiveVector allows to represent the solution in the objective space (it can be a \fBmoeoObjectiveVector\fP 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 \fBEO\fP) 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. .PP -Definition at line 34 of file MOEO.h. +Definition at line 59 of file MOEO.h. .SH "Member Function Documentation" .PP .SS "template void \fBMOEO\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::objectiveVector (const \fBObjectiveVector\fP & _objectiveVectorValue)\fC [inline]\fP" @@ -164,7 +164,7 @@ Sets the objective vector of the current solution. .PP .PP -Definition at line 85 of file MOEO.h. +Definition at line 110 of file MOEO.h. .SS "template void \fBMOEO\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::fitness (const \fBFitness\fP & _fitnessValue)\fC [inline]\fP" .PP Sets the fitness value of the current solution. @@ -176,7 +176,7 @@ Sets the fitness value of the current solution. .PP .PP -Definition at line 127 of file MOEO.h. +Definition at line 152 of file MOEO.h. .SS "template void \fBMOEO\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::diversity (const \fBDiversity\fP & _diversityValue)\fC [inline]\fP" .PP Sets the diversity value of the current solution. @@ -188,7 +188,7 @@ Sets the diversity value of the current solution. .PP .PP -Definition at line 169 of file MOEO.h. +Definition at line 194 of file MOEO.h. .SS "template bool \fBMOEO\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::operator< (const \fBMOEO\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity > & _other) const\fC [inline]\fP" .PP 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). @@ -202,7 +202,7 @@ You should implement another function in the sub-class of \fBMOEO\fP to have ano .PP .PP -Definition at line 220 of file MOEO.h. +Definition at line 245 of file MOEO.h. .SS "template virtual void \fBMOEO\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::printOn (std::ostream & _os) const\fC [inline, virtual]\fP" .PP Writing object. @@ -218,7 +218,7 @@ Reimplemented from \fBEO< MOEOObjectiveVector >\fP. .PP Reimplemented in \fBmoeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >\fP, \fBmoeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >\fP, \fBmoeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool >\fP, \fBmoeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, double >\fP, \fBmoeoVector< moeoRealObjectiveVector< FlowShopObjectiveVectorTraits >, double, double, unsigned int >\fP, and \fBmoeoVector< moeoRealObjectiveVector< Sch1ObjectiveVectorTraits >, double, double, double >\fP. .PP -Definition at line 239 of file MOEO.h. +Definition at line 264 of file MOEO.h. .SS "template virtual void \fBMOEO\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::readFrom (std::istream & _is)\fC [inline, virtual]\fP" .PP Reading object. @@ -234,7 +234,7 @@ Reimplemented from \fBEO< MOEOObjectiveVector >\fP. .PP Reimplemented in \fBmoeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >\fP, \fBmoeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >\fP, \fBmoeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool >\fP, \fBmoeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, double >\fP, \fBmoeoVector< moeoRealObjectiveVector< FlowShopObjectiveVectorTraits >, double, double, unsigned int >\fP, and \fBmoeoVector< moeoRealObjectiveVector< Sch1ObjectiveVectorTraits >, double, double, double >\fP. .PP -Definition at line 256 of file MOEO.h. +Definition at line 281 of file MOEO.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/Sch1.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/Sch1.3 index 662313cd3..688c60993 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/Sch1.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/Sch1.3 @@ -17,7 +17,7 @@ Inherits \fBmoeoRealVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >< m .in -1c .SH "Detailed Description" .PP -Definition at line 44 of file Sch1.cpp. +Definition at line 69 of file Sch1.cpp. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/Sch1Eval.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/Sch1Eval.3 index cec0251f9..b17927067 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/Sch1Eval.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/Sch1Eval.3 @@ -17,7 +17,7 @@ Inherits \fBmoeoEvalFunc< Sch1 >\fP. .in -1c .SH "Detailed Description" .PP -Definition at line 52 of file Sch1.cpp. +Definition at line 77 of file Sch1.cpp. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/Sch1ObjectiveVectorTraits.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/Sch1ObjectiveVectorTraits.3 index 800dfaad9..5ae87310f 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/Sch1ObjectiveVectorTraits.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/Sch1ObjectiveVectorTraits.3 @@ -24,7 +24,7 @@ Inherits \fBmoeoObjectiveVectorTraits\fP. .in -1c .SH "Detailed Description" .PP -Definition at line 21 of file Sch1.cpp. +Definition at line 46 of file Sch1.cpp. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAchievementFitnessAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAchievementFitnessAssignment.3 index a1776de35..7746e9a8e 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAchievementFitnessAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAchievementFitnessAssignment.3 @@ -78,7 +78,7 @@ Inherits \fBmoeoScalarFitnessAssignment< MOEOT >< MOEOT >\fP. .SS "template class moeoAchievementFitnessAssignment< MOEOT >" Fitness assignment sheme based on the achievement scalarizing function propozed by Wiersbicki (1980). .PP -Definition at line 24 of file moeoAchievementFitnessAssignment.h. +Definition at line 49 of file moeoAchievementFitnessAssignment.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoAchievementFitnessAssignment\fP< MOEOT >::\fBmoeoAchievementFitnessAssignment\fP (\fBObjectiveVector\fP & _reference, std::vector< double > & _lambdas, double _spn = \fC0.0001\fP)\fC [inline]\fP" @@ -96,7 +96,7 @@ Default ctor. .PP .PP -Definition at line 38 of file moeoAchievementFitnessAssignment.h. +Definition at line 63 of file moeoAchievementFitnessAssignment.h. .PP References moeoAchievementFitnessAssignment< MOEOT >::spn. .SS "template \fBmoeoAchievementFitnessAssignment\fP< MOEOT >::\fBmoeoAchievementFitnessAssignment\fP (\fBObjectiveVector\fP & _reference, double _spn = \fC0.0001\fP)\fC [inline]\fP" @@ -112,7 +112,7 @@ Ctor with default values for lambdas (1/nObjectives). .PP .PP -Definition at line 54 of file moeoAchievementFitnessAssignment.h. +Definition at line 79 of file moeoAchievementFitnessAssignment.h. .PP References moeoAchievementFitnessAssignment< MOEOT >::lambdas, and moeoAchievementFitnessAssignment< MOEOT >::spn. .SH "Member Function Documentation" @@ -130,7 +130,7 @@ Sets the fitness values for every solution contained in the population _pop. .PP Implements \fBeoUF< eoPop< MOEOT > &, void >\fP. .PP -Definition at line 75 of file moeoAchievementFitnessAssignment.h. +Definition at line 100 of file moeoAchievementFitnessAssignment.h. .PP References moeoAchievementFitnessAssignment< MOEOT >::compute(). .SS "template void \fBmoeoAchievementFitnessAssignment\fP< MOEOT >::updateByDeleting (\fBeoPop\fP< MOEOT > & _pop, \fBObjectiveVector\fP & _objVec)\fC [inline, virtual]\fP" @@ -148,7 +148,7 @@ Updates the fitness values of the whole population _pop by taking the deletion o .PP Implements \fBmoeoFitnessAssignment< MOEOT >\fP. .PP -Definition at line 89 of file moeoAchievementFitnessAssignment.h. +Definition at line 114 of file moeoAchievementFitnessAssignment.h. .SS "template void \fBmoeoAchievementFitnessAssignment\fP< MOEOT >::setReference (const \fBObjectiveVector\fP & _reference)\fC [inline]\fP" .PP Sets the reference point. @@ -160,7 +160,7 @@ Sets the reference point. .PP .PP -Definition at line 99 of file moeoAchievementFitnessAssignment.h. +Definition at line 124 of file moeoAchievementFitnessAssignment.h. .PP References moeoAchievementFitnessAssignment< MOEOT >::reference. .SS "template void \fBmoeoAchievementFitnessAssignment\fP< MOEOT >::compute (MOEOT & _moeo)\fC [inline, private]\fP" @@ -174,7 +174,7 @@ Computes the fitness value for a solution. .PP .PP -Definition at line 128 of file moeoAchievementFitnessAssignment.h. +Definition at line 153 of file moeoAchievementFitnessAssignment.h. .PP References moeoAchievementFitnessAssignment< MOEOT >::inf(), moeoAchievementFitnessAssignment< MOEOT >::lambdas, moeoAchievementFitnessAssignment< MOEOT >::reference, and moeoAchievementFitnessAssignment< MOEOT >::spn. .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAdditiveEpsilonBinaryMetric.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAdditiveEpsilonBinaryMetric.3 index 37a510c96..c458da858 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAdditiveEpsilonBinaryMetric.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAdditiveEpsilonBinaryMetric.3 @@ -36,7 +36,7 @@ Additive epsilon binary metric allowing to compare two objective vectors as prop 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). .PP -Definition at line 24 of file moeoAdditiveEpsilonBinaryMetric.h. +Definition at line 49 of file moeoAdditiveEpsilonBinaryMetric.h. .SH "Member Function Documentation" .PP .SS "template double \fBmoeoAdditiveEpsilonBinaryMetric\fP< ObjectiveVector >::operator() (const ObjectiveVector & _o1, const ObjectiveVector & _o2)\fC [inline]\fP" @@ -57,7 +57,7 @@ don't forget to set the bounds for every objective before the call of this funct .PP .PP -Definition at line 35 of file moeoAdditiveEpsilonBinaryMetric.h. +Definition at line 60 of file moeoAdditiveEpsilonBinaryMetric.h. .PP References moeoAdditiveEpsilonBinaryMetric< ObjectiveVector >::epsilon(). .SS "template double \fBmoeoAdditiveEpsilonBinaryMetric\fP< ObjectiveVector >::epsilon (const ObjectiveVector & _o1, const ObjectiveVector & _o2, const unsigned int _obj)\fC [inline, private]\fP" @@ -75,7 +75,7 @@ Returns the epsilon value by which the objective vector _o1 must be translated i .PP .PP -Definition at line 64 of file moeoAdditiveEpsilonBinaryMetric.h. +Definition at line 89 of file moeoAdditiveEpsilonBinaryMetric.h. .PP References moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double >::bounds. .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAggregativeComparator.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAggregativeComparator.3 index 08ed4c989..2b88b2de2 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAggregativeComparator.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAggregativeComparator.3 @@ -42,7 +42,7 @@ Inherits \fBmoeoComparator< MOEOT >< MOEOT >\fP. .SS "template class moeoAggregativeComparator< MOEOT >" Functor allowing to compare two solutions according to their fitness and diversity values, each according to its aggregative value. .PP -Definition at line 22 of file moeoAggregativeComparator.h. +Definition at line 47 of file moeoAggregativeComparator.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoAggregativeComparator\fP< MOEOT >::\fBmoeoAggregativeComparator\fP (double _weightFitness = \fC1.0\fP, double _weightDiversity = \fC1.0\fP)\fC [inline]\fP" @@ -58,7 +58,7 @@ Ctor. .PP .PP -Definition at line 31 of file moeoAggregativeComparator.h. +Definition at line 56 of file moeoAggregativeComparator.h. .SH "Member Function Documentation" .PP .SS "template const bool \fBmoeoAggregativeComparator\fP< MOEOT >::operator() (const MOEOT & _moeo1, const MOEOT & _moeo2)\fC [inline]\fP" @@ -74,7 +74,7 @@ Returns true if _moeo1 < _moeo2 according to the aggregation of their fitness an .PP .PP -Definition at line 40 of file moeoAggregativeComparator.h. +Definition at line 65 of file moeoAggregativeComparator.h. .PP References moeoAggregativeComparator< MOEOT >::weightDiversity, and moeoAggregativeComparator< MOEOT >::weightFitness. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAlgo.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAlgo.3 index d0de617fa..42b8a60e2 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAlgo.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoAlgo.3 @@ -10,13 +10,13 @@ moeoAlgo \- Abstract class for multi-objective algorithms. .PP \fC#include \fP .PP -Inherited by \fBmoeoEA< MOEOT >\fP, \fBmoeoLS< MOEOT, Type >\fP, \fBmoeoLS< MOEOT, eoPop< MOEOT > & >\fP, and \fBmoeoLS< MOEOT, MOEOT >\fP. +Inherited by \fBmoeoEA< MOEOT >\fP, \fBmoeoLS< MOEOT, Type >\fP, and \fBmoeoLS< MOEOT, MOEOT >\fP. .PP .SH "Detailed Description" .PP Abstract class for multi-objective algorithms. .PP -Definition at line 19 of file moeoAlgo.h. +Definition at line 44 of file moeoAlgo.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoArchive.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoArchive.3 index f3cac03fb..3c50e84b3 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoArchive.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoArchive.3 @@ -70,7 +70,7 @@ Inherits \fBeoPop< MOEOT >\fP. .SS "template class moeoArchive< MOEOT >" An archive is a secondary population that stores non-dominated solutions. .PP -Definition at line 24 of file moeoArchive.h. +Definition at line 49 of file moeoArchive.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoArchive\fP< MOEOT >::\fBmoeoArchive\fP ()\fC [inline]\fP" @@ -79,7 +79,7 @@ Default ctor. .PP The \fBmoeoObjectiveVectorComparator\fP used to compare solutions is based on Pareto dominance .PP -Definition at line 44 of file moeoArchive.h. +Definition at line 69 of file moeoArchive.h. .SS "template \fBmoeoArchive\fP< MOEOT >::\fBmoeoArchive\fP (\fBmoeoObjectiveVectorComparator\fP< \fBObjectiveVector\fP > & _comparator)\fC [inline]\fP" .PP Ctor. @@ -91,7 +91,7 @@ Ctor. .PP .PP -Definition at line 52 of file moeoArchive.h. +Definition at line 77 of file moeoArchive.h. .SH "Member Function Documentation" .PP .SS "template bool \fBmoeoArchive\fP< MOEOT >::dominates (const \fBObjectiveVector\fP & _objectiveVector) const\fC [inline]\fP" @@ -105,7 +105,7 @@ Returns true if the current archive dominates _objectiveVector according to the .PP .PP -Definition at line 60 of file moeoArchive.h. +Definition at line 85 of file moeoArchive.h. .PP References moeoArchive< MOEOT >::comparator. .SS "template bool \fBmoeoArchive\fP< MOEOT >::contains (const \fBObjectiveVector\fP & _objectiveVector) const\fC [inline]\fP" @@ -119,7 +119,7 @@ Returns true if the current archive already contains a solution with the same ob .PP .PP -Definition at line 78 of file moeoArchive.h. +Definition at line 103 of file moeoArchive.h. .PP Referenced by moeoArchive< MOEOT >::equals(). .SS "template void \fBmoeoArchive\fP< MOEOT >::update (const MOEOT & _moeo)\fC [inline]\fP" @@ -133,11 +133,11 @@ Updates the archive with a given individual _moeo. .PP .PP -Definition at line 95 of file moeoArchive.h. +Definition at line 120 of file moeoArchive.h. .PP References moeoArchive< MOEOT >::comparator. .PP -Referenced by moeoIteratedIBMOLS< MOEOT, Move >::operator()(), moeoIBMOLS< MOEOT, Move >::operator()(), and moeoArchive< MOEOT >::update(). +Referenced by moeoArchive< MOEOT >::update(). .SS "template void \fBmoeoArchive\fP< MOEOT >::update (const \fBeoPop\fP< MOEOT > & _pop)\fC [inline]\fP" .PP Updates the archive with a given population _pop. @@ -149,7 +149,7 @@ Updates the archive with a given population _pop. .PP .PP -Definition at line 138 of file moeoArchive.h. +Definition at line 163 of file moeoArchive.h. .PP References moeoArchive< MOEOT >::update(). .SS "template bool \fBmoeoArchive\fP< MOEOT >::equals (const \fBmoeoArchive\fP< MOEOT > & _arch)\fC [inline]\fP" @@ -163,11 +163,9 @@ Returns true if the current archive contains the same objective vectors than the .PP .PP -Definition at line 151 of file moeoArchive.h. +Definition at line 176 of file moeoArchive.h. .PP References moeoArchive< MOEOT >::contains(). -.PP -Referenced by moeoIBMOLS< MOEOT, Move >::operator()(). .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoArchiveObjectiveVectorSavingUpdater.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoArchiveObjectiveVectorSavingUpdater.3 index b30c175fb..b9e5af56b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoArchiveObjectiveVectorSavingUpdater.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoArchiveObjectiveVectorSavingUpdater.3 @@ -54,7 +54,7 @@ Inherits \fBeoUpdater\fP. .SS "template class moeoArchiveObjectiveVectorSavingUpdater< MOEOT >" This class allows to save the objective vectors of the solutions contained in an archive into a file at each generation. .PP -Definition at line 28 of file moeoArchiveObjectiveVectorSavingUpdater.h. +Definition at line 53 of file moeoArchiveObjectiveVectorSavingUpdater.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoArchiveObjectiveVectorSavingUpdater\fP< MOEOT >::\fBmoeoArchiveObjectiveVectorSavingUpdater\fP (\fBmoeoArchive\fP< MOEOT > & _arch, const std::string & _filename, bool _count = \fCfalse\fP, int _id = \fC-1\fP)\fC [inline]\fP" @@ -74,7 +74,7 @@ Ctor. .PP .PP -Definition at line 39 of file moeoArchiveObjectiveVectorSavingUpdater.h. +Definition at line 64 of file moeoArchiveObjectiveVectorSavingUpdater.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoArchiveUpdater.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoArchiveUpdater.3 index 3841fa313..125b9c0b5 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoArchiveUpdater.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoArchiveUpdater.3 @@ -42,7 +42,7 @@ Inherits \fBeoUpdater\fP. .SS "template class moeoArchiveUpdater< MOEOT >" This class allows to update the archive at each generation with newly found non-dominated solutions. .PP -Definition at line 24 of file moeoArchiveUpdater.h. +Definition at line 49 of file moeoArchiveUpdater.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoArchiveUpdater\fP< MOEOT >::\fBmoeoArchiveUpdater\fP (\fBmoeoArchive\fP< MOEOT > & _arch, const \fBeoPop\fP< MOEOT > & _pop)\fC [inline]\fP" @@ -58,7 +58,7 @@ Ctor. .PP .PP -Definition at line 33 of file moeoArchiveUpdater.h. +Definition at line 58 of file moeoArchiveUpdater.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBinaryIndicatorBasedFitnessAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBinaryIndicatorBasedFitnessAssignment.3 index fe17a35af..6e0c574f2 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBinaryIndicatorBasedFitnessAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBinaryIndicatorBasedFitnessAssignment.3 @@ -36,7 +36,7 @@ Inherited by \fBmoeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >\fP. .SS "template class moeoBinaryIndicatorBasedFitnessAssignment< MOEOT >" \fBmoeoIndicatorBasedFitnessAssignment\fP for binary indicators. .PP -Definition at line 22 of file moeoBinaryIndicatorBasedFitnessAssignment.h. +Definition at line 47 of file moeoBinaryIndicatorBasedFitnessAssignment.h. .SH "Member Function Documentation" .PP .SS "template virtual double \fBmoeoBinaryIndicatorBasedFitnessAssignment\fP< MOEOT >::updateByAdding (\fBeoPop\fP< MOEOT > & _pop, \fBObjectiveVector\fP & _objVec)\fC [pure virtual]\fP" diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBinaryMetric.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBinaryMetric.3 index 931db9a79..af43d7d2b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBinaryMetric.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBinaryMetric.3 @@ -20,7 +20,7 @@ Inherited by \fBmoeoSolutionVsSolutionBinaryMetric< ObjectiveVector, R >\fP, \fB .SS "template class moeoBinaryMetric< A1, A2, R >" Base class for binary metrics. .PP -Definition at line 36 of file moeoMetric.h. +Definition at line 61 of file moeoMetric.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBinaryMetricSavingUpdater.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBinaryMetricSavingUpdater.3 index 613bf705f..46413fe14 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBinaryMetricSavingUpdater.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBinaryMetricSavingUpdater.3 @@ -66,7 +66,7 @@ Inherits \fBeoUpdater\fP. .SS "template class 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. .PP -Definition at line 28 of file moeoBinaryMetricSavingUpdater.h. +Definition at line 53 of file moeoBinaryMetricSavingUpdater.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoBinaryMetricSavingUpdater\fP< MOEOT >::\fBmoeoBinaryMetricSavingUpdater\fP (\fBmoeoVectorVsVectorBinaryMetric\fP< \fBObjectiveVector\fP, double > & _metric, const \fBeoPop\fP< MOEOT > & _pop, std::string _filename)\fC [inline]\fP" @@ -84,7 +84,7 @@ Ctor. .PP .PP -Definition at line 42 of file moeoBinaryMetricSavingUpdater.h. +Definition at line 67 of file moeoBinaryMetricSavingUpdater.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBitVector.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBitVector.3 index 8eee4ecca..0321b479d 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBitVector.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoBitVector.3 @@ -38,7 +38,7 @@ Inherits \fBmoeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool >\ .SS "template class moeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >" This class is an implementationeo of a simple bit-valued \fBmoeoVector\fP. .PP -Definition at line 22 of file moeoBitVector.h. +Definition at line 47 of file moeoBitVector.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoBitVector\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::\fBmoeoBitVector\fP (unsigned int _size = \fC0\fP, bool _value = \fCfalse\fP)\fC [inline]\fP" @@ -54,7 +54,7 @@ Ctor. .PP .PP -Definition at line 37 of file moeoBitVector.h. +Definition at line 62 of file moeoBitVector.h. .SH "Member Function Documentation" .PP .SS "template virtual void \fBmoeoBitVector\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::printOn (std::ostream & _os) const\fC [inline, virtual]\fP" @@ -70,7 +70,7 @@ Writing object. .PP Reimplemented from \fBmoeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool >\fP. .PP -Definition at line 54 of file moeoBitVector.h. +Definition at line 79 of file moeoBitVector.h. .SS "template virtual void \fBmoeoBitVector\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::readFrom (std::istream & _is)\fC [inline, virtual]\fP" .PP Reading object. @@ -84,7 +84,7 @@ Reading object. .PP Reimplemented from \fBmoeoVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity, bool >\fP. .PP -Definition at line 67 of file moeoBitVector.h. +Definition at line 92 of file moeoBitVector.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoCombinedLS.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoCombinedLS.3 index 7d3633f9d..9f15b3814 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoCombinedLS.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoCombinedLS.3 @@ -42,7 +42,7 @@ Inherits \fBmoeoLS< MOEOT, Type >< MOEOT, Type >\fP. .SS "template class 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. .PP -Definition at line 25 of file moeoCombinedLS.h. +Definition at line 50 of file moeoCombinedLS.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoCombinedLS\fP< MOEOT, Type >::\fBmoeoCombinedLS\fP (\fBmoeoLS\fP< MOEOT, Type > & _first_mols)\fC [inline]\fP" @@ -56,7 +56,7 @@ Ctor. .PP .PP -Definition at line 33 of file moeoCombinedLS.h. +Definition at line 58 of file moeoCombinedLS.h. .PP References moeoCombinedLS< MOEOT, Type >::combinedLS. .SH "Member Function Documentation" @@ -72,7 +72,7 @@ Adds a new local search to combine. .PP .PP -Definition at line 42 of file moeoCombinedLS.h. +Definition at line 67 of file moeoCombinedLS.h. .PP References moeoCombinedLS< MOEOT, Type >::combinedLS. .SS "template void \fBmoeoCombinedLS\fP< MOEOT, Type >::operator() (Type _type, \fBmoeoArchive\fP< MOEOT > & _arch)\fC [inline, virtual]\fP" @@ -92,7 +92,7 @@ The new non-dominated solutions are added to the archive .PP Implements \fBeoBF< Type, moeoArchive< MOEOT > &, void >\fP. .PP -Definition at line 53 of file moeoCombinedLS.h. +Definition at line 78 of file moeoCombinedLS.h. .PP References moeoCombinedLS< MOEOT, Type >::combinedLS. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoComparator.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoComparator.3 index 850f75ff7..21faaad9b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoComparator.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoComparator.3 @@ -12,7 +12,7 @@ moeoComparator \- Functor allowing to compare two solutions. .PP Inherits \fBeoBF< A1, A2, R >< const const MOEOT &, MOEOT &, bool >\fP. .PP -Inherited by \fBmoeoAggregativeComparator< MOEOT >\fP, \fBmoeoDiversityThenFitnessComparator< MOEOT >\fP, \fBmoeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator\fP, \fBmoeoFitnessThenDiversityComparator< MOEOT >\fP, \fBmoeoIBMOLS< MOEOT, Move >::OneObjectiveComparator\fP, and \fBmoeoOneObjectiveComparator< MOEOT >\fP. +Inherited by \fBmoeoAggregativeComparator< MOEOT >\fP, \fBmoeoDiversityThenFitnessComparator< MOEOT >\fP, \fBmoeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator\fP, \fBmoeoFitnessThenDiversityComparator< MOEOT >\fP, and \fBmoeoOneObjectiveComparator< MOEOT >\fP. .PP .SH "Detailed Description" .PP @@ -20,7 +20,7 @@ Inherited by \fBmoeoAggregativeComparator< MOEOT >\fP, \fBmoeoDiversityThenFitne .SS "template class moeoComparator< MOEOT >" Functor allowing to compare two solutions. .PP -Definition at line 22 of file moeoComparator.h. +Definition at line 47 of file moeoComparator.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoContributionMetric.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoContributionMetric.3 index 32eb79fc3..7408efe5c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoContributionMetric.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoContributionMetric.3 @@ -52,7 +52,7 @@ The contribution metric evaluates the proportion of non-dominated solutions give of the 2000 Congress on Evolutionary Computation, IEEE Press, pp. 317-324) .PP -Definition at line 24 of file moeoContributionMetric.h. +Definition at line 49 of file moeoContributionMetric.h. .SH "Member Function Documentation" .PP .SS "template double \fBmoeoContributionMetric\fP< ObjectiveVector >::operator() (const std::vector< ObjectiveVector > & _set1, const std::vector< ObjectiveVector > & _set2)\fC [inline]\fP" @@ -68,7 +68,7 @@ Returns the contribution of the Pareto set '_set1' relatively to the Pareto set .PP .PP -Definition at line 33 of file moeoContributionMetric.h. +Definition at line 58 of file moeoContributionMetric.h. .PP References moeoContributionMetric< ObjectiveVector >::card_C(), moeoContributionMetric< ObjectiveVector >::card_N(), and moeoContributionMetric< ObjectiveVector >::card_W(). .SS "template unsigned int \fBmoeoContributionMetric\fP< ObjectiveVector >::card_C (const std::vector< ObjectiveVector > & _set1, const std::vector< ObjectiveVector > & _set2)\fC [inline, private]\fP" @@ -84,7 +84,7 @@ Returns the number of solutions both in '_set1' and '_set2'. .PP .PP -Definition at line 54 of file moeoContributionMetric.h. +Definition at line 79 of file moeoContributionMetric.h. .PP Referenced by moeoContributionMetric< ObjectiveVector >::operator()(). .SS "template unsigned int \fBmoeoContributionMetric\fP< ObjectiveVector >::card_W (const std::vector< ObjectiveVector > & _set1, const std::vector< ObjectiveVector > & _set2)\fC [inline, private]\fP" @@ -100,7 +100,7 @@ Returns the number of solutions in '_set1' dominating at least one solution of ' .PP .PP -Definition at line 71 of file moeoContributionMetric.h. +Definition at line 96 of file moeoContributionMetric.h. .PP References moeoContributionMetric< ObjectiveVector >::paretoComparator. .PP @@ -118,7 +118,7 @@ Returns the number of solutions in '_set1' having no relation of dominance with .PP .PP -Definition at line 89 of file moeoContributionMetric.h. +Definition at line 114 of file moeoContributionMetric.h. .PP References moeoContributionMetric< ObjectiveVector >::paretoComparator. .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoConvertPopToObjectiveVectors.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoConvertPopToObjectiveVectors.3 index d367331de..fd2afc4c5 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoConvertPopToObjectiveVectors.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoConvertPopToObjectiveVectors.3 @@ -26,7 +26,7 @@ Inherits \fBeoUF< A1, R >< eoPop< MOEOT >, std::vector< ObjectiveVector > >\fP. .SS "template class moeoConvertPopToObjectiveVectors< MOEOT, ObjectiveVector >" Functor allowing to get a vector of objective vectors from a population. .PP -Definition at line 23 of file moeoConvertPopToObjectiveVectors.h. +Definition at line 48 of file moeoConvertPopToObjectiveVectors.h. .SH "Member Function Documentation" .PP .SS "template const std::vector< ObjectiveVector > \fBmoeoConvertPopToObjectiveVectors\fP< MOEOT, ObjectiveVector >::operator() (const \fBeoPop\fP< MOEOT > _pop)\fC [inline]\fP" @@ -40,7 +40,7 @@ Returns a vector of the objective vectors from the population _pop. .PP .PP -Definition at line 31 of file moeoConvertPopToObjectiveVectors.h. +Definition at line 56 of file moeoConvertPopToObjectiveVectors.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoCriterionBasedFitnessAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoCriterionBasedFitnessAssignment.3 index 8265faed8..51df66843 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoCriterionBasedFitnessAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoCriterionBasedFitnessAssignment.3 @@ -18,7 +18,7 @@ Inherits \fBmoeoFitnessAssignment< MOEOT >< MOEOT >\fP. .SS "template class moeoCriterionBasedFitnessAssignment< MOEOT >" \fBmoeoCriterionBasedFitnessAssignment\fP is a \fBmoeoFitnessAssignment\fP for criterion-based strategies. .PP -Definition at line 22 of file moeoCriterionBasedFitnessAssignment.h. +Definition at line 47 of file moeoCriterionBasedFitnessAssignment.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoCrowdingDiversityAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoCrowdingDiversityAssignment.3 index 6c2e84b40..6b6ffb597 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoCrowdingDiversityAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoCrowdingDiversityAssignment.3 @@ -57,7 +57,7 @@ Diversity assignment sheme based on crowding proposed 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). .PP -Definition at line 25 of file moeoCrowdingDiversityAssignment.h. +Definition at line 50 of file moeoCrowdingDiversityAssignment.h. .SH "Member Function Documentation" .PP .SS "template void \fBmoeoCrowdingDiversityAssignment\fP< MOEOT >::operator() (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, virtual]\fP" @@ -73,7 +73,7 @@ Computes diversity values for every solution contained in the population _pop. .PP Implements \fBeoUF< eoPop< MOEOT > &, void >\fP. .PP -Definition at line 55 of file moeoCrowdingDiversityAssignment.h. +Definition at line 80 of file moeoCrowdingDiversityAssignment.h. .PP References moeoCrowdingDiversityAssignment< MOEOT >::inf(), and moeoCrowdingDiversityAssignment< MOEOT >::setDistances(). .SS "template void \fBmoeoCrowdingDiversityAssignment\fP< MOEOT >::updateByDeleting (\fBeoPop\fP< MOEOT > & _pop, \fBObjectiveVector\fP & _objVec)\fC [inline, virtual]\fP" @@ -101,7 +101,7 @@ Implements \fBmoeoDiversityAssignment< MOEOT >\fP. .PP Reimplemented in \fBmoeoFrontByFrontCrowdingDiversityAssignment< MOEOT >\fP. .PP -Definition at line 78 of file moeoCrowdingDiversityAssignment.h. +Definition at line 103 of file moeoCrowdingDiversityAssignment.h. .SS "template virtual void \fBmoeoCrowdingDiversityAssignment\fP< MOEOT >::setDistances (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, protected, virtual]\fP" .PP Sets the distance values. @@ -115,7 +115,7 @@ Sets the distance values. .PP Reimplemented in \fBmoeoFrontByFrontCrowdingDiversityAssignment< MOEOT >\fP. .PP -Definition at line 90 of file moeoCrowdingDiversityAssignment.h. +Definition at line 115 of file moeoCrowdingDiversityAssignment.h. .PP References moeoCrowdingDiversityAssignment< MOEOT >::inf(). .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDetTournamentSelect.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDetTournamentSelect.3 index 83e6902f5..086cf659b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDetTournamentSelect.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDetTournamentSelect.3 @@ -50,7 +50,7 @@ Inherits \fBmoeoSelectOne< MOEOT >< MOEOT >\fP. .SS "template class moeoDetTournamentSelect< MOEOT >" Selection strategy that selects ONE individual by deterministic tournament. .PP -Definition at line 24 of file moeoDetTournamentSelect.h. +Definition at line 49 of file moeoDetTournamentSelect.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoDetTournamentSelect\fP< MOEOT >::\fBmoeoDetTournamentSelect\fP (\fBmoeoComparator\fP< MOEOT > & _comparator, unsigned int _tSize = \fC2\fP)\fC [inline]\fP" @@ -66,7 +66,7 @@ Full Ctor. .PP .PP -Definition at line 33 of file moeoDetTournamentSelect.h. +Definition at line 58 of file moeoDetTournamentSelect.h. .PP References moeoDetTournamentSelect< MOEOT >::tSize. .SS "template \fBmoeoDetTournamentSelect\fP< MOEOT >::\fBmoeoDetTournamentSelect\fP (unsigned int _tSize = \fC2\fP)\fC [inline]\fP" @@ -82,7 +82,7 @@ A \fBmoeoFitnessThenDiversityComparator\fP is used as default. .PP .PP -Definition at line 49 of file moeoDetTournamentSelect.h. +Definition at line 74 of file moeoDetTournamentSelect.h. .PP References moeoDetTournamentSelect< MOEOT >::tSize. .SH "Member Function Documentation" @@ -98,7 +98,7 @@ Apply the tournament to the given population. .PP .PP -Definition at line 65 of file moeoDetTournamentSelect.h. +Definition at line 90 of file moeoDetTournamentSelect.h. .PP References moeoDetTournamentSelect< MOEOT >::comparator, and moeoDetTournamentSelect< MOEOT >::tSize. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDistance.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDistance.3 index 3e8529b4d..e99342915 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDistance.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDistance.3 @@ -36,7 +36,7 @@ Inherited by \fBmoeoNormalizedDistance< MOEOT, Type >\fP. .SS "template class moeoDistance< MOEOT, Type >" The base class for distance computation. .PP -Definition at line 22 of file moeoDistance.h. +Definition at line 47 of file moeoDistance.h. .SH "Member Function Documentation" .PP .SS "template virtual void \fBmoeoDistance\fP< MOEOT, Type >::setup (const \fBeoPop\fP< MOEOT > & _pop)\fC [inline, virtual]\fP" @@ -52,7 +52,7 @@ Nothing to do. .PP Reimplemented in \fBmoeoNormalizedDistance< MOEOT, Type >\fP, and \fBmoeoNormalizedDistance< MOEOT >\fP. .PP -Definition at line 30 of file moeoDistance.h. +Definition at line 55 of file moeoDistance.h. .SS "template virtual void \fBmoeoDistance\fP< MOEOT, Type >::setup (double _min, double _max, unsigned int _obj)\fC [inline, virtual]\fP" .PP Nothing to do. @@ -70,7 +70,7 @@ Nothing to do. .PP Reimplemented in \fBmoeoNormalizedDistance< MOEOT, Type >\fP, and \fBmoeoNormalizedDistance< MOEOT >\fP. .PP -Definition at line 40 of file moeoDistance.h. +Definition at line 65 of file moeoDistance.h. .SS "template virtual void \fBmoeoDistance\fP< MOEOT, Type >::setup (\fBeoRealInterval\fP _realInterval, unsigned int _obj)\fC [inline, virtual]\fP" .PP Nothing to do. @@ -86,7 +86,7 @@ Nothing to do. .PP Reimplemented in \fBmoeoNormalizedDistance< MOEOT, Type >\fP, and \fBmoeoNormalizedDistance< MOEOT >\fP. .PP -Definition at line 49 of file moeoDistance.h. +Definition at line 74 of file moeoDistance.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDistanceMatrix.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDistanceMatrix.3 index 6fb37c8cd..a64bd6e88 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDistanceMatrix.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDistanceMatrix.3 @@ -38,7 +38,7 @@ Inherits \fBeoUF< const eoPop< MOEOT > &, void >\fP. .SS "template class moeoDistanceMatrix< MOEOT, Type >" A matrix to compute distances between every pair of individuals contained in a population. .PP -Definition at line 24 of file moeoDistanceMatrix.h. +Definition at line 49 of file moeoDistanceMatrix.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoDistanceMatrix\fP< MOEOT, Type >::\fBmoeoDistanceMatrix\fP (unsigned int _size, \fBmoeoDistance\fP< MOEOT, Type > & _distance)\fC [inline]\fP" @@ -54,7 +54,7 @@ Ctor. .PP .PP -Definition at line 37 of file moeoDistanceMatrix.h. +Definition at line 62 of file moeoDistanceMatrix.h. .SH "Member Function Documentation" .PP .SS "template void \fBmoeoDistanceMatrix\fP< MOEOT, Type >::operator() (const \fBeoPop\fP< MOEOT > & _pop)\fC [inline, virtual]\fP" @@ -70,7 +70,7 @@ Sets the distance between every pair of individuals contained in the population .PP Implements \fBeoUF< const eoPop< MOEOT > &, void >\fP. .PP -Definition at line 51 of file moeoDistanceMatrix.h. +Definition at line 76 of file moeoDistanceMatrix.h. .PP References moeoDistanceMatrix< MOEOT, Type >::distance. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDiversityAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDiversityAssignment.3 index 1614c4b8e..b5d1afb89 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDiversityAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDiversityAssignment.3 @@ -40,7 +40,7 @@ Inherited by \fBmoeoCrowdingDiversityAssignment< MOEOT >\fP, \fBmoeoDummyDiversi .SS "template class moeoDiversityAssignment< MOEOT >" Functor that sets the diversity values of a whole population. .PP -Definition at line 23 of file moeoDiversityAssignment.h. +Definition at line 48 of file moeoDiversityAssignment.h. .SH "Member Function Documentation" .PP .SS "template virtual void \fBmoeoDiversityAssignment\fP< MOEOT >::updateByDeleting (\fBeoPop\fP< MOEOT > & _pop, \fBObjectiveVector\fP & _objVec)\fC [pure virtual]\fP" @@ -72,7 +72,7 @@ Updates the diversity values of the whole population _pop by taking the deletion .PP .PP -Definition at line 44 of file moeoDiversityAssignment.h. +Definition at line 69 of file moeoDiversityAssignment.h. .PP References moeoDiversityAssignment< MOEOT >::updateByDeleting(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDiversityThenFitnessComparator.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDiversityThenFitnessComparator.3 index 3eb20e378..2e0a917af 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDiversityThenFitnessComparator.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDiversityThenFitnessComparator.3 @@ -26,7 +26,7 @@ Inherits \fBmoeoComparator< MOEOT >< MOEOT >\fP. .SS "template class moeoDiversityThenFitnessComparator< MOEOT >" Functor allowing to compare two solutions according to their diversity values, then according to their fitness values. .PP -Definition at line 22 of file moeoDiversityThenFitnessComparator.h. +Definition at line 47 of file moeoDiversityThenFitnessComparator.h. .SH "Member Function Documentation" .PP .SS "template const bool \fBmoeoDiversityThenFitnessComparator\fP< MOEOT >::operator() (const MOEOT & _moeo1, const MOEOT & _moeo2)\fC [inline]\fP" @@ -42,7 +42,7 @@ Returns true if _moeo1 < _moeo2 according to their diversity values, then accord .PP .PP -Definition at line 31 of file moeoDiversityThenFitnessComparator.h. +Definition at line 56 of file moeoDiversityThenFitnessComparator.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDummyDiversityAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDummyDiversityAssignment.3 index 6a5f411dc..d5bfbc5c6 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDummyDiversityAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDummyDiversityAssignment.3 @@ -38,7 +38,7 @@ Inherits \fBmoeoDiversityAssignment< MOEOT >< MOEOT >\fP. .SS "template class moeoDummyDiversityAssignment< MOEOT >" \fBmoeoDummyDiversityAssignment\fP is a \fBmoeoDiversityAssignment\fP that gives the value '0' as the individual's diversity for a whole population if it is invalid. .PP -Definition at line 22 of file moeoDummyDiversityAssignment.h. +Definition at line 47 of file moeoDummyDiversityAssignment.h. .SH "Member Function Documentation" .PP .SS "template void \fBmoeoDummyDiversityAssignment\fP< MOEOT >::operator() (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, virtual]\fP" @@ -54,7 +54,7 @@ Sets the diversity to '0' for every individuals of the population _pop if it is .PP Implements \fBeoUF< eoPop< MOEOT > &, void >\fP. .PP -Definition at line 34 of file moeoDummyDiversityAssignment.h. +Definition at line 59 of file moeoDummyDiversityAssignment.h. .SS "template void \fBmoeoDummyDiversityAssignment\fP< MOEOT >::updateByDeleting (\fBeoPop\fP< MOEOT > & _pop, \fBObjectiveVector\fP & _objVec)\fC [inline, virtual]\fP" .PP Updates the diversity values of the whole population _pop by taking the deletion of the objective vector _objVec into account. @@ -70,7 +70,7 @@ Updates the diversity values of the whole population _pop by taking the deletion .PP Implements \fBmoeoDiversityAssignment< MOEOT >\fP. .PP -Definition at line 52 of file moeoDummyDiversityAssignment.h. +Definition at line 77 of file moeoDummyDiversityAssignment.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDummyFitnessAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDummyFitnessAssignment.3 index 5c2a09d3e..a8896767f 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDummyFitnessAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoDummyFitnessAssignment.3 @@ -38,7 +38,7 @@ Inherits \fBmoeoFitnessAssignment< MOEOT >< MOEOT >\fP. .SS "template class moeoDummyFitnessAssignment< MOEOT >" \fBmoeoDummyFitnessAssignment\fP is a \fBmoeoFitnessAssignment\fP that gives the value '0' as the individual's fitness for a whole population if it is invalid. .PP -Definition at line 22 of file moeoDummyFitnessAssignment.h. +Definition at line 47 of file moeoDummyFitnessAssignment.h. .SH "Member Function Documentation" .PP .SS "template void \fBmoeoDummyFitnessAssignment\fP< MOEOT >::operator() (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, virtual]\fP" @@ -54,7 +54,7 @@ Sets the fitness to '0' for every individuals of the population _pop if it is in .PP Implements \fBeoUF< eoPop< MOEOT > &, void >\fP. .PP -Definition at line 34 of file moeoDummyFitnessAssignment.h. +Definition at line 59 of file moeoDummyFitnessAssignment.h. .SS "template void \fBmoeoDummyFitnessAssignment\fP< MOEOT >::updateByDeleting (\fBeoPop\fP< MOEOT > & _pop, \fBObjectiveVector\fP & _objVec)\fC [inline, virtual]\fP" .PP Updates the fitness values of the whole population _pop by taking the deletion of the objective vector _objVec into account. @@ -70,7 +70,7 @@ Updates the fitness values of the whole population _pop by taking the deletion o .PP Implements \fBmoeoFitnessAssignment< MOEOT >\fP. .PP -Definition at line 52 of file moeoDummyFitnessAssignment.h. +Definition at line 77 of file moeoDummyFitnessAssignment.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEA.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEA.3 index a42ca6a47..1bafe0dc1 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEA.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEA.3 @@ -20,7 +20,7 @@ Inherited by \fBmoeoEasyEA< MOEOT >\fP, \fBmoeoIBEA< MOEOT >\fP, \fBmoeoNSGA< MO .SS "template class moeoEA< MOEOT >" Abstract class for multi-objective evolutionary algorithms. .PP -Definition at line 23 of file moeoEA.h. +Definition at line 48 of file moeoEA.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA.3 index 47f9c67e1..119a4cee6 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA.3 @@ -130,7 +130,7 @@ Inherits \fBmoeoEA< MOEOT >< MOEOT >\fP. .SS "template class moeoEasyEA< MOEOT >" An easy class to design multi-objective evolutionary algorithms. .PP -Definition at line 33 of file moeoEasyEA.h. +Definition at line 58 of file moeoEasyEA.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoEasyEA\fP< MOEOT >::\fBmoeoEasyEA\fP (\fBeoContinue\fP< MOEOT > & _continuator, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoBreed\fP< MOEOT > & _breed, \fBmoeoReplacement\fP< MOEOT > & _replace, \fBmoeoFitnessAssignment\fP< MOEOT > & _fitnessEval, \fBmoeoDiversityAssignment\fP< MOEOT > & _diversityEval, bool _evalFitAndDivBeforeSelection = \fCfalse\fP)\fC [inline]\fP" @@ -156,7 +156,7 @@ Ctor taking a breed and merge. .PP .PP -Definition at line 47 of file moeoEasyEA.h. +Definition at line 72 of file moeoEasyEA.h. .SS "template \fBmoeoEasyEA\fP< MOEOT >::\fBmoeoEasyEA\fP (\fBeoContinue\fP< MOEOT > & _continuator, \fBeoPopEvalFunc\fP< MOEOT > & _popEval, \fBeoBreed\fP< MOEOT > & _breed, \fBmoeoReplacement\fP< MOEOT > & _replace, \fBmoeoFitnessAssignment\fP< MOEOT > & _fitnessEval, \fBmoeoDiversityAssignment\fP< MOEOT > & _diversityEval, bool _evalFitAndDivBeforeSelection = \fCfalse\fP)\fC [inline]\fP" .PP Ctor taking a breed, a merge and a eoPopEval. @@ -180,7 +180,7 @@ Ctor taking a breed, a merge and a eoPopEval. .PP .PP -Definition at line 65 of file moeoEasyEA.h. +Definition at line 90 of file moeoEasyEA.h. .SS "template \fBmoeoEasyEA\fP< MOEOT >::\fBmoeoEasyEA\fP (\fBeoContinue\fP< MOEOT > & _continuator, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoBreed\fP< MOEOT > & _breed, \fBeoMerge\fP< MOEOT > & _merge, \fBeoReduce\fP< MOEOT > & _reduce, \fBmoeoFitnessAssignment\fP< MOEOT > & _fitnessEval, \fBmoeoDiversityAssignment\fP< MOEOT > & _diversityEval, bool _evalFitAndDivBeforeSelection = \fCfalse\fP)\fC [inline]\fP" .PP Ctor taking a breed, a merge and a reduce. @@ -206,7 +206,7 @@ Ctor taking a breed, a merge and a reduce. .PP .PP -Definition at line 84 of file moeoEasyEA.h. +Definition at line 109 of file moeoEasyEA.h. .SS "template \fBmoeoEasyEA\fP< MOEOT >::\fBmoeoEasyEA\fP (\fBeoContinue\fP< MOEOT > & _continuator, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoSelect\fP< MOEOT > & _select, \fBeoTransform\fP< MOEOT > & _transform, \fBmoeoReplacement\fP< MOEOT > & _replace, \fBmoeoFitnessAssignment\fP< MOEOT > & _fitnessEval, \fBmoeoDiversityAssignment\fP< MOEOT > & _diversityEval, bool _evalFitAndDivBeforeSelection = \fCfalse\fP)\fC [inline]\fP" .PP Ctor taking a select, a transform and a replacement. @@ -232,7 +232,7 @@ Ctor taking a select, a transform and a replacement. .PP .PP -Definition at line 103 of file moeoEasyEA.h. +Definition at line 128 of file moeoEasyEA.h. .SS "template \fBmoeoEasyEA\fP< MOEOT >::\fBmoeoEasyEA\fP (\fBeoContinue\fP< MOEOT > & _continuator, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoSelect\fP< MOEOT > & _select, \fBeoTransform\fP< MOEOT > & _transform, \fBeoMerge\fP< MOEOT > & _merge, \fBeoReduce\fP< MOEOT > & _reduce, \fBmoeoFitnessAssignment\fP< MOEOT > & _fitnessEval, \fBmoeoDiversityAssignment\fP< MOEOT > & _diversityEval, bool _evalFitAndDivBeforeSelection = \fCfalse\fP)\fC [inline]\fP" .PP Ctor taking a select, a transform, a merge and a reduce. @@ -260,7 +260,7 @@ Ctor taking a select, a transform, a merge and a reduce. .PP .PP -Definition at line 123 of file moeoEasyEA.h. +Definition at line 148 of file moeoEasyEA.h. .SH "Member Function Documentation" .PP .SS "template virtual void \fBmoeoEasyEA\fP< MOEOT >::operator() (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, virtual]\fP" @@ -274,7 +274,7 @@ Applies a few generation of evolution to the population _pop. .PP .PP -Definition at line 135 of file moeoEasyEA.h. +Definition at line 160 of file moeoEasyEA.h. .PP References moeoEasyEA< MOEOT >::breed, moeoEasyEA< MOEOT >::continuator, moeoEasyEA< MOEOT >::diversityEval, moeoEasyEA< MOEOT >::evalFitAndDivBeforeSelection, moeoEasyEA< MOEOT >::fitnessEval, moeoEasyEA< MOEOT >::popEval, and moeoEasyEA< MOEOT >::replace. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA_eoDummyEval.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA_eoDummyEval.3 index db33d6477..2e1a5a85e 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA_eoDummyEval.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA_eoDummyEval.3 @@ -26,7 +26,7 @@ Inherits \fBeoEvalFunc< MOEOT >\fP. .SS "template class moeoEasyEA< MOEOT >::eoDummyEval" a dummy eval .PP -Definition at line 200 of file moeoEasyEA.h. +Definition at line 225 of file moeoEasyEA.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA_eoDummySelect.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA_eoDummySelect.3 index 21fa88435..d5b2d782d 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA_eoDummySelect.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA_eoDummySelect.3 @@ -26,7 +26,7 @@ Inherits \fBeoSelect< MOEOT >\fP. .SS "template class moeoEasyEA< MOEOT >::eoDummySelect" a dummy select .PP -Definition at line 204 of file moeoEasyEA.h. +Definition at line 229 of file moeoEasyEA.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA_eoDummyTransform.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA_eoDummyTransform.3 index cd3cb23c9..ae4229dba 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA_eoDummyTransform.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEasyEA_eoDummyTransform.3 @@ -26,7 +26,7 @@ Inherits \fBeoTransform< MOEOT >\fP. .SS "template class moeoEasyEA< MOEOT >::eoDummyTransform" a dummy transform .PP -Definition at line 208 of file moeoEasyEA.h. +Definition at line 233 of file moeoEasyEA.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoElitistReplacement.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoElitistReplacement.3 index d9adb1c04..a9348169a 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoElitistReplacement.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoElitistReplacement.3 @@ -74,7 +74,7 @@ Inherits \fBmoeoReplacement< MOEOT >< MOEOT >\fP. .SS "template class moeoElitistReplacement< MOEOT >" Elitist replacement strategy that consists in keeping the N best individuals. .PP -Definition at line 26 of file moeoElitistReplacement.h. +Definition at line 51 of file moeoElitistReplacement.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoElitistReplacement\fP< MOEOT >::\fBmoeoElitistReplacement\fP (\fBmoeoFitnessAssignment\fP< MOEOT > & _fitnessAssignment, \fBmoeoDiversityAssignment\fP< MOEOT > & _diversityAssignment, \fBmoeoComparator\fP< MOEOT > & _comparator)\fC [inline]\fP" @@ -92,7 +92,7 @@ Full constructor. .PP .PP -Definition at line 36 of file moeoElitistReplacement.h. +Definition at line 61 of file moeoElitistReplacement.h. .SS "template \fBmoeoElitistReplacement\fP< MOEOT >::\fBmoeoElitistReplacement\fP (\fBmoeoFitnessAssignment\fP< MOEOT > & _fitnessAssignment, \fBmoeoDiversityAssignment\fP< MOEOT > & _diversityAssignment)\fC [inline]\fP" .PP Constructor without comparator. @@ -108,7 +108,7 @@ A moeoFitThenDivComparator is used as default. .PP .PP -Definition at line 46 of file moeoElitistReplacement.h. +Definition at line 71 of file moeoElitistReplacement.h. .SS "template \fBmoeoElitistReplacement\fP< MOEOT >::\fBmoeoElitistReplacement\fP (\fBmoeoFitnessAssignment\fP< MOEOT > & _fitnessAssignment, \fBmoeoComparator\fP< MOEOT > & _comparator)\fC [inline]\fP" .PP Constructor without moeoDiversityAssignement. @@ -124,7 +124,7 @@ A dummy diversity is used as default. .PP .PP -Definition at line 56 of file moeoElitistReplacement.h. +Definition at line 81 of file moeoElitistReplacement.h. .SS "template \fBmoeoElitistReplacement\fP< MOEOT >::\fBmoeoElitistReplacement\fP (\fBmoeoFitnessAssignment\fP< MOEOT > & _fitnessAssignment)\fC [inline]\fP" .PP Constructor without moeoDiversityAssignement nor \fBmoeoComparator\fP. @@ -138,7 +138,7 @@ A moeoFitThenDivComparator and a dummy diversity are used as default. .PP .PP -Definition at line 66 of file moeoElitistReplacement.h. +Definition at line 91 of file moeoElitistReplacement.h. .SH "Member Function Documentation" .PP .SS "template void \fBmoeoElitistReplacement\fP< MOEOT >::operator() (\fBeoPop\fP< MOEOT > & _parents, \fBeoPop\fP< MOEOT > & _offspring)\fC [inline]\fP" @@ -154,7 +154,7 @@ Replaces the first population by adding the individuals of the second one, sorti .PP .PP -Definition at line 76 of file moeoElitistReplacement.h. +Definition at line 101 of file moeoElitistReplacement.h. .PP References moeoElitistReplacement< MOEOT >::comparator, moeoElitistReplacement< MOEOT >::diversityAssignment, and moeoElitistReplacement< MOEOT >::fitnessAssignment. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoElitistReplacement_Cmp.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoElitistReplacement_Cmp.3 index 268d8735e..9302584e6 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoElitistReplacement_Cmp.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoElitistReplacement_Cmp.3 @@ -36,7 +36,7 @@ moeoElitistReplacement::Cmp \- this object is used to compare solutions in order .SS "template class moeoElitistReplacement< MOEOT >::Cmp" this object is used to compare solutions in order to sort the population .PP -Definition at line 105 of file moeoElitistReplacement.h. +Definition at line 130 of file moeoElitistReplacement.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoElitistReplacement\fP< MOEOT >::Cmp::Cmp (\fBmoeoComparator\fP< MOEOT > & _comp)\fC [inline]\fP" @@ -50,7 +50,7 @@ Ctor. .PP .PP -Definition at line 112 of file moeoElitistReplacement.h. +Definition at line 137 of file moeoElitistReplacement.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEntropyMetric.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEntropyMetric.3 index b53bec75b..f320b6aed 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEntropyMetric.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEntropyMetric.3 @@ -72,7 +72,7 @@ The entropy gives an idea of the diversity of a Pareto set relatively to another of the 2002 Congress on Evolutionary Computation, IEEE Press, pp. 1155-1156) .PP -Definition at line 25 of file moeoEntropyMetric.h. +Definition at line 50 of file moeoEntropyMetric.h. .SH "Member Function Documentation" .PP .SS "template double \fBmoeoEntropyMetric\fP< ObjectiveVector >::operator() (const std::vector< ObjectiveVector > & _set1, const std::vector< ObjectiveVector > & _set2)\fC [inline]\fP" @@ -88,7 +88,7 @@ Returns the entropy of the Pareto set '_set1' relatively to the Pareto set '_set .PP .PP -Definition at line 34 of file moeoEntropyMetric.h. +Definition at line 59 of file moeoEntropyMetric.h. .PP References moeoEntropyMetric< ObjectiveVector >::computeUnion(), moeoEntropyMetric< ObjectiveVector >::howManyInNicheOf(), moeoEntropyMetric< ObjectiveVector >::normalize(), moeoEntropyMetric< ObjectiveVector >::prenormalize(), and moeoEntropyMetric< ObjectiveVector >::removeDominated(). .SS "template void \fBmoeoEntropyMetric\fP< ObjectiveVector >::removeDominated (std::vector< ObjectiveVector > & _f)\fC [inline, private]\fP" @@ -102,7 +102,7 @@ Removes the dominated individuals contained in _f. .PP .PP -Definition at line 85 of file moeoEntropyMetric.h. +Definition at line 110 of file moeoEntropyMetric.h. .PP References moeoEntropyMetric< ObjectiveVector >::paretoComparator. .PP @@ -118,7 +118,7 @@ Prenormalization. .PP .PP -Definition at line 107 of file moeoEntropyMetric.h. +Definition at line 132 of file moeoEntropyMetric.h. .PP References moeoEntropyMetric< ObjectiveVector >::vect_max_val, and moeoEntropyMetric< ObjectiveVector >::vect_min_val. .PP @@ -134,7 +134,7 @@ Normalization. .PP .PP -Definition at line 129 of file moeoEntropyMetric.h. +Definition at line 154 of file moeoEntropyMetric.h. .PP References moeoEntropyMetric< ObjectiveVector >::vect_max_val, and moeoEntropyMetric< ObjectiveVector >::vect_min_val. .PP @@ -154,7 +154,7 @@ Computation of the union of _f1 and _f2 in _f. .PP .PP -Definition at line 142 of file moeoEntropyMetric.h. +Definition at line 167 of file moeoEntropyMetric.h. .PP Referenced by moeoEntropyMetric< ObjectiveVector >::operator()(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEnvironmentalReplacement.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEnvironmentalReplacement.3 index ce80e95ac..fe1ad7eb5 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEnvironmentalReplacement.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEnvironmentalReplacement.3 @@ -82,7 +82,7 @@ Inherits \fBmoeoReplacement< MOEOT >< MOEOT >\fP. .SS "template class 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. .PP -Definition at line 26 of file moeoEnvironmentalReplacement.h. +Definition at line 51 of file moeoEnvironmentalReplacement.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoEnvironmentalReplacement\fP< MOEOT >::\fBmoeoEnvironmentalReplacement\fP (\fBmoeoFitnessAssignment\fP< MOEOT > & _fitnessAssignment, \fBmoeoDiversityAssignment\fP< MOEOT > & _diversityAssignment, \fBmoeoComparator\fP< MOEOT > & _comparator)\fC [inline]\fP" @@ -100,7 +100,7 @@ Full constructor. .PP .PP -Definition at line 40 of file moeoEnvironmentalReplacement.h. +Definition at line 65 of file moeoEnvironmentalReplacement.h. .SS "template \fBmoeoEnvironmentalReplacement\fP< MOEOT >::\fBmoeoEnvironmentalReplacement\fP (\fBmoeoFitnessAssignment\fP< MOEOT > & _fitnessAssignment, \fBmoeoDiversityAssignment\fP< MOEOT > & _diversityAssignment)\fC [inline]\fP" .PP Constructor without comparator. @@ -116,7 +116,7 @@ A moeoFitThenDivComparator is used as default. .PP .PP -Definition at line 50 of file moeoEnvironmentalReplacement.h. +Definition at line 75 of file moeoEnvironmentalReplacement.h. .SS "template \fBmoeoEnvironmentalReplacement\fP< MOEOT >::\fBmoeoEnvironmentalReplacement\fP (\fBmoeoFitnessAssignment\fP< MOEOT > & _fitnessAssignment, \fBmoeoComparator\fP< MOEOT > & _comparator)\fC [inline]\fP" .PP Constructor without moeoDiversityAssignement. @@ -132,7 +132,7 @@ A dummy diversity is used as default. .PP .PP -Definition at line 60 of file moeoEnvironmentalReplacement.h. +Definition at line 85 of file moeoEnvironmentalReplacement.h. .SS "template \fBmoeoEnvironmentalReplacement\fP< MOEOT >::\fBmoeoEnvironmentalReplacement\fP (\fBmoeoFitnessAssignment\fP< MOEOT > & _fitnessAssignment)\fC [inline]\fP" .PP Constructor without moeoDiversityAssignement nor \fBmoeoComparator\fP. @@ -146,7 +146,7 @@ A moeoFitThenDivComparator and a dummy diversity are used as default. .PP .PP -Definition at line 70 of file moeoEnvironmentalReplacement.h. +Definition at line 95 of file moeoEnvironmentalReplacement.h. .SH "Member Function Documentation" .PP .SS "template void \fBmoeoEnvironmentalReplacement\fP< MOEOT >::operator() (\fBeoPop\fP< MOEOT > & _parents, \fBeoPop\fP< MOEOT > & _offspring)\fC [inline]\fP" @@ -162,7 +162,7 @@ Replaces the first population by adding the individuals of the second one, sorti .PP .PP -Definition at line 80 of file moeoEnvironmentalReplacement.h. +Definition at line 105 of file moeoEnvironmentalReplacement.h. .PP References moeoEnvironmentalReplacement< MOEOT >::comparator, moeoEnvironmentalReplacement< MOEOT >::diversityAssignment, and moeoEnvironmentalReplacement< MOEOT >::fitnessAssignment. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEnvironmentalReplacement_Cmp.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEnvironmentalReplacement_Cmp.3 index 9b7dc8c0f..365509ae2 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEnvironmentalReplacement_Cmp.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEnvironmentalReplacement_Cmp.3 @@ -36,7 +36,7 @@ moeoEnvironmentalReplacement::Cmp \- this object is used to compare solutions in .SS "template class moeoEnvironmentalReplacement< MOEOT >::Cmp" this object is used to compare solutions in order to sort the population .PP -Definition at line 121 of file moeoEnvironmentalReplacement.h. +Definition at line 146 of file moeoEnvironmentalReplacement.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoEnvironmentalReplacement\fP< MOEOT >::Cmp::Cmp (\fBmoeoComparator\fP< MOEOT > & _comp)\fC [inline]\fP" @@ -50,7 +50,7 @@ Ctor. .PP .PP -Definition at line 128 of file moeoEnvironmentalReplacement.h. +Definition at line 153 of file moeoEnvironmentalReplacement.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEuclideanDistance.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEuclideanDistance.3 index a06aa03d8..80f4c9eda 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEuclideanDistance.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEuclideanDistance.3 @@ -36,7 +36,7 @@ A class allowing to compute an euclidian distance between two solutions in the o between 0 and 1). A distance value then lies between 0 and sqrt(nObjectives). .PP -Definition at line 24 of file moeoEuclideanDistance.h. +Definition at line 49 of file moeoEuclideanDistance.h. .SH "Member Function Documentation" .PP .SS "template const double \fBmoeoEuclideanDistance\fP< MOEOT >::operator() (const MOEOT & _moeo1, const MOEOT & _moeo2)\fC [inline]\fP" @@ -52,7 +52,7 @@ Returns the euclidian distance between _moeo1 and _moeo2 in the objective space. .PP .PP -Definition at line 37 of file moeoEuclideanDistance.h. +Definition at line 62 of file moeoEuclideanDistance.h. .PP References moeoNormalizedDistance< MOEOT >::bounds. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEvalFunc.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEvalFunc.3 index 86b5d92f0..5d565fd9a 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEvalFunc.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoEvalFunc.3 @@ -14,7 +14,7 @@ Inherits \fBeoEvalFunc< MOEOT >\fP. .SS "template class moeoEvalFunc< MOEOT >" .PP -Definition at line 22 of file moeoEvalFunc.h. +Definition at line 47 of file moeoEvalFunc.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoExpBinaryIndicatorBasedFitnessAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoExpBinaryIndicatorBasedFitnessAssignment.3 index c8dc5ed87..fca54fd4b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoExpBinaryIndicatorBasedFitnessAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoExpBinaryIndicatorBasedFitnessAssignment.3 @@ -84,7 +84,7 @@ Fitness assignment sheme based on an indicator proposed in: E. 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. .PP -Definition at line 29 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +Definition at line 54 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoExpBinaryIndicatorBasedFitnessAssignment\fP< MOEOT >::\fBmoeoExpBinaryIndicatorBasedFitnessAssignment\fP (\fBmoeoNormalizedSolutionVsSolutionBinaryMetric\fP< \fBObjectiveVector\fP, double > & _metric, const double _kappa = \fC0.05\fP)\fC [inline]\fP" @@ -100,7 +100,7 @@ Ctor. .PP .PP -Definition at line 42 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +Definition at line 67 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. .SH "Member Function Documentation" .PP .SS "template void \fBmoeoExpBinaryIndicatorBasedFitnessAssignment\fP< MOEOT >::operator() (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, virtual]\fP" @@ -116,7 +116,7 @@ Sets the fitness values for every solution contained in the population _pop. .PP Implements \fBeoUF< eoPop< MOEOT > &, void >\fP. .PP -Definition at line 50 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +Definition at line 75 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. .PP References moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::computeValues(), moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::setFitnesses(), and moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::setup(). .SS "template void \fBmoeoExpBinaryIndicatorBasedFitnessAssignment\fP< MOEOT >::updateByDeleting (\fBeoPop\fP< MOEOT > & _pop, \fBObjectiveVector\fP & _objVec)\fC [inline, virtual]\fP" @@ -134,7 +134,7 @@ Updates the fitness values of the whole population _pop by taking the deletion o .PP Implements \fBmoeoFitnessAssignment< MOEOT >\fP. .PP -Definition at line 66 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +Definition at line 91 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. .PP References moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::kappa, and moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::metric. .SS "template double \fBmoeoExpBinaryIndicatorBasedFitnessAssignment\fP< MOEOT >::updateByAdding (\fBeoPop\fP< MOEOT > & _pop, \fBObjectiveVector\fP & _objVec)\fC [inline, virtual]\fP" @@ -152,7 +152,7 @@ Updates the fitness values of the whole population _pop by taking the adding of .PP Implements \fBmoeoBinaryIndicatorBasedFitnessAssignment< MOEOT >\fP. .PP -Definition at line 87 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +Definition at line 112 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. .PP References moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::kappa, and moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::metric. .SS "template void \fBmoeoExpBinaryIndicatorBasedFitnessAssignment\fP< MOEOT >::setup (const \fBeoPop\fP< MOEOT > & _pop)\fC [inline, protected]\fP" @@ -166,7 +166,7 @@ Sets the bounds for every objective using the min and the max value for every ob .PP .PP -Definition at line 130 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +Definition at line 155 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. .PP References moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::metric, and moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R >::setup(). .PP @@ -182,7 +182,7 @@ Compute every indicator value in values (values[i] = I(_v[i], _o)). .PP .PP -Definition at line 152 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +Definition at line 177 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. .PP References moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::metric, and moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::values. .PP @@ -198,7 +198,7 @@ Sets the fitness value of the whple population. .PP .PP -Definition at line 174 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +Definition at line 199 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. .PP References moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::computeFitness(). .PP @@ -214,7 +214,7 @@ Returns the fitness value of the _idx th individual of the population. .PP .PP -Definition at line 187 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. +Definition at line 212 of file moeoExpBinaryIndicatorBasedFitnessAssignment.h. .PP References moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::kappa, and moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::values. .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFastNonDominatedSortingFitnessAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFastNonDominatedSortingFitnessAssignment.3 index c61a99188..c52ebfd0c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFastNonDominatedSortingFitnessAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFastNonDominatedSortingFitnessAssignment.3 @@ -88,7 +88,7 @@ Fitness assignment sheme based on Pareto-dominance count proposed in: N. 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. .PP -Definition at line 32 of file moeoFastNonDominatedSortingFitnessAssignment.h. +Definition at line 57 of file moeoFastNonDominatedSortingFitnessAssignment.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoFastNonDominatedSortingFitnessAssignment\fP< MOEOT >::\fBmoeoFastNonDominatedSortingFitnessAssignment\fP (\fBmoeoObjectiveVectorComparator\fP< \fBObjectiveVector\fP > & _comparator)\fC [inline]\fP" @@ -102,7 +102,7 @@ Ctor where you can choose your own way to compare objective vectors. .PP .PP -Definition at line 51 of file moeoFastNonDominatedSortingFitnessAssignment.h. +Definition at line 76 of file moeoFastNonDominatedSortingFitnessAssignment.h. .SH "Member Function Documentation" .PP .SS "template void \fBmoeoFastNonDominatedSortingFitnessAssignment\fP< MOEOT >::operator() (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, virtual]\fP" @@ -118,7 +118,7 @@ Sets the fitness values for every solution contained in the population _pop. .PP Implements \fBeoUF< eoPop< MOEOT > &, void >\fP. .PP -Definition at line 59 of file moeoFastNonDominatedSortingFitnessAssignment.h. +Definition at line 84 of file moeoFastNonDominatedSortingFitnessAssignment.h. .PP References moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::mObjectives(), and moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::oneObjective(). .SS "template void \fBmoeoFastNonDominatedSortingFitnessAssignment\fP< MOEOT >::updateByDeleting (\fBeoPop\fP< MOEOT > & _pop, \fBObjectiveVector\fP & _objVec)\fC [inline, virtual]\fP" @@ -136,7 +136,7 @@ Updates the fitness values of the whole population _pop by taking the deletion o .PP Implements \fBmoeoFitnessAssignment< MOEOT >\fP. .PP -Definition at line 101 of file moeoFastNonDominatedSortingFitnessAssignment.h. +Definition at line 126 of file moeoFastNonDominatedSortingFitnessAssignment.h. .PP References moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::comparator. .SS "template void \fBmoeoFastNonDominatedSortingFitnessAssignment\fP< MOEOT >::oneObjective (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, private]\fP" @@ -150,7 +150,7 @@ Sets the fitness values for mono-objective problems. .PP .PP -Definition at line 143 of file moeoFastNonDominatedSortingFitnessAssignment.h. +Definition at line 168 of file moeoFastNonDominatedSortingFitnessAssignment.h. .PP References moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::objComparator. .PP @@ -166,7 +166,7 @@ Sets the fitness values for bi-objective problems with a complexity of O(n log n .PP .PP -Definition at line 165 of file moeoFastNonDominatedSortingFitnessAssignment.h. +Definition at line 190 of file moeoFastNonDominatedSortingFitnessAssignment.h. .SS "template void \fBmoeoFastNonDominatedSortingFitnessAssignment\fP< MOEOT >::mObjectives (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, private]\fP" .PP 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. @@ -178,7 +178,7 @@ Sets the fitness values for problems with more than two objectives with a comple .PP .PP -Definition at line 175 of file moeoFastNonDominatedSortingFitnessAssignment.h. +Definition at line 200 of file moeoFastNonDominatedSortingFitnessAssignment.h. .PP References moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::comparator. .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFastNonDominatedSortingFitnessAssignment_ObjectiveComparator.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFastNonDominatedSortingFitnessAssignment_ObjectiveComparator.3 index 6f7843590..b55313e3c 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFastNonDominatedSortingFitnessAssignment_ObjectiveComparator.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFastNonDominatedSortingFitnessAssignment_ObjectiveComparator.3 @@ -32,7 +32,7 @@ Inherits \fBmoeoComparator< MOEOT >< MOEOT >\fP. .SS "template class moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator" Functor allowing to compare two solutions according to their first objective value, then their second, and so on. .PP -Definition at line 121 of file moeoFastNonDominatedSortingFitnessAssignment.h. +Definition at line 146 of file moeoFastNonDominatedSortingFitnessAssignment.h. .SH "Member Function Documentation" .PP .SS "template const bool \fBmoeoFastNonDominatedSortingFitnessAssignment\fP< MOEOT >::ObjectiveComparator::operator() (const MOEOT & _moeo1, const MOEOT & _moeo2)\fC [inline]\fP" @@ -48,7 +48,7 @@ Returns true if _moeo1 < _moeo2 on the first objective, then on the second, and .PP .PP -Definition at line 129 of file moeoFastNonDominatedSortingFitnessAssignment.h. +Definition at line 154 of file moeoFastNonDominatedSortingFitnessAssignment.h. .PP References moeoFastNonDominatedSortingFitnessAssignment< MOEOT >::ObjectiveComparator::cmp. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFitnessAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFitnessAssignment.3 index bc4924f98..88b9e12cf 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFitnessAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFitnessAssignment.3 @@ -12,7 +12,7 @@ moeoFitnessAssignment \- Functor that sets the fitness values of a whole populat .PP Inherits \fBeoUF< eoPop< MOEOT > &, void >\fP. .PP -Inherited by \fBmoeoCriterionBasedFitnessAssignment< MOEOT >\fP, \fBmoeoDummyFitnessAssignment< MOEOT >\fP, \fBmoeoIndicatorBasedFitnessAssignment< MOEOT >\fP, \fBmoeoParetoBasedFitnessAssignment< MOEOT >\fP, \fBmoeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >\fP, and \fBmoeoScalarFitnessAssignment< MOEOT >\fP. +Inherited by \fBmoeoCriterionBasedFitnessAssignment< MOEOT >\fP, \fBmoeoDummyFitnessAssignment< MOEOT >\fP, \fBmoeoIndicatorBasedFitnessAssignment< MOEOT >\fP, \fBmoeoParetoBasedFitnessAssignment< MOEOT >\fP, and \fBmoeoScalarFitnessAssignment< MOEOT >\fP. .PP .SS "Public Types" @@ -40,7 +40,7 @@ Inherited by \fBmoeoCriterionBasedFitnessAssignment< MOEOT >\fP, \fBmoeoDummyFit .SS "template class moeoFitnessAssignment< MOEOT >" Functor that sets the fitness values of a whole population. .PP -Definition at line 23 of file moeoFitnessAssignment.h. +Definition at line 48 of file moeoFitnessAssignment.h. .SH "Member Function Documentation" .PP .SS "template virtual void \fBmoeoFitnessAssignment\fP< MOEOT >::updateByDeleting (\fBeoPop\fP< MOEOT > & _pop, \fBObjectiveVector\fP & _objVec)\fC [pure virtual]\fP" @@ -56,7 +56,7 @@ Updates the fitness values of the whole population _pop by taking the deletion o .PP .PP -Implemented in \fBmoeoAchievementFitnessAssignment< MOEOT >\fP, \fBmoeoDummyFitnessAssignment< MOEOT >\fP, \fBmoeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >\fP, \fBmoeoFastNonDominatedSortingFitnessAssignment< MOEOT >\fP, and \fBmoeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >\fP. +Implemented in \fBmoeoAchievementFitnessAssignment< MOEOT >\fP, \fBmoeoDummyFitnessAssignment< MOEOT >\fP, \fBmoeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >\fP, and \fBmoeoFastNonDominatedSortingFitnessAssignment< MOEOT >\fP. .PP Referenced by moeoFitnessAssignment< MOEOT >::updateByDeleting(). .SS "template void \fBmoeoFitnessAssignment\fP< MOEOT >::updateByDeleting (\fBeoPop\fP< MOEOT > & _pop, MOEOT & _moeo)\fC [inline]\fP" @@ -72,7 +72,7 @@ Updates the fitness values of the whole population _pop by taking the deletion o .PP .PP -Definition at line 44 of file moeoFitnessAssignment.h. +Definition at line 69 of file moeoFitnessAssignment.h. .PP References moeoFitnessAssignment< MOEOT >::updateByDeleting(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFitnessThenDiversityComparator.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFitnessThenDiversityComparator.3 index 7d4b6d938..ae81bcf28 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFitnessThenDiversityComparator.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFitnessThenDiversityComparator.3 @@ -26,7 +26,7 @@ Inherits \fBmoeoComparator< MOEOT >< MOEOT >\fP. .SS "template class moeoFitnessThenDiversityComparator< MOEOT >" Functor allowing to compare two solutions according to their fitness values, then according to their diversity values. .PP -Definition at line 22 of file moeoFitnessThenDiversityComparator.h. +Definition at line 47 of file moeoFitnessThenDiversityComparator.h. .SH "Member Function Documentation" .PP .SS "template const bool \fBmoeoFitnessThenDiversityComparator\fP< MOEOT >::operator() (const MOEOT & _moeo1, const MOEOT & _moeo2)\fC [inline]\fP" @@ -42,7 +42,7 @@ Returns true if _moeo1 < _moeo2 according to their fitness values, then accordin .PP .PP -Definition at line 31 of file moeoFitnessThenDiversityComparator.h. +Definition at line 56 of file moeoFitnessThenDiversityComparator.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFrontByFrontCrowdingDiversityAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFrontByFrontCrowdingDiversityAssignment.3 index 9c8584eb7..da9e91832 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFrontByFrontCrowdingDiversityAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFrontByFrontCrowdingDiversityAssignment.3 @@ -47,7 +47,7 @@ Diversity assignment sheme based on crowding proposed 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). Tis strategy assigns diversity values FRONT BY FRONT. It is, for instance, used in NSGA-II. .PP -Definition at line 25 of file moeoFrontByFrontCrowdingDiversityAssignment.h. +Definition at line 50 of file moeoFrontByFrontCrowdingDiversityAssignment.h. .SH "Member Function Documentation" .PP .SS "template void \fBmoeoFrontByFrontCrowdingDiversityAssignment\fP< MOEOT >::updateByDeleting (\fBeoPop\fP< MOEOT > & _pop, \fBObjectiveVector\fP & _objVec)\fC [inline, virtual]\fP" @@ -73,7 +73,7 @@ NOT IMPLEMENTED, DO NOTHING ! .PP Reimplemented from \fBmoeoCrowdingDiversityAssignment< MOEOT >\fP. .PP -Definition at line 40 of file moeoFrontByFrontCrowdingDiversityAssignment.h. +Definition at line 65 of file moeoFrontByFrontCrowdingDiversityAssignment.h. .SS "template void \fBmoeoFrontByFrontCrowdingDiversityAssignment\fP< MOEOT >::setDistances (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, private, virtual]\fP" .PP Sets the distance values. @@ -87,7 +87,7 @@ Sets the distance values. .PP Reimplemented from \fBmoeoCrowdingDiversityAssignment< MOEOT >\fP. .PP -Definition at line 55 of file moeoFrontByFrontCrowdingDiversityAssignment.h. +Definition at line 80 of file moeoFrontByFrontCrowdingDiversityAssignment.h. .PP References moeoCrowdingDiversityAssignment< MOEOT >::inf(), moeoFrontByFrontCrowdingDiversityAssignment< MOEOT >::lastIndex(), and moeoCrowdingDiversityAssignment< MOEOT >::tiny(). .SS "template unsigned int \fBmoeoFrontByFrontCrowdingDiversityAssignment\fP< MOEOT >::lastIndex (\fBeoPop\fP< MOEOT > & _pop, unsigned int _start)\fC [inline, private]\fP" @@ -103,7 +103,7 @@ Returns the index of the last individual having the same fitness value than _pop .PP .PP -Definition at line 121 of file moeoFrontByFrontCrowdingDiversityAssignment.h. +Definition at line 146 of file moeoFrontByFrontCrowdingDiversityAssignment.h. .PP Referenced by moeoFrontByFrontCrowdingDiversityAssignment< MOEOT >::setDistances(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFrontByFrontSharingDiversityAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFrontByFrontSharingDiversityAssignment.3 index 23f844092..9725da140 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFrontByFrontSharingDiversityAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoFrontByFrontSharingDiversityAssignment.3 @@ -49,7 +49,7 @@ Inherits \fBmoeoSharingDiversityAssignment< MOEOT >< MOEOT >\fP. .SS "template class moeoFrontByFrontSharingDiversityAssignment< MOEOT >" Sharing assignment scheme on the way it is used in NSGA. .PP -Definition at line 22 of file moeoFrontByFrontSharingDiversityAssignment.h. +Definition at line 47 of file moeoFrontByFrontSharingDiversityAssignment.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoFrontByFrontSharingDiversityAssignment\fP< MOEOT >::\fBmoeoFrontByFrontSharingDiversityAssignment\fP (\fBmoeoDistance\fP< MOEOT, double > & _distance, double _nicheSize = \fC0.5\fP, double _alpha = \fC2.0\fP)\fC [inline]\fP" @@ -67,7 +67,7 @@ Ctor. .PP .PP -Definition at line 36 of file moeoFrontByFrontSharingDiversityAssignment.h. +Definition at line 61 of file moeoFrontByFrontSharingDiversityAssignment.h. .SS "template \fBmoeoFrontByFrontSharingDiversityAssignment\fP< MOEOT >::\fBmoeoFrontByFrontSharingDiversityAssignment\fP (double _nicheSize = \fC0.5\fP, double _alpha = \fC2.0\fP)\fC [inline]\fP" .PP Ctor with an euclidean distance (with normalized objective values) in the objective space is used as default. @@ -81,7 +81,7 @@ Ctor with an euclidean distance (with normalized objective values) in the object .PP .PP -Definition at line 45 of file moeoFrontByFrontSharingDiversityAssignment.h. +Definition at line 70 of file moeoFrontByFrontSharingDiversityAssignment.h. .SH "Member Function Documentation" .PP .SS "template void \fBmoeoFrontByFrontSharingDiversityAssignment\fP< MOEOT >::updateByDeleting (\fBeoPop\fP< MOEOT > & _pop, \fBObjectiveVector\fP & _objVec)\fC [inline, virtual]\fP" @@ -107,7 +107,7 @@ NOT IMPLEMENTED, DO NOTHING ! .PP Reimplemented from \fBmoeoSharingDiversityAssignment< MOEOT >\fP. .PP -Definition at line 56 of file moeoFrontByFrontSharingDiversityAssignment.h. +Definition at line 81 of file moeoFrontByFrontSharingDiversityAssignment.h. .SS "template void \fBmoeoFrontByFrontSharingDiversityAssignment\fP< MOEOT >::setSimilarities (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, private, virtual]\fP" .PP Sets similarities FRONT BY FRONT for every solution contained in the population _pop. @@ -121,7 +121,7 @@ Sets similarities FRONT BY FRONT for every solution contained in the population .PP Reimplemented from \fBmoeoSharingDiversityAssignment< MOEOT >\fP. .PP -Definition at line 74 of file moeoFrontByFrontSharingDiversityAssignment.h. +Definition at line 99 of file moeoFrontByFrontSharingDiversityAssignment.h. .PP References moeoSharingDiversityAssignment< MOEOT >::distance, moeoSharingDiversityAssignment< MOEOT >::nicheSize, and moeoSharingDiversityAssignment< MOEOT >::sh(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoGDominanceObjectiveVectorComparator.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoGDominanceObjectiveVectorComparator.3 index b8f9cb2bc..a5db9a5d5 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoGDominanceObjectiveVectorComparator.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoGDominanceObjectiveVectorComparator.3 @@ -52,7 +52,7 @@ This functor class allows to compare 2 objective vectors according to g-dominanc 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) .PP -Definition at line 25 of file moeoGDominanceObjectiveVectorComparator.h. +Definition at line 50 of file moeoGDominanceObjectiveVectorComparator.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoGDominanceObjectiveVectorComparator\fP< ObjectiveVector >::\fBmoeoGDominanceObjectiveVectorComparator\fP (ObjectiveVector & _ref)\fC [inline]\fP" @@ -66,7 +66,7 @@ Ctor. .PP .PP -Definition at line 33 of file moeoGDominanceObjectiveVectorComparator.h. +Definition at line 58 of file moeoGDominanceObjectiveVectorComparator.h. .SH "Member Function Documentation" .PP .SS "template const bool \fBmoeoGDominanceObjectiveVectorComparator\fP< ObjectiveVector >::operator() (const ObjectiveVector & _objectiveVector1, const ObjectiveVector & _objectiveVector2)\fC [inline]\fP" @@ -82,7 +82,7 @@ Returns true if _objectiveVector1 is g-dominated by _objectiveVector2. .PP .PP -Definition at line 42 of file moeoGDominanceObjectiveVectorComparator.h. +Definition at line 67 of file moeoGDominanceObjectiveVectorComparator.h. .PP References moeoGDominanceObjectiveVectorComparator< ObjectiveVector >::flag(), and moeoGDominanceObjectiveVectorComparator< ObjectiveVector >::paretoComparator. .SS "template unsigned int \fBmoeoGDominanceObjectiveVectorComparator\fP< ObjectiveVector >::flag (const ObjectiveVector & _objectiveVector)\fC [inline, private]\fP" @@ -96,7 +96,7 @@ Returns the flag of _objectiveVector according to the reference point. .PP .PP -Definition at line 76 of file moeoGDominanceObjectiveVectorComparator.h. +Definition at line 101 of file moeoGDominanceObjectiveVectorComparator.h. .PP References moeoGDominanceObjectiveVectorComparator< ObjectiveVector >::ref. .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoGenerationalReplacement.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoGenerationalReplacement.3 index c99c8b14d..3a55f2432 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoGenerationalReplacement.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoGenerationalReplacement.3 @@ -26,7 +26,7 @@ Inherits \fBmoeoReplacement< MOEOT >< MOEOT >\fP, and \fBeoGenerationalReplaceme .SS "template class moeoGenerationalReplacement< MOEOT >" Generational replacement: only the new individuals are preserved. .PP -Definition at line 23 of file moeoGenerationalReplacement.h. +Definition at line 48 of file moeoGenerationalReplacement.h. .SH "Member Function Documentation" .PP .SS "template void \fBmoeoGenerationalReplacement\fP< MOEOT >::operator() (\fBeoPop\fP< MOEOT > & _parents, \fBeoPop\fP< MOEOT > & _offspring)\fC [inline]\fP" @@ -44,7 +44,7 @@ Swaps _parents and _offspring. .PP Reimplemented from \fBeoGenerationalReplacement< MOEOT >\fP. .PP -Definition at line 32 of file moeoGenerationalReplacement.h. +Definition at line 57 of file moeoGenerationalReplacement.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoHybridLS.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoHybridLS.3 index 7640dd8a7..8f19ba1fe 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoHybridLS.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoHybridLS.3 @@ -50,7 +50,7 @@ Inherits \fBeoUpdater\fP. .SS "template class 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. .PP -Definition at line 28 of file moeoHybridLS.h. +Definition at line 53 of file moeoHybridLS.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoHybridLS\fP< MOEOT >::\fBmoeoHybridLS\fP (\fBeoContinue\fP< MOEOT > & _term, \fBeoSelect\fP< MOEOT > & _select, \fBmoeoLS\fP< MOEOT, MOEOT > & _mols, \fBmoeoArchive\fP< MOEOT > & _arch)\fC [inline]\fP" @@ -70,7 +70,7 @@ Ctor. .PP .PP -Definition at line 39 of file moeoHybridLS.h. +Definition at line 64 of file moeoHybridLS.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoHypervolumeBinaryMetric.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoHypervolumeBinaryMetric.3 index 7e89c209a..6ff2cf7ad 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoHypervolumeBinaryMetric.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoHypervolumeBinaryMetric.3 @@ -52,7 +52,7 @@ Hypervolume binary metric allowing to compare two objective vectors as proposed : 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). .PP -Definition at line 29 of file moeoHypervolumeBinaryMetric.h. +Definition at line 54 of file moeoHypervolumeBinaryMetric.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoHypervolumeBinaryMetric\fP< ObjectiveVector >::\fBmoeoHypervolumeBinaryMetric\fP (double _rho = \fC1.1\fP)\fC [inline]\fP" @@ -66,7 +66,7 @@ Ctor. .PP .PP -Definition at line 37 of file moeoHypervolumeBinaryMetric.h. +Definition at line 62 of file moeoHypervolumeBinaryMetric.h. .PP References moeoHypervolumeBinaryMetric< ObjectiveVector >::rho. .SH "Member Function Documentation" @@ -89,7 +89,7 @@ don't forget to set the bounds for every objective before the call of this funct .PP .PP -Definition at line 63 of file moeoHypervolumeBinaryMetric.h. +Definition at line 88 of file moeoHypervolumeBinaryMetric.h. .PP References moeoHypervolumeBinaryMetric< ObjectiveVector >::hypervolume(), and moeoHypervolumeBinaryMetric< ObjectiveVector >::paretoComparator. .SS "template double \fBmoeoHypervolumeBinaryMetric\fP< ObjectiveVector >::hypervolume (const ObjectiveVector & _o1, const ObjectiveVector & _o2, const unsigned int _obj, const bool _flag = \fCfalse\fP)\fC [inline, private]\fP" @@ -109,7 +109,7 @@ Returns the volume of the space that is dominated by _o2 but not by _o1 with res .PP .PP -Definition at line 96 of file moeoHypervolumeBinaryMetric.h. +Definition at line 121 of file moeoHypervolumeBinaryMetric.h. .PP References moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, double >::bounds, and moeoHypervolumeBinaryMetric< ObjectiveVector >::rho. .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIBEA.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIBEA.3 index b6176b164..f1f7c9fd7 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIBEA.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIBEA.3 @@ -100,7 +100,7 @@ IBEA (Indicator-Based Evolutionary Algorithm) as described in: E. 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. .PP -Definition at line 38 of file moeoIBEA.h. +Definition at line 63 of file moeoIBEA.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoIBEA\fP< MOEOT >::\fBmoeoIBEA\fP (unsigned int _maxGen, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoGenOp\fP< MOEOT > & _op, \fBmoeoNormalizedSolutionVsSolutionBinaryMetric\fP< \fBObjectiveVector\fP, double > & _metric, const double _kappa = \fC0.05\fP)\fC [inline]\fP" @@ -122,7 +122,7 @@ Simple ctor with a \fBeoGenOp\fP. .PP .PP -Definition at line 54 of file moeoIBEA.h. +Definition at line 79 of file moeoIBEA.h. .SS "template \fBmoeoIBEA\fP< MOEOT >::\fBmoeoIBEA\fP (unsigned int _maxGen, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoTransform\fP< MOEOT > & _op, \fBmoeoNormalizedSolutionVsSolutionBinaryMetric\fP< \fBObjectiveVector\fP, double > & _metric, const double _kappa = \fC0.05\fP)\fC [inline]\fP" .PP Simple ctor with a \fBeoTransform\fP. @@ -142,7 +142,7 @@ Simple ctor with a \fBeoTransform\fP. .PP .PP -Definition at line 68 of file moeoIBEA.h. +Definition at line 93 of file moeoIBEA.h. .SS "template \fBmoeoIBEA\fP< MOEOT >::\fBmoeoIBEA\fP (unsigned int _maxGen, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoQuadOp\fP< MOEOT > & _crossover, double _pCross, \fBeoMonOp\fP< MOEOT > & _mutation, double _pMut, \fBmoeoNormalizedSolutionVsSolutionBinaryMetric\fP< \fBObjectiveVector\fP, double > & _metric, const double _kappa = \fC0.05\fP)\fC [inline]\fP" .PP Ctor with a crossover, a mutation and their corresponding rates. @@ -168,7 +168,7 @@ Ctor with a crossover, a mutation and their corresponding rates. .PP .PP -Definition at line 85 of file moeoIBEA.h. +Definition at line 110 of file moeoIBEA.h. .SS "template \fBmoeoIBEA\fP< MOEOT >::\fBmoeoIBEA\fP (\fBeoContinue\fP< MOEOT > & _continuator, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoGenOp\fP< MOEOT > & _op, \fBmoeoNormalizedSolutionVsSolutionBinaryMetric\fP< \fBObjectiveVector\fP, double > & _metric, const double _kappa = \fC0.05\fP)\fC [inline]\fP" .PP Ctor with a continuator (instead of _maxGen) and a \fBeoGenOp\fP. @@ -188,7 +188,7 @@ Ctor with a continuator (instead of _maxGen) and a \fBeoGenOp\fP. .PP .PP -Definition at line 100 of file moeoIBEA.h. +Definition at line 125 of file moeoIBEA.h. .SS "template \fBmoeoIBEA\fP< MOEOT >::\fBmoeoIBEA\fP (\fBeoContinue\fP< MOEOT > & _continuator, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoTransform\fP< MOEOT > & _op, \fBmoeoNormalizedSolutionVsSolutionBinaryMetric\fP< \fBObjectiveVector\fP, double > & _metric, const double _kappa = \fC0.05\fP)\fC [inline]\fP" .PP Ctor with a continuator (instead of _maxGen) and a \fBeoTransform\fP. @@ -208,7 +208,7 @@ Ctor with a continuator (instead of _maxGen) and a \fBeoTransform\fP. .PP .PP -Definition at line 114 of file moeoIBEA.h. +Definition at line 139 of file moeoIBEA.h. .SH "Member Function Documentation" .PP .SS "template virtual void \fBmoeoIBEA\fP< MOEOT >::operator() (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, virtual]\fP" @@ -222,7 +222,7 @@ Apply a few generation of evolution to the population _pop until the stopping cr .PP .PP -Definition at line 124 of file moeoIBEA.h. +Definition at line 149 of file moeoIBEA.h. .PP References moeoIBEA< MOEOT >::breed, moeoIBEA< MOEOT >::continuator, moeoIBEA< MOEOT >::dummyDiversityAssignment, moeoIBEA< MOEOT >::fitnessAssignment, moeoIBEA< MOEOT >::popEval, and moeoIBEA< MOEOT >::replace. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIBMOLS.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIBMOLS.3 deleted file mode 100644 index fb196da6b..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIBMOLS.3 +++ /dev/null @@ -1,168 +0,0 @@ -.TH "moeoIBMOLS" 3 "8 Oct 2007" "Version 1.0" "ParadisEO-MOEOMovingObjects" \" -*- nroff -*- -.ad l -.nh -.SH NAME -moeoIBMOLS \- Indicator-Based Multi-Objective Local Search (IBMOLS) as described in Basseur M., Burke K. - -.PP -.SH SYNOPSIS -.br -.PP -\fC#include \fP -.PP -Inherits \fBmoeoLS< MOEOT, eoPop< MOEOT > & >\fP. -.PP -.SS "Public Types" - -.in +1c -.ti -1c -.RI "typedef MOEOT::ObjectiveVector \fBObjectiveVector\fP" -.br -.RI "\fIThe type of objective vector. \fP" -.in -1c -.SS "Public Member Functions" - -.in +1c -.ti -1c -.RI "\fBmoeoIBMOLS\fP (moMoveInit< Move > &_moveInit, moNextMove< Move > &_nextMove, \fBeoEvalFunc\fP< MOEOT > &_eval, \fBmoeoMoveIncrEval\fP< Move > &_moveIncrEval, \fBmoeoBinaryIndicatorBasedFitnessAssignment\fP< MOEOT > &_fitnessAssignment, \fBeoContinue\fP< MOEOT > &_continuator)" -.br -.RI "\fICtor. \fP" -.ti -1c -.RI "void \fBoperator()\fP (\fBeoPop\fP< MOEOT > &_pop, \fBmoeoArchive\fP< MOEOT > &_arch)" -.br -.RI "\fIApply the local search until a local archive does not change or another stopping criteria is met and update the archive _arch with new non-dominated solutions. \fP" -.in -1c -.SS "Private Member Functions" - -.in +1c -.ti -1c -.RI "void \fBoneStep\fP (\fBeoPop\fP< MOEOT > &_pop)" -.br -.RI "\fIApply one step of the local search to the population _pop. \fP" -.ti -1c -.RI "void \fBnew_oneStep\fP (\fBeoPop\fP< MOEOT > &_pop)" -.br -.RI "\fIApply one step of the local search to the population _pop. \fP" -.in -1c -.SS "Private Attributes" - -.in +1c -.ti -1c -.RI "moMoveInit< Move > & \fBmoveInit\fP" -.br -.RI "\fIthe move initializer \fP" -.ti -1c -.RI "moNextMove< Move > & \fBnextMove\fP" -.br -.RI "\fIthe neighborhood explorer \fP" -.ti -1c -.RI "\fBeoEvalFunc\fP< MOEOT > & \fBeval\fP" -.br -.RI "\fIthe full evaluation \fP" -.ti -1c -.RI "\fBmoeoMoveIncrEval\fP< Move > & \fBmoveIncrEval\fP" -.br -.RI "\fIthe incremental evaluation \fP" -.ti -1c -.RI "\fBmoeoBinaryIndicatorBasedFitnessAssignment\fP< MOEOT > & \fBfitnessAssignment\fP" -.br -.RI "\fIthe fitness assignment strategy \fP" -.ti -1c -.RI "\fBeoContinue\fP< MOEOT > & \fBcontinuator\fP" -.br -.RI "\fIthe stopping criteria \fP" -.in -1c -.SS "Classes" - -.in +1c -.ti -1c -.RI "class \fBOneObjectiveComparator\fP" -.br -.in -1c -.SH "Detailed Description" -.PP - -.SS "template class moeoIBMOLS< MOEOT, Move >" -Indicator-Based Multi-Objective Local Search (IBMOLS) as described in Basseur M., Burke K. - -: 'Indicator-Based Multi-Objective Local Search' (2007). -.PP -Definition at line 33 of file moeoIBMOLS.h. -.SH "Constructor & Destructor Documentation" -.PP -.SS "template \fBmoeoIBMOLS\fP< MOEOT, Move >::\fBmoeoIBMOLS\fP (moMoveInit< Move > & _moveInit, moNextMove< Move > & _nextMove, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBmoeoMoveIncrEval\fP< Move > & _moveIncrEval, \fBmoeoBinaryIndicatorBasedFitnessAssignment\fP< MOEOT > & _fitnessAssignment, \fBeoContinue\fP< MOEOT > & _continuator)\fC [inline]\fP" -.PP -Ctor. -.PP -\fBParameters:\fP -.RS 4 -\fI_moveInit\fP the move initializer -.br -\fI_nextMove\fP the neighborhood explorer -.br -\fI_eval\fP the full evaluation -.br -\fI_moveIncrEval\fP the incremental evaluation -.br -\fI_fitnessAssignment\fP the fitness assignment strategy -.br -\fI_continuator\fP the stopping criteria -.RE -.PP - -.PP -Definition at line 50 of file moeoIBMOLS.h. -.SH "Member Function Documentation" -.PP -.SS "template void \fBmoeoIBMOLS\fP< MOEOT, Move >::operator() (\fBeoPop\fP< MOEOT > & _pop, \fBmoeoArchive\fP< MOEOT > & _arch)\fC [inline, virtual]\fP" -.PP -Apply the local search until a local archive does not change or another stopping criteria is met and update the archive _arch with new non-dominated solutions. -.PP -\fBParameters:\fP -.RS 4 -\fI_pop\fP the initial population -.br -\fI_arch\fP the (updated) archive -.RE -.PP - -.PP -Implements \fBeoBF< eoPop< MOEOT > &, moeoArchive< MOEOT > &, void >\fP. -.PP -Definition at line 73 of file moeoIBMOLS.h. -.PP -References moeoIBMOLS< MOEOT, Move >::continuator, moeoArchive< MOEOT >::equals(), moeoIBMOLS< MOEOT, Move >::fitnessAssignment, moeoIBMOLS< MOEOT, Move >::oneStep(), and moeoArchive< MOEOT >::update(). -.SS "template void \fBmoeoIBMOLS\fP< MOEOT, Move >::oneStep (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, private]\fP" -.PP -Apply one step of the local search to the population _pop. -.PP -\fBParameters:\fP -.RS 4 -\fI_pop\fP the population -.RE -.PP - -.PP -Definition at line 120 of file moeoIBMOLS.h. -.PP -References moeoIBMOLS< MOEOT, Move >::continuator, moeoIBMOLS< MOEOT, Move >::fitnessAssignment, moeoIBMOLS< MOEOT, Move >::moveIncrEval, moeoIBMOLS< MOEOT, Move >::moveInit, and moeoIBMOLS< MOEOT, Move >::nextMove. -.PP -Referenced by moeoIBMOLS< MOEOT, Move >::operator()(). -.SS "template void \fBmoeoIBMOLS\fP< MOEOT, Move >::new_oneStep (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, private]\fP" -.PP -Apply one step of the local search to the population _pop. -.PP -\fBParameters:\fP -.RS 4 -\fI_pop\fP the population -.RE -.PP - -.PP -Definition at line 304 of file moeoIBMOLS.h. -.PP -References moeoIBMOLS< MOEOT, Move >::continuator, moeoIBMOLS< MOEOT, Move >::fitnessAssignment, moeoIBMOLS< MOEOT, Move >::moveIncrEval, moeoIBMOLS< MOEOT, Move >::moveInit, and moeoIBMOLS< MOEOT, Move >::nextMove. - -.SH "Author" -.PP -Generated automatically by Doxygen for ParadisEO-MOEOMovingObjects from the source code. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIBMOLS_OneObjectiveComparator.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIBMOLS_OneObjectiveComparator.3 deleted file mode 100644 index 1323b146e..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIBMOLS_OneObjectiveComparator.3 +++ /dev/null @@ -1,38 +0,0 @@ -.TH "moeoIBMOLS::OneObjectiveComparator" 3 "8 Oct 2007" "Version 1.0" "ParadisEO-MOEOMovingObjects" \" -*- nroff -*- -.ad l -.nh -.SH NAME -moeoIBMOLS::OneObjectiveComparator \- -.SH SYNOPSIS -.br -.PP -Inherits \fBmoeoComparator< MOEOT >< MOEOT >\fP. -.PP -.SS "Public Member Functions" - -.in +1c -.ti -1c -.RI "\fBOneObjectiveComparator\fP (unsigned int _obj)" -.br -.ti -1c -.RI "const bool \fBoperator()\fP (const MOEOT &_moeo1, const MOEOT &_moeo2)" -.br -.in -1c -.SS "Private Attributes" - -.in +1c -.ti -1c -.RI "unsigned int \fBobj\fP" -.br -.in -1c -.SH "Detailed Description" -.PP - -.SS "template class moeoIBMOLS< MOEOT, Move >::OneObjectiveComparator" - -.PP -Definition at line 462 of file moeoIBMOLS.h. - -.SH "Author" -.PP -Generated automatically by Doxygen for ParadisEO-MOEOMovingObjects from the source code. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIndicatorBasedFitnessAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIndicatorBasedFitnessAssignment.3 index 105295805..0b64d62d6 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIndicatorBasedFitnessAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIndicatorBasedFitnessAssignment.3 @@ -20,7 +20,7 @@ Inherited by \fBmoeoBinaryIndicatorBasedFitnessAssignment< MOEOT >\fP, and \fBmo .SS "template class moeoIndicatorBasedFitnessAssignment< MOEOT >" \fBmoeoIndicatorBasedFitnessAssignment\fP is a \fBmoeoFitnessAssignment\fP for Indicator-based strategies. .PP -Definition at line 22 of file moeoIndicatorBasedFitnessAssignment.h. +Definition at line 47 of file moeoIndicatorBasedFitnessAssignment.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIteratedIBMOLS.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIteratedIBMOLS.3 deleted file mode 100644 index 4ccf4fad5..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoIteratedIBMOLS.3 +++ /dev/null @@ -1,151 +0,0 @@ -.TH "moeoIteratedIBMOLS" 3 "8 Oct 2007" "Version 1.0" "ParadisEO-MOEOMovingObjects" \" -*- nroff -*- -.ad l -.nh -.SH NAME -moeoIteratedIBMOLS \- Iterated version of IBMOLS as described in Basseur M., Burke K. - -.PP -.SH SYNOPSIS -.br -.PP -\fC#include \fP -.PP -Inherits \fBmoeoLS< MOEOT, eoPop< MOEOT > & >\fP. -.PP -.SS "Public Types" - -.in +1c -.ti -1c -.RI "typedef MOEOT::ObjectiveVector \fBObjectiveVector\fP" -.br -.RI "\fIThe type of objective vector. \fP" -.in -1c -.SS "Public Member Functions" - -.in +1c -.ti -1c -.RI "\fBmoeoIteratedIBMOLS\fP (moMoveInit< Move > &_moveInit, moNextMove< Move > &_nextMove, \fBeoEvalFunc\fP< MOEOT > &_eval, \fBmoeoMoveIncrEval\fP< Move > &_moveIncrEval, \fBmoeoBinaryIndicatorBasedFitnessAssignment\fP< MOEOT > &_fitnessAssignment, \fBeoContinue\fP< MOEOT > &_continuator, \fBeoMonOp\fP< MOEOT > &_monOp, \fBeoMonOp\fP< MOEOT > &_randomMonOp, unsigned int _nNoiseIterations=1)" -.br -.RI "\fICtor. \fP" -.ti -1c -.RI "void \fBoperator()\fP (\fBeoPop\fP< MOEOT > &_pop, \fBmoeoArchive\fP< MOEOT > &_arch)" -.br -.RI "\fIApply the local search iteratively until the stopping criteria is met. \fP" -.in -1c -.SS "Private Member Functions" - -.in +1c -.ti -1c -.RI "void \fBgenerateNewSolutions\fP (\fBeoPop\fP< MOEOT > &_pop, const \fBmoeoArchive\fP< MOEOT > &_arch)" -.br -.RI "\fICreates new population randomly initialized and/or initialized from the archive _arch. \fP" -.in -1c -.SS "Private Attributes" - -.in +1c -.ti -1c -.RI "\fBmoeoIBMOLS\fP< MOEOT, Move > \fBibmols\fP" -.br -.RI "\fIthe local search to iterate \fP" -.ti -1c -.RI "\fBeoEvalFunc\fP< MOEOT > & \fBeval\fP" -.br -.RI "\fIthe full evaluation \fP" -.ti -1c -.RI "\fBeoContinue\fP< MOEOT > & \fBcontinuator\fP" -.br -.RI "\fIthe stopping criteria \fP" -.ti -1c -.RI "\fBeoMonOp\fP< MOEOT > & \fBmonOp\fP" -.br -.RI "\fIthe monary operator \fP" -.ti -1c -.RI "\fBeoMonOp\fP< MOEOT > & \fBrandomMonOp\fP" -.br -.RI "\fIthe random monary operator (or random initializer) \fP" -.ti -1c -.RI "unsigned int \fBnNoiseIterations\fP" -.br -.RI "\fIthe number of iterations to apply the random noise \fP" -.in -1c -.SH "Detailed Description" -.PP - -.SS "template class moeoIteratedIBMOLS< MOEOT, Move >" -Iterated version of IBMOLS as described in Basseur M., Burke K. - -: 'Indicator-Based Multi-Objective Local Search' (2007). -.PP -Definition at line 41 of file moeoIteratedIBMOLS.h. -.SH "Constructor & Destructor Documentation" -.PP -.SS "template \fBmoeoIteratedIBMOLS\fP< MOEOT, Move >::\fBmoeoIteratedIBMOLS\fP (moMoveInit< Move > & _moveInit, moNextMove< Move > & _nextMove, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBmoeoMoveIncrEval\fP< Move > & _moveIncrEval, \fBmoeoBinaryIndicatorBasedFitnessAssignment\fP< MOEOT > & _fitnessAssignment, \fBeoContinue\fP< MOEOT > & _continuator, \fBeoMonOp\fP< MOEOT > & _monOp, \fBeoMonOp\fP< MOEOT > & _randomMonOp, unsigned int _nNoiseIterations = \fC1\fP)\fC [inline]\fP" -.PP -Ctor. -.PP -\fBParameters:\fP -.RS 4 -\fI_moveInit\fP the move initializer -.br -\fI_nextMove\fP the neighborhood explorer -.br -\fI_eval\fP the full evaluation -.br -\fI_moveIncrEval\fP the incremental evaluation -.br -\fI_fitnessAssignment\fP the fitness assignment strategy -.br -\fI_continuator\fP the stopping criteria -.br -\fI_monOp\fP the monary operator -.br -\fI_randomMonOp\fP the random monary operator (or random initializer) -.br -\fI_nNoiseIterations\fP the number of iterations to apply the random noise -.RE -.PP - -.PP -Definition at line 61 of file moeoIteratedIBMOLS.h. -.SH "Member Function Documentation" -.PP -.SS "template void \fBmoeoIteratedIBMOLS\fP< MOEOT, Move >::operator() (\fBeoPop\fP< MOEOT > & _pop, \fBmoeoArchive\fP< MOEOT > & _arch)\fC [inline, virtual]\fP" -.PP -Apply the local search iteratively until the stopping criteria is met. -.PP -\fBParameters:\fP -.RS 4 -\fI_pop\fP the initial population -.br -\fI_arch\fP the (updated) archive -.RE -.PP - -.PP -Implements \fBeoBF< eoPop< MOEOT > &, moeoArchive< MOEOT > &, void >\fP. -.PP -Definition at line 86 of file moeoIteratedIBMOLS.h. -.PP -References moeoIteratedIBMOLS< MOEOT, Move >::continuator, moeoIteratedIBMOLS< MOEOT, Move >::generateNewSolutions(), moeoIteratedIBMOLS< MOEOT, Move >::ibmols, and moeoArchive< MOEOT >::update(). -.SS "template void \fBmoeoIteratedIBMOLS\fP< MOEOT, Move >::generateNewSolutions (\fBeoPop\fP< MOEOT > & _pop, const \fBmoeoArchive\fP< MOEOT > & _arch)\fC [inline, private]\fP" -.PP -Creates new population randomly initialized and/or initialized from the archive _arch. -.PP -\fBParameters:\fP -.RS 4 -\fI_pop\fP the output population -.br -\fI_arch\fP the archive -.RE -.PP - -.PP -Definition at line 121 of file moeoIteratedIBMOLS.h. -.PP -References moeoIteratedIBMOLS< MOEOT, Move >::eval, eoPop< EOT >::invalidate(), moeoIteratedIBMOLS< MOEOT, Move >::monOp, moeoIteratedIBMOLS< MOEOT, Move >::nNoiseIterations, and moeoIteratedIBMOLS< MOEOT, Move >::randomMonOp. -.PP -Referenced by moeoIteratedIBMOLS< MOEOT, Move >::operator()(). - -.SH "Author" -.PP -Generated automatically by Doxygen for ParadisEO-MOEOMovingObjects from the source code. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoLS.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoLS.3 index e680dec5b..1c9714321 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoLS.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoLS.3 @@ -22,7 +22,7 @@ Abstract class for local searches applied to multi-objective optimization. Starting from a Type (i.e.: an individual, a pop, an archive...), it produces a set of new non-dominated solutions. .PP -Definition at line 25 of file moeoLS.h. +Definition at line 50 of file moeoLS.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoManhattanDistance.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoManhattanDistance.3 index dd571d4dc..ed2f0cebe 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoManhattanDistance.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoManhattanDistance.3 @@ -36,7 +36,7 @@ A class allowing to compute the Manhattan distance between two solutions in the between 0 and 1). A distance value then lies between 0 and nObjectives. .PP -Definition at line 24 of file moeoManhattanDistance.h. +Definition at line 49 of file moeoManhattanDistance.h. .SH "Member Function Documentation" .PP .SS "template const double \fBmoeoManhattanDistance\fP< MOEOT >::operator() (const MOEOT & _moeo1, const MOEOT & _moeo2)\fC [inline]\fP" @@ -52,7 +52,7 @@ Returns the Manhattan distance between _moeo1 and _moeo2 in the objective space. .PP .PP -Definition at line 37 of file moeoManhattanDistance.h. +Definition at line 62 of file moeoManhattanDistance.h. .PP References moeoNormalizedDistance< MOEOT >::bounds. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoMetric.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoMetric.3 index 5f6e2e3b6..11393bb43 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoMetric.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoMetric.3 @@ -18,7 +18,7 @@ Inherited by \fBmoeoBinaryMetric< A1, A2, R >\fP, \fBmoeoBinaryMetric< const con .PP Base class for performance metrics (also known as quality indicators). .PP -Definition at line 22 of file moeoMetric.h. +Definition at line 47 of file moeoMetric.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoMoveIncrEval.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoMoveIncrEval.3 deleted file mode 100644 index 3bbbf9481..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoMoveIncrEval.3 +++ /dev/null @@ -1,21 +0,0 @@ -.TH "moeoMoveIncrEval" 3 "8 Oct 2007" "Version 1.0" "ParadisEO-MOEOMovingObjects" \" -*- nroff -*- -.ad l -.nh -.SH NAME -moeoMoveIncrEval \- -.SH SYNOPSIS -.br -.PP -Inherits \fBeoBF< A1, A2, R >< const const Move &, Move::EOType &, Move::EOType::ObjectiveVector >\fP. -.PP -.SH "Detailed Description" -.PP - -.SS "template class moeoMoveIncrEval< Move >" - -.PP -Definition at line 9 of file moeoMoveIncrEval.h. - -.SH "Author" -.PP -Generated automatically by Doxygen for ParadisEO-MOEOMovingObjects from the source code. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNSGA.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNSGA.3 index 59219452c..89ffd09aa 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNSGA.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNSGA.3 @@ -92,7 +92,7 @@ NSGA (Non-dominated Sorting Genetic Algorithm) as described in: N. 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. .PP -Definition at line 37 of file moeoNSGA.h. +Definition at line 62 of file moeoNSGA.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoNSGA\fP< MOEOT >::\fBmoeoNSGA\fP (unsigned int _maxGen, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoGenOp\fP< MOEOT > & _op, double _nicheSize = \fC0.5\fP)\fC [inline]\fP" @@ -112,7 +112,7 @@ Simple ctor with a \fBeoGenOp\fP. .PP .PP -Definition at line 48 of file moeoNSGA.h. +Definition at line 73 of file moeoNSGA.h. .SS "template \fBmoeoNSGA\fP< MOEOT >::\fBmoeoNSGA\fP (unsigned int _maxGen, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoTransform\fP< MOEOT > & _op, double _nicheSize = \fC0.5\fP)\fC [inline]\fP" .PP Simple ctor with a \fBeoTransform\fP. @@ -130,7 +130,7 @@ Simple ctor with a \fBeoTransform\fP. .PP .PP -Definition at line 61 of file moeoNSGA.h. +Definition at line 86 of file moeoNSGA.h. .SS "template \fBmoeoNSGA\fP< MOEOT >::\fBmoeoNSGA\fP (unsigned int _maxGen, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoQuadOp\fP< MOEOT > & _crossover, double _pCross, \fBeoMonOp\fP< MOEOT > & _mutation, double _pMut, double _nicheSize = \fC0.5\fP)\fC [inline]\fP" .PP Ctor with a crossover, a mutation and their corresponding rates. @@ -154,7 +154,7 @@ Ctor with a crossover, a mutation and their corresponding rates. .PP .PP -Definition at line 77 of file moeoNSGA.h. +Definition at line 102 of file moeoNSGA.h. .SS "template \fBmoeoNSGA\fP< MOEOT >::\fBmoeoNSGA\fP (\fBeoContinue\fP< MOEOT > & _continuator, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoGenOp\fP< MOEOT > & _op, double _nicheSize = \fC0.5\fP)\fC [inline]\fP" .PP Ctor with a continuator (instead of _maxGen) and a \fBeoGenOp\fP. @@ -172,7 +172,7 @@ Ctor with a continuator (instead of _maxGen) and a \fBeoGenOp\fP. .PP .PP -Definition at line 91 of file moeoNSGA.h. +Definition at line 116 of file moeoNSGA.h. .SS "template \fBmoeoNSGA\fP< MOEOT >::\fBmoeoNSGA\fP (\fBeoContinue\fP< MOEOT > & _continuator, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoTransform\fP< MOEOT > & _op, double _nicheSize = \fC0.5\fP)\fC [inline]\fP" .PP Ctor with a continuator (instead of _maxGen) and a \fBeoTransform\fP. @@ -190,7 +190,7 @@ Ctor with a continuator (instead of _maxGen) and a \fBeoTransform\fP. .PP .PP -Definition at line 104 of file moeoNSGA.h. +Definition at line 129 of file moeoNSGA.h. .SH "Member Function Documentation" .PP .SS "template virtual void \fBmoeoNSGA\fP< MOEOT >::operator() (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, virtual]\fP" @@ -204,7 +204,7 @@ Apply a few generation of evolution to the population _pop until the stopping cr .PP .PP -Definition at line 114 of file moeoNSGA.h. +Definition at line 139 of file moeoNSGA.h. .PP References moeoNSGA< MOEOT >::breed, moeoNSGA< MOEOT >::continuator, moeoNSGA< MOEOT >::diversityAssignment, moeoNSGA< MOEOT >::fitnessAssignment, moeoNSGA< MOEOT >::popEval, and moeoNSGA< MOEOT >::replace. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNSGAII.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNSGAII.3 index 67bc2a56f..c756a7eed 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNSGAII.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNSGAII.3 @@ -100,7 +100,7 @@ NSGA-II (Non-dominated Sorting Genetic Algorithm II) as described in: Deb, K., S 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. .PP -Definition at line 40 of file moeoNSGAII.h. +Definition at line 65 of file moeoNSGAII.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoNSGAII\fP< MOEOT >::\fBmoeoNSGAII\fP (unsigned int _maxGen, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoGenOp\fP< MOEOT > & _op)\fC [inline]\fP" @@ -118,7 +118,7 @@ Simple ctor with a \fBeoGenOp\fP. .PP .PP -Definition at line 50 of file moeoNSGAII.h. +Definition at line 75 of file moeoNSGAII.h. .SS "template \fBmoeoNSGAII\fP< MOEOT >::\fBmoeoNSGAII\fP (unsigned int _maxGen, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoTransform\fP< MOEOT > & _op)\fC [inline]\fP" .PP Simple ctor with a \fBeoTransform\fP. @@ -134,7 +134,7 @@ Simple ctor with a \fBeoTransform\fP. .PP .PP -Definition at line 63 of file moeoNSGAII.h. +Definition at line 88 of file moeoNSGAII.h. .SS "template \fBmoeoNSGAII\fP< MOEOT >::\fBmoeoNSGAII\fP (unsigned int _maxGen, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoQuadOp\fP< MOEOT > & _crossover, double _pCross, \fBeoMonOp\fP< MOEOT > & _mutation, double _pMut)\fC [inline]\fP" .PP Ctor with a crossover, a mutation and their corresponding rates. @@ -156,7 +156,7 @@ Ctor with a crossover, a mutation and their corresponding rates. .PP .PP -Definition at line 79 of file moeoNSGAII.h. +Definition at line 104 of file moeoNSGAII.h. .SS "template \fBmoeoNSGAII\fP< MOEOT >::\fBmoeoNSGAII\fP (\fBeoContinue\fP< MOEOT > & _continuator, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoGenOp\fP< MOEOT > & _op)\fC [inline]\fP" .PP Ctor with a continuator (instead of _maxGen) and a \fBeoGenOp\fP. @@ -172,7 +172,7 @@ Ctor with a continuator (instead of _maxGen) and a \fBeoGenOp\fP. .PP .PP -Definition at line 92 of file moeoNSGAII.h. +Definition at line 117 of file moeoNSGAII.h. .SS "template \fBmoeoNSGAII\fP< MOEOT >::\fBmoeoNSGAII\fP (\fBeoContinue\fP< MOEOT > & _continuator, \fBeoEvalFunc\fP< MOEOT > & _eval, \fBeoTransform\fP< MOEOT > & _op)\fC [inline]\fP" .PP Ctor with a continuator (instead of _maxGen) and a \fBeoTransform\fP. @@ -188,7 +188,7 @@ Ctor with a continuator (instead of _maxGen) and a \fBeoTransform\fP. .PP .PP -Definition at line 105 of file moeoNSGAII.h. +Definition at line 130 of file moeoNSGAII.h. .SH "Member Function Documentation" .PP .SS "template virtual void \fBmoeoNSGAII\fP< MOEOT >::operator() (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, virtual]\fP" @@ -202,7 +202,7 @@ Apply a few generation of evolution to the population _pop until the stopping cr .PP .PP -Definition at line 116 of file moeoNSGAII.h. +Definition at line 141 of file moeoNSGAII.h. .PP References moeoNSGAII< MOEOT >::breed, moeoNSGAII< MOEOT >::continuator, moeoNSGAII< MOEOT >::diversityAssignment, moeoNSGAII< MOEOT >::fitnessAssignment, moeoNSGAII< MOEOT >::popEval, and moeoNSGAII< MOEOT >::replace. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNormalizedDistance.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNormalizedDistance.3 index a5a8efa54..b6ff4e951 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNormalizedDistance.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNormalizedDistance.3 @@ -64,7 +64,7 @@ The base class for double distance computation with normalized objective values between 0 and 1). .PP -Definition at line 24 of file moeoNormalizedDistance.h. +Definition at line 49 of file moeoNormalizedDistance.h. .SH "Member Function Documentation" .PP .SS "template virtual void \fBmoeoNormalizedDistance\fP< MOEOT, Type >::setup (const \fBeoPop\fP< MOEOT > & _pop)\fC [inline, virtual]\fP" @@ -80,7 +80,7 @@ Sets the lower and the upper bounds for every objective using extremes values fo .PP Reimplemented from \fBmoeoDistance< MOEOT, Type >\fP. .PP -Definition at line 59 of file moeoNormalizedDistance.h. +Definition at line 84 of file moeoNormalizedDistance.h. .PP Referenced by moeoNormalizedDistance< MOEOT >::setup(). .SS "template virtual void \fBmoeoNormalizedDistance\fP< MOEOT, Type >::setup (double _min, double _max, unsigned int _obj)\fC [inline, virtual]\fP" @@ -100,7 +100,7 @@ Sets the lower bound (_min) and the upper bound (_max) for the objective _obj. .PP Reimplemented from \fBmoeoDistance< MOEOT, Type >\fP. .PP -Definition at line 83 of file moeoNormalizedDistance.h. +Definition at line 108 of file moeoNormalizedDistance.h. .SS "template virtual void \fBmoeoNormalizedDistance\fP< MOEOT, Type >::setup (\fBeoRealInterval\fP _realInterval, unsigned int _obj)\fC [inline, virtual]\fP" .PP Sets the lower bound and the upper bound for the objective _obj using a \fBeoRealInterval\fP object. @@ -116,7 +116,7 @@ Sets the lower bound and the upper bound for the objective _obj using a \fBeoRea .PP Reimplemented from \fBmoeoDistance< MOEOT, Type >\fP. .PP -Definition at line 99 of file moeoNormalizedDistance.h. +Definition at line 124 of file moeoNormalizedDistance.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNormalizedSolutionVsSolutionBinaryMetric.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNormalizedSolutionVsSolutionBinaryMetric.3 index 3e5af66ff..b012fc27f 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNormalizedSolutionVsSolutionBinaryMetric.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoNormalizedSolutionVsSolutionBinaryMetric.3 @@ -52,7 +52,7 @@ Base class for binary metrics dedicated to the performance comparison between tw Then, indicator values lie in the interval [-1,1]. Note that you have to set the bounds for every objective before using the operator(). .PP -Definition at line 26 of file moeoNormalizedSolutionVsSolutionBinaryMetric.h. +Definition at line 51 of file moeoNormalizedSolutionVsSolutionBinaryMetric.h. .SH "Member Function Documentation" .PP .SS "template void \fBmoeoNormalizedSolutionVsSolutionBinaryMetric\fP< ObjectiveVector, R >::setup (double _min, double _max, unsigned int _obj)\fC [inline]\fP" @@ -70,9 +70,9 @@ Sets the lower bound (_min) and the upper bound (_max) for the objective _obj. .PP .PP -Definition at line 50 of file moeoNormalizedSolutionVsSolutionBinaryMetric.h. +Definition at line 75 of file moeoNormalizedSolutionVsSolutionBinaryMetric.h. .PP -Referenced by moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >::setup(), and moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::setup(). +Referenced by moeoExpBinaryIndicatorBasedFitnessAssignment< MOEOT >::setup(). .SS "template virtual void \fBmoeoNormalizedSolutionVsSolutionBinaryMetric\fP< ObjectiveVector, R >::setup (\fBeoRealInterval\fP _realInterval, unsigned int _obj)\fC [inline, virtual]\fP" .PP Sets the lower bound and the upper bound for the objective _obj using a \fBeoRealInterval\fP object. @@ -86,7 +86,7 @@ Sets the lower bound and the upper bound for the objective _obj using a \fBeoRea .PP .PP -Definition at line 66 of file moeoNormalizedSolutionVsSolutionBinaryMetric.h. +Definition at line 91 of file moeoNormalizedSolutionVsSolutionBinaryMetric.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveObjectiveVectorComparator.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveObjectiveVectorComparator.3 index de18839f9..49ae6adc3 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveObjectiveVectorComparator.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveObjectiveVectorComparator.3 @@ -26,7 +26,7 @@ Inherits \fBmoeoObjectiveVectorComparator< ObjectiveVector >< ObjectiveVector >\ .SS "template class moeoObjectiveObjectiveVectorComparator< ObjectiveVector >" Functor allowing to compare two objective vectors according to their first objective value, then their second, and so on. .PP -Definition at line 22 of file moeoObjectiveObjectiveVectorComparator.h. +Definition at line 47 of file moeoObjectiveObjectiveVectorComparator.h. .SH "Member Function Documentation" .PP .SS "template const bool \fBmoeoObjectiveObjectiveVectorComparator\fP< ObjectiveVector >::operator() (const ObjectiveVector & _objectiveVector1, const ObjectiveVector & _objectiveVector2)\fC [inline]\fP" @@ -42,7 +42,7 @@ Returns true if _objectiveVector1 < _objectiveVector2 on the first objective, th .PP .PP -Definition at line 31 of file moeoObjectiveObjectiveVectorComparator.h. +Definition at line 56 of file moeoObjectiveObjectiveVectorComparator.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveVector.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveVector.3 index 19bcd76e4..1e613cb7f 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveVector.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveVector.3 @@ -62,7 +62,7 @@ Abstract class allowing to represent a solution in the objective space (phenotyp The template argument ObjectiveVectorTraits defaults to \fBmoeoObjectiveVectorTraits\fP, 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. .PP -Definition at line 25 of file moeoObjectiveVector.h. +Definition at line 50 of file moeoObjectiveVector.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoObjectiveVector\fP< ObjectiveVectorTraits, ObjectiveVectorType >::\fBmoeoObjectiveVector\fP (std::vector< \fBType\fP > & _v)\fC [inline]\fP" @@ -76,7 +76,7 @@ Ctor from a vector of Type. .PP .PP -Definition at line 46 of file moeoObjectiveVector.h. +Definition at line 71 of file moeoObjectiveVector.h. .SH "Member Function Documentation" .PP .SS "template static void \fBmoeoObjectiveVector\fP< ObjectiveVectorTraits, ObjectiveVectorType >::setup (unsigned int _nObjectives, std::vector< bool > & _bObjectives)\fC [inline, static]\fP" @@ -92,7 +92,7 @@ Definition at line 46 of file moeoObjectiveVector.h. .PP .PP -Definition at line 55 of file moeoObjectiveVector.h. +Definition at line 80 of file moeoObjectiveVector.h. .SS "template static bool \fBmoeoObjectiveVector\fP< ObjectiveVectorTraits, ObjectiveVectorType >::minimizing (unsigned int _i)\fC [inline, static]\fP" .PP Returns true if the _ith objective have to be minimized. @@ -104,7 +104,7 @@ Returns true if the _ith objective have to be minimized. .PP .PP -Definition at line 74 of file moeoObjectiveVector.h. +Definition at line 99 of file moeoObjectiveVector.h. .SS "template static bool \fBmoeoObjectiveVector\fP< ObjectiveVectorTraits, ObjectiveVectorType >::maximizing (unsigned int _i)\fC [inline, static]\fP" .PP Returns true if the _ith objective have to be maximized. @@ -116,7 +116,7 @@ Returns true if the _ith objective have to be maximized. .PP .PP -Definition at line 84 of file moeoObjectiveVector.h. +Definition at line 109 of file moeoObjectiveVector.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveVectorComparator.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveVectorComparator.3 index 33cb4ab4d..139ce6e86 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveVectorComparator.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveVectorComparator.3 @@ -22,7 +22,7 @@ Abstract class allowing to compare 2 objective vectors. The template argument ObjectiveVector have to be a \fBmoeoObjectiveVector\fP. .PP -Definition at line 24 of file moeoObjectiveVectorComparator.h. +Definition at line 49 of file moeoObjectiveVectorComparator.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveVectorTraits.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveVectorTraits.3 index 6d887a952..aeb69decf 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveVectorTraits.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoObjectiveVectorTraits.3 @@ -52,7 +52,7 @@ Inherited by \fBFlowShopObjectiveVectorTraits\fP, and \fBSch1ObjectiveVectorTrai .PP A traits class for \fBmoeoObjectiveVector\fP to specify the number of objectives and which ones have to be minimized or maximized. .PP -Definition at line 23 of file moeoObjectiveVectorTraits.h. +Definition at line 48 of file moeoObjectiveVectorTraits.h. .SH "Member Function Documentation" .PP .SS "static void moeoObjectiveVectorTraits::setup (unsigned int _nObjectives, std::vector< bool > & _bObjectives)\fC [inline, static]\fP" @@ -68,7 +68,7 @@ Definition at line 23 of file moeoObjectiveVectorTraits.h. .PP .PP -Definition at line 32 of file moeoObjectiveVectorTraits.h. +Definition at line 57 of file moeoObjectiveVectorTraits.h. .PP References bObj, and nObj. .SS "static bool moeoObjectiveVectorTraits::minimizing (unsigned int _i)\fC [inline, static]\fP" @@ -82,7 +82,7 @@ Returns true if the _ith objective have to be minimized. .PP .PP -Definition at line 67 of file moeoObjectiveVectorTraits.h. +Definition at line 92 of file moeoObjectiveVectorTraits.h. .PP References bObj. .PP @@ -98,7 +98,7 @@ Returns true if the _ith objective have to be maximized. .PP .PP -Definition at line 80 of file moeoObjectiveVectorTraits.h. +Definition at line 105 of file moeoObjectiveVectorTraits.h. .PP References minimizing(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoOneObjectiveComparator.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoOneObjectiveComparator.3 index 9ee007ee9..532fdb8da 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoOneObjectiveComparator.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoOneObjectiveComparator.3 @@ -38,7 +38,7 @@ Inherits \fBmoeoComparator< MOEOT >< MOEOT >\fP. .SS "template class moeoOneObjectiveComparator< MOEOT >" Functor allowing to compare two solutions according to one objective. .PP -Definition at line 22 of file moeoOneObjectiveComparator.h. +Definition at line 47 of file moeoOneObjectiveComparator.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoOneObjectiveComparator\fP< MOEOT >::\fBmoeoOneObjectiveComparator\fP (unsigned int _obj)\fC [inline]\fP" @@ -52,7 +52,7 @@ Ctor. .PP .PP -Definition at line 30 of file moeoOneObjectiveComparator.h. +Definition at line 55 of file moeoOneObjectiveComparator.h. .PP References moeoOneObjectiveComparator< MOEOT >::obj. .SH "Member Function Documentation" @@ -70,7 +70,7 @@ Returns true if _moeo1 < _moeo2 on the obj objective. .PP .PP -Definition at line 44 of file moeoOneObjectiveComparator.h. +Definition at line 69 of file moeoOneObjectiveComparator.h. .PP References moeoOneObjectiveComparator< MOEOT >::obj. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoParetoBasedFitnessAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoParetoBasedFitnessAssignment.3 index 1b8d45f4b..09421d2cf 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoParetoBasedFitnessAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoParetoBasedFitnessAssignment.3 @@ -20,7 +20,7 @@ Inherited by \fBmoeoFastNonDominatedSortingFitnessAssignment< MOEOT >\fP. .SS "template class moeoParetoBasedFitnessAssignment< MOEOT >" \fBmoeoParetoBasedFitnessAssignment\fP is a \fBmoeoFitnessAssignment\fP for Pareto-based strategies. .PP -Definition at line 22 of file moeoParetoBasedFitnessAssignment.h. +Definition at line 47 of file moeoParetoBasedFitnessAssignment.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoParetoObjectiveVectorComparator.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoParetoObjectiveVectorComparator.3 index f8077bc6a..46d270827 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoParetoObjectiveVectorComparator.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoParetoObjectiveVectorComparator.3 @@ -26,7 +26,7 @@ Inherits \fBmoeoObjectiveVectorComparator< ObjectiveVector >< ObjectiveVector >\ .SS "template class moeoParetoObjectiveVectorComparator< ObjectiveVector >" This functor class allows to compare 2 objective vectors according to Pareto dominance. .PP -Definition at line 22 of file moeoParetoObjectiveVectorComparator.h. +Definition at line 47 of file moeoParetoObjectiveVectorComparator.h. .SH "Member Function Documentation" .PP .SS "template const bool \fBmoeoParetoObjectiveVectorComparator\fP< ObjectiveVector >::operator() (const ObjectiveVector & _objectiveVector1, const ObjectiveVector & _objectiveVector2)\fC [inline]\fP" @@ -42,7 +42,7 @@ Returns true if _objectiveVector1 is dominated by _objectiveVector2. .PP .PP -Definition at line 31 of file moeoParetoObjectiveVectorComparator.h. +Definition at line 56 of file moeoParetoObjectiveVectorComparator.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRandomSelect.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRandomSelect.3 index 46798b2d5..aaf8260a1 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRandomSelect.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRandomSelect.3 @@ -30,7 +30,7 @@ Inherits \fBmoeoSelectOne< MOEOT >< MOEOT >\fP, and \fBeoRandomSelect< MOEOT >\f .SS "template class moeoRandomSelect< MOEOT >" Selection strategy that selects only one element randomly from a whole population. .PP -Definition at line 23 of file moeoRandomSelect.h. +Definition at line 48 of file moeoRandomSelect.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRealObjectiveVector.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRealObjectiveVector.3 index f2bcf8c4c..7a399b0d2 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRealObjectiveVector.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRealObjectiveVector.3 @@ -60,7 +60,7 @@ This class allows to represent a solution in the objective space (phenotypic rep that an objective value is represented using a double, and this for any objective. .PP -Definition at line 27 of file moeoRealObjectiveVector.h. +Definition at line 52 of file moeoRealObjectiveVector.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoRealObjectiveVector\fP< ObjectiveVectorTraits >::\fBmoeoRealObjectiveVector\fP (std::vector< double > & _v)\fC [inline]\fP" @@ -74,7 +74,7 @@ Ctor from a vector of doubles. .PP .PP -Definition at line 45 of file moeoRealObjectiveVector.h. +Definition at line 70 of file moeoRealObjectiveVector.h. .SH "Member Function Documentation" .PP .SS "template bool \fBmoeoRealObjectiveVector\fP< ObjectiveVectorTraits >::dominates (const \fBmoeoRealObjectiveVector\fP< ObjectiveVectorTraits > & _other) const\fC [inline]\fP" @@ -88,7 +88,7 @@ Returns true if the current objective vector dominates _other according to the P .PP .PP -Definition at line 54 of file moeoRealObjectiveVector.h. +Definition at line 79 of file moeoRealObjectiveVector.h. .SS "template bool \fBmoeoRealObjectiveVector\fP< ObjectiveVectorTraits >::operator== (const \fBmoeoRealObjectiveVector\fP< ObjectiveVectorTraits > & _other) const\fC [inline]\fP" .PP Returns true if the current objective vector is equal to _other (according to a tolerance value). @@ -100,7 +100,7 @@ Returns true if the current objective vector is equal to _other (according to a .PP .PP -Definition at line 65 of file moeoRealObjectiveVector.h. +Definition at line 90 of file moeoRealObjectiveVector.h. .PP Referenced by moeoRealObjectiveVector< ObjectiveVectorTraits >::operator!=(), and moeoRealObjectiveVector< ObjectiveVectorTraits >::operator>=(). .SS "template bool \fBmoeoRealObjectiveVector\fP< ObjectiveVectorTraits >::operator!= (const \fBmoeoRealObjectiveVector\fP< ObjectiveVectorTraits > & _other) const\fC [inline]\fP" @@ -114,7 +114,7 @@ Returns true if the current objective vector is different than _other (according .PP .PP -Definition at line 82 of file moeoRealObjectiveVector.h. +Definition at line 107 of file moeoRealObjectiveVector.h. .PP References moeoRealObjectiveVector< ObjectiveVectorTraits >::operator==(). .SS "template bool \fBmoeoRealObjectiveVector\fP< ObjectiveVectorTraits >::operator< (const \fBmoeoRealObjectiveVector\fP< ObjectiveVectorTraits > & _other) const\fC [inline]\fP" @@ -128,7 +128,7 @@ Returns true if the current objective vector is smaller than _other on the first .PP .PP -Definition at line 93 of file moeoRealObjectiveVector.h. +Definition at line 118 of file moeoRealObjectiveVector.h. .PP Referenced by moeoRealObjectiveVector< ObjectiveVectorTraits >::operator<=(). .SS "template bool \fBmoeoRealObjectiveVector\fP< ObjectiveVectorTraits >::operator> (const \fBmoeoRealObjectiveVector\fP< ObjectiveVectorTraits > & _other) const\fC [inline]\fP" @@ -142,7 +142,7 @@ Returns true if the current objective vector is greater than _other on the first .PP .PP -Definition at line 105 of file moeoRealObjectiveVector.h. +Definition at line 130 of file moeoRealObjectiveVector.h. .PP Referenced by moeoRealObjectiveVector< ObjectiveVectorTraits >::operator>=(). .SS "template bool \fBmoeoRealObjectiveVector\fP< ObjectiveVectorTraits >::operator<= (const \fBmoeoRealObjectiveVector\fP< ObjectiveVectorTraits > & _other) const\fC [inline]\fP" @@ -156,7 +156,7 @@ Returns true if the current objective vector is smaller than or equal to _other .PP .PP -Definition at line 116 of file moeoRealObjectiveVector.h. +Definition at line 141 of file moeoRealObjectiveVector.h. .PP References moeoRealObjectiveVector< ObjectiveVectorTraits >::operator<(). .SS "template bool \fBmoeoRealObjectiveVector\fP< ObjectiveVectorTraits >::operator>= (const \fBmoeoRealObjectiveVector\fP< ObjectiveVectorTraits > & _other) const\fC [inline]\fP" @@ -170,7 +170,7 @@ Returns true if the current objective vector is greater than or equal to _other .PP .PP -Definition at line 127 of file moeoRealObjectiveVector.h. +Definition at line 152 of file moeoRealObjectiveVector.h. .PP References moeoRealObjectiveVector< ObjectiveVectorTraits >::operator==(), and moeoRealObjectiveVector< ObjectiveVectorTraits >::operator>(). diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRealVector.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRealVector.3 index 36fb0cf25..bcc7612e2 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRealVector.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRealVector.3 @@ -32,7 +32,7 @@ Inherited by \fBSch1\fP. .SS "template class moeoRealVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >" This class is an implementation of a simple double-valued \fBmoeoVector\fP. .PP -Definition at line 22 of file moeoRealVector.h. +Definition at line 47 of file moeoRealVector.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoRealVector\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity >::\fBmoeoRealVector\fP (unsigned int _size = \fC0\fP, double _value = \fC0.0\fP)\fC [inline]\fP" @@ -48,7 +48,7 @@ Ctor. .PP .PP -Definition at line 31 of file moeoRealVector.h. +Definition at line 56 of file moeoRealVector.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoReferencePointIndicatorBasedFitnessAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoReferencePointIndicatorBasedFitnessAssignment.3 deleted file mode 100644 index 7b8c8dafc..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoReferencePointIndicatorBasedFitnessAssignment.3 +++ /dev/null @@ -1,155 +0,0 @@ -.TH "moeoReferencePointIndicatorBasedFitnessAssignment" 3 "8 Oct 2007" "Version 1.0" "ParadisEO-MOEOMovingObjects" \" -*- nroff -*- -.ad l -.nh -.SH NAME -moeoReferencePointIndicatorBasedFitnessAssignment \- Fitness assignment sheme based a Reference Point and a Quality Indicator. - -.PP -.SH SYNOPSIS -.br -.PP -\fC#include \fP -.PP -Inherits \fBmoeoFitnessAssignment< MOEOT >< MOEOT >\fP. -.PP -.SS "Public Types" - -.in +1c -.ti -1c -.RI "typedef MOEOT::ObjectiveVector \fBObjectiveVector\fP" -.br -.RI "\fIThe type of objective vector. \fP" -.in -1c -.SS "Public Member Functions" - -.in +1c -.ti -1c -.RI "\fBmoeoReferencePointIndicatorBasedFitnessAssignment\fP (\fBObjectiveVector\fP &_refPoint, \fBmoeoNormalizedSolutionVsSolutionBinaryMetric\fP< \fBObjectiveVector\fP, double > &_metric)" -.br -.RI "\fICtor. \fP" -.ti -1c -.RI "void \fBoperator()\fP (\fBeoPop\fP< MOEOT > &_pop)" -.br -.RI "\fISets the fitness values for every solution contained in the population _pop. \fP" -.ti -1c -.RI "void \fBupdateByDeleting\fP (\fBeoPop\fP< MOEOT > &_pop, \fBObjectiveVector\fP &_objVec)" -.br -.RI "\fIUpdates the fitness values of the whole population _pop by taking the deletion of the objective vector _objVec into account. \fP" -.in -1c -.SS "Protected Member Functions" - -.in +1c -.ti -1c -.RI "void \fBsetup\fP (const \fBeoPop\fP< MOEOT > &_pop)" -.br -.RI "\fISets the bounds for every objective using the min and the max value for every objective vector of _pop (and the reference point). \fP" -.ti -1c -.RI "void \fBsetFitnesses\fP (\fBeoPop\fP< MOEOT > &_pop)" -.br -.RI "\fISets the fitness of every individual contained in the population _pop. \fP" -.in -1c -.SS "Protected Attributes" - -.in +1c -.ti -1c -.RI "\fBObjectiveVector\fP & \fBrefPoint\fP" -.br -.RI "\fIthe reference point \fP" -.ti -1c -.RI "\fBmoeoNormalizedSolutionVsSolutionBinaryMetric\fP< \fBObjectiveVector\fP, double > & \fBmetric\fP" -.br -.RI "\fIthe quality indicator \fP" -.in -1c -.SH "Detailed Description" -.PP - -.SS "template class moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >" -Fitness assignment sheme based a Reference Point and a Quality Indicator. -.PP -Definition at line 25 of file moeoReferencePointIndicatorBasedFitnessAssignment.h. -.SH "Constructor & Destructor Documentation" -.PP -.SS "template \fBmoeoReferencePointIndicatorBasedFitnessAssignment\fP< MOEOT >::\fBmoeoReferencePointIndicatorBasedFitnessAssignment\fP (\fBObjectiveVector\fP & _refPoint, \fBmoeoNormalizedSolutionVsSolutionBinaryMetric\fP< \fBObjectiveVector\fP, double > & _metric)\fC [inline]\fP" -.PP -Ctor. -.PP -\fBParameters:\fP -.RS 4 -\fI_refPoint\fP the reference point -.br -\fI_metric\fP the quality indicator -.RE -.PP - -.PP -Definition at line 37 of file moeoReferencePointIndicatorBasedFitnessAssignment.h. -.SH "Member Function Documentation" -.PP -.SS "template void \fBmoeoReferencePointIndicatorBasedFitnessAssignment\fP< MOEOT >::operator() (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, virtual]\fP" -.PP -Sets the fitness values for every solution contained in the population _pop. -.PP -\fBParameters:\fP -.RS 4 -\fI_pop\fP the population -.RE -.PP - -.PP -Implements \fBeoUF< eoPop< MOEOT > &, void >\fP. -.PP -Definition at line 46 of file moeoReferencePointIndicatorBasedFitnessAssignment.h. -.PP -References moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >::setFitnesses(), and moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >::setup(). -.SS "template void \fBmoeoReferencePointIndicatorBasedFitnessAssignment\fP< MOEOT >::updateByDeleting (\fBeoPop\fP< MOEOT > & _pop, \fBObjectiveVector\fP & _objVec)\fC [inline, virtual]\fP" -.PP -Updates the fitness values of the whole population _pop by taking the deletion of the objective vector _objVec into account. -.PP -\fBParameters:\fP -.RS 4 -\fI_pop\fP the population -.br -\fI_objVec\fP the objective vector -.RE -.PP - -.PP -Implements \fBmoeoFitnessAssignment< MOEOT >\fP. -.PP -Definition at line 60 of file moeoReferencePointIndicatorBasedFitnessAssignment.h. -.SS "template void \fBmoeoReferencePointIndicatorBasedFitnessAssignment\fP< MOEOT >::setup (const \fBeoPop\fP< MOEOT > & _pop)\fC [inline, protected]\fP" -.PP -Sets the bounds for every objective using the min and the max value for every objective vector of _pop (and the reference point). -.PP -\fBParameters:\fP -.RS 4 -\fI_pop\fP the population -.RE -.PP - -.PP -Definition at line 78 of file moeoReferencePointIndicatorBasedFitnessAssignment.h. -.PP -References moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >::metric, moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >::refPoint, and moeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R >::setup(). -.PP -Referenced by moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >::operator()(). -.SS "template void \fBmoeoReferencePointIndicatorBasedFitnessAssignment\fP< MOEOT >::setFitnesses (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, protected]\fP" -.PP -Sets the fitness of every individual contained in the population _pop. -.PP -\fBParameters:\fP -.RS 4 -\fI_pop\fP the population -.RE -.PP - -.PP -Definition at line 99 of file moeoReferencePointIndicatorBasedFitnessAssignment.h. -.PP -References moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >::metric, and moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >::refPoint. -.PP -Referenced by moeoReferencePointIndicatorBasedFitnessAssignment< MOEOT >::operator()(). - -.SH "Author" -.PP -Generated automatically by Doxygen for ParadisEO-MOEOMovingObjects from the source code. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoReplacement.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoReplacement.3 index 57bf8a6ec..ed4347487 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoReplacement.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoReplacement.3 @@ -20,7 +20,7 @@ Inherited by \fBmoeoElitistReplacement< MOEOT >\fP, \fBmoeoEnvironmentalReplacem .SS "template class moeoReplacement< MOEOT >" Replacement strategy for multi-objective optimization. .PP -Definition at line 22 of file moeoReplacement.h. +Definition at line 47 of file moeoReplacement.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRouletteSelect.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRouletteSelect.3 index 81018ff77..efa817159 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRouletteSelect.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoRouletteSelect.3 @@ -45,7 +45,7 @@ This selection only uses fitness values (and not diversity values). .PP .PP -Definition at line 24 of file moeoRouletteSelect.h. +Definition at line 49 of file moeoRouletteSelect.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoRouletteSelect\fP< MOEOT >::\fBmoeoRouletteSelect\fP (unsigned int _tSize = \fC2\fP)\fC [inline]\fP" @@ -59,7 +59,7 @@ Ctor. .PP .PP -Definition at line 32 of file moeoRouletteSelect.h. +Definition at line 57 of file moeoRouletteSelect.h. .PP References moeoRouletteSelect< MOEOT >::tSize. .SH "Member Function Documentation" @@ -75,7 +75,7 @@ Apply the tournament to the given population. .PP .PP -Definition at line 48 of file moeoRouletteSelect.h. +Definition at line 73 of file moeoRouletteSelect.h. .PP References moeoRouletteSelect< MOEOT >::tSize. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoScalarFitnessAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoScalarFitnessAssignment.3 index c3165d16b..755aed391 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoScalarFitnessAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoScalarFitnessAssignment.3 @@ -20,7 +20,7 @@ Inherited by \fBmoeoAchievementFitnessAssignment< MOEOT >\fP. .SS "template class moeoScalarFitnessAssignment< MOEOT >" \fBmoeoScalarFitnessAssignment\fP is a \fBmoeoFitnessAssignment\fP for scalar strategies. .PP -Definition at line 22 of file moeoScalarFitnessAssignment.h. +Definition at line 47 of file moeoScalarFitnessAssignment.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSelectFromPopAndArch.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSelectFromPopAndArch.3 index ffe7ca3a5..e926da557 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSelectFromPopAndArch.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSelectFromPopAndArch.3 @@ -62,7 +62,7 @@ Inherits \fBmoeoSelectOne< MOEOT >< MOEOT >\fP. .SS "template class moeoSelectFromPopAndArch< MOEOT >" Elitist selection process that consists in choosing individuals in the archive as well as in the current population. .PP -Definition at line 26 of file moeoSelectFromPopAndArch.h. +Definition at line 51 of file moeoSelectFromPopAndArch.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoSelectFromPopAndArch\fP< MOEOT >::\fBmoeoSelectFromPopAndArch\fP (\fBmoeoSelectOne\fP< MOEOT > & _popSelectOne, \fBmoeoSelectOne\fP< MOEOT > _archSelectOne, \fBmoeoArchive\fP< MOEOT > & _arch, double _ratioFromPop = \fC0.5\fP)\fC [inline]\fP" @@ -82,7 +82,7 @@ Ctor. .PP .PP -Definition at line 37 of file moeoSelectFromPopAndArch.h. +Definition at line 62 of file moeoSelectFromPopAndArch.h. .SS "template \fBmoeoSelectFromPopAndArch\fP< MOEOT >::\fBmoeoSelectFromPopAndArch\fP (\fBmoeoSelectOne\fP< MOEOT > & _popSelectOne, \fBmoeoArchive\fP< MOEOT > & _arch, double _ratioFromPop = \fC0.5\fP)\fC [inline]\fP" .PP Defaulr ctor - the archive's selection operator is a random selector. @@ -98,7 +98,7 @@ Defaulr ctor - the archive's selection operator is a random selector. .PP .PP -Definition at line 48 of file moeoSelectFromPopAndArch.h. +Definition at line 73 of file moeoSelectFromPopAndArch.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSelectOne.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSelectOne.3 index ec9442e81..9bff7072a 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSelectOne.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSelectOne.3 @@ -20,7 +20,7 @@ Inherited by \fBmoeoDetTournamentSelect< MOEOT >\fP, \fBmoeoRandomSelect< MOEOT .SS "template class moeoSelectOne< MOEOT >" Selection strategy for multi-objective optimization that selects only one element from a whole population. .PP -Definition at line 22 of file moeoSelectOne.h. +Definition at line 47 of file moeoSelectOne.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSharingDiversityAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSharingDiversityAssignment.3 index ee703f832..f3cd2669d 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSharingDiversityAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSharingDiversityAssignment.3 @@ -81,7 +81,7 @@ Sharing assignment scheme originally porposed by: D. E. Goldberg, 'Genetic Algorithms in Search, Optimization and Machine Learning', Addision-Wesley, MA, USA (1989). .PP -Definition at line 28 of file moeoSharingDiversityAssignment.h. +Definition at line 53 of file moeoSharingDiversityAssignment.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoSharingDiversityAssignment\fP< MOEOT >::\fBmoeoSharingDiversityAssignment\fP (\fBmoeoDistance\fP< MOEOT, double > & _distance, double _nicheSize = \fC0.5\fP, double _alpha = \fC1.0\fP)\fC [inline]\fP" @@ -99,7 +99,7 @@ Ctor. .PP .PP -Definition at line 42 of file moeoSharingDiversityAssignment.h. +Definition at line 67 of file moeoSharingDiversityAssignment.h. .SS "template \fBmoeoSharingDiversityAssignment\fP< MOEOT >::\fBmoeoSharingDiversityAssignment\fP (double _nicheSize = \fC0.5\fP, double _alpha = \fC1.0\fP)\fC [inline]\fP" .PP Ctor with an euclidean distance (with normalized objective values) in the objective space is used as default. @@ -113,7 +113,7 @@ Ctor with an euclidean distance (with normalized objective values) in the object .PP .PP -Definition at line 51 of file moeoSharingDiversityAssignment.h. +Definition at line 76 of file moeoSharingDiversityAssignment.h. .SH "Member Function Documentation" .PP .SS "template void \fBmoeoSharingDiversityAssignment\fP< MOEOT >::operator() (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, virtual]\fP" @@ -129,7 +129,7 @@ Sets diversity values for every solution contained in the population _pop. .PP Implements \fBeoUF< eoPop< MOEOT > &, void >\fP. .PP -Definition at line 59 of file moeoSharingDiversityAssignment.h. +Definition at line 84 of file moeoSharingDiversityAssignment.h. .PP References moeoSharingDiversityAssignment< MOEOT >::setSimilarities(). .SS "template void \fBmoeoSharingDiversityAssignment\fP< MOEOT >::updateByDeleting (\fBeoPop\fP< MOEOT > & _pop, \fBObjectiveVector\fP & _objVec)\fC [inline, virtual]\fP" @@ -157,7 +157,7 @@ Implements \fBmoeoDiversityAssignment< MOEOT >\fP. .PP Reimplemented in \fBmoeoFrontByFrontSharingDiversityAssignment< MOEOT >\fP. .PP -Definition at line 80 of file moeoSharingDiversityAssignment.h. +Definition at line 105 of file moeoSharingDiversityAssignment.h. .SS "template virtual void \fBmoeoSharingDiversityAssignment\fP< MOEOT >::setSimilarities (\fBeoPop\fP< MOEOT > & _pop)\fC [inline, protected, virtual]\fP" .PP Sets similarities for every solution contained in the population _pop. @@ -171,7 +171,7 @@ Sets similarities for every solution contained in the population _pop. .PP Reimplemented in \fBmoeoFrontByFrontSharingDiversityAssignment< MOEOT >\fP. .PP -Definition at line 102 of file moeoSharingDiversityAssignment.h. +Definition at line 127 of file moeoSharingDiversityAssignment.h. .PP References moeoSharingDiversityAssignment< MOEOT >::distance, and moeoSharingDiversityAssignment< MOEOT >::sh(). .PP @@ -187,7 +187,7 @@ Sharing function. .PP .PP -Definition at line 125 of file moeoSharingDiversityAssignment.h. +Definition at line 150 of file moeoSharingDiversityAssignment.h. .PP References moeoSharingDiversityAssignment< MOEOT >::alpha, and moeoSharingDiversityAssignment< MOEOT >::nicheSize. .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSolutionUnaryMetric.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSolutionUnaryMetric.3 index ffb8713f9..37915bd11 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSolutionUnaryMetric.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSolutionUnaryMetric.3 @@ -18,7 +18,7 @@ Inherits \fBmoeoUnaryMetric< const ObjectiveVector &, R >\fP. .SS "template class moeoSolutionUnaryMetric< ObjectiveVector, R >" Base class for unary metrics dedicated to the performance evaluation of a single solution's objective vector. .PP -Definition at line 43 of file moeoMetric.h. +Definition at line 68 of file moeoMetric.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSolutionVsSolutionBinaryMetric.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSolutionVsSolutionBinaryMetric.3 index d8437f624..91a3a4b92 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSolutionVsSolutionBinaryMetric.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoSolutionVsSolutionBinaryMetric.3 @@ -20,7 +20,7 @@ Inherited by \fBmoeoNormalizedSolutionVsSolutionBinaryMetric< ObjectiveVector, R .SS "template class moeoSolutionVsSolutionBinaryMetric< ObjectiveVector, R >" Base class for binary metrics dedicated to the performance comparison between two solutions's objective vectors. .PP -Definition at line 57 of file moeoMetric.h. +Definition at line 82 of file moeoMetric.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoStochTournamentSelect.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoStochTournamentSelect.3 index 62bb009f9..07c072996 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoStochTournamentSelect.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoStochTournamentSelect.3 @@ -50,7 +50,7 @@ Inherits \fBmoeoSelectOne< MOEOT >< MOEOT >\fP. .SS "template class moeoStochTournamentSelect< MOEOT >" Selection strategy that selects ONE individual by stochastic tournament. .PP -Definition at line 24 of file moeoStochTournamentSelect.h. +Definition at line 49 of file moeoStochTournamentSelect.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoStochTournamentSelect\fP< MOEOT >::\fBmoeoStochTournamentSelect\fP (\fBmoeoComparator\fP< MOEOT > & _comparator, double _tRate = \fC1.0\fP)\fC [inline]\fP" @@ -66,7 +66,7 @@ Full Ctor. .PP .PP -Definition at line 33 of file moeoStochTournamentSelect.h. +Definition at line 58 of file moeoStochTournamentSelect.h. .PP References moeoStochTournamentSelect< MOEOT >::tRate. .SS "template \fBmoeoStochTournamentSelect\fP< MOEOT >::\fBmoeoStochTournamentSelect\fP (double _tRate = \fC1.0\fP)\fC [inline]\fP" @@ -82,7 +82,7 @@ A \fBmoeoFitnessThenDiversityComparator\fP is used as default. .PP .PP -Definition at line 53 of file moeoStochTournamentSelect.h. +Definition at line 78 of file moeoStochTournamentSelect.h. .PP References moeoStochTournamentSelect< MOEOT >::tRate. .SH "Member Function Documentation" @@ -98,7 +98,7 @@ Apply the tournament to the given population. .PP .PP -Definition at line 73 of file moeoStochTournamentSelect.h. +Definition at line 98 of file moeoStochTournamentSelect.h. .PP References moeoStochTournamentSelect< MOEOT >::comparator, and moeoStochTournamentSelect< MOEOT >::tRate. diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoUnaryIndicatorBasedFitnessAssignment.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoUnaryIndicatorBasedFitnessAssignment.3 index b18db2c97..1d7ec7ffa 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoUnaryIndicatorBasedFitnessAssignment.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoUnaryIndicatorBasedFitnessAssignment.3 @@ -18,7 +18,7 @@ Inherits \fBmoeoIndicatorBasedFitnessAssignment< MOEOT >< MOEOT >\fP. .SS "template class moeoUnaryIndicatorBasedFitnessAssignment< MOEOT >" \fBmoeoIndicatorBasedFitnessAssignment\fP for unary indicators. .PP -Definition at line 22 of file moeoUnaryIndicatorBasedFitnessAssignment.h. +Definition at line 47 of file moeoUnaryIndicatorBasedFitnessAssignment.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoUnaryMetric.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoUnaryMetric.3 index e4cb04d33..e0dd7de5b 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoUnaryMetric.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoUnaryMetric.3 @@ -18,7 +18,7 @@ Inherits \fBeoUF< A, R >\fP, and \fBmoeoMetric\fP. .SS "template class moeoUnaryMetric< A, R >" Base class for unary metrics. .PP -Definition at line 29 of file moeoMetric.h. +Definition at line 54 of file moeoMetric.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoVector.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoVector.3 index 485f6057f..58d01cb6f 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoVector.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoVector.3 @@ -58,7 +58,7 @@ Base class for fixed length chromosomes, just derives from \fBMOEO\fP and std::v GeneType must have the following methods: void ctor (needed for the std::vector<>), copy ctor. .PP -Definition at line 25 of file moeoVector.h. +Definition at line 50 of file moeoVector.h. .SH "Constructor & Destructor Documentation" .PP .SS "template \fBmoeoVector\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >::\fBmoeoVector\fP (unsigned int _size = \fC0\fP, GeneType _value = \fCGeneType()\fP)\fC [inline]\fP" @@ -74,7 +74,7 @@ Default ctor. .PP .PP -Definition at line 47 of file moeoVector.h. +Definition at line 72 of file moeoVector.h. .SH "Member Function Documentation" .PP .SS "template void \fBmoeoVector\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >::value (const std::vector< GeneType > & _v)\fC [inline]\fP" @@ -88,7 +88,7 @@ We can't have a Ctor from a std::vector as it would create ambiguity with the co .PP .PP -Definition at line 56 of file moeoVector.h. +Definition at line 81 of file moeoVector.h. .PP Referenced by FlowShopOpMutationShift::operator()(), FlowShopOpMutationExchange::operator()(), FlowShopOpCrossoverQuad::operator()(), and FlowShopInit::operator()(). .SS "template bool \fBmoeoVector\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >::operator< (const \fBmoeoVector\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType > & _moeo) const\fC [inline]\fP" @@ -102,7 +102,7 @@ To avoid conflicts between \fBMOEO::operator<\fP and std::vector::oper .PP .PP -Definition at line 79 of file moeoVector.h. +Definition at line 104 of file moeoVector.h. .SS "template virtual void \fBmoeoVector\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >::printOn (std::ostream & _os) const\fC [inline, virtual]\fP" .PP Writing object. @@ -118,7 +118,7 @@ Reimplemented from \fBMOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >\fP .PP Reimplemented in \fBmoeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >\fP. .PP -Definition at line 89 of file moeoVector.h. +Definition at line 114 of file moeoVector.h. .SS "template virtual void \fBmoeoVector\fP< MOEOObjectiveVector, MOEOFitness, MOEODiversity, GeneType >::readFrom (std::istream & _is)\fC [inline, virtual]\fP" .PP Reading object. @@ -134,7 +134,7 @@ Reimplemented from \fBMOEO< MOEOObjectiveVector, MOEOFitness, MOEODiversity >\fP .PP Reimplemented in \fBmoeoBitVector< MOEOObjectiveVector, MOEOFitness, MOEODiversity >\fP. .PP -Definition at line 102 of file moeoVector.h. +Definition at line 127 of file moeoVector.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoVectorUnaryMetric.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoVectorUnaryMetric.3 index b80c26699..0600f279e 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoVectorUnaryMetric.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoVectorUnaryMetric.3 @@ -18,7 +18,7 @@ Inherits \fBmoeoUnaryMetric< const std::vector< ObjectiveVector > &, R >\fP. .SS "template class moeoVectorUnaryMetric< ObjectiveVector, R >" Base class for unary metrics dedicated to the performance evaluation of a Pareto set (a vector of objective vectors). .PP -Definition at line 50 of file moeoMetric.h. +Definition at line 75 of file moeoMetric.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoVectorVsVectorBinaryMetric.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoVectorVsVectorBinaryMetric.3 index 4f02fef79..24fed1620 100644 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoVectorVsVectorBinaryMetric.3 +++ b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/moeoVectorVsVectorBinaryMetric.3 @@ -18,7 +18,7 @@ Inherits \fBmoeoBinaryMetric< A1, A2, R >< const const std::vector< ObjectiveVec .SS "template class moeoVectorVsVectorBinaryMetric< ObjectiveVector, R >" Base class for binary metrics dedicated to the performance comparison between two Pareto sets (two vectors of objective vectors). .PP -Definition at line 64 of file moeoMetric.h. +Definition at line 89 of file moeoMetric.h. .SH "Author" .PP diff --git a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/peoEA.3 b/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/peoEA.3 deleted file mode 100644 index 8025ecfaa..000000000 --- a/tags/paradiseo-ix86-1.0/paradiseo-moeo/doc/man/man3/peoEA.3 +++ /dev/null @@ -1,107 +0,0 @@ -.TH "peoEA" 3 "8 Oct 2007" "Version 1.0" "ParadisEO-MOEOMovingObjects" \" -*- nroff -*- -.ad l -.nh -.SH NAME -peoEA \- The \fBpeoEA\fP class offers an elementary evolutionary algorithm implementation. - -.PP -.SH SYNOPSIS -.br -.PP -\fC#include \fP -.PP -.SS "Public Member Functions" - -.in +1c -.ti -1c -.RI "\fBpeoEA\fP (\fBeoContinue\fP< EOT > &__cont, peoPopEval< EOT > &__pop_eval, \fBeoSelect\fP< EOT > &__select, peoTransform< EOT > &__trans, \fBeoReplacement\fP< EOT > &__replace)" -.br -.RI "\fIConstructor for the evolutionary algorithm object - several basic parameters have to be specified, allowing for different levels of parallelism. \fP" -.ti -1c -.RI "void \fBrun\fP ()" -.br -.RI "\fIEvolutionary algorithm function - a side effect of the fact that the class is derived from the \fBRunner\fP class, thus requiring the existence of a \fIrun\fP function, the algorithm being executed on a distinct thread. \fP" -.ti -1c -.RI "void \fBoperator()\fP (\fBeoPop\fP< EOT > &__pop)" -.br -.RI "\fI\fBFunction\fP operator for specifying the population to be associated with the algorithm. \fP" -.in -1c -.SS "Private Attributes" - -.in +1c -.ti -1c -.RI "\fBeoContinue\fP< EOT > & \fBcont\fP" -.br -.ti -1c -.RI "peoPopEval< EOT > & \fBpop_eval\fP" -.br -.ti -1c -.RI "\fBeoSelect\fP< EOT > & \fBselect\fP" -.br -.ti -1c -.RI "peoTransform< EOT > & \fBtrans\fP" -.br -.ti -1c -.RI "\fBeoReplacement\fP< EOT > & \fBreplace\fP" -.br -.ti -1c -.RI "\fBeoPop\fP< EOT > * \fBpop\fP" -.br -.in -1c -.SH "Detailed Description" -.PP - -.SS "template class peoEA< EOT >" -The \fBpeoEA\fP class offers an elementary evolutionary algorithm implementation. - -In addition, as compared with the algorithms provided by the \fBEO\fP framework, the \fBpeoEA\fP class has the underlying necessary structure for including, for example, parallel evaluation and parallel transformation operators, migration operators etc. Although there is no restriction on using the algorithms provided by the \fBEO\fP framework, the drawback resides in the fact that the \fBEO\fP implementation is exclusively sequential and, in consequence, no parallelism is provided. A simple example for constructing a \fBpeoEA\fP object: -.PP -... eoPop< EOT > population( POP_SIZE, popInitializer ); // creation of a population with POP_SIZE individuals - the popInitializer is a functor to be called for each individual eoGenContinue< EOT > eaCont( NUM_GEN ); // number of generations for the evolutionary algorithm eoCheckPoint< EOT > eaCheckpointContinue( eaCont ); // checkpoint incorporating the continuation criterion - startpoint for adding other checkpoint objects peoSeqPopEval< EOT > eaPopEval( evalFunction ); // sequential evaluation functor wrapper - evalFunction represents the actual evaluation functor eoRankingSelect< EOT > selectionStrategy; // selection strategy for creating the offspring population - a simple ranking selection in this case eoSelectNumber< EOT > eaSelect( selectionStrategy, POP_SIZE ); // the number of individuals to be selected for creating the offspring population eoRankingSelect< EOT > selectionStrategy; // selection strategy for creating the offspring population - a simple ranking selection in this case eoSGATransform< EOT > transform( crossover, CROSS_RATE, mutation, MUT_RATE ); // transformation operator - crossover and mutation operators with their associated probabilities peoSeqTransform< EOT > eaTransform( transform ); // ParadisEO specific sequential operator - a parallel version may be specified in the same manner eoPlusReplacement< EOT > eaReplace; // replacement strategy - for integrating the offspring resulting individuals in the initial population peoEA< EOT > eaAlg( eaCheckpointContinue, eaPopEval, eaSelect, eaTransform, eaReplace ); // ParadisEO evolutionary algorithm integrating the above defined objects eaAlg( population ); // specifying the initial population for the algorithm ... -.PP -Definition at line 54 of file pmoeoEA.h. -.SH "Constructor & Destructor Documentation" -.PP -.SS "template \fBpeoEA\fP< EOT >::\fBpeoEA\fP (\fBeoContinue\fP< EOT > & __cont, peoPopEval< EOT > & __pop_eval, \fBeoSelect\fP< EOT > & __select, peoTransform< EOT > & __trans, \fBeoReplacement\fP< EOT > & __replace)" -.PP -Constructor for the evolutionary algorithm object - several basic parameters have to be specified, allowing for different levels of parallelism. -.PP -Depending on the requirements, a sequential or a parallel evaluation operator may be specified or, in the same manner, a sequential or a parallel transformation operator may be given as parameter. Out of the box objects may be provided, from the \fBEO\fP package, for example, or custom defined ones may be specified, provided that they are derived from the correct base classes. -.PP -\fBParameters:\fP -.RS 4 -\fIeoContinue<\fP EOT >& __cont - continuation criterion specifying whether the algorithm should continue or not; -.br -\fIpeoPopEval<\fP EOT >& __pop_eval - evaluation operator; it allows the specification of parallel evaluation operators, aggregate evaluation functions, etc.; -.br -\fIeoSelect<\fP EOT >& __select - selection strategy to be applied for constructing a list of offspring individuals; -.br -\fIpeoTransform<\fP EOT >& __trans - transformation operator, i.e. crossover and mutation; allows for sequential or parallel transform; -.br -\fIeoReplacement<\fP EOT >& __replace - replacement strategy for integrating the offspring individuals in the initial population; -.RE -.PP - -.PP -Definition at line 98 of file pmoeoEA.h. -.PP -References peoEA< EOT >::pop_eval, and peoEA< EOT >::trans. -.SH "Member Function Documentation" -.PP -.SS "template void \fBpeoEA\fP< EOT >::operator() (\fBeoPop\fP< EOT > & __pop)" -.PP -\fBFunction\fP operator for specifying the population to be associated with the algorithm. -.PP -\fBParameters:\fP -.RS 4 -\fIeoPop<\fP EOT >& __pop - initial population of the algorithm, to be iteratively evolved; -.RE -.PP - -.PP -Definition at line 114 of file pmoeoEA.h. -.PP -References peoEA< EOT >::pop. - -.SH "Author" -.PP -Generated automatically by Doxygen for ParadisEO-MOEOMovingObjects from the source code.