Initial import.

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

contribution/trunk/tutos_META08/windows/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;
+}

contribution/trunk/tutos_META08/windows/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