ef8ef3f3b2
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1020 331e1502-861f-0410-8da2-ba01fb791d7f
116 lines
4.2 KiB
C++
116 lines
4.2 KiB
C++
/*
|
|
* <mainEA.cpp>
|
|
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
|
|
* (C) OPAC Team, INRIA, 2008
|
|
*
|
|
* Clive Canape
|
|
*
|
|
* 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 <peo>
|
|
#include <es.h>
|
|
|
|
typedef eoReal<double> Indi;
|
|
|
|
//Evaluation function
|
|
double f (const Indi & _indi)
|
|
{
|
|
// Rosenbrock function f(x) = 100*(x[1]-x[0]^2)^2+(1-x[0])^2
|
|
// => optimal : f* = 0 , with x* =(1,1)
|
|
|
|
double sum;
|
|
sum=_indi[1]-pow(_indi[0],2);
|
|
sum=100*pow(sum,2);
|
|
sum+=pow((1-_indi[0]),2);
|
|
return (-sum);
|
|
}
|
|
|
|
int main (int __argc, char *__argv[])
|
|
{
|
|
|
|
// Initialization of the parallel environment : thanks this instruction, ParadisEO-PEO can initialize himself
|
|
peo :: init( __argc, __argv );
|
|
|
|
//Parameters
|
|
eoParser parser(__argc, __argv);
|
|
unsigned int POP_SIZE = parser.createParam((unsigned int)(20), "popSize", "Population size",'P',"Param").value();
|
|
unsigned int MAX_GEN = parser.createParam((unsigned int)(100), "maxGen", "Maximum number of generations",'G',"Param").value();
|
|
double EPSILON = parser.createParam(0.01, "mutEpsilon", "epsilon for mutation",'e',"Param").value();
|
|
double CROSS_RATE = parser.createParam(0.25, "pCross", "Crossover probability",'C',"Param").value();
|
|
double MUT_RATE = parser.createParam(0.35, "pMut", "Mutation probability",'M',"Param").value();
|
|
unsigned int VEC_SIZE = parser.createParam((unsigned int)(2), "vecSize", "Vector size",'V',"Param").value();
|
|
double INIT_POSITION_MIN = parser.createParam(-2.0, "pMin", "Init position min",'N',"Param").value();
|
|
double INIT_POSITION_MAX = parser.createParam(2.0, "pMax", "Init position max",'X',"Param").value();
|
|
rng.reseed (time(0));
|
|
|
|
// Stopping
|
|
eoGenContinue < Indi > genContPara (MAX_GEN);
|
|
eoCombinedContinue <Indi> continuatorPara (genContPara);
|
|
eoCheckPoint<Indi> checkpoint(continuatorPara);
|
|
|
|
// For a parallel evaluation
|
|
peoEvalFunc<Indi> plainEval(f);
|
|
peoPopEval <Indi> eval(plainEval);
|
|
|
|
// Initialization
|
|
eoUniformGenerator < double >uGen (INIT_POSITION_MIN, INIT_POSITION_MAX);
|
|
eoInitFixedLength < Indi > random (VEC_SIZE, uGen);
|
|
|
|
// Selection
|
|
eoRankingSelect<Indi> selectionStrategy;
|
|
eoSelectNumber<Indi> select(selectionStrategy,POP_SIZE);
|
|
|
|
// Transformation
|
|
eoSegmentCrossover<Indi> crossover;
|
|
eoUniformMutation<Indi> mutation(EPSILON);
|
|
eoSGATransform<Indi> transform(crossover,CROSS_RATE,mutation,MUT_RATE);
|
|
|
|
// Replacement
|
|
eoPlusReplacement<Indi> replace;
|
|
|
|
// Creation of the population
|
|
eoPop < Indi > pop;
|
|
pop.append (POP_SIZE, random);
|
|
|
|
// Algorithm
|
|
eoEasyEA< Indi > eaAlg( checkpoint, eval, select, transform, replace );
|
|
|
|
//Parallel algorithm
|
|
peoWrapper parallelEA( eaAlg, pop);
|
|
eval.setOwner(parallelEA);
|
|
|
|
peo :: run();
|
|
peo :: finalize();
|
|
if (getNodeRank()==1)
|
|
{
|
|
pop.sort();
|
|
std::cout << "Final population :\n" << pop << std::endl;
|
|
}
|
|
}
|