00001 /* 00002 * <t-moeoAggregativeComparator.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-moeoAggregativeComparator.cpp 00038 //----------------------------------------------------------------------------- 00039 00040 #include <eo> 00041 #include <moeo> 00042 00043 //----------------------------------------------------------------------------- 00044 00045 typedef MOEO < double, double, double > Solution; 00046 00047 //----------------------------------------------------------------------------- 00048 00049 int main() 00050 { 00051 std::cout << "[moeoAggregativeComparator]\t=>\t"; 00052 00053 // fitness & diversity 00054 double fit1 = 1.0; 00055 double div1 = 2.0; 00056 double fit2 = 3.0; 00057 double div2 = 1.0; 00058 00059 // solutions 00060 Solution sol1; 00061 sol1.fitness(fit1); 00062 sol1.diversity(div1); 00063 Solution sol2; 00064 sol2.fitness(fit2); 00065 sol2.diversity(div2); 00066 00067 // comparator 00068 moeoAggregativeComparator < Solution > comparator; 00069 00070 // sol1 not better than sol2? 00071 if (! comparator(sol1, sol2)) 00072 { 00073 std::cout << "ERROR (sol1 must be better)" << std::endl; 00074 return EXIT_FAILURE; 00075 } 00076 00077 std::cout << "OK" << std::endl; 00078 return EXIT_SUCCESS; 00079 } 00080 00081 //-----------------------------------------------------------------------------
1.4.7