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
|
|
@ -20,7 +20,7 @@ typedef EOT::Fitness {\bf Fitness}\label{classmo_fit_sol_continue_369ed94a788d8b
|
|||
\subsection*{Public Member Functions}
|
||||
\begin{CompactItemize}
|
||||
\item
|
||||
{\bf moFitSolContinue} ({\bf Fitness} \_\-\_\-fitness, bool \_\-\_\-maximization=true)
|
||||
{\bf moFitSolContinue} ({\bf Fitness} \_\-\_\-fitness, bool \_\-\_\-minimization=true)
|
||||
\begin{CompactList}\small\item\em Basic constructor. \item\end{CompactList}\item
|
||||
bool {\bf operator()} (const EOT \&\_\-\_\-sol)
|
||||
\begin{CompactList}\small\item\em Function that activates the stopping criterion. \item\end{CompactList}\item
|
||||
|
|
@ -33,8 +33,8 @@ void {\bf init} ()\label{classmo_fit_sol_continue_670bd895b4edfcd3aebb40d2295d7f
|
|||
{\bf Fitness} {\bf fitness}\label{classmo_fit_sol_continue_87d0ba8f2f76f61c89317eed5f094dfc}
|
||||
|
||||
\begin{CompactList}\small\item\em Fitness target. \item\end{CompactList}\item
|
||||
bool {\bf maximization}
|
||||
\begin{CompactList}\small\item\em Flag that indicate if there is a maximization (true) or a minimization (false) of the fitness value. \item\end{CompactList}\end{CompactItemize}
|
||||
bool {\bf minimization}
|
||||
\begin{CompactList}\small\item\em Flag that indicate if there is a minimization (true) or a maximization (false) of the fitness value. \item\end{CompactList}\end{CompactItemize}
|
||||
|
||||
|
||||
\subsection{Detailed Description}
|
||||
|
|
@ -51,7 +51,7 @@ Definition at line 21 of file moFitSolContinue.h.
|
|||
\subsection{Constructor \& Destructor Documentation}
|
||||
\index{moFitSolContinue@{moFitSolContinue}!moFitSolContinue@{moFitSolContinue}}
|
||||
\index{moFitSolContinue@{moFitSolContinue}!moFitSolContinue@{moFitSolContinue}}
|
||||
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf moFitSolContinue}$<$ EOT $>$::{\bf moFitSolContinue} ({\bf Fitness} {\em \_\-\_\-fitness}, bool {\em \_\-\_\-maximization} = {\tt true})\hspace{0.3cm}{\tt [inline]}}\label{classmo_fit_sol_continue_5af29ede3794a7a73d8f6b0d9ebccc80}
|
||||
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf moFitSolContinue}$<$ EOT $>$::{\bf moFitSolContinue} ({\bf Fitness} {\em \_\-\_\-fitness}, bool {\em \_\-\_\-minimization} = {\tt true})\hspace{0.3cm}{\tt [inline]}}\label{classmo_fit_sol_continue_667090eca00b8532524f8e0a6e988fed}
|
||||
|
||||
|
||||
Basic constructor.
|
||||
|
|
@ -59,7 +59,7 @@ Basic constructor.
|
|||
\begin{Desc}
|
||||
\item[Parameters:]
|
||||
\begin{description}
|
||||
\item[{\em \_\-\_\-fitness}]The fitness to reach. \item[{\em \_\-\_\-maximization}]Indicate if the the aim is to maximize or minimize the fitness. \end{description}
|
||||
\item[{\em \_\-\_\-fitness}]The fitness to reach. \item[{\em \_\-\_\-minimization}]Indicate if the the aim is to maximize or minimize the fitness. \end{description}
|
||||
\end{Desc}
|
||||
|
||||
|
||||
|
|
@ -73,7 +73,7 @@ Definition at line 34 of file moFitSolContinue.h.
|
|||
|
||||
Function that activates the stopping criterion.
|
||||
|
||||
Indicates if the fitness threshold has not been yet reached.
|
||||
Indicates if the fitness threshold has not yet been reached.
|
||||
|
||||
\begin{Desc}
|
||||
\item[Parameters:]
|
||||
|
|
@ -88,15 +88,15 @@ Implements {\bf eoUF$<$ const EOT \&, bool $>$}.
|
|||
|
||||
Definition at line 44 of file moFitSolContinue.h.
|
||||
|
||||
References moFitSolContinue$<$ EOT $>$::fitness, and moFitSolContinue$<$ EOT $>$::maximization.
|
||||
References moFitSolContinue$<$ EOT $>$::fitness, and moFitSolContinue$<$ EOT $>$::minimization.
|
||||
|
||||
\subsection{Member Data Documentation}
|
||||
\index{moFitSolContinue@{moFitSolContinue}!maximization@{maximization}}
|
||||
\index{maximization@{maximization}!moFitSolContinue@{moFitSolContinue}}
|
||||
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ bool {\bf moFitSolContinue}$<$ EOT $>$::{\bf maximization}\hspace{0.3cm}{\tt [private]}}\label{classmo_fit_sol_continue_d686a52cbcaa57924a585c7c90456612}
|
||||
\index{moFitSolContinue@{moFitSolContinue}!minimization@{minimization}}
|
||||
\index{minimization@{minimization}!moFitSolContinue@{moFitSolContinue}}
|
||||
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ bool {\bf moFitSolContinue}$<$ EOT $>$::{\bf minimization}\hspace{0.3cm}{\tt [private]}}\label{classmo_fit_sol_continue_a4c90279f00774d9868a2e38ead45696}
|
||||
|
||||
|
||||
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 solution with a fitness that is worse that the best known fitness (in this case, the counter is not reinitialized).
|
||||
|
||||
|
|
|
|||
|
|
@ -20,7 +20,7 @@ typedef EOT::Fitness {\bf Fitness}\label{classmo_no_fit_impr_sol_continue_64c184
|
|||
\subsection*{Public Member Functions}
|
||||
\begin{CompactItemize}
|
||||
\item
|
||||
{\bf moNoFitImprSolContinue} (unsigned int \_\-\_\-maxNumberOfIterationWithoutImprovement, bool \_\-\_\-maximization=true)
|
||||
{\bf moNoFitImprSolContinue} (unsigned int \_\-\_\-maxNumberOfIterationWithoutImprovement, bool \_\-\_\-minimization=true)
|
||||
\begin{CompactList}\small\item\em Basic constructor. \item\end{CompactList}\item
|
||||
bool {\bf operator()} (const EOT \&\_\-\_\-sol)
|
||||
\begin{CompactList}\small\item\em Function that activates the stopping criterion. \item\end{CompactList}\item
|
||||
|
|
@ -39,8 +39,8 @@ bool {\bf firstFitnessSaved}\label{classmo_no_fit_impr_sol_continue_ca3591e47a07
|
|||
{\bf Fitness} {\bf fitness}\label{classmo_no_fit_impr_sol_continue_3d3d2b43a4dd73e38689cc0018d44ee7}
|
||||
|
||||
\begin{CompactList}\small\item\em Current Fitness. \item\end{CompactList}\item
|
||||
bool {\bf maximization}
|
||||
\begin{CompactList}\small\item\em Flag that indicate if there is a maximization (true) or a minimization (false) of the fitness value. \item\end{CompactList}\item
|
||||
bool {\bf minimization}
|
||||
\begin{CompactList}\small\item\em Flag that indicate if there is a minimization (true) or a maximization (false) of the fitness value. \item\end{CompactList}\item
|
||||
unsigned int {\bf counter}\label{classmo_no_fit_impr_sol_continue_46fc008a8f7cd06dcaaeb4016b433adb}
|
||||
|
||||
\begin{CompactList}\small\item\em The iteration couter. \item\end{CompactList}\end{CompactItemize}
|
||||
|
|
@ -60,7 +60,7 @@ Definition at line 21 of file moNoFitImprSolContinue.h.
|
|||
\subsection{Constructor \& Destructor Documentation}
|
||||
\index{moNoFitImprSolContinue@{moNoFitImprSolContinue}!moNoFitImprSolContinue@{moNoFitImprSolContinue}}
|
||||
\index{moNoFitImprSolContinue@{moNoFitImprSolContinue}!moNoFitImprSolContinue@{moNoFitImprSolContinue}}
|
||||
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf moNoFitImprSolContinue}$<$ EOT $>$::{\bf moNoFitImprSolContinue} (unsigned int {\em \_\-\_\-maxNumberOfIterationWithoutImprovement}, bool {\em \_\-\_\-maximization} = {\tt true})\hspace{0.3cm}{\tt [inline]}}\label{classmo_no_fit_impr_sol_continue_07684d717a14a70bb94307e3ff62a826}
|
||||
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf moNoFitImprSolContinue}$<$ EOT $>$::{\bf moNoFitImprSolContinue} (unsigned int {\em \_\-\_\-maxNumberOfIterationWithoutImprovement}, bool {\em \_\-\_\-minimization} = {\tt true})\hspace{0.3cm}{\tt [inline]}}\label{classmo_no_fit_impr_sol_continue_6246733469ea1b5001bf4c567e3dfdcb}
|
||||
|
||||
|
||||
Basic constructor.
|
||||
|
|
@ -68,7 +68,7 @@ Basic constructor.
|
|||
\begin{Desc}
|
||||
\item[Parameters:]
|
||||
\begin{description}
|
||||
\item[{\em \_\-\_\-maxNumberOfIterationWithoutImprovement}]The number of iterations without fitness improvement to reach for stop. \item[{\em \_\-\_\-maximization}]Indicate if the the aim is to maximize or minimize the fitness. \end{description}
|
||||
\item[{\em \_\-\_\-maxNumberOfIterationWithoutImprovement}]The number of iterations without fitness improvement to reach for stop. \item[{\em \_\-\_\-minimization}]Indicate if the the aim is to maximize or minimize the fitness. \end{description}
|
||||
\end{Desc}
|
||||
|
||||
|
||||
|
|
@ -95,15 +95,15 @@ Implements {\bf eoUF$<$ const EOT \&, bool $>$}.
|
|||
|
||||
Definition at line 45 of file moNoFitImprSolContinue.h.
|
||||
|
||||
References moNoFitImprSolContinue$<$ EOT $>$::counter, moNoFitImprSolContinue$<$ EOT $>$::firstFitnessSaved, moNoFitImprSolContinue$<$ EOT $>$::fitness, moNoFitImprSolContinue$<$ EOT $>$::maximization, and moNoFitImprSolContinue$<$ EOT $>$::maxNumberOfIterationsWithoutImprovement.
|
||||
References moNoFitImprSolContinue$<$ EOT $>$::counter, moNoFitImprSolContinue$<$ EOT $>$::firstFitnessSaved, moNoFitImprSolContinue$<$ EOT $>$::fitness, moNoFitImprSolContinue$<$ EOT $>$::maxNumberOfIterationsWithoutImprovement, and moNoFitImprSolContinue$<$ EOT $>$::minimization.
|
||||
|
||||
\subsection{Member Data Documentation}
|
||||
\index{moNoFitImprSolContinue@{moNoFitImprSolContinue}!maximization@{maximization}}
|
||||
\index{maximization@{maximization}!moNoFitImprSolContinue@{moNoFitImprSolContinue}}
|
||||
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ bool {\bf moNoFitImprSolContinue}$<$ EOT $>$::{\bf maximization}\hspace{0.3cm}{\tt [private]}}\label{classmo_no_fit_impr_sol_continue_73295d6a4ad437b0ab06848ac24698c4}
|
||||
\index{moNoFitImprSolContinue@{moNoFitImprSolContinue}!minimization@{minimization}}
|
||||
\index{minimization@{minimization}!moNoFitImprSolContinue@{moNoFitImprSolContinue}}
|
||||
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ bool {\bf moNoFitImprSolContinue}$<$ EOT $>$::{\bf minimization}\hspace{0.3cm}{\tt [private]}}\label{classmo_no_fit_impr_sol_continue_2d216544c9188ec593d808c8e95208f5}
|
||||
|
||||
|
||||
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).
|
||||
|
||||
|
|
|
|||
|
|
@ -20,7 +20,7 @@ typedef EOT::Fitness {\bf Fitness}\label{classmo_steady_fit_sol_continue_c289721
|
|||
\subsection*{Public Member Functions}
|
||||
\begin{CompactItemize}
|
||||
\item
|
||||
{\bf moSteadyFitSolContinue} (unsigned int \_\-\_\-maxNumberOfIterations, unsigned int \_\-\_\-maxNumberOfIterationWithoutImprovement, bool \_\-\_\-maximization=true)
|
||||
{\bf moSteadyFitSolContinue} (unsigned int \_\-\_\-maxNumberOfIterations, unsigned int \_\-\_\-maxNumberOfIterationWithoutImprovement, bool \_\-\_\-minimization=true)
|
||||
\begin{CompactList}\small\item\em Basic constructor. \item\end{CompactList}\item
|
||||
bool {\bf operator()} (const EOT \&\_\-\_\-sol)
|
||||
\begin{CompactList}\small\item\em Function that activates the stopping criterion. \item\end{CompactList}\item
|
||||
|
|
@ -45,8 +45,8 @@ bool {\bf firstFitnessSaved}\label{classmo_steady_fit_sol_continue_025bf2789e470
|
|||
{\bf Fitness} {\bf fitness}\label{classmo_steady_fit_sol_continue_a5c62e7049b36f6e71e92b559568c09e}
|
||||
|
||||
\begin{CompactList}\small\item\em Current Fitness. \item\end{CompactList}\item
|
||||
bool {\bf maximization}
|
||||
\begin{CompactList}\small\item\em Flag that indicate if there is a maximization (true) or a minimization (false) of the fitness value. \item\end{CompactList}\item
|
||||
bool {\bf minimization}
|
||||
\begin{CompactList}\small\item\em Flag that indicate if there is a minimization (true) or a maximization (false) of the fitness value. \item\end{CompactList}\item
|
||||
unsigned int {\bf counter}\label{classmo_steady_fit_sol_continue_245c9099a2c40dfc4f34b3ff216d13ce}
|
||||
|
||||
\begin{CompactList}\small\item\em The iteration couter. \item\end{CompactList}\end{CompactItemize}
|
||||
|
|
@ -66,7 +66,7 @@ Definition at line 21 of file moSteadyFitSolContinue.h.
|
|||
\subsection{Constructor \& Destructor Documentation}
|
||||
\index{moSteadyFitSolContinue@{moSteadyFitSolContinue}!moSteadyFitSolContinue@{moSteadyFitSolContinue}}
|
||||
\index{moSteadyFitSolContinue@{moSteadyFitSolContinue}!moSteadyFitSolContinue@{moSteadyFitSolContinue}}
|
||||
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf moSteadyFitSolContinue}$<$ EOT $>$::{\bf moSteadyFitSolContinue} (unsigned int {\em \_\-\_\-maxNumberOfIterations}, unsigned int {\em \_\-\_\-maxNumberOfIterationWithoutImprovement}, bool {\em \_\-\_\-maximization} = {\tt true})\hspace{0.3cm}{\tt [inline]}}\label{classmo_steady_fit_sol_continue_3ebfa3cfb83cdbf2e23cddc9d16fd00b}
|
||||
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf moSteadyFitSolContinue}$<$ EOT $>$::{\bf moSteadyFitSolContinue} (unsigned int {\em \_\-\_\-maxNumberOfIterations}, unsigned int {\em \_\-\_\-maxNumberOfIterationWithoutImprovement}, bool {\em \_\-\_\-minimization} = {\tt true})\hspace{0.3cm}{\tt [inline]}}\label{classmo_steady_fit_sol_continue_0c7e09ca080bfb1dd493015d23a50ad7}
|
||||
|
||||
|
||||
Basic constructor.
|
||||
|
|
@ -74,7 +74,7 @@ Basic constructor.
|
|||
\begin{Desc}
|
||||
\item[Parameters:]
|
||||
\begin{description}
|
||||
\item[{\em \_\-\_\-maxNumberOfIterations}]The number of iterations to reach before looking for the fitness. \item[{\em \_\-\_\-maxNumberOfIterationWithoutImprovement}]The number of iterations without fitness improvement to reach for stop. \item[{\em \_\-\_\-maximization}]Indicate if the the aim is to maximize or minimize the fitness. \end{description}
|
||||
\item[{\em \_\-\_\-maxNumberOfIterations}]The number of iterations to reach before looking for the fitness. \item[{\em \_\-\_\-maxNumberOfIterationWithoutImprovement}]The number of iterations without fitness improvement to reach for stop. \item[{\em \_\-\_\-minimization}]Indicate if the the aim is to maximize or minimize the fitness. \end{description}
|
||||
\end{Desc}
|
||||
|
||||
|
||||
|
|
@ -103,15 +103,15 @@ Implements {\bf eoUF$<$ const EOT \&, bool $>$}.
|
|||
|
||||
Definition at line 47 of file moSteadyFitSolContinue.h.
|
||||
|
||||
References moSteadyFitSolContinue$<$ EOT $>$::counter, moSteadyFitSolContinue$<$ EOT $>$::firstFitnessSaved, moSteadyFitSolContinue$<$ EOT $>$::fitness, moSteadyFitSolContinue$<$ EOT $>$::maximization, moSteadyFitSolContinue$<$ EOT $>$::maxNumberOfIterations, moSteadyFitSolContinue$<$ EOT $>$::maxNumberOfIterationsReached, and moSteadyFitSolContinue$<$ EOT $>$::maxNumberOfIterationsWithoutImprovement.
|
||||
References moSteadyFitSolContinue$<$ EOT $>$::counter, moSteadyFitSolContinue$<$ EOT $>$::firstFitnessSaved, moSteadyFitSolContinue$<$ EOT $>$::fitness, moSteadyFitSolContinue$<$ EOT $>$::maxNumberOfIterations, moSteadyFitSolContinue$<$ EOT $>$::maxNumberOfIterationsReached, moSteadyFitSolContinue$<$ EOT $>$::maxNumberOfIterationsWithoutImprovement, and moSteadyFitSolContinue$<$ EOT $>$::minimization.
|
||||
|
||||
\subsection{Member Data Documentation}
|
||||
\index{moSteadyFitSolContinue@{moSteadyFitSolContinue}!maximization@{maximization}}
|
||||
\index{maximization@{maximization}!moSteadyFitSolContinue@{moSteadyFitSolContinue}}
|
||||
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ bool {\bf moSteadyFitSolContinue}$<$ EOT $>$::{\bf maximization}\hspace{0.3cm}{\tt [private]}}\label{classmo_steady_fit_sol_continue_cc54de2c6f32b650e5a7ee36efc1ba73}
|
||||
\index{moSteadyFitSolContinue@{moSteadyFitSolContinue}!minimization@{minimization}}
|
||||
\index{minimization@{minimization}!moSteadyFitSolContinue@{moSteadyFitSolContinue}}
|
||||
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ bool {\bf moSteadyFitSolContinue}$<$ EOT $>$::{\bf minimization}\hspace{0.3cm}{\tt [private]}}\label{classmo_steady_fit_sol_continue_4176d8cc6fda6cb854997a845faaf8a4}
|
||||
|
||||
|
||||
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 solution with a fitness that is worse that the best known fitness (in this case, the counter is not reinitialized).
|
||||
|
||||
|
|
|
|||
|
|
@ -10,8 +10,8 @@
|
|||
{\fancyplain{}{\bfseries\rightmark}}
|
||||
\rhead[\fancyplain{}{\bfseries\leftmark}]
|
||||
{\fancyplain{}{\bfseries\thepage}}
|
||||
\rfoot[\fancyplain{}{\bfseries\scriptsize Generated on Tue Jul 31 14:12:37 2007 for PARADISEO-MO by Doxygen }]{}
|
||||
\lfoot[]{\fancyplain{}{\bfseries\scriptsize Generated on Tue Jul 31 14:12:37 2007 for PARADISEO-MO by Doxygen }}
|
||||
\rfoot[\fancyplain{}{\bfseries\scriptsize Generated on Thu Aug 2 09:02:25 2007 for PARADISEO-MO by Doxygen }]{}
|
||||
\lfoot[]{\fancyplain{}{\bfseries\scriptsize Generated on Thu Aug 2 09:02:25 2007 for PARADISEO-MO by Doxygen }}
|
||||
\cfoot{}
|
||||
\newenvironment{Code}
|
||||
{\footnotesize}
|
||||
|
|
|
|||
|
|
@ -20,7 +20,7 @@
|
|||
\vspace*{1cm}
|
||||
{\large Generated by Doxygen 1.5.2}\\
|
||||
\vspace*{0.5cm}
|
||||
{\small Tue Jul 31 14:12:37 2007}\\
|
||||
{\small Thu Aug 2 09:02:25 2007}\\
|
||||
\end{center}
|
||||
\end{titlepage}
|
||||
\clearemptydoublepage
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue