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

Brand new documentation for ParadisEO-PEO

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1475 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
fatene 2009-03-05 11:02:24 +00:00
commit a28c5452ef
142 changed files with 8144 additions and 5695 deletions
Download patch file Download diff file Expand all files Collapse all files

305
trunk/paradiseo-peo/tutorial/Lesson6/main.cpp Normal file → Executable file
View file

@ -1,162 +1,195 @@
/*
* <main.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
*
<main.cpp>
Copyright (C) DOLPHIN Project-Team, INRIA Lille Nord Europe, 2006-2009
(C) OPAC Team, LIFL, 2002-2009
The Van LUONG, (The-Van.Luong@inria.fr)
Mahmoud FATENE, (mahmoud.fatene@inria.fr)
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 <mo>
#include <peo>
#include <time.h>
#include "route.h"
#include "route_init.h"
#include "route_eval.h"
#include "order_xover.h"
#include "city_swap.h"
#include "param.h"
#include <iostream>
#include <fstream>
#include "QAP.h"
#include "Move.h"
#include "QAPGA.h"
#include "qapPackUnpack.h"
using namespace std;
/** Set of parameters wrapped into a structure. We pass then the structure
* to a function which parses the parameters file. Doing so helps cleaning
* the code from the parts of reading the inputs.
*/
#include "parserStruct.h"
#include "utils.h"
/** The actual reading and parameters parsing is done inside this class utilities
*/
// Global variables
int n; // problem size
int** a;
int** b; // flows and distances matrices
#define POP_SIZE 10
#define NUM_GEN 100
#define CROSS_RATE 1.0
#define MUT_RATE 0.01
int bkv; //best known value
void main_function(int argc, char **argv)
{
if (argc < 2){
cout << "Please give a param file" << endl;
exit(1);
}
struct CoSearch
// Declaration of useful variables to parse the parameters file and then
// put its elements into a structure
eoParser parser(argc, argv);
parameters param;
parseFile(parser, param);
string s (argv[1]);
if ( (s.compare("-h") == 0) || (s.compare("--help") == 0 ) )
;//make help
// Reading the a and b matrices of the QAP problem
else
loadInstances(param.inst.c_str(), n, bkv, a, b);
MoveInit move_init;
ProblemEval problem_eval;
MoveNext move_next;
MoveIncrEval move_incr_eval;
moBestImprSelect<Move> move_select;
moSimpleMoveTabuList <Move> tabulist (param.tabuListSize);
//moNoAspirCrit<Move> aspiration_criterion;
moImprBestFitAspirCrit <Move> aspiration_criterion;
moGenSolContinue <Problem> continu (param.TSmaxIter);
moTS <Move> tabu_search (move_init, move_next, move_incr_eval,
tabulist, aspiration_criterion, continu, problem_eval );
ProblemInit chromInit;
eoPop <Problem> pop (param.popSize, chromInit);
eoDetTournamentSelect<Problem> selectOne(param.tSize);
eoSelectPerc<Problem> select(selectOne);// by default rate==1
ProblemXover Xover; // CROSSOVER
ProblemSwapMutation mutationSwap; // MUTATION
eoSGATransform<Problem> transform(Xover, param.pCross, mutationSwap, param.pMut);
eoPlusReplacement<Problem> replace;
eoGenContinue<Problem> genCont(param.maxGen); // generation continuation
eoEasyEA<Problem> gga(genCont, problem_eval, select, transform, replace);
// Initialisation of the parallel environment
peo :: init (argc, argv);
if (getNodeRank()==1)
{
std :: cout << "\nResult before the local search\n";
//std :: cout << "size\t" << pop.size() << endl;
for (int i=0;i<pop.size();i++)
problem_eval(pop[i]);
pop.sort();
cout << pop;
}
// The parallel EA
peoWrapper parallelEA( gga, pop);
peo :: run ();
peo :: finalize ();
CoSearch(
eoPop< Route >& A, eoPop< Route >& B,
peoAsyncDataTransfer& asyncTransferA, peoAsyncDataTransfer& asyncTransferB
)
: transferA( A ), transferB( B ),
asyncDataTransferA( asyncTransferA ), asyncDataTransferB( asyncTransferB )
{
}
// Local search
peo :: init (argc, argv);
peoMultiStart <Problem> initParallelTS (tabu_search);
peoWrapper parallelTS (initParallelTS, pop);
initParallelTS.setOwner(parallelTS);
peo :: run( );
peo :: finalize( );
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
if (getNodeRank()==1)
{
cout << "\nInstance size = " << n << endl;
cout << "Best known value in the litterature = " << bkv << endl;
std :: cout << "\nResult after the local search\n";
// sort and print the population
pop.sort();
cout << pop;
}
void operator()( eoPop< Route >& A, eoPop< Route >& B )
{
for ( unsigned int index = 0; index < B.size(); index++ )
{
cout << endl;
A.push_back( B[ index ] );
}
}
};
int main( int __argc, char** __argv )
}
// A main that catches the exceptions
int main(int argc, char **argv)
{
peo :: init( __argc, __argv );
try
{
main_function(argc, argv);
loadParameters( __argc, __argv );
}
catch(exception& e)
{
cout << "Exception: " << e.what() << '\n';
}
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 );
// desallocate memory
for (int i=0; i<n; i++){
delete[] a[i];
delete[] b[i];
}
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 );
delete[] a;
delete[] b;
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;
return 1;
}