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

git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1346 331e1502-861f-0410-8da2-ba01fb791d7f

Browse source
This commit is contained in:
jhumeau 2009-01-16 13:25:30 +00:00
commit aa8109322c
1 changed files with 20 additions and 20 deletions
Download patch file Download diff file Expand all files Collapse all files

40
trunk/paradiseo-mo/src/moTS.h
View file

@ -2,20 +2,20 @@
<moTS.h> <moTS.h>
Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008 Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
(C) OPAC Team, LIFL, 2002-2008 (C) OPAC Team, LIFL, 2002-2008
Sébastien Cahon, Jean-Charles Boisson (Jean-Charles.Boisson@lifl.fr) Sébastien Cahon, Jean-Charles Boisson (Jean-Charles.Boisson@lifl.fr)
This software is governed by the CeCILL license under French law and This software is governed by the CeCILL license under French law and
abiding by the rules of distribution of free software. You can use, abiding by the rules of distribution of free software. You can use,
modify and/ or redistribute the software under the terms of the CeCILL modify and/ or redistribute the software under the terms of the CeCILL
license as circulated by CEA, CNRS and INRIA at the following URL license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info". "http://www.cecill.info".
As a counterpart to the access to the source code and rights to copy, As a counterpart to the access to the source code and rights to copy,
modify and redistribute granted by the license, users are provided only modify and redistribute granted by the license, users are provided only
with a limited warranty and the software's author, the holder of the with a limited warranty and the software's author, the holder of the
economic rights, and the successive licensors have only limited liability. economic rights, and the successive licensors have only limited liability.
In this respect, the user's attention is drawn to the risks associated In this respect, the user's attention is drawn to the risks associated
with loading, using, modifying and/or developing or reproducing the with loading, using, modifying and/or developing or reproducing the
software by the user in light of its specific status of free software, software by the user in light of its specific status of free software,
@ -28,7 +28,7 @@
same conditions as regards security. same conditions as regards security.
The fact that you are presently reading this means that you have had The fact that you are presently reading this means that you have had
knowledge of the CeCILL license and that you accept its terms. knowledge of the CeCILL license and that you accept its terms.
ParadisEO WebSite : http://paradiseo.gforge.inria.fr ParadisEO WebSite : http://paradiseo.gforge.inria.fr
Contact: paradiseo-help@lists.gforge.inria.fr Contact: paradiseo-help@lists.gforge.inria.fr
*/ */
@ -54,9 +54,9 @@ class moTS:public moAlgo < typename M::EOType >
//!Alias for the fitness //!Alias for the fitness
typedef typename EOT::Fitness Fitness; typedef typename EOT::Fitness Fitness;
public: public:
//!Constructor of a moTS specifying all the boxes //!Constructor of a moTS specifying all the boxes
/*! /*!
In this constructor, a moTSMoveLoopExpl is instanciated. In this constructor, a moTSMoveLoopExpl is instanciated.
@ -69,15 +69,15 @@ class moTS:public moAlgo < typename M::EOType >
\param _continue The stopping criterion. \param _continue The stopping criterion.
\param _full_evaluation A full evaluation function. \param _full_evaluation A full evaluation function.
*/ */
moTS (moMoveInit < M > & _move_initializer, moNextMove < M > & _next_move_generator, moTS (moMoveInit < M > & _move_initializer, moNextMove < M > & _next_move_generator,
moMoveIncrEval < M > & _incremental_evaluation, moTabuList < M > & _tabu_list, moMoveIncrEval < M > & _incremental_evaluation, moTabuList < M > & _tabu_list,
moAspirCrit < M > & _aspiration_criterion, moSolContinue < EOT > & _continue, moAspirCrit < M > & _aspiration_criterion, moSolContinue < EOT > & _continue,
eoEvalFunc < EOT > & _full_evaluation): eoEvalFunc < EOT > & _full_evaluation):
move_explorer (new moTSMoveLoopExpl < M >(_move_initializer, _next_move_generator, _incremental_evaluation, move_explorer (new moTSMoveLoopExpl < M >(_move_initializer, _next_move_generator, _incremental_evaluation,
_tabu_list,_aspiration_criterion) ), _tabu_list,_aspiration_criterion) ),
continu (_continue), full_evaluation (_full_evaluation), move_explorer_memory_allocation(true) continu (_continue), full_evaluation (_full_evaluation), move_explorer_memory_allocation(true)
{} {}
//! Constructor with less parameters //! Constructor with less parameters
/*! /*!
The explorer is given in the parameters. The explorer is given in the parameters.
@ -98,44 +98,44 @@ class moTS:public moAlgo < typename M::EOType >
delete(move_explorer); delete(move_explorer);
} }
} }
//! Function which launchs the Tabu Search //! Function which launchs the Tabu Search
/*! /*!
Algorithm of the tabu search. Algorithm of the tabu search.
As a moSA or a moHC, it can be used for HYBRIDATION in an evolutionary algorithm. As a moSA or a moHC, it can be used for HYBRIDATION in an evolutionary algorithm.
For security a lock (pthread_mutex_t) is closed during the algorithm. For security a lock (pthread_mutex_t) is closed during the algorithm.
\param _solution a solution to improve. \param _solution a solution to improve.
\return TRUE. \return TRUE.
*/ */
bool operator ()(EOT & _solution) bool operator ()(EOT & _solution)
{ {
M move; M move;
EOT best_solution, new_solution; EOT best_solution, new_solution;
if ( _solution.invalid () ) if ( _solution.invalid () )
{ {
full_evaluation (_solution); full_evaluation (_solution);
} }
best_solution=_solution; best_solution=_solution;
// code used for avoiding warning because new_solution is indirectly initialized by move_expl. // code used for avoiding warning because new_solution is indirectly initialized by move_expl.
new_solution=_solution; new_solution=_solution;
continu.init (); continu.init ();
do do
{ {
(*move_explorer) (_solution, new_solution); (*move_explorer) (_solution, new_solution);
// Updating the best solution found until now ? // Updating the best solution found until now ?
if (new_solution.fitness() > best_solution.fitness()) if (new_solution.fitness() > best_solution.fitness())
{ {
best_solution = new_solution; best_solution = new_solution;
} }
_solution = new_solution; _solution = new_solution;
} }
while ( continu (_solution) ); while ( continu (_solution) );