nojhan/paradiseo
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

AUTHORS modification

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@152 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
liefooga 2007-01-15 13:22:55 +00:00
commit 4c21c72510
137 changed files with 2356 additions and 2369 deletions
Download patch file Download diff file Expand all files Collapse all files

130
trunk/paradiseo-moeo/tutorials/lesson2/Sch1.cpp
View file

@ -1,9 +1,14 @@
// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
/* (c) OPAC Team, LIFL, October 2006
//-----------------------------------------------------------------------------
// Sch1.cpp
// (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2006
/*
This library...
Contact: paradiseo-help@lists.gforge.inria.fr
*/
Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr
*/
//-----------------------------------------------------------------------------
using namespace std;
@ -13,81 +18,92 @@ using namespace std;
#include <eo>
#include <es.h>
/* ParadisEO-MOEO */
/* ParadisEO-MOEO */
#include <moeoNSGA_II.h>
#include <moeoArchive.h>
// Extend eoParetoFitnessTraits
class SCH1Traits : public eoParetoFitnessTraits
class SCH1Traits:public eoParetoFitnessTraits
{
public :
static bool maximizing(int i) { return false; } // is the i-th objective
static unsigned nObjectives() { return 2;} // number of objectives
public:static bool maximizing (int i)
{
return false;
} // is the i-th objective
static unsigned nObjectives ()
{
return 2;
} // number of objectives
};
// Code decision variables
typedef eoParetoFitness<SCH1Traits> SCH1Fit;
typedef eoParetoFitness < SCH1Traits > SCH1Fit;
class SCH1EO : public eoReal<SCH1Fit>
class SCH1EO:public eoReal < SCH1Fit >
{
public:
SCH1EO(): eoReal<SCH1Fit>(1)
{}
};
// evaluation of the individuals
class SCH1Eval : public eoEvalFunc<SCH1EO>
{
public:
SCH1Eval(): eoEvalFunc<SCH1EO>()
{}
void operator()(SCH1EO & _eo) {
SCH1Fit fitness;
double x = _eo[0];
fitness[0] = x*x;
fitness[1] = (x-2.0)*(x-2.0);
_eo.fitness(fitness);
SCH1EO ():eoReal < SCH1Fit > (1)
{
}
};
int main(int argc, char* argv[]) {
// evaluation of the individuals
class SCH1Eval:public eoEvalFunc < SCH1EO >
{
public:
SCH1Eval ():eoEvalFunc < SCH1EO > ()
{
}
unsigned POP_SIZE = 20;
unsigned MAX_GEN = 100;
double M_EPSILON = 0.01;
double P_CROSS = 0.25;
double P_MUT = 0.35;
void operator () (SCH1EO & _eo)
{
SCH1Fit fitness;
double x = _eo[0];
// The fitness evaluation
SCH1Eval eval;
fitness[0] = x * x;
fitness[1] = (x - 2.0) * (x - 2.0);
// choose crossover and mutation
eoQuadCloneOp<SCH1EO> xover;
eoUniformMutation<SCH1EO> mutation(M_EPSILON);
// generate initial population
eoRealVectorBounds bounds(1, 0.0, 2.0); // [0, 2]
eoRealInitBounded<SCH1EO> init(bounds);
eoPop<SCH1EO> pop(POP_SIZE, init);
_eo.fitness (fitness);
}
};
// pass parameters to NSGA2
moeoNSGA_II<SCH1EO> nsga2(MAX_GEN, eval, xover, P_CROSS, mutation, P_MUT);
int
main (int argc, char *argv[])
{
// run the algo
nsga2(pop);
unsigned POP_SIZE = 20;
unsigned MAX_GEN = 100;
double M_EPSILON = 0.01;
double P_CROSS = 0.25;
double P_MUT = 0.35;
// extract first front of the final population (this is the solution of nsga2)
moeoArchive<SCH1EO> arch;
arch.update(pop);
// The fitness evaluation
SCH1Eval eval;
// choose crossover and mutation
eoQuadCloneOp < SCH1EO > xover;
eoUniformMutation < SCH1EO > mutation (M_EPSILON);
// generate initial population
eoRealVectorBounds bounds (1, 0.0, 2.0); // [0, 2]
eoRealInitBounded < SCH1EO > init (bounds);
eoPop < SCH1EO > pop (POP_SIZE, init);
// pass parameters to NSGA2
moeoNSGA_II < SCH1EO > nsga2 (MAX_GEN, eval, xover, P_CROSS, mutation,
P_MUT);
// run the algo
nsga2 (pop);
// extract first front of the final population (this is the solution of nsga2)
moeoArchive < SCH1EO > arch;
arch.update (pop);
// printing of the final archive
cout << "Final Archive\n";
arch.sortedPrintOn (cout);
cout << endl;
// printing of the final archive
cout << "Final Archive\n";
arch.sortedPrintOn(cout);
cout << endl;
return EXIT_SUCCESS;
}