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

for tag

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1096 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
canape 2008-03-07 13:01:53 +00:00
commit 4c394ff220
14 changed files with 1 additions and 1493 deletions
Download patch file Download diff file Expand all files Collapse all files

122
trunk/paradiseo-peo/tutorial/Lesson6/main.cpp
View file

@ -1,122 +0,0 @@
#include <peo>
#include <peoAsyncDataTransfer.h>
#include <peoSyncDataTransfer.h>
#include "route.h"
#include "route_init.h"
#include "route_eval.h"
#include "order_xover.h"
#include "city_swap.h"
#include "param.h"
#define POP_SIZE 10
#define NUM_GEN 100
#define CROSS_RATE 1.0
#define MUT_RATE 0.01
struct CoSearch
{
CoSearch(
eoPop< Route >& A, eoPop< Route >& B,
peoAsyncDataTransfer& asyncTransferA, peoAsyncDataTransfer& asyncTransferB
)
: transferA( A ), transferB( B ),
asyncDataTransferA( asyncTransferA ), asyncDataTransferB( asyncTransferB ) {
}
void operator()() {
for ( unsigned int index = 0; index < 100; index++ ) {
asyncDataTransferA();
asyncDataTransferB();
eoPop< Route > intermed;
intermed = transferA;
transferA = transferB;
transferB = intermed;
}
}
eoPop< Route >& transferA;
eoPop< Route >& transferB;
peoAsyncDataTransfer& asyncDataTransferA;
peoAsyncDataTransfer& asyncDataTransferB;
};
struct PushBackAggregation {
void operator()( eoPop< Route >& A, eoPop< Route >& B ) {
for ( unsigned int index = 0; index < B.size(); index++ ) {
A.push_back( B[ index ] );
}
}
};
int main( int __argc, char** __argv ) {
peo :: init( __argc, __argv );
loadParameters( __argc, __argv );
RouteInit route_init;
RouteEval full_eval;
OrderXover crossover;
CitySwap mutation;
eoPop< Route > population( POP_SIZE, route_init );
eoGenContinue< Route > eaCont( NUM_GEN );
eoCheckPoint< Route > eaCheckpointContinue( eaCont );
eoRankingSelect< Route > selectionStrategy;
eoSelectNumber< Route > eaSelect( selectionStrategy, POP_SIZE );
eoSGATransform< Route > transformA( crossover, CROSS_RATE, mutation, MUT_RATE );
eoPlusReplacement< Route > eaReplace;
RingTopology ring;
eoPlusReplacement< Route > transferReplace;
peoAsyncDataTransfer asyncEAEndPoint( population, population, ring, transferReplace );
eaCheckpointContinue.add( asyncEAEndPoint );
eoEasyEA< Route > eaAlg( eaCheckpointContinue, full_eval, eaSelect, transformA, eaReplace );
peoWrapper paraEAAlg( eaAlg, population );
asyncEAEndPoint.setOwner( paraEAAlg );
eoPop< Route > populationB( POP_SIZE, route_init );
eoGenContinue< Route > eaContB( NUM_GEN );
eoCheckPoint< Route > eaCheckpointContinueB( eaContB );
eoRankingSelect< Route > selectionStrategyB;
eoSelectNumber< Route > eaSelectB( selectionStrategyB, POP_SIZE );
RingTopology ringB;
eoPlusReplacement< Route > transferReplaceB;
peoAsyncDataTransfer asyncEAEndPointB( populationB, populationB, ringB, transferReplaceB );
eaCheckpointContinueB.add( asyncEAEndPointB );
eoSGATransform< Route > transformB ( crossover, CROSS_RATE, mutation, MUT_RATE );
eoEasyEA< Route > eaAlgB( eaCheckpointContinueB, full_eval, eaSelectB, transformB, eaReplace );
peoWrapper paraEAAlgB( eaAlgB, populationB );
asyncEAEndPointB.setOwner( paraEAAlgB );
eoPop< Route > A, B;
PushBackAggregation pushBackA, pushBackB;
peoAsyncDataTransfer coSearchEndPointA( A, A, ring, pushBackA );
peoAsyncDataTransfer coSearchEndPointB( B, B, ringB, pushBackB );
CoSearch coSearch( A, B, coSearchEndPointA, coSearchEndPointB );
peoWrapper paraCoSearch( coSearch );
coSearchEndPointA.setOwner( paraCoSearch );
coSearchEndPointB.setOwner( paraCoSearch );
peo::run();
peo::finalize();
return 0;
}