From bb7dc10752a9fc9fafccad80ed99fe76ae21b7fb Mon Sep 17 00:00:00 2001
From: liefooga <liefooga@331e1502-861f-0410-8da2-ba01fb791d7f>
Date: Mon, 10 Mar 2008 15:33:09 +0000
Subject: [PATCH] add a tri-objective maximization problem

git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1108 331e1502-861f-0410-8da2-ba01fb791d7f
---
 trunk/paradiseo-moeo/test/t-moeoMax3Obj.cpp | 113 ++++++++++++++++++++
 1 file changed, 113 insertions(+)
 create mode 100644 trunk/paradiseo-moeo/test/t-moeoMax3Obj.cpp

diff --git a/trunk/paradiseo-moeo/test/t-moeoMax3Obj.cpp b/trunk/paradiseo-moeo/test/t-moeoMax3Obj.cpp
new file mode 100644
index 000000000..f0ff1471e
--- /dev/null
+++ b/trunk/paradiseo-moeo/test/t-moeoMax3Obj.cpp
@@ -0,0 +1,113 @@
+/*
+* <t-moeoNSGAII.cpp>
+* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+* (C) OPAC Team, LIFL, 2002-2007
+*
+* Arnaud Liefooghe
+*
+* 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-moeoNSGAII.cpp
+//-----------------------------------------------------------------------------
+
+#include <eo>
+#include <es/eoRealInitBounded.h>
+#include <es/eoRealOp.h>
+#include <moeo>
+
+//-----------------------------------------------------------------------------
+
+class ObjectiveVectorTraits : public moeoObjectiveVectorTraits
+{
+public:
+    static bool minimizing (int i)
+    {
+        return false;
+    }
+    static bool maximizing (int i)
+    {
+        return true;
+    }
+    static unsigned int nObjectives ()
+    {
+        return 3;
+    }
+};
+
+typedef moeoRealObjectiveVector < ObjectiveVectorTraits > ObjectiveVector;
+
+class Solution : public moeoRealVector < ObjectiveVector, double, double >
+{
+public:
+    Solution() : moeoRealVector < ObjectiveVector, double, double > (1) {}
+};
+
+class TestEval : public moeoEvalFunc < Solution >
+{
+public:
+    void operator () (Solution & _sol)
+    {
+        ObjectiveVector objVec;
+        objVec[0] = _sol[0];
+        objVec[1] = _sol[0] * _sol[0];
+        objVec[2] = _sol[0] + (_sol[0] * _sol[0]);
+        _sol.objectiveVector(objVec);
+    }
+};
+
+//-----------------------------------------------------------------------------
+
+int main()
+{
+    std::cout << "[moeoNSGAII]" << std::endl;
+
+    TestEval eval;
+    eoQuadCloneOp < Solution > xover;
+    eoUniformMutation < Solution > mutation(0.05);
+
+    eoRealVectorBounds bounds(1, 1.0, 2.0);
+    eoRealInitBounded < Solution > init(bounds);
+    eoPop < Solution > pop(20, init);
+
+    // build NSGA-II
+    moeoNSGAII < Solution > algo(20, eval, xover, 1.0, mutation, 1.0);
+
+    // run the algo
+    algo(pop);
+
+    // final pop
+    std::cout << "Final population" << std::endl;
+    std::cout << pop << std::endl;
+
+    std::cout << "[moeoNSGAII] OK" << std::endl;
+    return EXIT_SUCCESS;
+}
+
+//-----------------------------------------------------------------------------