Test peo modified
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@911 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
b87149ea75
commit
743d94aea0
17 changed files with 559 additions and 140 deletions
85
trunk/paradiseo-peo/test/t-PSOGlobalBestLib.cpp
Normal file
85
trunk/paradiseo-peo/test/t-PSOGlobalBestLib.cpp
Normal file
|
|
@ -0,0 +1,85 @@
|
|||
// Test : PSO Global Best
|
||||
#include <peo>
|
||||
typedef eoRealParticle < double >Indi;
|
||||
double f (const Indi & _indi)
|
||||
{
|
||||
double sum=_indi[0]+_indi[1];
|
||||
return (sum);
|
||||
}
|
||||
int main (int __argc, char *__argv[])
|
||||
{
|
||||
peo :: init( __argc, __argv );
|
||||
if (getNodeRank()==1)
|
||||
std::cout<<"\n\nTest : PSO Global Best\n\n";
|
||||
rng.reseed (10);
|
||||
RingTopology topologyMig;
|
||||
eoGenContinue < Indi > genContPara (10);
|
||||
eoCombinedContinue <Indi> continuatorPara (genContPara);
|
||||
eoCheckPoint<Indi> checkpoint(continuatorPara);
|
||||
peoEvalFunc<Indi, double, const Indi& > plainEval(f);
|
||||
peoPopEval< Indi > eval(plainEval);
|
||||
eoUniformGenerator < double >uGen (0, 1.);
|
||||
eoInitFixedLength < Indi > random (2, uGen);
|
||||
eoUniformGenerator < double >sGen (-1., 1.);
|
||||
eoVelocityInitFixedLength < Indi > veloRandom (2, sGen);
|
||||
eoFirstIsBestInit < Indi > localInit;
|
||||
eoRealVectorBounds bndsFlight(2,0,1.);
|
||||
eoStandardFlight < Indi > flight(bndsFlight);
|
||||
peoPop < Indi > pop;
|
||||
pop.append (10, random);
|
||||
eoLinearTopology<Indi> topology(2);
|
||||
eoRealVectorBounds bnds(2,-1.,1.);
|
||||
eoStandardVelocity < Indi > velocity (topology,1,0.5,2.,bnds);
|
||||
eoInitializer <Indi> init(eval,veloRandom,localInit,topology,pop);
|
||||
eoPeriodicContinue< Indi > mig_cont( 2 );
|
||||
peoPSOSelect<Indi> mig_selec(topology);
|
||||
peoGlobalBestVelocity<Indi> mig_replac (2.,velocity);
|
||||
eoContinuator<Indi> cont(mig_cont, pop);
|
||||
eoSelector <Indi, peoPop<Indi> > mig_select (mig_selec,1,pop);
|
||||
eoReplace <Indi, peoPop<Indi> > mig_replace (mig_replac,pop);
|
||||
eoGenContinue < Indi > genContPara2 (10);
|
||||
eoCombinedContinue <Indi> continuatorPara2 (genContPara2);
|
||||
eoCheckPoint<Indi> checkpoint2(continuatorPara2);
|
||||
peoEvalFunc<Indi, double, const Indi& > plainEval2(f);
|
||||
peoPopEval< Indi > eval2(plainEval2);
|
||||
eoUniformGenerator < double >uGen2 (0, 1.);
|
||||
eoInitFixedLength < Indi > random2 (2, uGen2);
|
||||
eoUniformGenerator < double >sGen2 (-1., 1.);
|
||||
eoVelocityInitFixedLength < Indi > veloRandom2 (2, sGen2);
|
||||
eoFirstIsBestInit < Indi > localInit2;
|
||||
eoRealVectorBounds bndsFlight2(2,0,1.);
|
||||
eoStandardFlight < Indi > flight2(bndsFlight2);
|
||||
peoPop < Indi > pop2;
|
||||
pop2.append (10, random2);
|
||||
eoLinearTopology<Indi> topology2(2);
|
||||
eoRealVectorBounds bnds2(2,-1.,1.);
|
||||
eoStandardVelocity < Indi > velocity2 (topology2,1,0.5,2.,bnds2);
|
||||
eoInitializer <Indi> init2(eval2,veloRandom2,localInit2,topology2,pop2);
|
||||
eoPeriodicContinue< Indi > mig_cont2( 2 );
|
||||
peoPSOSelect<Indi> mig_selec2(topology2);
|
||||
peoGlobalBestVelocity<Indi> mig_replac2 (2.,velocity2);
|
||||
eoContinuator<Indi> cont2(mig_cont2,pop2);
|
||||
eoSelector <Indi, peoPop<Indi> > mig_select2 (mig_selec2,1,pop2);
|
||||
eoReplace <Indi, peoPop<Indi> > mig_replace2 (mig_replac2,pop2);
|
||||
peoAsyncIslandMig< Indi, peoPop<Indi> > mig(cont,mig_select, mig_replace, topologyMig, pop, pop);
|
||||
checkpoint.add( mig );
|
||||
peoAsyncIslandMig< Indi, peoPop<Indi> > mig2(cont2,mig_select2, mig_replace2, topologyMig, pop2, pop2);
|
||||
checkpoint2.add( mig2 );
|
||||
eoSyncEasyPSO <Indi> psa(init,checkpoint,eval, velocity, flight);
|
||||
peoWrapper parallelPSO( psa, pop);
|
||||
eval.setOwner(parallelPSO);
|
||||
mig.setOwner(parallelPSO);
|
||||
eoSyncEasyPSO <Indi> psa2(init2,checkpoint2,eval2, velocity2, flight2);
|
||||
peoWrapper parallelPSO2( psa2, pop2);
|
||||
eval2.setOwner(parallelPSO2);
|
||||
mig2.setOwner(parallelPSO2);
|
||||
peo :: run();
|
||||
peo :: finalize();
|
||||
if (getNodeRank()==1)
|
||||
{
|
||||
pop.sort();
|
||||
pop2.sort();
|
||||
std::cout << "Final population :\n" << pop << std::endl;
|
||||
std::cout << "Final population :\n" << pop2 << std::endl;
|
||||
}
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue