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 } 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_*/
1.4.7