From 6de0a60f2746f61f342f5242e138a0faf940cc73 Mon Sep 17 00:00:00 2001 From: verel Date: Mon, 29 Mar 2010 12:48:18 +0000 Subject: [PATCH] ajout SA avant compilation git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1726 331e1502-861f-0410-8da2-ba01fb791d7f --- .../src/coolingSchedule/moCoolingSchedule.h | 67 ++++++ .../coolingSchedule/moSimpleCoolingSchedule.h | 109 +++++++++ .../paradiseo-mo/src/explorer/moSAexplorer.h | 185 ++++++++++++++++ trunk/paradiseo-mo/src/mo.h | 3 + .../oneMax/application/CMakeLists.txt | 4 +- .../application/testSimulatedAnnealing.cpp | 209 ++++++++++++++++++ 6 files changed, 576 insertions(+), 1 deletion(-) create mode 100644 trunk/paradiseo-mo/src/coolingSchedule/moCoolingSchedule.h create mode 100644 trunk/paradiseo-mo/src/coolingSchedule/moSimpleCoolingSchedule.h create mode 100644 trunk/paradiseo-mo/src/explorer/moSAexplorer.h create mode 100644 trunk/paradiseo-mo/tutorial/oneMax/application/testSimulatedAnnealing.cpp diff --git a/trunk/paradiseo-mo/src/coolingSchedule/moCoolingSchedule.h b/trunk/paradiseo-mo/src/coolingSchedule/moCoolingSchedule.h new file mode 100644 index 000000000..e72b236d6 --- /dev/null +++ b/trunk/paradiseo-mo/src/coolingSchedule/moCoolingSchedule.h @@ -0,0 +1,67 @@ +/* + + Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010 + + Sébastien Verel, Arnaud Liefooghe, Jérémie 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 +*/ + +#ifndef _moCoolingSchedule_h +#define _moCoolingSchedule_h + +/** + * Cooling Schedule of the temperature in the simulated algorithm + * + */ +template< class EOT > +class moCoolingSchedule : public eoUF +{ +public: + /** + * Initial temperature + * @param _solution initial solution + */ + double init(EOT & _solution) = 0; + + /** + * update the temperature + * @param _temp current temperature to update + */ + void update(double& _temp) = 0; + + /** + * test the ending of the process + * @param _temp current temperature + * @return true if the process could be continue + */ + // bool operator()(double _temp) = 0; +}; + + +#endif diff --git a/trunk/paradiseo-mo/src/coolingSchedule/moSimpleCoolingSchedule.h b/trunk/paradiseo-mo/src/coolingSchedule/moSimpleCoolingSchedule.h new file mode 100644 index 000000000..5cf462e08 --- /dev/null +++ b/trunk/paradiseo-mo/src/coolingSchedule/moSimpleCoolingSchedule.h @@ -0,0 +1,109 @@ +/* + + Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010 + + Sébastien Verel, Arnaud Liefooghe, Jérémie 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 +*/ + +#ifndef _moSimpleCoolingSchedule_h +#define _moSimpleCoolingSchedule_h + +#include +#include + +/** + * Cooling Schedule of the temperature in the simulated algorithm + * + */ +template< class EOT > +class moSimpleCoolingSchedule : public eoUF +{ +public: + /** + * default constructor + * @param _initT initial temperature + * @param _alpha factor of decreasing + * @param span number of iteration with equal temperature + * @param finalT final temperature, threshold of the stopping criteria + */ + moSimpleCoolingSchedule(double _initT, double _alpha, unsigned _span, double _finalT) : initT(_initT), alpha(_alpha), span(_span), finalT(_finalT) { + } + + /** + * Initial temperature + * @param _solution initial solution + */ + double init(EOT & _solution) { + // number of iteration with the same temperature + step = 0; + + return initT; + } + + /** + * update the temperature by a factor + * @param _temp current temperature to update + */ + void update(double& _temp) { + if (step >= span) { + _temp *= alpha; + step = 0; + } else + step++; + } + + /** + * compare the temperature to the threshold + * @param _temp current temperature + * @return true if the current temperature is over the threshold (final temperature) + */ + bool operator()(double _temp) { + return _temp > finalT; + } + +private: + // initial temperature + double initT; + + // threshold temperature + double finalT; + + // coefficient of decrease + double alpha; + + // maximum number of iterations at the same temperature + unisgned span; + + // number of steps with the same temperature + unsigned step; +}; + + +#endif diff --git a/trunk/paradiseo-mo/src/explorer/moSAexplorer.h b/trunk/paradiseo-mo/src/explorer/moSAexplorer.h new file mode 100644 index 000000000..a37e9ebb5 --- /dev/null +++ b/trunk/paradiseo-mo/src/explorer/moSAexplorer.h @@ -0,0 +1,185 @@ +/* + + Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010 + + Sébastien Verel, Arnaud Liefooghe, Jérémie 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 +*/ + +#ifndef _moSAexplorer_h +#define _moSAexplorer_h + +#include + +#include +#include +#include + +#include + +/** + * Explorer for the Simulated Annealing + * Only the symetric case is considered when Q(x,y) = Q(y,x) + * Fitness must be > 0 + * + */ +template< class Neighborhood > +class moSAexplorer : public moNeighborhoodExplorer +{ +public: + typedef typename Neighborhood::EOT EOT ; + typedef typename Neighborhood::Neighbor Neighbor ; + + using moNeighborhoodExplorer::neighborhood; + using moNeighborhoodExplorer::eval; + + /** + * Constructor + * @param _neighborhood the neighborhood + * @param _eval the evaluation function + * @param _neighborComparator a neighbor comparator + * @param _solNeighborComparator a solution vs neighbor comparator + * @param _nbStep maximum number of step to do + */ + moSAexplorer(Neighborhood& _neighborhood, moEval& _eval, moSolNeighborComparator& _solNeighborComparator, moCoolingSchedule _coolingSchedule) : moNeighborhoodExplorer(_neighborhood, _eval), solNeighborComparator(_solNeighborComparator), coolingSchedule(_coolingSchedule) { + isAccept = false; + + if (!neighborhood.isRandom()) { + std::cout << "moSAexplorer::Warning -> the neighborhood used is not random" << std::endl; + } + } + + /** + * Destructor + */ + ~moSAexplorer() { + } + + /** + * initialization of the initial temperature + * @param _solution the solution + */ + virtual void initParam(EOT & _solution) { + temperature = coolingSchedule.init(_solution); + isAccept = true; + }; + + /** + * decrease the temperature if necessary + * @param _solution the solution (unused here) + */ + virtual void updateParam(EOT & _solution) { + coolingSchedule.update(temperature); + }; + + /** + * terminate: NOTHING TO DO + * @param _solution the solution (unused here) + */ + virtual void terminate(EOT & _solution) {}; + + /** + * Explore one random solution in the neighborhood + * @param _solution + */ + virtual void operator()(EOT & _solution) { + //Test if _solution has a Neighbor + if (neighborhood.hasNeighbor(_solution)) { + //init on the first neighbor: supposed to be random solution in the neighborhood + neighborhood.init(_solution, current); + + //eval the _solution moved with the neighbor and stock the result in the neighbor + eval(_solution, current); + } + else { + //if _solution hasn't neighbor, + isAccept=false; + } + }; + + /** + * continue if the temperature is not too low + * @param _solution the solution + * @return true if the criteria from the cooling schedule is true + */ + virtual bool isContinue(EOT & _solution) { + return coolingSchedule(temperature); + }; + + /** + * move the solution on the accepted solution + * @param _solution the solution to move + */ + virtual void move(EOT & _solution) { + //move the solution + current.move(_solution); + //update its fitness + _solution.fitness(current.fitness()); + }; + + /** + * acceptance criterion according to the boltzmann criterion + * @param _solution the solution + * @return true if better neighbor or rnd < exp(delta f / T) + */ + virtual bool accept(EOT & _solution) { + double alpha=0.0; + if (neighborhood.hasNeighbor(_solution)) { + if (solNeighborComparator(_solution, current)) // accept if the current neighbor is better than the solution + isAccept = true; + else { + if ( (double)current.fitness() < (double)_solution.fitness()) // this is a maximization + alpha = exp( ((double) current.fitness() - (double) _solution.fitness()) / temperature ); + else // this is a minimization + alpha = exp( ((double) _solution.fitness() - (double) current.fitness()) / temperature ); + isAccept = (rng.uniform() < alpha) ; + } + } + return isAccept; + }; + +private: + // comparator betwenn solution and neighbor + moSolNeighborComparator& solNeighborComparator; + + // current number of step + unsigned int step; + + // maximum number of steps to do + unsigned int nbStep; + + //Pointer on the best and the current neighbor + Neighbor current; + + // true if the move is accepted + bool isAccept ; +}; + + +#endif diff --git a/trunk/paradiseo-mo/src/mo.h b/trunk/paradiseo-mo/src/mo.h index b4944977b..c3bef2971 100755 --- a/trunk/paradiseo-mo/src/mo.h +++ b/trunk/paradiseo-mo/src/mo.h @@ -73,6 +73,7 @@ #include #include #include +#include #include #include @@ -102,6 +103,8 @@ #include #include +#include +#include //#include //#include diff --git a/trunk/paradiseo-mo/tutorial/oneMax/application/CMakeLists.txt b/trunk/paradiseo-mo/tutorial/oneMax/application/CMakeLists.txt index 00093aef8..4c6310333 100644 --- a/trunk/paradiseo-mo/tutorial/oneMax/application/CMakeLists.txt +++ b/trunk/paradiseo-mo/tutorial/oneMax/application/CMakeLists.txt @@ -14,6 +14,7 @@ ADD_EXECUTABLE(testMetropolisHasting testMetropolisHasting.cpp) ADD_EXECUTABLE(testSimpleTS testSimpleTS.cpp) ADD_EXECUTABLE(testRandomNeutralWalk testRandomNeutralWalk.cpp) ADD_EXECUTABLE(testILS testILS.cpp) +ADD_EXECUTABLE(testSimulatedAnnealing testSimulatedAnnealing.cpp) TARGET_LINK_LIBRARIES(testSimpleHC eoutils ga eo) TARGET_LINK_LIBRARIES(testFirstImpr eoutils ga eo) @@ -25,5 +26,6 @@ TARGET_LINK_LIBRARIES(testMetropolisHasting eoutils ga eo) TARGET_LINK_LIBRARIES(testSimpleTS eoutils ga eo) TARGET_LINK_LIBRARIES(testRandomNeutralWalk eoutils ga eo) TARGET_LINK_LIBRARIES(testILS eoutils ga eo) +TARGET_LINK_LIBRARIES(testSimulatedAnnealing eoutils ga eo) - \ No newline at end of file + diff --git a/trunk/paradiseo-mo/tutorial/oneMax/application/testSimulatedAnnealing.cpp b/trunk/paradiseo-mo/tutorial/oneMax/application/testSimulatedAnnealing.cpp new file mode 100644 index 000000000..0b2c67774 --- /dev/null +++ b/trunk/paradiseo-mo/tutorial/oneMax/application/testSimulatedAnnealing.cpp @@ -0,0 +1,209 @@ +//----------------------------------------------------------------------------- +/** testSimulatedAnnealing.cpp + * + * SV - 29/03/10 + * + */ +//----------------------------------------------------------------------------- + +// standard includes +#define HAVE_SSTREAM + +#include // runtime_error +#include // cout +#include // ostrstream, istrstream +#include +#include + +// the general include for eo +#include +#include + +using namespace std; + +//----------------------------------------------------------------------------- +// fitness function +#include +#include +#include +#include + +#include +#include +#include +#include +#include +#include +#include +#include + +// REPRESENTATION +//----------------------------------------------------------------------------- +typedef eoBit Indi; +typedef moBitNeighbor Neighbor ; // incremental evaluation +typedef moRndWithReplNeighborhood Neighborhood ; + +void main_function(int argc, char **argv) +{ + /* ========================================================= + * + * Parameters + * + * ========================================================= */ + + // First define a parser from the command-line arguments + eoParser parser(argc, argv); + + // For each parameter, define Parameter, read it through the parser, + // and assign the value to the variable + + eoValueParam seedParam(time(0), "seed", "Random number seed", 'S'); + parser.processParam( seedParam ); + unsigned seed = seedParam.value(); + + // description of genotype + eoValueParam vecSizeParam(8, "vecSize", "Genotype size", 'V'); + parser.processParam( vecSizeParam, "Representation" ); + unsigned vecSize = vecSizeParam.value(); + + eoValueParam stepParam(10, "nbStep", "Number of steps of the random walk", 'n'); + parser.processParam( stepParam, "Representation" ); + unsigned nbStep = stepParam.value(); + + // the name of the "status" file where all actual parameter values will be saved + string str_status = parser.ProgramName() + ".status"; // default value + eoValueParam statusParam(str_status.c_str(), "status", "Status file"); + parser.processParam( statusParam, "Persistence" ); + + // do the following AFTER ALL PARAMETERS HAVE BEEN PROCESSED + // i.e. in case you need parameters somewhere else, postpone these + if (parser.userNeedsHelp()) { + parser.printHelp(cout); + exit(1); + } + if (statusParam.value() != "") { + ofstream os(statusParam.value().c_str()); + os << parser;// and you can use that file as parameter file + } + + /* ========================================================= + * + * Random seed + * + * ========================================================= */ + + //reproducible random seed: if you don't change SEED above, + // you'll aways get the same result, NOT a random run + rng.reseed(seed); + + + /* ========================================================= + * + * Eval fitness function + * + * ========================================================= */ + + FuncOneMax eval(vecSize); + + + /* ========================================================= + * + * Initilisation of the solution + * + * ========================================================= */ + + // a Indi random initializer + eoUniformGenerator uGen; + eoInitFixedLength random(vecSize, uGen); + + + /* ========================================================= + * + * evaluation of a neighbor solution + * + * ========================================================= */ + + moFullEvalByModif fulleval(eval); + + //An eval by copy can be used instead of the eval by modif + //moFullEvalByCopy fulleval(eval); + + + /* ========================================================= + * + * Comparator of neighbors + * + * ========================================================= */ + + moSolNeighborComparator solComparator; + + + /* ========================================================= + * + * the neighborhood of a solution + * + * ========================================================= */ + + Neighborhood neighborhood(vecSize); + + + /* ========================================================= + * + * the cooling schedule of the process + * + * ========================================================= */ + + // initial temp, factor of decrease, number of steps without decrease, final temp. + moSimpleCoolingSchdedule coolingSchedule(10, 0.9, 1, 0.01); + + /* ========================================================= + * + * a neighborhood explorer solution + * + * ========================================================= */ + + moSAexplorer explorer(neighborhood, fulleval, solComparator, coolingSchedule); + + /* ========================================================= + * + * the local search algorithm + * + * ========================================================= */ + + moTrueContinuator continuator;//always continue + + moLocalSearch< moMetropolisHastingExplorer > localSearch(explorer, continuator, eval); + + /* ========================================================= + * + * execute the local search from random sollution + * + * ========================================================= */ + + Indi solution; + + random(solution); + + //Can be eval here, else it will be done at the beginning of the localSearch + //eval(solution); + + std::cout << "initial: " << solution << std::endl ; + + localSearch(solution); + + std::cout << "final: " << solution << std::endl ; + +} + +// A main that catches the exceptions + +int main(int argc, char **argv) +{ + try { + main_function(argc, argv); + } + catch (exception& e) { + cout << "Exception: " << e.what() << '\n'; + } + return 1; +}