SingleObjectivization algorithms added
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1624 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
jhumeau
parent
943c3083f9
commit
cb88ff2dff
10 changed files with 1036 additions and 0 deletions
148
trunk/paradiseo-moeo/src/explorer/moeoHCMoveLoopExpl.h
Executable file
148
trunk/paradiseo-moeo/src/explorer/moeoHCMoveLoopExpl.h
Executable file
|
|
@ -0,0 +1,148 @@
|
|||
/*
|
||||
<moeoHCMoveLoopExpl.h>
|
||||
Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
|
||||
(C) OPAC Team, LIFL, 2002-2008
|
||||
|
||||
Sébastien Cahon, Jean-Charles Boisson (Jean-Charles.Boisson@lifl.fr)
|
||||
|
||||
This software is governed by the CeCILL license under French law and
|
||||
abiding by the rules of distribution of free software. You can use,
|
||||
modify and/ or redistribute the software under the terms of the CeCILL
|
||||
license as circulated by CEA, CNRS and INRIA at the following URL
|
||||
"http://www.cecill.info".
|
||||
|
||||
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
|
||||
with a limited warranty and the software's author, the holder of the
|
||||
economic rights, and the successive licensors have only limited liability.
|
||||
|
||||
In this respect, the user's attention is drawn to the risks associated
|
||||
with loading, using, modifying and/or developing or reproducing the
|
||||
software by the user in light of its specific status of free software,
|
||||
that may mean that it is complicated to manipulate, and that also
|
||||
therefore means that it is reserved for developers and experienced
|
||||
professionals having in-depth computer knowledge. Users are therefore
|
||||
encouraged to load and test the software's suitability as regards their
|
||||
requirements in conditions enabling the security of their systems and/or
|
||||
data to be ensured and, more generally, to use and operate it in the
|
||||
same conditions as regards security.
|
||||
The fact that you are presently reading this means that you have had
|
||||
knowledge of the CeCILL license and that you accept its terms.
|
||||
|
||||
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||
*/
|
||||
|
||||
#ifndef __moeoHCLoopExpl_h
|
||||
#define __moeoHCLoopExpl_h
|
||||
|
||||
#include <moMoveLoopExpl.h>
|
||||
#include <moMoveInit.h>
|
||||
#include <moNextMove.h>
|
||||
#include <moMoveIncrEval.h>
|
||||
#include <moMoveSelect.h>
|
||||
#include <moeo>
|
||||
#include <fitness/moeoIncrEvalSingleObjectivizer.h>
|
||||
/**
|
||||
move explorer for multiobjectives solutions
|
||||
*/
|
||||
template < class M >
|
||||
class moeoHCMoveLoopExpl:public moMoveLoopExpl < M >
|
||||
{
|
||||
//! Alias for the type.
|
||||
typedef typename M::EOType EOT;
|
||||
|
||||
//! Alias for the fitness.
|
||||
typedef typename M::EOType::Fitness Fitness;
|
||||
|
||||
typedef typename M::EOType::ObjectiveVector ObjectiveVector;
|
||||
|
||||
public:
|
||||
|
||||
//! Constructor.
|
||||
/*!
|
||||
All the boxes have to be specified.
|
||||
|
||||
\param _move_initializer The move initialiser.
|
||||
\param _next_move_generator The neighbourhood explorer.
|
||||
\param _incremental_evaluation (generally) Efficient evaluation function.
|
||||
\param _move_selection The move selector.
|
||||
*/
|
||||
moeoHCMoveLoopExpl (moMoveInit < M > & _move_initializer, moNextMove < M > & _next_move_generator,
|
||||
moeoIncrEvalSingleObjectivizer < EOT,M > & _incremental_evaluation, moMoveSelect < M > & _move_selection) :
|
||||
move_initializer (_move_initializer), next_move_generator (_next_move_generator),
|
||||
incremental_evaluation (_incremental_evaluation), move_selection (_move_selection)
|
||||
{}
|
||||
|
||||
//! Procedure which launches the explorer.
|
||||
/*!
|
||||
The exploration starts from an old solution and provides a new solution.
|
||||
|
||||
\param _old_solution The current solution.
|
||||
\param _new_solution The new solution (result of the procedure).
|
||||
*/
|
||||
void operator () (const EOT & _old_solution, EOT & _new_solution)
|
||||
{
|
||||
M move, best_move;
|
||||
Fitness best_fitness;
|
||||
bool has_next_move, selection_update_is_ok;
|
||||
|
||||
if( _old_solution.invalid() )
|
||||
{
|
||||
throw std::runtime_error("[moHCMoveLoopExpl.h]: The current solution has not been evaluated.");
|
||||
}
|
||||
|
||||
/*
|
||||
The two following lines are added to avoid compilation warning.
|
||||
<=> current best move fitness is the current fitness.
|
||||
<=> move and best move are empty for the moment.
|
||||
*/
|
||||
best_fitness=_old_solution.fitness();
|
||||
move=best_move;
|
||||
//At the begining, the new sol is equivalent to the old one.
|
||||
_new_solution=(EOT)_old_solution;
|
||||
|
||||
// Restarting the exploration of the neighbourhood
|
||||
move_initializer(move, _old_solution);
|
||||
|
||||
move_selection.init(_old_solution.fitness ());
|
||||
|
||||
do
|
||||
{
|
||||
selection_update_is_ok = move_selection.update (move, incremental_evaluation(move, _old_solution) );
|
||||
has_next_move = next_move_generator (move, _old_solution);
|
||||
}
|
||||
while ( selection_update_is_ok && has_next_move);
|
||||
//The selecter gives the value of the best move and the corresponding best fitness.
|
||||
move_selection (best_move, best_fitness);
|
||||
|
||||
/*std::cout<<"bonjour moeoloopexpl"<<std::endl;
|
||||
for (unsigned i=0;i<6;i++){
|
||||
std::cout<<"move"<<best_move[i]<<std::endl;
|
||||
} */
|
||||
//The best move is applied on the new solution.
|
||||
best_move(_new_solution);
|
||||
|
||||
//fitness and objective are set.
|
||||
_new_solution.fitness(best_fitness);
|
||||
_new_solution.objectiveVector(incremental_evaluation.incr_obj(best_move, _old_solution));
|
||||
//we make a full eval
|
||||
// incremental_evaluation(_new_solution);
|
||||
}
|
||||
|
||||
private:
|
||||
|
||||
//! Move initialiser.
|
||||
moMoveInit < M > & move_initializer;
|
||||
|
||||
//! Neighborhood explorer.
|
||||
moNextMove < M > & next_move_generator;
|
||||
|
||||
//! (generally) Efficient evaluation.
|
||||
moeoIncrEvalSingleObjectivizer < EOT,M > & incremental_evaluation;
|
||||
|
||||
//! Move selector.
|
||||
moMoveSelect < M > & move_selection;
|
||||
};
|
||||
|
||||
#endif
|
||||
175
trunk/paradiseo-moeo/src/explorer/moeoTSMoveLoopExpl.h
Executable file
175
trunk/paradiseo-moeo/src/explorer/moeoTSMoveLoopExpl.h
Executable file
|
|
@ -0,0 +1,175 @@
|
|||
/*
|
||||
<moeoTSMoveLoopExpl.h>
|
||||
Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
|
||||
(C) OPAC Team, LIFL, 2002-2008
|
||||
|
||||
Sébastien Cahon, Jean-Charles Boisson (Jean-Charles.Boisson@lifl.fr)
|
||||
|
||||
This software is governed by the CeCILL license under French law and
|
||||
abiding by the rules of distribution of free software. You can use,
|
||||
modify and/ or redistribute the software under the terms of the CeCILL
|
||||
license as circulated by CEA, CNRS and INRIA at the following URL
|
||||
"http://www.cecill.info".
|
||||
|
||||
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
|
||||
with a limited warranty and the software's author, the holder of the
|
||||
economic rights, and the successive licensors have only limited liability.
|
||||
|
||||
In this respect, the user's attention is drawn to the risks associated
|
||||
with loading, using, modifying and/or developing or reproducing the
|
||||
software by the user in light of its specific status of free software,
|
||||
that may mean that it is complicated to manipulate, and that also
|
||||
therefore means that it is reserved for developers and experienced
|
||||
professionals having in-depth computer knowledge. Users are therefore
|
||||
encouraged to load and test the software's suitability as regards their
|
||||
requirements in conditions enabling the security of their systems and/or
|
||||
data to be ensured and, more generally, to use and operate it in the
|
||||
same conditions as regards security.
|
||||
The fact that you are presently reading this means that you have had
|
||||
knowledge of the CeCILL license and that you accept its terms.
|
||||
|
||||
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||
*/
|
||||
|
||||
#ifndef _moeoTSMoveLoopExpl_h
|
||||
#define _moeoTSMoveLoopExpl_h
|
||||
#include <mo>
|
||||
#include <moMoveLoopExpl.h>
|
||||
#include <moMoveInit.h>
|
||||
#include <moNextMove.h>
|
||||
#include <moMoveIncrEval.h>
|
||||
#include <moMoveSelect.h>
|
||||
#include <moTabuList.h>
|
||||
#include <moAspirCrit.h>
|
||||
#include <moBestImprSelect.h>
|
||||
|
||||
|
||||
|
||||
template <class M>
|
||||
class moeoTSMoveLoopExpl:public moMoveLoopExpl < M >
|
||||
{
|
||||
//!Alias for the type
|
||||
typedef typename M::EOType EOT;
|
||||
|
||||
//!Alias for the fitness
|
||||
typedef typename M::EOType::Fitness Fitness;
|
||||
|
||||
public:
|
||||
|
||||
//!Constructor
|
||||
/*!
|
||||
\param _move_initializer The move initializer.
|
||||
\param _next_move_generator The neighbourhood explorer.
|
||||
\param _incremental_evaluation A (generally) efficient evaluation.
|
||||
\param _tabu_list The tabu list.
|
||||
\param _aspiration_criterion An aspiration criterion.
|
||||
*/
|
||||
moeoTSMoveLoopExpl (moMoveInit < M > & _move_initializer, moNextMove < M > & _next_move_generator, moeoIncrEvalSingleObjectivizer < EOT, M > & _incremental_evaluation, moTabuList < M > & _tabu_list, moAspirCrit < M > & _aspiration_criterion):
|
||||
move_initializer(_move_initializer),
|
||||
next_move_generator(_next_move_generator),
|
||||
incremental_evaluation(_incremental_evaluation),
|
||||
tabu_list(_tabu_list),
|
||||
aspiration_criterion(_aspiration_criterion)
|
||||
{
|
||||
tabu_list.init ();
|
||||
aspiration_criterion.init ();
|
||||
}
|
||||
//!Procedure which lauches the exploration
|
||||
/*!
|
||||
The exploration continues while the chosen move is not in the tabu list
|
||||
or the aspiration criterion is true. If these 2 conditions are not true, the
|
||||
exploration stops if the move selector update function returns false.
|
||||
|
||||
\param _old_solution the initial solution
|
||||
\param _new_solution the new solution
|
||||
*/
|
||||
void operator () (const EOT & _old_solution, EOT & _new_solution)
|
||||
{
|
||||
M move, best_move;
|
||||
Fitness fitness, best_move_fitness;
|
||||
|
||||
bool move_is_tabu, aspiration_criterion_is_verified, selection_update_is_ok, has_next_move;
|
||||
|
||||
if( _old_solution.invalidFitness() || _old_solution.invalid() )
|
||||
{
|
||||
throw std::runtime_error("[moTSMoveLoopExpl.h]: The current solution has not been evaluated.");
|
||||
}
|
||||
|
||||
//At the begining, the new solution is equivalent to the old one.
|
||||
_new_solution=(EOT)_old_solution;
|
||||
// EOT mem(_old_solution);
|
||||
|
||||
|
||||
// Restarting the exploration of of the neighborhood !
|
||||
move_initializer (move, _old_solution);
|
||||
|
||||
move_selection.init( _old_solution.fitness() );
|
||||
|
||||
selection_update_is_ok=true;
|
||||
// std::cout<<"moeoTS lets go"<<std::cout;
|
||||
do
|
||||
{
|
||||
fitness = incremental_evaluation(move, _old_solution);
|
||||
// std::cout<<"fit: "<<fitness<<std::endl;
|
||||
|
||||
move_is_tabu = tabu_list(move, _old_solution);
|
||||
|
||||
aspiration_criterion_is_verified = aspiration_criterion(move, fitness);
|
||||
|
||||
if( !move_is_tabu || aspiration_criterion_is_verified )
|
||||
{
|
||||
selection_update_is_ok = move_selection.update(move, fitness);
|
||||
}
|
||||
|
||||
has_next_move = next_move_generator(move, _old_solution);
|
||||
}
|
||||
while( has_next_move && selection_update_is_ok );
|
||||
// std::cout<<"moeoTS before select"<<std::cout;
|
||||
|
||||
move_selection(best_move, best_move_fitness);
|
||||
typename EOT::ObjectiveVector best_obj=incremental_evaluation.incr_obj(best_move,_new_solution);
|
||||
|
||||
//std::cout<<"moeo explo apply move "<<std::endl;
|
||||
// Apply the best move.
|
||||
best_move(_new_solution);
|
||||
|
||||
// The fitness is set to avoid an additionnal fitness computation.
|
||||
// std::cout<<"moeo explo apply fit"<<std::endl;
|
||||
_new_solution.fitness(best_move_fitness);
|
||||
// std::cout<<"moeo explo apply obj"<<std::endl;
|
||||
_new_solution.objectiveVector(best_obj);
|
||||
// std::cout<<"moeo explo apply obj OK"<<std::endl;
|
||||
// incremental_evaluation(_new_solution);
|
||||
|
||||
// Removing moves that are no more tabu.
|
||||
tabu_list.update ();
|
||||
|
||||
// Updating the tabu list
|
||||
tabu_list.add(best_move, _new_solution);
|
||||
//std::cout<<"moeo end "<<std::endl;
|
||||
}
|
||||
|
||||
private:
|
||||
|
||||
//! Move initialisation
|
||||
moMoveInit < M > & move_initializer;
|
||||
|
||||
//! Neighborhood explorer
|
||||
moNextMove < M > & next_move_generator;
|
||||
|
||||
//! Efficient evaluation
|
||||
moeoIncrEvalSingleObjectivizer < EOT,M > & incremental_evaluation;
|
||||
|
||||
//! Move selector
|
||||
moBestImprSelect < M > move_selection;
|
||||
|
||||
//! Tabu list
|
||||
moTabuList < M > & tabu_list;
|
||||
|
||||
//! Aspiration criterion
|
||||
moAspirCrit < M > & aspiration_criterion;
|
||||
};
|
||||
|
||||
#endif
|
||||
Loading…
Add table
Add a link
Reference in a new issue