t-moeoArchive.cpp

00001 /*
00002 * <t-moeoArchive.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-moeoArchive.cpp
00038 //-----------------------------------------------------------------------------
00039 
00040 #include <eo>
00041 #include <moeo>
00042 
00043 //-----------------------------------------------------------------------------
00044 
00045 class ObjectiveVectorTraits : public moeoObjectiveVectorTraits
00046 {
00047 public:
00048     static bool minimizing (int i)
00049     {
00050         return true;
00051     }
00052     static bool maximizing (int i)
00053     {
00054         return false;
00055     }
00056     static unsigned int nObjectives ()
00057     {
00058         return 2;
00059     }
00060 };
00061 
00062 typedef moeoRealObjectiveVector < ObjectiveVectorTraits > ObjectiveVector;
00063 
00064 typedef MOEO < ObjectiveVector, double, double > Solution;
00065 
00066 //-----------------------------------------------------------------------------
00067 
00068 int main()
00069 {
00070     std::cout << "[moeoArchive]\t=>\t";
00071 
00072     // objective vectors
00073     ObjectiveVector obj0, obj1, obj2, obj3, obj4, obj5;
00074     obj0[0] = 2;
00075     obj0[1] = 5;
00076     obj1[0] = 3;
00077     obj1[1] = 3;
00078     obj2[0] = 4;
00079     obj2[1] = 1;
00080     obj3[0] = 5;
00081     obj3[1] = 5;
00082     obj4[0] = 5;
00083     obj4[1] = 1;
00084     obj5[0] = 3;
00085     obj5[1] = 3;
00086 
00087     // population
00088     eoPop < Solution > pop;
00089     pop.resize(6);
00090     pop[0].objectiveVector(obj0);
00091     pop[1].objectiveVector(obj1);
00092     pop[2].objectiveVector(obj2);
00093     pop[3].objectiveVector(obj3);
00094     pop[4].objectiveVector(obj4);
00095     pop[5].objectiveVector(obj5);
00096 
00097     // archive
00098     moeoArchive< Solution > arch;
00099     arch.update(pop);
00100 
00101     // size
00102     if (arch.size() != 3)
00103     {
00104         std::cout << "ERROR (too much solutions)" << std::endl;
00105         return EXIT_FAILURE;
00106     }
00107     // obj0 must be in
00108     if (! arch.contains(obj0))
00109     {
00110         std::cout << "ERROR (obj0 not in)" << std::endl;
00111         return EXIT_FAILURE;
00112     }
00113     // obj1 must be in
00114     if (! arch.contains(obj1))
00115     {
00116         std::cout << "ERROR (obj1 not in)" << std::endl;
00117         return EXIT_FAILURE;
00118     }
00119     // obj2 must be in
00120     if (! arch.contains(obj2))
00121     {
00122         std::cout << "ERROR (obj2 not in)" << std::endl;
00123         return EXIT_FAILURE;
00124     }
00125     // obj3 must be out
00126     if (arch.contains(obj3))
00127     {
00128         std::cout << "ERROR (obj3 in)" << std::endl;
00129         return EXIT_FAILURE;
00130     }
00131     // obj4 must be out
00132     if (arch.contains(obj4))
00133     {
00134         std::cout << "ERROR (obj4 in)" << std::endl;
00135         return EXIT_FAILURE;
00136     }
00137     // obj5 must be in
00138     if (! arch.contains(obj5))
00139     {
00140         std::cout << "ERROR (obj5 not in)" << std::endl;
00141         return EXIT_FAILURE;
00142     }
00143 
00144     std::cout << "OK" << std::endl;
00145     return EXIT_SUCCESS;
00146 }
00147 
00148 //-----------------------------------------------------------------------------

Generated on Thu Mar 13 15:54:08 2008 for ParadisEO-MOEO-MultiObjectiveEvolvingObjects by  doxygen 1.4.7