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

Ajout du state saver dans testRndWalk

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1687 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
verel 2010-02-22 10:55:27 +00:00
commit 1bf3aeeefa
1 changed files with 29 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

35
branches/newMo/tutorial/oneMax/application/testRandomWalk.cpp
View file

@ -155,7 +155,7 @@ void main_function(int argc, char **argv)
/* =========================================================
*
* the local search algorithm
* the continuator and the checkpoint
*
* ========================================================= */
@ -167,20 +167,45 @@ void main_function(int argc, char **argv)
moDistanceStat<Indi, unsigned> distStat(distance, bestSolution);
// moSolutionStat<Indi> solStat;
moCheckpoint<Neighborhood> checkpoint(continuator);
eoFileMonitor outputfile("out.dat", " ");
checkpoint.add(outputfile);
checkpoint.add(fStat);
checkpoint.add(distStat);
// checkpoint.add(solStat);
eoValueParam<unsigned int> genCounter(-1,"Gen");
eoIncrementor<unsigned int> increm(genCounter.value());
checkpoint.add(increm);
moCheckpoint<Neighborhood> checkpoint(continuator);
eoFileMonitor outputfile("out.dat", " ");
checkpoint.add(outputfile);
outputfile.add(genCounter);
outputfile.add(fStat);
outputfile.add(distStat);
// outputfile.add(solStat);
// to save the solution at each iteration
eoState outState;
// Register the algorithm into the state (so it has something to save!!
Indi solution; // current solution of the search process
outState.registerObject(solution);
// and feed the state to state savers
// save state every 10th iteration
eoCountedStateSaver stateSaver(10, outState, "iteration");
// Don't forget to add the two savers to the checkpoint
checkpoint.add(stateSaver);
/* =========================================================
*
* the local search algorithm
*
* ========================================================= */
moLocalSearch< moRandomWalkExplorer<Neighborhood> > localSearch(explorer, checkpoint, eval);
/* =========================================================
@ -189,8 +214,6 @@ void main_function(int argc, char **argv)
*
* ========================================================= */
Indi solution;
random(solution);
//Can be eval here, else it will be done at the beginning of the localSearch