moved utilities and contribution in branchez

git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2183 331e1502-861f-0410-8da2-ba01fb791d7f

branches/contribution/trunk/tutos_META08/linux_64bits/EO_lesson1/param

@@ -0,0 +1,9 @@
+######    Configuration           ######
+--instancePath=../tsp/benchs/berlin52.tsp       # Path to the instance.
+--popSize=100                            # Size of the population.
+--nbOffspring=100                           # Number of selected parents.
+--maxGen=1000                           # Maximum number of iterations.
+--crossType=Partial                      # Crossover to use, it can be 'Partial', 'Order' or 'Edge'.
+--crossRate=1                            # Probability of crossover.
+--mutRate=0.01                           # Probability of mutation
+

branches/contribution/trunk/tutos_META08/linux_64bits/EO_lesson1/tsp.cpp

@@ -0,0 +1,160 @@
+/* 
+* <tsp.cpp>
+* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+* (C) OPAC Team, LIFL, 2002-2007
+*
+* Sébastien Cahon, Thomas Legrand
+*
+* 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
+*
+*/
+
+#include <eo>
+#include <tsp>
+
+void manage_configuration_file(eoParser & _parser);
+
+int main (int _argc, char* _argv [])
+{
+
+  eoParser parser(_argc, _argv); 
+
+  manage_configuration_file(parser);
+
+  unsigned int seed=atoi( (parser.getParamWithLongName("seed")->getValue()).c_str() );
+  std::string instancePath=parser.getParamWithLongName("instancePath")->getValue();
+  unsigned int populationSize=atoi( (parser.getParamWithLongName("popSize")->getValue()).c_str() );
+  unsigned int maxGen=atoi( (parser.getParamWithLongName("maxGen")->getValue()).c_str() );
+  double crossoverRate=atof( (parser.getParamWithLongName("crossRate")->getValue()).c_str() );
+  double mutationRate=atof( (parser.getParamWithLongName("mutRate")->getValue()).c_str() );
+  unsigned int nbOffspring=atoi( (parser.getParamWithLongName("nbOffspring")->getValue()).c_str() );
+  std::string crossoverType=parser.getParamWithLongName("crossType")->getValue();
+
+  // random number generator
+  srand (seed);
+  
+  // load test instance
+  Graph::load(instancePath.c_str());
+
+
+
+  /*** the representation-dependent things ***/
+  
+  // the evaluation function
+  RouteEval full_eval ;
+  // the genotype (through a genotype initializer)
+  RouteInit init ;
+  // crossover
+  eoQuadOp <Route>*crossover;
+  if(crossoverType.compare("Partial")==0)
+  {
+      crossover=new PartialMappedXover();
+  }
+  else if (crossoverType.compare("Order")==0)
+  {
+      crossover=new OrderXover();
+  }
+  else if (crossoverType.compare("Edge")==0)
+  {
+      crossover=new EdgeXover();
+  }
+  else
+  {
+      throw std::runtime_error("[tsp.cpp]: the crossover type '"+crossoverType+"' is not correct.");
+  }
+  // mutation 
+  CitySwap mutation ;
+  // variation operators
+  eoSGATransform <Route> transform (*crossover, crossoverRate, mutation, mutationRate) ; 
+
+
+
+   /*** the representation-independent things ***/
+  
+  // initialization of the population
+   eoPop <Route> pop (populationSize, init) ;
+   apply <Route> (full_eval, pop) ;
+   // select
+   eoDetTournamentSelect <Route> select_one ;
+   eoSelectNumber <Route> select (select_one, nbOffspring) ;
+   // replace
+   eoGenerationalReplacement <Route> genReplace;
+   eoWeakElitistReplacement <Route> replace(genReplace);
+   // stopping criteria
+   eoGenContinue <Route> continu (maxGen) ;
+   // algorithm
+   eoEasyEA <Route> ea (continu, full_eval, select, transform, replace) ;
+
+  
+
+   /*** Go ! ***/
+
+   // initial solution
+   std :: cout << "[From] " << pop.best_element () << std :: endl ;
+  
+   // run the algo
+   ea(pop);
+
+   // final solution
+  std :: cout << "[To] " << pop.best_element () << std :: endl ;
+  
+
+
+  // delete pointer
+  delete(crossover);
+
+  // that's all
+  return EXIT_SUCCESS;
+}
+
+
+
+void manage_configuration_file(eoParser & _parser)
+{
+  std::ofstream os;
+  _parser.getORcreateParam(std::string("../tsp/benchs/berlin52.tsp"), "instancePath", "Path to the instance.", 0, "Configuration", false);
+  _parser.getORcreateParam((unsigned int)time(0), "seed", "Seed for rand.", 0, "Configuration", false);
+  _parser.getORcreateParam((unsigned int)100, "popSize", "Size of the population.", 0, "Configuration", false);
+  _parser.getORcreateParam((unsigned int)1000, "maxGen", "Maximum number of generations.", 0, "Configuration", false);
+  _parser.getORcreateParam((double)1.0, "crossRate", "Probability of crossover.", 0, "Configuration", false);
+  _parser.getORcreateParam((double)0.01, "mutRate", "Probability of mutation.", 0, "Configuration", false);
+  _parser.getORcreateParam((unsigned int)100, "nbOffspring", "Number of offspring.", 0, "Configuration", false);
+  _parser.getORcreateParam(std::string("Partial"), "crossType", "Crossover to use, it can be 'Partial', 'Order' or 'Edge'.", 0, "Configuration", false);
+  if (_parser.userNeedsHelp())
+    {
+      _parser.printHelp(std::cout);
+      exit(EXIT_FAILURE);
+    }
+  os.open("current_param");
+  if(!os.is_open())
+    {
+      throw std::runtime_error("[tsp.cpp]: the file current_param cannot be created.");
+    }
+  os <<_parser;
+  os.close();
+}

branches/contribution/trunk/tutos_META08/linux_64bits/MOEO_lesson/FlowShopEA.cpp

@@ -0,0 +1,132 @@
+/*
+* <FlowShopEA.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
+*
+*/
+//-----------------------------------------------------------------------------
+
+
+// moeo general include
+#include <moeo>
+// for the creation of an evaluator
+#include <make_eval_FlowShop.h>
+// for the creation of an initializer
+#include <make_genotype_FlowShop.h>
+// for the creation of the variation operators
+#include <make_op_FlowShop.h>
+// how to initialize the population
+#include <do/make_pop.h>
+// the stopping criterion
+#include <do/make_continue_moeo.h>
+// outputs (stats, population dumps, ...)
+#include <do/make_checkpoint_moeo.h>
+// evolution engine (selection and replacement)
+#include <do/make_ea_moeo.h>
+// simple call to the algo
+#include <do/make_run.h>
+// checks for help demand, and writes the status file and make_help; in libutils
+void make_help(eoParser & _parser);
+// definition of the representation
+#include <FlowShop.h>
+
+
+using namespace std;
+
+
+int main(int argc, char* argv[])
+{
+  try
+    {
+
+      eoParser parser(argc, argv);  // for user-parameter reading
+      eoState state;                // to keep all things allocated
+
+
+      /*** the representation-dependent things ***/
+
+      // The evaluation
+      eoEvalFuncCounter<FlowShop>& eval = do_make_eval(parser, state);
+      // the genotype (through a genotype initializer)
+      eoInit<FlowShop>& init = do_make_genotype(parser, state);
+      // the variation operators
+      eoGenOp<FlowShop>& op = do_make_op(parser, state);
+
+
+      /*** the representation-independent things ***/
+
+      // initialization of the population
+      eoPop<FlowShop>& pop = do_make_pop(parser, state, init);
+      // definition of the archive
+      moeoArchive<FlowShop> arch;
+      // stopping criteria
+      eoContinue<FlowShop>& term = do_make_continue_moeo(parser, state, eval);
+      // output
+      eoCheckPoint<FlowShop>& checkpoint = do_make_checkpoint_moeo(parser, state, eval, term, pop, arch);
+      // algorithm
+      eoAlgo<FlowShop>& algo = do_make_ea_moeo(parser, state, eval, checkpoint, op, arch);
+
+
+      /*** Go ! ***/
+
+      // help ?
+      make_help(parser);
+
+      // first evalution (for printing)
+      apply<FlowShop>(eval, pop);
+
+      // printing of the initial population
+      cout << "Initial Population\n";
+      pop.sortedPrintOn(cout);
+      cout << endl;
+
+      // run the algo
+      algo(pop);
+
+      // printing of the final population
+      cout << "Final Population\n";
+      pop.sortedPrintOn(cout);
+      cout << endl;
+
+      // printing of the final archive
+      cout << "Final Archive\n";
+      arch.sortedPrintOn(cout);
+      cout << endl;
+
+
+    }
+  catch (exception& e)
+    {
+      cout << e.what() << endl;
+    }
+  return EXIT_SUCCESS;
+}

branches/contribution/trunk/tutos_META08/linux_64bits/MOEO_lesson/param

@@ -0,0 +1,33 @@
+######    Evolution Engine        ######
+--popSize=100                              # -P : Population Size
+--updateArch=1                             # Update the archive at each gen.
+--fitness=FastNonDominatedSorting          # -F : Fitness assignment scheme: Dummy, FastNonDominatedSorting or IndicatorBased
+--indicator=Epsilon                        # -i : Binary indicator for IndicatorBased: Epsilon, Hypervolume
+--diversity=Crowding                       # -D : Diversity assignment scheme: Dummy, Sharing(nicheSize) or Crowding
+--comparator=FitnessThenDiversity          # -C : Comparator scheme: FitnessThenDiversity, DiversityThenFitness or Aggregative
+--selection=DetTour(2)                     # -S : Selection scheme: DetTour(T), StochTour(t) or Random
+--replacement=Elitist                      # -R : Replacement scheme: Elitist, Environmental or Generational
+--nbOffspring=100%                         # -O : Number of offspring (percentage or absolute)
+
+######    Output                  ######
+--resDir=Res                               # Directory to store DISK outputs
+--eraseDir=1                               # erase files in dirName if any
+--printPop=0                               # Print sorted pop. every gen.
+--storeArch=1                              # Store the archive's objective vectors at each gen.
+--contribution=0                           # Store the contribution of the archive at each gen.
+--entropy=0                                # Store the entropy of the archive at each gen.
+
+######    Representation          ######
+--BenchmarkFile=../flowshop/benchs/020_10_01.txt  # -B : Benchmark file name REQUIRED
+
+######    Stopping criterion      ######
+--maxGen=100                               # -G : Maximum number of generations (0 = none)
+--maxEval=0                                # -E : Maximum number of evaluations (0 = none)
+--maxTime=0                                # -T : Maximum running time in seconds (0 = none)
+
+######    Variation Operators     ######
+--crossRate=1                              # Relative rate for the only crossover
+--shiftMutRate=0.5                         # Relative rate for shift mutation
+--exchangeMutRate=0.5                      # Relative rate for exchange mutation
+--pCross=0.25                              # -c : Probability of Crossover
+--pMut=0.35                                # -m : Probability of Mutation

branches/contribution/trunk/tutos_META08/linux_64bits/MO_lesson1/hill_climbing.cpp

@@ -0,0 +1,134 @@
+/*
+  <hill_climbing.cpp>
+  Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
+  (C) OPAC Team, LIFL, 2002-2008
+
+  Sébastien Cahon, Jean-Charles Boisson
+
+  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
+*/
+
+#include <eo>
+#include <mo>
+#include <tsp>
+
+void manage_configuration_file(eoParser & _parser);
+
+int
+main (int _argc, char* _argv [])
+{
+  std::string instancePath, selectionType;
+  unsigned int seed;
+
+  eoParser parser(_argc, _argv); 
+
+  manage_configuration_file(parser);
+
+  seed=atoi( (parser.getParamWithLongName("seed")->getValue()).c_str() );
+  instancePath=parser.getParamWithLongName("instancePath")->getValue();
+  selectionType=parser.getParamWithLongName("selectionType")->getValue();
+
+  srand (seed);
+  Graph::load(instancePath.c_str());
+
+  Route solution;
+
+  RouteInit initializer;
+  initializer (solution);
+
+  RouteEval full_evaluation;
+  full_evaluation (solution);
+
+  std :: cout << "[From] " << solution << std :: endl;
+
+  /* Tools for an efficient (? :-))
+     local search ! */
+
+  TwoOptInit two_opt_initializer;
+
+  TwoOptNext two_opt_next_move_generator;
+
+  TwoOptIncrEval two_opt_incremental_evaluation;
+
+  moMoveSelect<TwoOpt>* two_opt_selection;
+
+  if(selectionType.compare("Best")==0)
+    {
+      two_opt_selection= new moBestImprSelect<TwoOpt>();
+    }
+  else if (selectionType.compare("First")==0)
+    {
+      two_opt_selection= new moFirstImprSelect<TwoOpt>();
+    }
+  else if (selectionType.compare("Random")==0)
+    {
+      two_opt_selection= new moRandImprSelect<TwoOpt>();
+    }
+  else
+    {
+      throw std::runtime_error("[hill_climbing.cpp]: the type of selection '"+selectionType+"' is not correct.");
+    }
+
+  moHC <TwoOpt> hill_climbing (two_opt_initializer, two_opt_next_move_generator, two_opt_incremental_evaluation, 
+			       *two_opt_selection, full_evaluation);
+  hill_climbing (solution) ;
+  
+  std :: cout << "[To] " << solution << std :: endl;
+  
+  delete(two_opt_selection);
+
+  return EXIT_SUCCESS;
+}
+
+void
+manage_configuration_file(eoParser & _parser)
+{
+  std::ofstream os;
+
+  _parser.createParam(std::string("../tsp/benchs/berlin52.tsp"), "instancePath", "Path to the instance.",
+		      0, "Configuration", false);
+  
+  _parser.getORcreateParam((unsigned int)time(0), "seed", "Seed for rand.", 0, "Configuration", false);
+
+  _parser.getORcreateParam(std::string("Best"), "selectionType", "Type of the selection: 'Best', 'First' or 'Random'.", 
+			   0, "Configuration", false);
+
+  if (_parser.userNeedsHelp())
+    {
+      _parser.printHelp(std::cout);
+      exit(EXIT_FAILURE);
+    }
+  
+  os.open("current_param");
+  if(!os.is_open())
+    {
+      throw std::runtime_error("[hill_climbing.cpp]: the file current_param cannot be created.");
+    }
+  os <<_parser;
+  os.close();
+}

branches/contribution/trunk/tutos_META08/linux_64bits/MO_lesson1/param

@@ -0,0 +1,3 @@
+######    Configuration           ######
+--instancePath=../tsp/benchs/berlin52.tsp  # Path to the instance.
+--selectionType=Best                       # Type of the selection: 'Best', 'First' or 'Random'.

branches/contribution/trunk/tutos_META08/linux_64bits/MO_lesson2/param

@@ -0,0 +1,5 @@
+######    Configuration           ######
+--instancePath=../tsp/benchs/berlin52.tsp # Path to the instance
+--tabuListSize=10                        # Size of the tabu list
+--maxIter=1000                           # Maximum number of iterations
+--tabuListType=TwoOpt                    # Type of the tabu list: 'TwoOpt', 'SimpleMove' or 'SimpleSolution'

branches/contribution/trunk/tutos_META08/linux_64bits/MO_lesson2/tabu_search.cpp

@@ -0,0 +1,145 @@
+/*
+  <tabu_search.cpp>
+  Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
+  (C) OPAC Team, LIFL, 2002-2008
+
+  Sébastien Cahon, Jean-Charles Boisson
+
+  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
+
+*/
+
+#include <eo>
+#include <mo>
+#include <tsp>
+
+void manage_configuration_file(eoParser & _parser);
+
+int
+main (int _argc, char* _argv [])
+{
+  std::string instancePath, value;
+  unsigned int seed, maxIterations, tabuListSize;
+
+  eoParser parser(_argc, _argv); 
+  
+  manage_configuration_file(parser);
+  
+  seed=atoi( (parser.getParamWithLongName("seed")->getValue()).c_str() );
+  maxIterations=atoi( (parser.getParamWithLongName("maxIter")->getValue()).c_str() );
+  tabuListSize=atoi( (parser.getParamWithLongName("tabuListSize")->getValue()).c_str() );
+  instancePath=parser.getParamWithLongName("instancePath")->getValue();
+  value=parser.getParamWithLongName("tabuListType")->getValue();
+  
+  srand (seed);
+  Graph::load(instancePath.c_str());
+
+  Route solution;
+
+  RouteInit initializer;
+  initializer(solution);
+
+  RouteEval full_evaluation;
+  full_evaluation(solution);
+
+  std :: cout << "[From] " << solution << std :: endl;
+
+  /* Tools for an efficient (? :-))
+     local search ! */
+
+  TwoOptInit two_opt_initializer;
+
+  TwoOptNext two_opt_next_move_generator;
+
+  TwoOptIncrEval two_opt_incremental_evaluation;
+
+  moTabuList<TwoOpt> *tabuList;
+
+  if(value.compare("TwoOpt")==0)
+    {
+      tabuList=new TwoOptTabuList();
+    }
+  else if (value.compare("SimpleMove")==0)
+    {
+      tabuList=new moSimpleMoveTabuList<TwoOpt>(tabuListSize);
+    }
+  else if (value.compare("SimpleSolution")==0)
+    {
+      tabuList=new moSimpleSolutionTabuList<TwoOpt>(tabuListSize);
+    }
+  else
+    {
+      throw std::runtime_error("[tabu_search.cpp]: the type of tabu list '"+value+"' is not correct.");
+    }
+
+  moNoAspirCrit <TwoOpt> aspiration_criterion;
+
+  moGenSolContinue <Route> continu (maxIterations);
+  
+  moTS <TwoOpt> tabu_search (two_opt_initializer, two_opt_next_move_generator, 
+			     two_opt_incremental_evaluation, *tabuList, aspiration_criterion, continu, full_evaluation);
+  tabu_search(solution);
+
+  std :: cout << "[To] " << solution << std :: endl;
+
+  delete(tabuList);
+
+  return EXIT_SUCCESS;
+}
+
+void
+manage_configuration_file(eoParser & _parser)
+{
+  std::ofstream os;
+  
+  _parser.createParam(std::string("../tsp/benchs/berlin52.tsp"), "instancePath", "Path to the instance.",
+		      0, "Configuration", false);
+
+  _parser.getORcreateParam((unsigned int)time(0), "seed", "Seed for rand.", 0, "Configuration", false);
+
+  _parser.getORcreateParam((unsigned int)10, "tabuListSize", "Size of the tabu list.", 0, "Configuration", false);
+
+  _parser.getORcreateParam((unsigned int)1000, "maxIter", "Maximum number of iterations.", 0, "Configuration", false);
+
+  _parser.getORcreateParam(std::string("TwoOpt"), "tabuListType", "Type of the tabu list: 'TwoOpt', 'SimpleMove' or 'SimpleSolution'.", 
+			   0, "Configuration", false);
+
+  if (_parser.userNeedsHelp())
+    {
+      _parser.printHelp(std::cout);
+      exit(EXIT_FAILURE);
+    }
+  
+  os.open("current_param");
+  if(!os.is_open())
+    {
+      throw std::runtime_error("[tabu_search.cpp]: the file current_param cannot be created.");
+    }
+  os <<_parser;
+  os.close();
+}

branches/contribution/trunk/tutos_META08/linux_64bits/MO_lesson3/param

@@ -0,0 +1,8 @@
+######    Configuration           ######
+--instancePath=../tsp/benchs/berlin52.tsp # Path to the instance.
+--maxIter=1000                           # Maximum number of iterations.
+--initialTemp=1000                       # Initial temperature.
+--threshold=0.1                          # Minimum temperature allowed.
+--expoRatio=0.98                         # Ratio used if exponential cooling schedule is chosen.
+--lineaRatio=0.5                         # Ratio used if linear cooling schedule is chosen.
+--coolSchedType=Expo                     # Type the cooling schedule: 'Expo' or 'Linear'.

branches/contribution/trunk/tutos_META08/linux_64bits/MO_lesson3/simulated_annealing.cpp

@@ -0,0 +1,148 @@
+/*
+  <simulated_annealing.cpp>
+  Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
+  (C) OPAC Team, LIFL, 2002-2008
+
+  Sébastien Cahon, Jean-Charles Boisson
+
+  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
+*/
+
+#include <eo>
+#include <mo>
+#include <tsp>
+
+void manage_configuration_file(eoParser & _parser);
+
+int
+main (int _argc, char* _argv [])
+{
+  std::string instancePath, value;
+  unsigned int seed, maxIterations;
+  double threshold, exponentialRatio, linearRatio, initialTemperature;
+
+  eoParser parser(_argc, _argv); 
+
+  manage_configuration_file(parser);
+
+  seed=atoi( (parser.getParamWithLongName("seed")->getValue()).c_str() );
+  instancePath=parser.getParamWithLongName("instancePath")->getValue();
+  maxIterations=atoi( (parser.getParamWithLongName("maxIter")->getValue()).c_str() );
+  initialTemperature=atof( (parser.getParamWithLongName("initialTemp")->getValue()).c_str() );
+  threshold=atof( (parser.getParamWithLongName("threshold")->getValue()).c_str() );
+  exponentialRatio=atof( (parser.getParamWithLongName("expoRatio")->getValue()).c_str() );
+  linearRatio=atof( (parser.getParamWithLongName("lineaRatio")->getValue()).c_str() );
+  value=parser.getParamWithLongName("coolSchedType")->getValue();
+
+  srand (seed);
+  Graph::load(instancePath.c_str());
+
+  Route solution;
+
+  RouteInit initializer;
+  initializer (solution);
+
+  RouteEval full_evaluation;
+  full_evaluation (solution);
+
+  std :: cout << "[From] " << solution << std :: endl;
+
+  /* Tools for an efficient (? :-))
+     local search ! */
+
+  TwoOptRand two_opt_random_move_generator;
+
+  TwoOptIncrEval two_opt_incremental_evaluation;
+
+  TwoOpt move;
+
+  moCoolingSchedule* coolingSchedule;
+
+  if(value.compare("Expo")==0)
+    {
+      coolingSchedule=new moExponentialCoolingSchedule(threshold, exponentialRatio);
+    }
+  else if (value.compare("Linear")==0)
+    {
+      coolingSchedule=new moLinearCoolingSchedule(threshold, linearRatio);
+    }
+  else
+    {
+      throw std::runtime_error("[simulated_annealing.cpp]: the type of cooling schedule '"+value+"' is not correct.");
+    }
+
+  moGenSolContinue <Route> continu (maxIterations);
+
+  moSA <TwoOpt> simulated_annealing (two_opt_random_move_generator, two_opt_incremental_evaluation,
+				     continu, initialTemperature, *coolingSchedule, full_evaluation);
+  simulated_annealing (solution);
+
+  std :: cout << "[To] " << solution << std :: endl;
+
+  delete(coolingSchedule);
+
+  return EXIT_SUCCESS ;
+}
+
+void
+manage_configuration_file(eoParser & _parser)
+{
+  std::ofstream os;
+
+  _parser.createParam(std::string("../tsp/benchs/berlin52.tsp"), "instancePath", "Path to the instance.",
+		      0, "Configuration", false);
+
+  _parser.getORcreateParam((unsigned int)time(0), "seed", "Seed for rand.", 0, "Configuration", false);
+
+  _parser.getORcreateParam((unsigned int)1000, "maxIter", "Maximum number of iterations.", 0, "Configuration", false);
+
+  _parser.getORcreateParam((double)1000, "initialTemp", "Initial temperature.", 0, "Configuration", false);
+
+  _parser.getORcreateParam((double)0.1, "threshold", "Minimum temperature allowed.", 0, "Configuration", false);
+
+  _parser.getORcreateParam((double)0.98, "expoRatio", "Ratio used if exponential cooling schedule is chosen.", 0, "Configuration", false);
+
+  _parser.getORcreateParam((double)0.5, "lineaRatio", "Ratio used if linear cooling schedule is chosen.", 0, "Configuration", false);
+
+  _parser.getORcreateParam(std::string("Expo"), "coolSchedType", "Type the cooling schedule: 'Expo' or 'Linear'.", 
+			   0, "Configuration", false);
+  
+  if (_parser.userNeedsHelp())
+    {
+      _parser.printHelp(std::cout);
+      exit(EXIT_FAILURE);
+    }
+  
+  os.open("current_param");
+  if(!os.is_open())
+    {
+      throw std::runtime_error("[simulated_annealing.cpp]: the file current_param cannot be created.");
+    }
+  os <<_parser;
+  os.close();
+}

branches/contribution/trunk/tutos_META08/linux_64bits/MO_lesson4/iterated_local_search.cpp

@@ -0,0 +1,117 @@
+/*
+  <iterated_local_search.cpp>
+  Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
+  (C) OPAC Team, LIFL, 2002-2008
+
+  Sébastien Cahon, Jean-Charles Boisson
+
+  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
+*/
+
+#include <eo>
+#include <mo>
+#include <tsp>
+
+void manage_configuration_file(eoParser & _parser);
+
+int
+main (int _argc, char* _argv [])
+{
+  std::string instancePath;
+  unsigned int seed, maxIterations;
+
+  eoParser parser(_argc, _argv); 
+
+  manage_configuration_file(parser);
+
+  seed=atoi( (parser.getParamWithLongName("seed")->getValue()).c_str() );
+  instancePath=parser.getParamWithLongName("instancePath")->getValue();
+  maxIterations=atoi( (parser.getParamWithLongName("maxIter")->getValue()).c_str() );
+
+  srand(seed);
+  Graph::load (instancePath.c_str());
+
+  Route solution;
+
+  RouteInit initializer;
+  initializer (solution);
+
+  RouteEval full_evaluation;
+  full_evaluation (solution);
+
+  std :: cout << "[From] " << solution << std :: endl;
+
+  TwoOptInit two_opt_initializer;
+
+  TwoOptNext two_opt_next_move_generator;
+
+  TwoOptIncrEval two_opt_incremental_evaluation;
+
+  moBestImprSelect <TwoOpt> two_opt_selection;
+
+  moGenSolContinue <Route> continu(maxIterations);
+
+  moFitComparator<Route> comparator;
+
+  CitySwap perturbation;
+
+  moILS<TwoOpt> iterated_local_search (two_opt_initializer, two_opt_next_move_generator, two_opt_incremental_evaluation,
+				       two_opt_selection, continu, comparator, perturbation, full_evaluation) ;
+  iterated_local_search(solution);
+
+  std :: cout << "[To] " << solution << std :: endl;
+
+  return EXIT_SUCCESS;
+}
+
+void
+manage_configuration_file(eoParser & _parser)
+{
+  std::ofstream os;
+  
+  _parser.createParam(std::string("../tsp/benchs/berlin52.tsp"), "instancePath", "Path to the instance.",
+		      0, "Configuration", false);
+
+  _parser.getORcreateParam((unsigned int)time(0), "seed", "Seed for rand.", 0, "Configuration", false);
+
+  _parser.getORcreateParam((unsigned int)1000, "maxIter", "Maximum number of iterations.", 0, "Configuration", false);
+
+  if (_parser.userNeedsHelp())
+    {
+      _parser.printHelp(std::cout);
+      exit(EXIT_FAILURE);
+    }
+  
+  os.open("current_param");
+  if(!os.is_open())
+    {
+      throw std::runtime_error("[iterated_local_search.cpp]: the file current_param cannot be created.");
+    }
+  os <<_parser;
+  os.close();
+}

branches/contribution/trunk/tutos_META08/linux_64bits/MO_lesson4/param

@@ -0,0 +1,3 @@
+######    Configuration           ######
+--instancePath=../tsp/benchs/berlin52.tsp # Path to the instance.
+--maxIter=1000                           # Maximum number of iterations.

branches/contribution/trunk/tutos_META08/linux_64bits/flowshop/benchs/020_05_01.txt

@@ -0,0 +1,63 @@
+20
+5
+873654221
+0
+468
+54 79 16 66 58 
+1
+325
+83 3 89 58 56 
+2
+923
+15 11 49 31 20 
+3
+513
+71 99 15 68 85 
+4
+1070
+77 56 89 78 53 
+5
+690
+36 70 45 91 35 
+6
+602
+53 99 60 13 53 
+7
+289
+38 60 23 59 41 
+8
+873
+27 5 57 49 69 
+9
+342
+87 56 64 85 13 
+10
+764
+76 3 7 85 86 
+11
+268
+91 61 1 9 72 
+12
+1158
+14 73 63 39 8 
+13
+646
+29 75 41 41 49 
+14
+1111
+12 47 63 56 47 
+15
+965
+77 14 47 40 87 
+16
+703
+32 21 26 54 58 
+17
+1205
+87 86 75 77 18 
+18
+334
+68 5 77 51 68 
+19
+1111
+94 77 40 31 28 

branches/contribution/trunk/tutos_META08/linux_64bits/flowshop/benchs/020_05_02.txt

@@ -0,0 +1,63 @@
+20
+5
+379008056
+0
+517
+26 59 78 88 69 
+1
+461
+38 62 90 54 30 
+2
+832
+27 44 64 47 61 
+3
+653
+88 10 49 83 35 
+4
+933
+95 23 47 84 53 
+5
+811
+55 64 20 9 98 
+6
+966
+54 47 61 30 94 
+7
+448
+63 68 93 11 33 
+8
+577
+23 54 36 92 77 
+9
+1122
+45 9 47 63 31 
+10
+666
+86 30 70 62 54 
+11
+1189
+43 31 54 75 71 
+12
+470
+43 92 87 48 78 
+13
+475
+40 7 13 23 9 
+14
+462
+37 14 40 85 79 
+15
+866
+54 95 34 23 51 
+16
+392
+35 76 55 4 76 
+17
+310
+59 82 13 31 56 
+18
+719
+43 91 11 13 80 
+19
+1221
+50 37 5 98 72