diff --git a/trunk/paradiseo-mo/src/algo/moRandomSearch.h b/trunk/paradiseo-mo/src/algo/moRandomSearch.h new file mode 100644 index 000000000..aef9af806 --- /dev/null +++ b/trunk/paradiseo-mo/src/algo/moRandomSearch.h @@ -0,0 +1,82 @@ +/* + +Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010 + +Sebastien Verel, 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 ue, +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". + +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 _moRandomSearch_h +#define _moRandomSearch_h + +#include +#include +#include +#include +#include + +/******************************************************** + * Random Search: + * Pure random search local search + * + * At each iteration, + * one random solution is selected and replace the current solution + * the algorithm stops when the number of solution is reached + ********************************************************/ +template +class moRandomSearch: public moLocalSearch +{ +public: + typedef typename Neighbor::EOT EOT; + + /** + * Simple constructor for a random search + * @param _init the solution initializer, to explore at random the search space + * @param _fullEval the full evaluation function + * @param _nbSolMax number of solutions + */ + moRandomSearch(eoInit & _init, eoEvalFunc& _fullEval, unsigned _nbSolMax): + moLocalSearch(explorer, trueCont, _fullEval), + explorer(_init, _fullEval, _nbSolMax) + {} + + /** + * Simple constructor for a random search + * @param _init the solution initializer, to explore at random the search space + * @param _fullEval the full evaluation function + * @param _nbSolMax number of solutions + */ + moRandomSearch(eoInit & _init, eoEvalFunc& _fullEval, unsigned _nbSolMax, moContinuator& _cont): + moLocalSearch(explorer, _cont, _fullEval), + explorer(_init, _fullEval, _nbSolMax) + {} + +private: + // always true continuator + moTrueContinuator trueCont; + // the explorer of the random walk + moRandomSearchExplorer explorer; +}; + +#endif diff --git a/trunk/paradiseo-mo/src/explorer/moRandomSearchExplorer.h b/trunk/paradiseo-mo/src/explorer/moRandomSearchExplorer.h new file mode 100644 index 000000000..a4d4eccac --- /dev/null +++ b/trunk/paradiseo-mo/src/explorer/moRandomSearchExplorer.h @@ -0,0 +1,147 @@ +/* + + 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 _moRandomSearchexplorer_h +#define _moRandomSearchexplorer_h + +#include +#include +#include +#include + +/** + * Explorer for a pure random search: + * the solution is initialized at each step + */ +template< class Neighbor > +class moRandomSearchExplorer : public moNeighborhoodExplorer +{ +public: + typedef typename Neighbor::EOT EOT ; + typedef moNeighborhood Neighborhood ; + + using moNeighborhoodExplorer::neighborhood; + using moNeighborhoodExplorer::eval; + + /** + * Constructor + * @param _init the solution initializer, to explore at random the search space + * @param _eval the evaluation function + * @param _nbStep maximum number of step to do + */ + moRandomSearchExplorer(eoInit& _init, eoEvalFunc& _fulleval, unsigned _nbStep) : moNeighborhoodExplorer(), init(_init), fulleval(_fulleval), nbStep(_nbStep) { + // number of step done + step = 0; + } + + /** + * Destructor + */ + ~moRandomSearchExplorer() { + } + + /** + * initialization of the number of step to be done + */ + virtual void initParam(EOT & solution) { + step = 0; + }; + + /** + * increase the number of step + */ + virtual void updateParam(EOT & solution) { + step++; + }; + + /** + * terminate: NOTHING TO DO + */ + virtual void terminate(EOT & solution) {}; + + /** + * Explore the neighborhood with only one random solution + * we supposed that the first neighbor is uniformly selected in the neighborhood + * @param _solution + */ + virtual void operator()(EOT & _solution) { + //init the first neighbor + init(_solution); + + //eval the _solution moved with the neighbor and stock the result in the neighbor + fulleval(_solution); + }; + + /** + * continue if it is remainds some steps to do + * @param _solution the solution + * @return true there is some steps to do + */ + virtual bool isContinue(EOT & _solution) { + return (step < nbStep) ; + }; + + /** + * move the solution with the best neighbor + * @param _solution the solution to move + */ + virtual void move(EOT & _solution) { + // the solution is already move. So nothing to do ! + }; + + /** + * accept test : always accept + * @param _solution the solution + * @return true if the best neighbor ameliorate the fitness + */ + virtual bool accept(EOT & _solution) { + return true; + }; + +private: + // initialization method to explore at random the search space + eoInit & init; + + // the full eval function + eoEvalFunc & fulleval; + + // current number of step + unsigned int step; + + // maximum number of steps to do + unsigned int nbStep; +}; + + +#endif diff --git a/trunk/paradiseo-mo/src/mo.h b/trunk/paradiseo-mo/src/mo.h index 9f1553444..44d987966 100755 --- a/trunk/paradiseo-mo/src/mo.h +++ b/trunk/paradiseo-mo/src/mo.h @@ -36,6 +36,7 @@ #define _newmo_h #include +#include #include #include #include @@ -85,6 +86,7 @@ #include #include #include +#include #include #include #include @@ -132,6 +134,7 @@ #include #include +#include #include #include diff --git a/trunk/paradiseo-mo/src/sampling/moDensityOfStatesSampling.h b/trunk/paradiseo-mo/src/sampling/moDensityOfStatesSampling.h new file mode 100644 index 000000000..ce43a49ee --- /dev/null +++ b/trunk/paradiseo-mo/src/sampling/moDensityOfStatesSampling.h @@ -0,0 +1,87 @@ +/* + + Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010 + + Sebastien Verel, 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 +*/ + +#ifndef moDensityOfStatesSampling_h +#define moDensityOfStatesSampling_h + +#include +#include +#include +#include +#include +#include + +/** + * To compute the autocorrelation function: + * Perform a random walk based on the neighborhood, + * The fitness values of solutions are collected during the random walk + * The autocorrelation can be computed from the serie of fitness values + * + */ +template +class moDensityOfStatesSampling : public moSampling +{ +public: + typedef typename Neighbor::EOT EOT ; + + using moSampling::localSearch; + + /** + * Default Constructor + * @param _init initialisation method of the solution + * @param _neighborhood neighborhood giving neighbor in random order + * @param _nbStep Number of steps of the random walk + */ + moDensityOfStatesSampling(eoInit & _init, + eoEvalFunc& _fullEval, + unsigned int _nbSol) : + moSampling(_init, * new moRandomSearch(_init, _fullEval, _nbSol), fitnessStat) + { + } + + /** + * default destructor + */ + ~moDensityOfStatesSampling() { + // delete the pointer on the local search which has been constructed in the constructor + delete &localSearch; + } + +protected: + moFitnessStat fitnessStat; + +}; + + +#endif diff --git a/trunk/paradiseo-mo/tutorial/Lesson6/CMakeLists.txt b/trunk/paradiseo-mo/tutorial/Lesson6/CMakeLists.txt index f92dd8712..522761075 100644 --- a/trunk/paradiseo-mo/tutorial/Lesson6/CMakeLists.txt +++ b/trunk/paradiseo-mo/tutorial/Lesson6/CMakeLists.txt @@ -10,10 +10,12 @@ ADD_EXECUTABLE(testRandomWalk testRandomWalk.cpp) ADD_EXECUTABLE(testMetropolisHasting testMetropolisHasting.cpp) ADD_EXECUTABLE(testRandomNeutralWalk testRandomNeutralWalk.cpp) ADD_EXECUTABLE(sampling sampling.cpp) +ADD_EXECUTABLE(densityOfStates densityOfStates.cpp) ADD_EXECUTABLE(autocorrelation autocorrelation.cpp) TARGET_LINK_LIBRARIES(testRandomWalk eoutils ga eo) TARGET_LINK_LIBRARIES(testMetropolisHasting eoutils ga eo) TARGET_LINK_LIBRARIES(testRandomNeutralWalk eoutils ga eo) -TARGET_LINK_LIBRARIES(autocorrelation eoutils ga eo) TARGET_LINK_LIBRARIES(sampling eoutils ga eo) +TARGET_LINK_LIBRARIES(densityOfStates eoutils ga eo) +TARGET_LINK_LIBRARIES(autocorrelation eoutils ga eo) diff --git a/trunk/paradiseo-mo/tutorial/Lesson6/densityOfStates.cpp b/trunk/paradiseo-mo/tutorial/Lesson6/densityOfStates.cpp new file mode 100644 index 000000000..89528397a --- /dev/null +++ b/trunk/paradiseo-mo/tutorial/Lesson6/densityOfStates.cpp @@ -0,0 +1,181 @@ +//----------------------------------------------------------------------------- +/** densityOfStates.cpp + * + * SV - 03/05/10 + * + */ +//----------------------------------------------------------------------------- + +// standard includes +#define HAVE_SSTREAM + +#include // runtime_error +#include // cout +#include // ostrstream, istrstream +#include +#include + +// the general include for eo +#include + +// declaration of the namespace +using namespace std; + +//----------------------------------------------------------------------------- +// representation of solutions, and neighbors +#include // bit string : see also EO tutorial lesson 1: FirstBitGA.cpp +#include // neighbor of bit string + +//----------------------------------------------------------------------------- +// fitness function, and evaluation of neighbors +#include + +//----------------------------------------------------------------------------- +// the sampling class +#include + +// Declaration of types +//----------------------------------------------------------------------------- +// Indi is the typedef of the solution type like in paradisEO-eo +typedef eoBit Indi; // bit string with unsigned fitness type +// Neighbor is the typedef of the neighbor type, +// Neighbor = How to compute the neighbor from the solution + information on it (i.e. fitness) +// all classes from paradisEO-mo use this template type +typedef moBitNeighbor Neighbor ; // bit string neighbor with unsigned fitness type + + +void main_function(int argc, char **argv) +{ + /* ========================================================= + * + * Parameters + * + * ========================================================= */ + // more information on the input parameters: see EO tutorial lesson 3 + // but don't care at first it just read the parameters of the bit string size and the random seed. + + // 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 + + // random seed parameter + eoValueParam seedParam(time(0), "seed", "Random number seed", 'S'); + parser.processParam( seedParam ); + unsigned seed = seedParam.value(); + + // length of the bit string + eoValueParam vecSizeParam(20, "vecSize", "Genotype size", 'V'); + parser.processParam( vecSizeParam, "Representation" ); + unsigned vecSize = vecSizeParam.value(); + + // the number of steps of the random walk + eoValueParam solParam(100, "nbSol", "Number of random solution", 'n'); + parser.processParam( solParam, "Representation" ); + unsigned nbSol = solParam.value(); + + // the name of the output file + string str_out = "out.dat"; // default value + eoValueParam outParam(str_out.c_str(), "out", "Output file of the sampling", 'o'); + parser.processParam(outParam, "Persistence" ); + + // 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 + // more information: see EO tutorial lesson 1 (FirstBitGA.cpp) + rng.reseed(seed); + + /* ========================================================= + * + * Initialization of the solution + * + * ========================================================= */ + + // a Indi random initializer: each bit is random + // more information: see EO tutorial lesson 1 (FirstBitGA.cpp) + eoUniformGenerator uGen; + eoInitFixedLength random(vecSize, uGen); + + /* ========================================================= + * + * Eval fitness function (full evaluation) + * + * ========================================================= */ + + // the fitness function is just the number of 1 in the bit string + oneMaxEval fullEval; + + /* ========================================================= + * + * The sampling of the search space + * + * ========================================================= */ + + // sampling object : + // - random initialization + // - local search to sample the search space + // - one statistic to compute + moDensityOfStatesSampling sampling(random, fullEval, nbSol); + + /* ========================================================= + * + * execute the sampling + * + * ========================================================= */ + + sampling(); + + /* ========================================================= + * + * export the sampling + * + * ========================================================= */ + + // to export the statistics into file + sampling.fileExport(str_out); + + // to get the values of statistics + // so, you can compute some statistics in c++ from the data + const std::vector & fitnessValues = sampling.getVector(0); + + std::cout << "First values:" << std::endl; + std::cout << "Fitness " << fitnessValues[0] << std::endl; + + std::cout << "Last values:" << std::endl; + std::cout << "Fitness " << fitnessValues[fitnessValues.size() - 1] << 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; +}