From 6f1b05d03696061736f2cdec844ffcb01acf60b7 Mon Sep 17 00:00:00 2001 From: jhumeau Date: Tue, 9 Dec 2008 14:52:05 +0000 Subject: [PATCH] test on MOGA added git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1283 331e1502-861f-0410-8da2-ba01fb791d7f --- trunk/paradiseo-moeo/test/CMakeLists.txt | 1 + trunk/paradiseo-moeo/test/t-moeoMOGA.cpp | 120 +++++++++++++++++++++++ 2 files changed, 121 insertions(+) create mode 100644 trunk/paradiseo-moeo/test/t-moeoMOGA.cpp diff --git a/trunk/paradiseo-moeo/test/CMakeLists.txt b/trunk/paradiseo-moeo/test/CMakeLists.txt index 4ed526941..e5b2bbe2a 100644 --- a/trunk/paradiseo-moeo/test/CMakeLists.txt +++ b/trunk/paradiseo-moeo/test/CMakeLists.txt @@ -66,6 +66,7 @@ SET (TEST_LIST t-moeoHyperVolumeDifferenceMetric t-moeoIntVector t-moeoBoundedArchive + t-moeoMOGA ) FOREACH (test ${TEST_LIST}) diff --git a/trunk/paradiseo-moeo/test/t-moeoMOGA.cpp b/trunk/paradiseo-moeo/test/t-moeoMOGA.cpp new file mode 100644 index 000000000..81ded7713 --- /dev/null +++ b/trunk/paradiseo-moeo/test/t-moeoMOGA.cpp @@ -0,0 +1,120 @@ +/* +* +* 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-moeoMOGA.cpp +//----------------------------------------------------------------------------- + +#include +#include +#include +#include + +//----------------------------------------------------------------------------- + +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; + +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]; + _sol.objectiveVector(objVec); + } +}; + +//----------------------------------------------------------------------------- + +int main() +{ + std::cout << "[moeoMOGA]" << std::endl; + + TestEval eval; + eoPopLoopEval popEval(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); + eoQuadGenOp genOp(xover); + eoSGATransform < Solution > transform(xover, 0.1, mutation, 0.1); + eoGenContinue continuator(10); + + // build MOGA + moeoMOGA < Solution > algo(20, eval, xover, 1.0, mutation, 1.0); + moeoMOGA < Solution > algo2(continuator, eval, genOp); + moeoMOGA < Solution > algo3(continuator, popEval, genOp); + moeoMOGA < Solution > algo4(continuator, eval, transform); + moeoMOGA < Solution > algo5(continuator, popEval, transform); + + // run the algo + algo(pop); + + // final pop + std::cout << "Final population" << std::endl; + std::cout << pop << std::endl; + + std::cout << "[moeoMOGA] OK" << std::endl; + return EXIT_SUCCESS; +} + +//-----------------------------------------------------------------------------