moSolContinue(s) modifications, maximization ==> minimization
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@585 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
cba18441d6
commit
20f0a9fef4
155 changed files with 296 additions and 296 deletions
|
|
@ -29,10 +29,10 @@ public:
|
|||
//! Basic constructor.
|
||||
/*!
|
||||
\param __maxNumberOfIterationWithoutImprovement The number of iterations without fitness improvement to reach for stop.
|
||||
\param __maximization Indicate if the the aim is to maximize or minimize the fitness.
|
||||
\param __minimization Indicate if the the aim is to maximize or minimize the fitness.
|
||||
*/
|
||||
moNoFitImprSolContinue (unsigned int __maxNumberOfIterationWithoutImprovement, bool __maximization=true)
|
||||
: maxNumberOfIterationsWithoutImprovement(__maxNumberOfIterationWithoutImprovement),maximization(__maximization),
|
||||
moNoFitImprSolContinue (unsigned int __maxNumberOfIterationWithoutImprovement, bool __minimization=true)
|
||||
: maxNumberOfIterationsWithoutImprovement(__maxNumberOfIterationWithoutImprovement),minimization(__minimization),
|
||||
firstFitnessSaved(true), counter(0)
|
||||
{}
|
||||
|
||||
|
|
@ -59,8 +59,8 @@ public:
|
|||
|
||||
counter++;
|
||||
|
||||
if( ((maximization) && (__sol.fitness() > fitness)) ||
|
||||
((!maximization) && (__sol.fitness() < fitness)) )
|
||||
if( ((minimization) && (__sol.fitness() < fitness)) ||
|
||||
((!minimization) && (__sol.fitness() > fitness)) )
|
||||
{
|
||||
fitness=__sol.fitness();
|
||||
counter=0;
|
||||
|
|
@ -88,12 +88,12 @@ private:
|
|||
//! Current Fitness.
|
||||
Fitness fitness;
|
||||
|
||||
//! Flag that indicate if there is a maximization (true) or a minimization (false) of the fitness value.
|
||||
//! 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 maximization;
|
||||
bool minimization;
|
||||
|
||||
//! The iteration couter.
|
||||
unsigned int counter;
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue