misspelling errors have been corrected in some files. improvment -> improvement
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@584 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
bc6cbb56b5
commit
cba18441d6
130 changed files with 217 additions and 217 deletions
|
|
@ -60,7 +60,7 @@ Definition at line 22 of file moBestImprSelect.h.
|
|||
|
||||
Function that indicates if the current move has not improved the fitness.
|
||||
|
||||
If the given fitness enables an improvment, the move (\doxyref{moMove}{p.}{classmo_move}) and the fitness linked to this move are saved.
|
||||
If the given fitness enables an improvement, the move (\doxyref{moMove}{p.}{classmo_move}) and the fitness linked to this move are saved.
|
||||
|
||||
\begin{Desc}
|
||||
\item[Parameters:]
|
||||
|
|
|
|||
|
|
@ -48,7 +48,7 @@ M {\bf best\_\-move}\label{classmo_first_impr_select_dfed419a608dd7c41f07fa1f127
|
|||
|
||||
One possible \doxyref{moMoveSelect}{p.}{classmo_move_select}.
|
||||
|
||||
The neighborhood is explored until a move enables an improvment of the current solution.
|
||||
The neighborhood is explored until a move enables an improvement of the current solution.
|
||||
|
||||
|
||||
|
||||
|
|
@ -75,7 +75,7 @@ References moFirstImprSelect$<$ M $>$::init\_\-fit, and moFirstImprSelect$<$ M $
|
|||
|
||||
Function that indicates if the current move has not improved the fitness.
|
||||
|
||||
If the given fitness enables an improvment, the move (\doxyref{moMove}{p.}{classmo_move}) should be applied to the current solution.
|
||||
If the given fitness enables an improvement, the move (\doxyref{moMove}{p.}{classmo_move}) should be applied to the current solution.
|
||||
|
||||
\begin{Desc}
|
||||
\item[Parameters:]
|
||||
|
|
|
|||
|
|
@ -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 \_\-\_\-maxNumberOfIterationWithoutImprovment, bool \_\-\_\-maximization=true)
|
||||
{\bf moNoFitImprSolContinue} (unsigned int \_\-\_\-maxNumberOfIterationWithoutImprovement, bool \_\-\_\-maximization=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
|
||||
|
|
@ -30,9 +30,9 @@ void {\bf init} ()\label{classmo_no_fit_impr_sol_continue_21641c0a38a4501baae613
|
|||
\subsection*{Private Attributes}
|
||||
\begin{CompactItemize}
|
||||
\item
|
||||
unsigned int {\bf maxNumberOfIterationsWithoutImprovment}\label{classmo_no_fit_impr_sol_continue_9dbd725a2dab787f9f7b159b759e4834}
|
||||
unsigned int {\bf maxNumberOfIterationsWithoutImprovement}\label{classmo_no_fit_impr_sol_continue_03612ffc3af9d943c1b1d2cde09d461b}
|
||||
|
||||
\begin{CompactList}\small\item\em Maximum number of iterations without improvment allowed. \item\end{CompactList}\item
|
||||
\begin{CompactList}\small\item\em Maximum number of iterations without improvement allowed. \item\end{CompactList}\item
|
||||
bool {\bf firstFitnessSaved}\label{classmo_no_fit_impr_sol_continue_ca3591e47a075b59e0826f31234c71ef}
|
||||
|
||||
\begin{CompactList}\small\item\em Flag that this is the first time that the fitness is used. \item\end{CompactList}\item
|
||||
|
|
@ -51,7 +51,7 @@ unsigned int {\bf counter}\label{classmo_no_fit_impr_sol_continue_46fc008a8f7cd0
|
|||
|
||||
One possible stop criterion for a solution-based heuristic.
|
||||
|
||||
The stop criterion corresponds to a maximum number of iterations without improvement.
|
||||
The stop criterion corresponds to a maximum number of iterations without improevement.
|
||||
|
||||
|
||||
|
||||
|
|
@ -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 \_\-\_\-maxNumberOfIterationWithoutImprovment}, bool {\em \_\-\_\-maximization} = {\tt true})\hspace{0.3cm}{\tt [inline]}}\label{classmo_no_fit_impr_sol_continue_979c991cbae53e1fd596964837c8d32d}
|
||||
\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}
|
||||
|
||||
|
||||
Basic constructor.
|
||||
|
|
@ -68,7 +68,7 @@ Basic constructor.
|
|||
\begin{Desc}
|
||||
\item[Parameters:]
|
||||
\begin{description}
|
||||
\item[{\em \_\-\_\-maxNumberOfIterationWithoutImprovment}]The number of iterations without fitness improvment 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 \_\-\_\-maximization}]Indicate if the the aim is to maximize or minimize the fitness. \end{description}
|
||||
\end{Desc}
|
||||
|
||||
|
||||
|
|
@ -95,7 +95,7 @@ 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 $>$::maxNumberOfIterationsWithoutImprovment.
|
||||
References moNoFitImprSolContinue$<$ EOT $>$::counter, moNoFitImprSolContinue$<$ EOT $>$::firstFitnessSaved, moNoFitImprSolContinue$<$ EOT $>$::fitness, moNoFitImprSolContinue$<$ EOT $>$::maximization, and moNoFitImprSolContinue$<$ EOT $>$::maxNumberOfIterationsWithoutImprovement.
|
||||
|
||||
\subsection{Member Data Documentation}
|
||||
\index{moNoFitImprSolContinue@{moNoFitImprSolContinue}!maximization@{maximization}}
|
||||
|
|
|
|||
|
|
@ -45,7 +45,7 @@ std::vector$<$ M $>$ {\bf vect\_\-better\_\-moves}\label{classmo_rand_impr_selec
|
|||
|
||||
One of the possible \doxyref{moMove}{p.}{classmo_move} selector (\doxyref{moMoveSelect}{p.}{classmo_move_select}).
|
||||
|
||||
All the neighbors are considered. One of them that enables an improvment of the objective function is choosen.
|
||||
All the neighbors are considered. One of them that enables an improvement of the objective function is choosen.
|
||||
|
||||
|
||||
|
||||
|
|
|
|||
|
|
@ -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 \_\-\_\-maxNumberOfIterationWithoutImprovment, bool \_\-\_\-maximization=true)
|
||||
{\bf moSteadyFitSolContinue} (unsigned int \_\-\_\-maxNumberOfIterations, unsigned int \_\-\_\-maxNumberOfIterationWithoutImprovement, bool \_\-\_\-maximization=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,9 +33,9 @@ void {\bf init} ()\label{classmo_steady_fit_sol_continue_87563493addc8e4b58982c5
|
|||
unsigned int {\bf maxNumberOfIterations}\label{classmo_steady_fit_sol_continue_36b43c2a252887ad027165ac32393fe8}
|
||||
|
||||
\begin{CompactList}\small\item\em Maximum number of iterations before considering the fitness. \item\end{CompactList}\item
|
||||
unsigned int {\bf maxNumberOfIterationsWithoutImprovment}\label{classmo_steady_fit_sol_continue_92a3ea5b6752938b159257f8c6c62580}
|
||||
unsigned int {\bf maxNumberOfIterationsWithoutImprovement}\label{classmo_steady_fit_sol_continue_cde593c09f497a5fa66ff62732544f40}
|
||||
|
||||
\begin{CompactList}\small\item\em Maximum number of iterations without improvment allowed. \item\end{CompactList}\item
|
||||
\begin{CompactList}\small\item\em Maximum number of iterations without improvement allowed. \item\end{CompactList}\item
|
||||
bool {\bf maxNumberOfIterationsReached}\label{classmo_steady_fit_sol_continue_7d88c0eb91b2a12121ba1c3ae9139887}
|
||||
|
||||
\begin{CompactList}\small\item\em Flag that indicates that the maxNumberIteration have been reached. \item\end{CompactList}\item
|
||||
|
|
@ -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 \_\-\_\-maxNumberOfIterationWithoutImprovment}, bool {\em \_\-\_\-maximization} = {\tt true})\hspace{0.3cm}{\tt [inline]}}\label{classmo_steady_fit_sol_continue_bde46266638f645d409cf1afb7190c19}
|
||||
\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}
|
||||
|
||||
|
||||
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 \_\-\_\-maxNumberOfIterationWithoutImprovment}]The number of iterations without fitness improvment 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 \_\-\_\-maximization}]Indicate if the the aim is to maximize or minimize the fitness. \end{description}
|
||||
\end{Desc}
|
||||
|
||||
|
||||
|
|
@ -103,7 +103,7 @@ 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 $>$::maxNumberOfIterationsWithoutImprovment.
|
||||
References moSteadyFitSolContinue$<$ EOT $>$::counter, moSteadyFitSolContinue$<$ EOT $>$::firstFitnessSaved, moSteadyFitSolContinue$<$ EOT $>$::fitness, moSteadyFitSolContinue$<$ EOT $>$::maximization, moSteadyFitSolContinue$<$ EOT $>$::maxNumberOfIterations, moSteadyFitSolContinue$<$ EOT $>$::maxNumberOfIterationsReached, and moSteadyFitSolContinue$<$ EOT $>$::maxNumberOfIterationsWithoutImprovement.
|
||||
|
||||
\subsection{Member Data Documentation}
|
||||
\index{moSteadyFitSolContinue@{moSteadyFitSolContinue}!maximization@{maximization}}
|
||||
|
|
|
|||
|
|
@ -10,8 +10,8 @@
|
|||
{\fancyplain{}{\bfseries\rightmark}}
|
||||
\rhead[\fancyplain{}{\bfseries\leftmark}]
|
||||
{\fancyplain{}{\bfseries\thepage}}
|
||||
\rfoot[\fancyplain{}{\bfseries\scriptsize Generated on Tue Jul 31 13:43:22 2007 for PARADISEO-MO by Doxygen }]{}
|
||||
\lfoot[]{\fancyplain{}{\bfseries\scriptsize Generated on Tue Jul 31 13:43:22 2007 for PARADISEO-MO by Doxygen }}
|
||||
\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 }}
|
||||
\cfoot{}
|
||||
\newenvironment{Code}
|
||||
{\footnotesize}
|
||||
|
|
|
|||
|
|
@ -20,7 +20,7 @@
|
|||
\vspace*{1cm}
|
||||
{\large Generated by Doxygen 1.5.2}\\
|
||||
\vspace*{0.5cm}
|
||||
{\small Tue Jul 31 13:43:22 2007}\\
|
||||
{\small Tue Jul 31 14:12:37 2007}\\
|
||||
\end{center}
|
||||
\end{titlepage}
|
||||
\clearemptydoublepage
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue