diff --git a/branches/ParadisEO-GPU/tutoriel/OneMax/CMakeLists.txt b/branches/ParadisEO-GPU/tutoriel/OneMax/CMakeLists.txt
deleted file mode 100644
index 1d3422c68..000000000
--- a/branches/ParadisEO-GPU/tutoriel/OneMax/CMakeLists.txt
+++ /dev/null
@@ -1,56 +0,0 @@
-###############################################################################
-##
-## CMakeLists file for OneMax Example/application
-##
-###############################################################################
-
-
-######################################################################################
-### 1) Include the sources
-######################################################################################
-
-INCLUDE_DIRECTORIES(
-
-  # include CUDA source directory
-  ${CUDA_SRC_DIR}
-  # include EO source directory
-  ${PARADISEO_EO_SRC_DIR}/src
-  # include MO source directory
-  ${PARADISEO_MO_SRC_DIR}/src
-  # include problems  directory
-  ${PARADISEO_PROBLEMS_SRC_DIR}
-  # include GPU  directory
-  ${PARADISEO_GPU_SRC_DIR}
-  # include your source directory
-  ${CMAKE_CURRENT_SOURCE_DIR}/../src
-  )
-
-######################################################################################
-
-######################################################################################
-### 2) Specify where CMake can find the libraries
-######################################################################################
-
-LINK_DIRECTORIES(${PARADISEO_EO_BIN_DIR}/lib ${CUDA_LIB_DIR} )	
-
-######################################################################################
-
-######################################################################################
-### 3) Define your targets and link the librairies
-######################################################################################	
-
-CUDA_ADD_EXECUTABLE(GPUtestFirstImpr testFirstImpr.cu) 
-CUDA_ADD_EXECUTABLE(GPUtestNeutralHC testNeutralHC.cu) 
-CUDA_ADD_EXECUTABLE(GPUtestSimpleHC testSimpleHC.cu) 
-CUDA_ADD_EXECUTABLE(GPUtestSimpleHCByCpy testSimpleHCByCpy.cu) 
-CUDA_ADD_EXECUTABLE(GPUtestSimpleTS testSimpleTS.cu) 
-CUDA_ADD_EXECUTABLE(GPUtestSimulatedAnnealing testSimulatedAnnealing.cu) 
-
-TARGET_LINK_LIBRARIES(GPUtestFirstImpr eoutils ga eo)
-TARGET_LINK_LIBRARIES(GPUtestNeutralHC eoutils ga eo)
-TARGET_LINK_LIBRARIES(GPUtestSimpleHC eoutils ga eo)
-TARGET_LINK_LIBRARIES(GPUtestSimpleHCByCpy eoutils ga eo)
-TARGET_LINK_LIBRARIES(GPUtestSimpleTS eoutils ga eo)
-TARGET_LINK_LIBRARIES(GPUtestSimulatedAnnealing eoutils ga eo)
-
-######################################################################################
diff --git a/branches/ParadisEO-GPU/tutoriel/OneMax/moGPUConfig.h b/branches/ParadisEO-GPU/tutoriel/OneMax/moGPUConfig.h
deleted file mode 100644
index 726e0db0d..000000000
--- a/branches/ParadisEO-GPU/tutoriel/OneMax/moGPUConfig.h
+++ /dev/null
@@ -1,50 +0,0 @@
-/*
- <moGPUConfig.h>
- Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
-
- Karima Boufaras, Thé Van LUONG
-
- 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 __moGPUConfig_H
-#define __moGPUConfig_H
-
-#define BLOCK_SIZE 8
-#ifndef NB_POS
-#define NB_POS 1
-#endif
-#ifndef SIZE
-#define SIZE 60
-#endif
-#endif
-
-
-
-	
-	
diff --git a/branches/ParadisEO-GPU/tutoriel/OneMax/testFirstImpr.cu b/branches/ParadisEO-GPU/tutoriel/OneMax/testFirstImpr.cu
deleted file mode 100644
index b57ab02fc..000000000
--- a/branches/ParadisEO-GPU/tutoriel/OneMax/testFirstImpr.cu
+++ /dev/null
@@ -1,241 +0,0 @@
-/*
-  <testFirstImpr.cu>
-  Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
-
-  Karima Boufaras, Thé Van LUONG
-
-  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 <iostream>  
-#include <stdlib.h> 
-using namespace std;
-
-//Include GPU Config File
-#include "moGPUConfig.h"
-// The general include for eo
-#include <eo>
-#include <ga.h>
-// OneMax full eval function
-#include <problems/eval/EvalOneMax.h>
-//Parallel evaluation of neighborhood on GPU
-#include <eval/moGPUEvalByModif.h>
-// OneMax increment evaluation function
-#include <problems/eval/OneMaxIncrEval.h>
-// One Max solution
-#include <GPUType/moGPUBitVector.h>
-// Bit neighbor 
-#include <neighborhood/moGPUBitNeighbor.h>
-// Ordered neighborhood
-#include <neighborhood/moGPUOrderNeighborhoodByModif.h>
-// The Solution and neighbor comparator
-#include <comparator/moNeighborComparator.h>
-#include <comparator/moSolNeighborComparator.h>
-// The continuator
-#include <continuator/moTrueContinuator.h>
-// Local search algorithm
-#include <algo/moLocalSearch.h>
-// First improvment algorithm
-#include <algo/moFirstImprHC.h>
-// The First Improvment algorithm explorer
-#include <explorer/moFirstImprHCexplorer.h>
-//To compute execution time
-#include <performance/moGPUTimer.h>
-
-//------------------------------------------------------------------------------------
-// Define types of the representation solution, different neighbors and neighborhoods
-//------------------------------------------------------------------------------------
-
-typedef moGPUBitVector<eoMaximizingFitness> solution;
-typedef moGPUBitNeighbor <eoMaximizingFitness> Neighbor;
-typedef moGPUOrderNeighborhoodByModif<Neighbor> 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
-
-  // seed
-  eoValueParam<uint32_t> seedParam(time(0), "seed", "Random number seed", 'S');
-  parser.processParam( seedParam );
-  unsigned seed = seedParam.value();
-
-  // the name of the "status" file where all actual parameter values will be saved
-  string str_status = parser.ProgramName() + ".status"; // default value
-  eoValueParam<string> 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 always get the same result, NOT a random run
-  rng.reseed(seed);
-  
-  /* =========================================================
-   *
-   * Initilisation of the solution
-   *
-   * ========================================================= */
-  
-  solution sol(SIZE);
-
-  /* =========================================================
-   *
-   * Eval fitness function
-   *
-   * ========================================================= */
-
-  EvalOneMax<solution> eval;
-  
-  /* =========================================================
-   *
-   * Evaluation of a solution neighbor's
-   *
-   * ========================================================= */
-
-  OneMaxIncrEval<Neighbor> incr_eval;
-  moGPUEvalByModif<Neighbor,OneMaxIncrEval<Neighbor> > gpuEval(SIZE,incr_eval);
-  
-  /* =========================================================
-   *
-   * Comparator of solutions and neighbors
-   *
-   * ========================================================= */
-
-  moNeighborComparator<Neighbor> comparator;
-  moSolNeighborComparator<Neighbor> solComparator;
-
-  /* =========================================================
-   *
-   * a solution neighborhood
-   *
-   * ========================================================= */
-
-  Neighborhood neighborhood(SIZE,gpuEval);
-
-  /* =========================================================
-   *
-   * An explorer of solution neighborhood's
-   *
-   * ========================================================= */
-
-  moFirstImprHCexplorer<Neighbor> explorer(neighborhood, gpuEval, comparator, solComparator);
-
-
-  /* =========================================================
-   *
-   * The local search algorithm
-   *
-   * ========================================================= */
-  // True continuator <=> Always continue
-
-  moTrueContinuator<Neighbor> continuator;
-
-  moLocalSearch<Neighbor> localSearch(explorer,continuator, eval);
-
-  /* =========================================================
-   *
-   * The First improvment algorithm
-   *
-   * ========================================================= */
-
-  moFirstImprHC<Neighbor> firstImprHC(neighborhood,eval,gpuEval);
-
-  /* =========================================================
-   *
-   * Execute the local search from random sollution
-   *
-   * ========================================================= */
-
-  //Can be eval here, else it will be done at the beginning of the localSearch
-  eval(sol);
-
-  std::cout << "initial: " << sol<< std::endl;
-  moGPUTimer timer;
-  timer.start();
-  localSearch(sol);
-  timer.stop();
-  std::cout << "final:   " << sol << std::endl;
-  printf("Execution time = %.2lf s\n",timer.getTime());
-  
-  /* =========================================================
-   *
-   * Execute the first improvment from random sollution
-   *
-   * ========================================================= */
- 
-  solution sol1(SIZE);
-  eval(sol1);
-  std::cout<< std::endl;
-  std::cout << "initial: " << sol1<< std::endl;
-
-  moGPUTimer timer1;
-  timer1.start();
-  firstImprHC(sol1);
-  timer1.stop();
-  std::cout << "final:   " << sol1 << std::endl;
-  printf("Execution time = %.2lf s\n",timer1.getTime());
-
-}
-
-// 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;
-}
diff --git a/branches/ParadisEO-GPU/tutoriel/OneMax/testNeutralHC.cu b/branches/ParadisEO-GPU/tutoriel/OneMax/testNeutralHC.cu
deleted file mode 100644
index 9973e7bb9..000000000
--- a/branches/ParadisEO-GPU/tutoriel/OneMax/testNeutralHC.cu
+++ /dev/null
@@ -1,208 +0,0 @@
-/*
-  <testNeutralHC.cu>
-  Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
-
-  Karima Boufaras, Thé Van LUONG
-
-  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 <iostream>  
-#include <stdlib.h> 
-using namespace std;
-
-//Include GPU Config File
-#include "moGPUConfig.h"
-// The general include for eo
-#include <eo>
-#include <ga.h>
-// OneMax full eval function
-#include <problems/eval/EvalOneMax.h>
-//Parallel evaluation of neighborhood on GPU
-#include <eval/moGPUEvalByModif.h>
-// OneMax increment evaluation function
-#include <problems/eval/OneMaxIncrEval.h>
-// One Max solution
-#include <GPUType/moGPUBitVector.h>
-// Bit neighbor
-#include <neighborhood/moGPUBitNeighbor.h>
-// Ordered neighborhood
-#include <neighborhood/moGPUOrderNeighborhoodByModif.h>
-// The Solution and neighbor comparator
-#include <comparator/moNeighborComparator.h>
-#include <comparator/moSolNeighborComparator.h>
-// The continuator
-#include <continuator/moTrueContinuator.h>
-// Neutral HC algorithm
-#include <algo/moNeutralHC.h>
-//To compute execution time
-#include <performance/moGPUTimer.h>
-
-//------------------------------------------------------------------------------------
-// Define types of the representation solution, different neighbors and neighborhoods
-//------------------------------------------------------------------------------------
-
-typedef moGPUBitVector<eoMaximizingFitness> solution;
-typedef moGPUBitNeighbor <eoMaximizingFitness> Neighbor;
-typedef moGPUOrderNeighborhoodByModif<Neighbor> 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
-
-  // seed
-  eoValueParam<uint32_t> seedParam(time(0), "seed", "Random number seed", 'S');
-  parser.processParam( seedParam );
-  unsigned seed = seedParam.value();
-
- //nbStep maximum step to do
-  eoValueParam<unsigned int> nbStepParam(10, "nbStep", "maximum number of step", 'n');
-  parser.processParam( nbStepParam, "numberStep" );
-  unsigned nbStep = nbStepParam.value();
- 
-  // the name of the "status" file where all actual parameter values will be saved
-  string str_status = parser.ProgramName() + ".status"; // default value
-  eoValueParam<string> 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);
-
-  
-  /* =========================================================
-   *
-   * Initilisation of the solution
-   *
-   * ========================================================= */
-  
-  solution sol(SIZE);
-  
-  /* =========================================================
-   *
-   * Eval fitness function
-   *
-   * ========================================================= */
-
-  EvalOneMax<solution> eval;
-  
-  /* =========================================================
-   *
-   * Evaluation of a solution neighbor's
-   *
-   * ========================================================= */
-  
-  OneMaxIncrEval<Neighbor> incr_eval;
-  moGPUEvalByModif<Neighbor,OneMaxIncrEval<Neighbor> > gpuEval(SIZE,incr_eval);
-  
-  /* =========================================================
-   *
-   * Comparator of solutions and neighbors
-   *
-   * ========================================================= */
-
-  moNeighborComparator<Neighbor> comparator;
-  moSolNeighborComparator<Neighbor> solComparator;
-
-  /* =========================================================
-   *
-   * a solution neighborhood
-   *
-   * ========================================================= */
-
-  Neighborhood neighborhood(SIZE,gpuEval);
-
-  /* =========================================================
-   *
-   * The neutral Hill Climbing algorithm
-   *
-   * ========================================================= */
-  //True continuator <=> Always continue
-
-  moTrueContinuator<Neighbor> continuator;
-
-  moNeutralHC<Neighbor> neutralHC(neighborhood,eval,gpuEval,nbStep,continuator);
-
-  /* =========================================================
-   *
-   * Execute the neutral Hill climbing from random sollution
-   *
-   * ========================================================= */
-  
-  eval(sol);
-
-  std::cout << "initial: " << sol<< std::endl;
-  moGPUTimer timer;
-  timer.start();
-  neutralHC(sol);
-  timer.stop();
-  std::cout << "final:   " << sol << std::endl;
-  printf("Execution time = %.2lf s\n",timer.getTime());
-
-}
-
-// 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;
-}
diff --git a/branches/ParadisEO-GPU/tutoriel/OneMax/testSimpleHC.cu b/branches/ParadisEO-GPU/tutoriel/OneMax/testSimpleHC.cu
deleted file mode 100644
index fd52384ea..000000000
--- a/branches/ParadisEO-GPU/tutoriel/OneMax/testSimpleHC.cu
+++ /dev/null
@@ -1,243 +0,0 @@
-/*
-  <testSimpleHC.cu>
-  Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
-
-  Karima Boufaras, Thé Van LUONG
-
-  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 <iostream>  
-#include <stdlib.h> 
-using namespace std;
-
-//Include GPU Config File
-#include "moGPUConfig.h"
-// The general include for eo
-#include <eo>
-#include <ga.h>
-// OneMax full eval function
-#include <problems/eval/EvalOneMax.h>
-//Parallel evaluation of neighborhood on GPU
-#include <eval/moGPUEvalByModif.h>
-// OneMax increment evaluation function
-#include <problems/eval/OneMaxIncrEval.h>
-// One Max solution
-#include <GPUType/moGPUBitVector.h>
-// Bit neighbor
-#include <neighborhood/moGPUBitNeighbor.h>
-// Ordered neighborhood
-#include <neighborhood/moGPUOrderNeighborhoodByModif.h>
-// The Solution and neighbor comparator
-#include <comparator/moNeighborComparator.h>
-#include <comparator/moSolNeighborComparator.h>
-// The continuator
-#include <continuator/moTrueContinuator.h>
-// Local search algorithm
-#include <algo/moLocalSearch.h>
-// Simple HC algorithm
-#include <algo/moSimpleHC.h>
-// The simple HC algorithm explorer
-#include <explorer/moSimpleHCexplorer.h>
-//To compute execution time
-#include <performance/moGPUTimer.h>
-
-//------------------------------------------------------------------------------------
-// Define types of the representation solution, different neighbors and neighborhoods
-//------------------------------------------------------------------------------------
-
-typedef moGPUBitVector<eoMaximizingFitness> solution;
-typedef moGPUBitNeighbor <eoMaximizingFitness> Neighbor;
-typedef moGPUOrderNeighborhoodByModif<Neighbor> 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
-
-  // seed
-  eoValueParam<uint32_t> seedParam(time(0), "seed", "Random number seed", 'S');
-  parser.processParam( seedParam );
-  unsigned seed = seedParam.value();
-
-  // the name of the "status" file where all actual parameter values will be saved
-  string str_status = parser.ProgramName() + ".status"; // default value
-  eoValueParam<string> 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);
-  
-  /* =========================================================
-   *
-   * Initilisation of the solution
-   *
-   * ========================================================= */
-  
-  solution sol(SIZE);
-
-  /* =========================================================
-   *
-   * Eval fitness function
-   *
-   * ========================================================= */
-
-  EvalOneMax<solution> eval;
-  
-  /* =========================================================
-   *
-   * Evaluation of a solution neighbor's
-   *
-   * ========================================================= */
-  
-  OneMaxIncrEval<Neighbor> incr_eval;
-  moGPUEvalByModif<Neighbor,OneMaxIncrEval<Neighbor> > cueval(SIZE,incr_eval);
-  
-  /* =========================================================
-   *
-   * Comparator of solutions and neighbors
-   *
-   * ========================================================= */
-
-  moNeighborComparator<Neighbor> comparator;
-  moSolNeighborComparator<Neighbor> solComparator;
-
-  /* =========================================================
-   *
-   * a solution neighborhood
-   *
-   * ========================================================= */
-
-  Neighborhood neighborhood(SIZE,cueval);
-
-  /* =========================================================
-   *
-   * An explorer of solution neighborhood's
-   *
-   * ========================================================= */
-
-  moSimpleHCexplorer<Neighbor> explorer(neighborhood, cueval,
-					comparator, solComparator);
-
-  /* =========================================================
-   *
-   * The local search algorithm
-   *
-   * ========================================================= */
-  //True continuator <=> Always continue
-
-  moTrueContinuator<Neighbor> continuator;
-
-  moLocalSearch<Neighbor> localSearch(explorer,continuator, eval);
-
-  /* =========================================================
-   *
-   * The simple Hill Climbing algorithm
-   *
-   * ========================================================= */
-
-  moSimpleHC<Neighbor> simpleHC(neighborhood,eval,cueval);
-
-  /* =========================================================
-   *
-   * Execute the local search from random sollution
-   *
-   * ========================================================= */
- 
-  //Can be eval here, else it will be done at the beginning of the localSearch
-  eval(sol);
-
-  std::cout << "initial: " << sol<< std::endl;
-  // Create timer for timing CUDA calculation
-  moGPUTimer timer;
-  timer.start();
-  localSearch(sol);
-  timer.stop();
-  std::cout << "final:   " << sol << std::endl;
-  printf("Execution time = %0.2lf s\n",timer.getTime());
- 
-
-  /* =========================================================
-   *
-   * Execute the Simple Hill climbing from random sollution
-   *
-   * ========================================================= */
-  cout<<endl;
-  solution sol1(SIZE);
-  eval(sol1);
-  std::cout << "initial: " << sol1<< std::endl;
-  // Create timer for timing CUDA calculation
-  moGPUTimer timer1;
-  timer1.start();
-  simpleHC(sol1);
-  timer1.stop();
-  std::cout << "final:   " << sol1 << std::endl;
-  printf("Execution time = %0.2lf s\n",timer1.getTime());
-}
-
-// 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;
-}
diff --git a/branches/ParadisEO-GPU/tutoriel/OneMax/testSimpleHCByCpy.cu b/branches/ParadisEO-GPU/tutoriel/OneMax/testSimpleHCByCpy.cu
deleted file mode 100644
index 318692d41..000000000
--- a/branches/ParadisEO-GPU/tutoriel/OneMax/testSimpleHCByCpy.cu
+++ /dev/null
@@ -1,244 +0,0 @@
-/*
-  <testSimpleHCByCpy.cu>
-  Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
-
-  Karima Boufaras, Thé Van LUONG
-
-  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 <iostream>  
-#include <stdlib.h> 
-using namespace std;
-
-//Include GPU Config File
-#include "moGPUConfig.h"
-// The general include for eo
-#include <eo>
-#include <ga.h>
-// One Max full eval function
-#include <problems/eval/EvalOneMax.h>
-//Parallel evaluation of neighborhood on GPU
-#include <eval/moGPUEvalByCpy.h>
-// One Max increment evaluation function
-#include <problems/eval/OneMaxIncrEval.h>
-// One Max solution
-#include <GPUType/moGPUBitVector.h>
-// Bit neighbor 
-#include <neighborhood/moGPUBitNeighbor.h>
-// Ordered neighborhood
-#include <neighborhood/moGPUOrderNeighborhoodByCpy.h>
-// The Solution and neighbor comparator
-#include <comparator/moNeighborComparator.h>
-#include <comparator/moSolNeighborComparator.h>
-// The continuator
-#include <continuator/moTrueContinuator.h>
-// Local search algorithm
-#include <algo/moLocalSearch.h>
-// Simple HC algorithm
-#include <algo/moSimpleHC.h>
-// The simple HC algorithm explorer
-#include <explorer/moSimpleHCexplorer.h>
-//To compute execution time
-#include <performance/moGPUTimer.h>
-
-//------------------------------------------------------------------------------------
-// Define types of the representation solution, different neighbors and neighborhoods
-//------------------------------------------------------------------------------------
-
-typedef moGPUBitVector<eoMaximizingFitness> solution;
-typedef moGPUBitNeighbor<eoMaximizingFitness> Neighbor;
-typedef moGPUOrderNeighborhoodByCpy<Neighbor> 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
-
-  // seed
-  eoValueParam<uint32_t> seedParam(time(0), "seed", "Random number seed", 'S');
-  parser.processParam( seedParam );
-  unsigned seed = seedParam.value();
-
-  // the name of the "status" file where all actual parameter values will be saved
-  string str_status = parser.ProgramName() + ".status"; // default value
-  eoValueParam<string> 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);
-  srand(seed);
-  
-  /* =========================================================
-   *
-   * Initilisation of the solution
-   *
-   * ========================================================= */
-  
-  solution sol(SIZE);
-
-  /* =========================================================
-   *
-   * Eval fitness function
-   *
-   * ========================================================= */
-
-  EvalOneMax<solution> eval;
-  
-  /* =========================================================
-   *
-   * Evaluation of a solution neighbor's
-   *
-   * ========================================================= */
-  
-  OneMaxIncrEval<Neighbor> incr_eval;
-  moGPUEvalByCpy<Neighbor,OneMaxIncrEval<Neighbor> > gpuEval(SIZE,incr_eval);
-  
-  /* =========================================================
-   *
-   * Comparator of solutions and neighbors
-   *
-   * ========================================================= */
-
-  moNeighborComparator<Neighbor> comparator;
-  moSolNeighborComparator<Neighbor> solComparator;
-
-  /* =========================================================
-   *
-   * a solution neighborhood
-   *
-   * ========================================================= */
-
-  Neighborhood neighborhood(SIZE,gpuEval);
-
-  /* =========================================================
-   *
-   * An explorer of solution neighborhood's
-   *
-   * ========================================================= */
-
-  moSimpleHCexplorer<Neighbor> explorer(neighborhood, gpuEval,
-					comparator, solComparator);
-
-  /* =========================================================
-   *
-   * The local search algorithm
-   *
-   * ========================================================= */
-  //True continuator <=> Always continue
-
-  moTrueContinuator<Neighbor> continuator;
-
-  moLocalSearch<Neighbor> localSearch(explorer,continuator, eval);
-
-  /* =========================================================
-   *
-   * The simple Hill Climbing algorithm
-   *
-   * ========================================================= */
-
-  moSimpleHC<Neighbor> simpleHC(neighborhood,eval,gpuEval);
-
-  /* =========================================================
-   *
-   * Execute the local search from random sollution
-   *
-   * ========================================================= */
- 
-  //Can be eval here, else it will be done at the beginning of the localSearch
-  eval(sol);
-
-  std::cout << "initial: " << sol<< std::endl;
-  // Create timer for timing GPU calculation
-  moGPUTimer timer;
-  timer.start();
-  //Run the local search with Simple Hill climbing explorer
-  localSearch(sol);
-  timer.stop();
-  std::cout << "final:   " << sol << std::endl;
-  printf("Execution time = %0.2lf s\n",timer.getTime());
-
-  /* =========================================================
-   *
-   * Execute the Simple Hill climbing from random sollution
-   *
-   * ========================================================= */
-  cout<<endl;
-  solution sol1(SIZE);
-  eval(sol1);
-  std::cout << "initial: " << sol1<< std::endl;
-  moGPUTimer timer1;
-  timer1.start();
-  // Run Simple Hill Climbing 
-  simpleHC(sol1);
-  timer1.stop();
-  std::cout << "final:   " << sol1 << std::endl;
-  printf("Execution time = %0.2lf s\n",timer1.getTime());
-}
-
-// 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;
-}
diff --git a/branches/ParadisEO-GPU/tutoriel/OneMax/testSimpleTS.cu b/branches/ParadisEO-GPU/tutoriel/OneMax/testSimpleTS.cu
deleted file mode 100644
index 10fb50dd8..000000000
--- a/branches/ParadisEO-GPU/tutoriel/OneMax/testSimpleTS.cu
+++ /dev/null
@@ -1,313 +0,0 @@
-/*
-  <testSimpleTS.cu>
-  Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
-
-  Karima Boufaras, Thé Van LUONG
-
-  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 <iostream>  
-#include <stdlib.h> 
-using namespace std;
-
-//Include GPU Config File
-#include "moGPUConfig.h"
-// The general include for eo
-#include <eo>
-#include <ga.h>
-// OneMax full eval function
-#include <problems/eval/EvalOneMax.h>
-//Parallel evaluation of neighborhood on GPU
-#include <eval/moGPUEvalByModif.h>
-// OneMax increment evaluation function
-#include <problems/eval/OneMaxIncrEval.h>
-// One Max solution
-#include <GPUType/moGPUBitVector.h>
-// Bit neighbor
-#include <neighborhood/moGPUBitNeighbor.h>
-// Ordered neighborhood
-#include <neighborhood/moGPUOrderNeighborhoodByModif.h>
-// The Solution and neighbor comparator
-#include <comparator/moNeighborComparator.h>
-#include <comparator/moSolNeighborComparator.h>
-// The time continuator
-#include <continuator/moTimeContinuator.h>
-// Local search algorithm
-#include <algo/moLocalSearch.h>
-// The Tabou Search algorithm explorer
-#include <explorer/moTSexplorer.h>
-//Algorithm and its components
-#include <algo/moTS.h>
-//Tabu list
-#include <memory/moNeighborVectorTabuList.h>
-//Memories
-#include <memory/moDummyIntensification.h>
-#include <memory/moDummyDiversification.h>
-#include <memory/moBestImprAspiration.h>
-//To compute execution time
-#include <performance/moGPUTimer.h>
-
-
-//------------------------------------------------------------------------------------
-// Define types of the representation solution, different neighbors and neighborhoods
-//------------------------------------------------------------------------------------
-
-typedef moGPUBitVector<eoMaximizingFitness> solution;
-typedef moGPUBitNeighbor <eoMaximizingFitness> Neighbor;
-typedef moGPUOrderNeighborhoodByModif<Neighbor> 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
-
-  // seed
-  eoValueParam<uint32_t> seedParam(time(0), "seed", "Random number seed", 'S');
-  parser.processParam( seedParam );
-  unsigned seed = seedParam.value();
-
-  // size tabu list
-  eoValueParam<unsigned int> sizeTabuListParam(7, "sizeTabuList", "size of the tabu list", 'T');
-  parser.processParam( sizeTabuListParam, "Search Parameters" );
-  unsigned sizeTabuList = sizeTabuListParam.value();
-
-  // time Limit
-  eoValueParam<unsigned int> timeLimitParam(1, "timeLimit", "time limits", 't');
-  parser.processParam( timeLimitParam, "Search Parameters" );
-  unsigned timeLimit = timeLimitParam.value();
-
-  // the name of the "status" file where all actual parameter values will be saved
-  string str_status = parser.ProgramName() + ".status"; // default value
-  eoValueParam<string> 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
-   *
-   * ========================================================= */
-
-  EvalOneMax<solution> eval;
-  
-  /* =========================================================
-   *
-   * Evaluation of a solution neighbor's
-   *
-   * ========================================================= */
-  
-  OneMaxIncrEval<Neighbor> incr_eval;
-  moGPUEvalByModif<Neighbor,OneMaxIncrEval<Neighbor> > gpuEval(SIZE,incr_eval);
-
-  /* =========================================================
-   *
-   * Comparator of solutions and neighbors
-   *
-   * ========================================================= */
-
-  moNeighborComparator<Neighbor> comparator;
-  moSolNeighborComparator<Neighbor> solComparator;
-
-  /* =========================================================
-   *
-   * a solution neighborhood
-   *
-   * ========================================================= */
-
-  Neighborhood neighborhood(SIZE,gpuEval);
-    
-  /* =========================================================
-   *
-   * continuator
-   *
-   * ========================================================= */
-
-  moTimeContinuator <Neighbor> continuator(timeLimit);
-
-  /* =========================================================
-   *
-   * tabu list
-   *
-   * ========================================================= */
-
-  moNeighborVectorTabuList<Neighbor> tl(sizeTabuList,0);
-
-  /* =========================================================
-   *
-   * Memories
-   *
-   * ========================================================= */
-
-  moDummyIntensification<Neighbor> inten;
-  moDummyDiversification<Neighbor> div;
-  moBestImprAspiration<Neighbor> asp;
-
-  /* =========================================================
-   *
-   * An explorer of solution neighborhood's
-   *
-   * ========================================================= */
-
-  moTSexplorer<Neighbor> explorer(neighborhood, gpuEval, comparator, solComparator, tl, inten, div, asp);
-
-  
-  /* =========================================================
-   *
-   * the local search algorithm
-   *
-   * ========================================================= */
-
-  moLocalSearch<Neighbor> localSearch1(explorer, continuator, eval);
-
-  //Basic Constructor
-  moTS<Neighbor> localSearch2(neighborhood,eval, gpuEval,  2, 7);
-
-  //Simple Constructor
-  moTS<Neighbor> localSearch3(neighborhood, eval, gpuEval, 5, tl);
-
-  //General Constructor
-  moTS<Neighbor> localSearch4(neighborhood, eval, gpuEval, comparator, solComparator, continuator, tl, inten, div, asp);
-
-  /* =========================================================
-   *
-   * Execute the local search(TS) from random sollution
-   *
-   * ========================================================= */
-
-  //Initilisation of the solution
-  solution sol1(SIZE);
-  eval(sol1);
-  std::cout << "\nTabu Search 1:" << std::endl;
-  std::cout << "---------------------" << std::endl;
-  std::cout << "initial: " << sol1<< std::endl;
-  moGPUTimer timer1;
-  timer1.start();
-  localSearch1(sol1);
-  timer1.stop();
-  std::cout << "final:   " << sol1 <<std::endl;
-  printf("Execution time = %.2lf s\n",timer1.getTime());
-
-  /* =========================================================
-   *
-   * Execute the TS Basic Constructor 
-   *
-   * ========================================================= */
-
-  solution sol2(SIZE);
-  eval(sol2);
-  std::cout << "\nTabu Search 2:" << std::endl;
-  std::cout << "---------------------" << std::endl;
-  std::cout << "initial: " << sol2<< std::endl;
-  moGPUTimer timer2;
-  timer2.start();
-  localSearch2(sol2);
-  timer2.stop();
-  std::cout << "final:   " << sol2 << std::endl;
-  printf("Execution time = %.2lf s\n",timer2.getTime());
-
-  /* =========================================================
-   *
-   * Execute the TS Simple Constructor
-   *
-   * ========================================================= */
-
-  solution sol3(SIZE);
-  eval(sol3);
-  std::cout << "\nTabu Search 3:" << std::endl;
-  std::cout << "---------------------" << std::endl;
-  std::cout << "initial: " << sol3<< std::endl;
-  moGPUTimer timer3;
-  timer3.start();
-  localSearch3(sol3);
-  timer3.stop();
-  std::cout << "final:   " << sol3<< std::endl;
-  printf("Execution time = %.2lf s\n",timer3.getTime());
-
-  /* =========================================================
-   *
-   * Execute the TS General Constructor
-   *
-   * ========================================================= */
-
-  solution sol4(SIZE);
-  eval(sol4);
-  std::cout << "\nTabu Search 4:" << std::endl;
-  std::cout << "---------------------" << std::endl;
-  std::cout << "initial: " << sol4<< std::endl;
-  moGPUTimer timer4;
-  timer4.start();
-  localSearch4(sol4);
-  timer4.stop();
-  std::cout << "final:   " << sol4 << std::endl;
-  printf("Execution time = %.2lf s\n",timer4.getTime());
-
-}
-
-// 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;
-}
-
diff --git a/branches/ParadisEO-GPU/tutoriel/OneMax/testSimulatedAnnealing.cu b/branches/ParadisEO-GPU/tutoriel/OneMax/testSimulatedAnnealing.cu
deleted file mode 100644
index cdfc227fd..000000000
--- a/branches/ParadisEO-GPU/tutoriel/OneMax/testSimulatedAnnealing.cu
+++ /dev/null
@@ -1,206 +0,0 @@
-/*
-  <testSimulatedAnnealing.cu>
-  Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
-
-  Karima Boufaras, Thé Van LUONG
-
-  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
-*/
-
-//Init the number of threads per block
-#include <iostream>  
-#include <stdlib.h> 
-using namespace std;
-
-//Include GPU Config File
-#include "moGPUConfig.h"
-// The general include for eo
-#include <eo>
-#include <ga.h>
-// OneMax full eval function
-#include <problems/eval/EvalOneMax.h>
-//Parallel evaluation of neighborhood on GPU
-#include <eval/moGPUEvalByModif.h>
-// OneMax increment eval function
-#include <problems/eval/OneMaxIncrEval.h>
-// One Max solution
-#include <GPUType/moGPUBitVector.h>
-// Bit neighbor
-#include <neighborhood/moGPUBitNeighbor.h>
-// Random with replacement neighborhood
-#include <neighborhood/moGPURndWithReplNeighborhoodByModif.h>
-// The Solution and neighbor comparator
-#include <comparator/moNeighborComparator.h>
-#include <comparator/moSolNeighborComparator.h>
-//To compute execution time
-#include <performance/moGPUTimer.h>
-//Algorithm and its components
-#include <coolingSchedule/moCoolingSchedule.h>
-#include <algo/moSA.h>
-// The simulated annealing algorithm explorer
-#include <explorer/moSAexplorer.h>
-//continuators
-#include <continuator/moTrueContinuator.h>
-#include <continuator/moCheckpoint.h>
-#include <continuator/moFitnessStat.h>
-#include <utils/eoFileMonitor.h>
-#include <continuator/moCounterMonitorSaver.h>
-
-//------------------------------------------------------------------------------------
-// Define types of the representation solution, different neighbors and neighborhoods
-//------------------------------------------------------------------------------------
-
-typedef moGPUBitVector<eoMaximizingFitness> solution;
-typedef moGPUBitNeighbor <eoMaximizingFitness> Neighbor;
-typedef moGPURndWithReplNeighborhoodByModif<Neighbor> 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<uint32_t> seedParam(time(0), "seed", "Random number seed", 'S');
-  parser.processParam( seedParam );
-  unsigned seed = seedParam.value();
-
-  // the name of the "status" file where all actual parameter values will be saved
-  string str_status = parser.ProgramName() + ".status"; // default value
-  eoValueParam<string> 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 always get the same result, NOT a random run
-  rng.reseed(seed);
-
-  /* =========================================================
-   *
-   * Initilisation of the solution
-   *
-   * ========================================================= */
-
-  solution sol(SIZE);
-
-  /* =========================================================
-   *
-   * Eval fitness function
-   *
-   * ========================================================= */
-
-  EvalOneMax<solution> eval;
-
-  /* =========================================================
-   *
-   * Evaluation of a solution neighbor's
-   *
-   * ========================================================= */
-
-  OneMaxIncrEval<Neighbor> incr_eval;
-  moGPUEvalByModif<Neighbor,OneMaxIncrEval<Neighbor> > gpuEval(SIZE,incr_eval);
-
-  /* =========================================================
-   *
-   * a solution neighborhood
-   *
-   * ========================================================= */
-
-  Neighborhood neighborhood(SIZE,gpuEval);
-
-  /* =========================================================
-   *
-   * the cooling schedule of the process
-   *
-   * ========================================================= */
-
-
-  // initial temp, factor of decrease, number of steps without decrease, final temp.
-  moSimpleCoolingSchedule<solution> coolingSchedule(500, 0.9, 1000, 0.01);
-
-  /* =========================================================
-   *
-   * the local search algorithm
-   *
-   * ========================================================= */
-
-  moSA<Neighbor> SA(neighborhood, eval, gpuEval,coolingSchedule);
-
-  /* =========================================================
-   *
-   * execute the local search from random solution
-   *
-   * ========================================================= */
-
-  //init(solution);
-  eval(sol);
-  std::cout << "initial : " << sol << std::endl;
-  moGPUTimer timer;
-  timer.start();
-  SA(sol);
-  timer.stop(); 
-  std::cout << "final : " << sol << std::endl;
-  printf("Execution time = %.2lf s\n",timer.getTime()); 
-
-}
-
-// A main that catc hes the exceptions
-
-int main(int argc, char **argv)
-{
-  try {
-    main_function(argc, argv);
-  }
-  catch (exception& e) {
-    cout << "Exception: " << e.what() << '\n';
-  }
-  return 1;
-}