diff --git a/trunk/paradiseo-mo/test/t-moTA.cpp b/trunk/paradiseo-mo/test/t-moTA.cpp new file mode 100644 index 000000000..4b8485e5d --- /dev/null +++ b/trunk/paradiseo-mo/test/t-moTA.cpp @@ -0,0 +1,168 @@ +/* +* +* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2007-2008 +* (C) OPAC Team, LIFL, 2002-2008 +* +* Salma Mesmoudi +* +* 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-moTA.cpp +//----------------------------------------------------------------------------- + +#include // EO +#include // MO + +using std::cout; +using std::endl; + +//----------------------------------------------------------------------------- + +typedef EO solution; + +class testMove : public moMove +{ +public : + void operator () (solution & _solution) + { + solution sol=_solution; + } +} ; + +class testRandMove : public moRandMove +{ +public : + void operator () (testMove & _move) + { + _move=_move; + } +}; + +class testMoveIncrEval : public moMoveIncrEval +{ +public : + + testMoveIncrEval() : counter(0) + {} + + int operator () (const testMove & _move, const solution & _solution) + { + const testMove move(_move); + const solution solution(_solution); + + if(counter==0) + { + counter++; + return 2; + } + return 0; + } +private : + unsigned int counter; +} ; + +class solutionContinue : public moSolContinue +{ +public : + + solutionContinue() : counter(0) + {} + + bool operator () (const solution & _solution) + { + const solution sol(_solution); + + if(counter==0) + { + counter++; + return true; + } + + return false; + } + + void init() + {} +private : + unsigned int counter; +} ; + +class testCooling : public moCoolingSchedule +{ +public : + bool operator () (double & _threeshold) + { + double threeshold; + threeshold=_threeshold; + + return false; + } +}; + +class solutionEval : public eoEvalFunc +{ +public : + void operator () (solution & _solution) + { + _solution.fitness(0); + } +} ; + + +//----------------------------------------------------------------------------- + +int +main() +{ + std::string test_result; + int return_value; + + solution solution; + + testRandMove rand; + testMoveIncrEval incrEval; + solutionContinue continu; + testCooling cooling; + solutionEval eval; + + moTA ta(rand, incrEval, continu, 10.0, cooling, eval); + + cout << "[ moTA ] ==> "; + + ta(solution); + + test_result=((solution.fitness()!=2)?"KO":"OK"); + return_value=((test_result.compare("KO")==0)?EXIT_FAILURE:EXIT_SUCCESS); + + cout << test_result << endl; + return return_value; +} + +//-----------------------------------------------------------------------------