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

In the TSP, the fitness has to be minimized ... with all the needed modification (for example, moSA.h)

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@587 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
jboisson 2007-08-03 14:28:06 +00:00
commit 1d94071693
170 changed files with 748 additions and 837 deletions
Download patch file Download diff file Expand all files Collapse all files

24
trunk/paradiseo-mo/src/moNoFitImprSolContinue.h
View file

@ -29,11 +29,9 @@ public:
//! Basic constructor.
/*!
\param __maxNumberOfIterationWithoutImprovement The number of iterations without fitness improvement to reach for stop.
\param __minimization Indicate if the the aim is to maximize or minimize the fitness.
*/
moNoFitImprSolContinue (unsigned int __maxNumberOfIterationWithoutImprovement, bool __minimization=true)
: maxNumberOfIterationsWithoutImprovement(__maxNumberOfIterationWithoutImprovement),minimization(__minimization),
firstFitnessSaved(true), counter(0)
moNoFitImprSolContinue (unsigned int __maxNumberOfIterationWithoutImprovement)
: maxNumberOfIterationsWithoutImprovement(__maxNumberOfIterationWithoutImprovement), firstFitnessSaved(true), counter(0)
{}
//! Function that activates the stopping criterion.
@ -59,8 +57,7 @@ public:
counter++;
if( ((minimization) && (__sol.fitness() < fitness)) ||
((!minimization) && (__sol.fitness() > fitness)) )
if( __sol.fitness() > fitness)
{
fitness=__sol.fitness();
counter=0;
@ -74,8 +71,14 @@ public:
}
//! Procedure which allows to initialise all the stuff needed.
/*!
It can be also used to reinitialize the counter all the needed things.
*/
void init ()
{}
{
firstFitnessSaved=true;
counter=0;
}
private:
@ -88,13 +91,6 @@ private:
//! Current Fitness.
Fitness fitness;
//! Flag that indicate if there is a minimization (true) or a maximization (false) of the fitness value.
/*!
It can be interesting to know this information because some solution-based metaheuristics can generate solutions wiht a fitness that
is worse that the best known fitness (in this case, the counter is not reinitialized).
*/
bool minimization;
//! The iteration couter.
unsigned int counter;
};