From 9296968edcbb76eaa522bf547a0bd20c14cfab97 Mon Sep 17 00:00:00 2001
From: jhumeau <jhumeau@331e1502-861f-0410-8da2-ba01fb791d7f>
Date: Wed, 17 Dec 2008 14:17:53 +0000
Subject: [PATCH] test for Aggregative fitness assignment added

git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1302 331e1502-861f-0410-8da2-ba01fb791d7f
---
 trunk/paradiseo-moeo/test/CMakeLists.txt      |   1 +
 .../t-moeoAggregativeFitnessAssignment.cpp    | 115 ++++++++++++++++++
 2 files changed, 116 insertions(+)
 create mode 100644 trunk/paradiseo-moeo/test/t-moeoAggregativeFitnessAssignment.cpp

diff --git a/trunk/paradiseo-moeo/test/CMakeLists.txt b/trunk/paradiseo-moeo/test/CMakeLists.txt
index e5b2bbe2a..8d0311240 100644
--- a/trunk/paradiseo-moeo/test/CMakeLists.txt
+++ b/trunk/paradiseo-moeo/test/CMakeLists.txt
@@ -67,6 +67,7 @@ SET (TEST_LIST
 		t-moeoIntVector
 		t-moeoBoundedArchive
 		t-moeoMOGA
+		t-moeoAggregativeFitnessAssignment
 )
 
 FOREACH (test ${TEST_LIST})
diff --git a/trunk/paradiseo-moeo/test/t-moeoAggregativeFitnessAssignment.cpp b/trunk/paradiseo-moeo/test/t-moeoAggregativeFitnessAssignment.cpp
new file mode 100644
index 000000000..f264f89e4
--- /dev/null
+++ b/trunk/paradiseo-moeo/test/t-moeoAggregativeFitnessAssignment.cpp
@@ -0,0 +1,115 @@
+/*
+* <t-moeoAggregativeFitnessAssignment.cpp>
+* Copyright (C) DOLPHIN Project-Team, INRIA Lille-Nord Europe, 2006-2008
+* (C) OPAC Team, LIFL, 2002-2008
+*
+* Arnaud Liefooghe
+* Jeremie Humeau
+*
+* This software is governed by the CeCILL 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 CeCILL
+* license as circulated by CEA, CNRS and INRIA at the following URL
+* "http://www.cecill.info".
+*
+* 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.
+*
+* In this respect, the user's attention is drawn to the risks associated
+* with loading,  using,  modifying and/or developing or reproducing the
+* software by the user in light of its specific status of free software,
+* that may mean  that it is complicated to manipulate,  and  that  also
+* therefore means  that it is reserved for developers  and  experienced
+* professionals having in-depth computer knowledge. Users are therefore
+* encouraged to load and test the software's suitability as regards their
+* requirements in conditions enabling the security of their systems and/or
+* data to be ensured and,  more generally, to use and operate it in the
+* same conditions as regards security.
+* The fact that you are presently reading this means that you have had
+* knowledge of the CeCILL license and that you accept its terms.
+*
+* ParadisEO WebSite : http://paradiseo.gforge.inria.fr
+* Contact: paradiseo-help@lists.gforge.inria.fr
+*
+*/
+//-----------------------------------------------------------------------------
+// t-moeoAggregativeFitnessAssignment.cpp
+//-----------------------------------------------------------------------------
+
+#include <eo>
+#include <moeo>
+#include <cassert>
+
+//-----------------------------------------------------------------------------
+
+class ObjectiveVectorTraits : public moeoObjectiveVectorTraits
+{
+public:
+    static bool minimizing (int i)
+    {
+        return true;
+    }
+    static bool maximizing (int i)
+    {
+        return false;
+    }
+    static unsigned int nObjectives ()
+    {
+        return 2;
+    }
+};
+
+typedef moeoRealObjectiveVector < ObjectiveVectorTraits > ObjectiveVector;
+
+typedef MOEO < ObjectiveVector, double, double > Solution;
+
+//-----------------------------------------------------------------------------
+
+int main()
+{
+    int res=EXIT_SUCCESS;
+
+    std::cout << "[moeoAggregativeFitnessAssignment] => ";
+
+    // objective vectors
+    ObjectiveVector obj0, obj1, obj2, obj3, obj4, obj5, obj6;
+    obj0[0] = 2;
+    obj0[1] = 5;
+    obj1[0] = 3;
+    obj1[1] = 3;
+    obj2[0] = 4;
+    obj2[1] = 1;
+    obj3[0] = 5;
+    obj3[1] = 5;
+    
+    std::vector<double> poids;
+    poids.resize(2);
+    
+    poids[0]=2;
+    poids[1]=3;
+
+    // population
+    eoPop < Solution > pop;
+    pop.resize(4);
+    pop[0].objectiveVector(obj0); 
+    pop[1].objectiveVector(obj1);
+    pop[2].objectiveVector(obj2);
+    pop[3].objectiveVector(obj3);
+
+    moeoAggregativeFitnessAssignment < Solution > fitness(poids);
+
+    fitness(pop);
+    
+    assert(pop[0].fitness() == 19.0);
+    assert(pop[1].fitness() == 15.0);
+    assert(pop[2].fitness() == 11.0);
+    assert(pop[3].fitness() == 25.0);
+ 
+    std::cout << "Ok" << std::endl;
+    
+    return EXIT_SUCCESS;
+}
+
+//-----------------------------------------------------------------------------