From b0a8a5a6c2a8d220c866a803d59744e5370849af Mon Sep 17 00:00:00 2001 From: jhumeau Date: Wed, 3 Feb 2010 17:01:31 +0000 Subject: [PATCH] Taboo Explorer -> reste a voir ce qu'on fait avec le bestsofar git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1678 331e1502-861f-0410-8da2-ba01fb791d7f --- branches/newMo/src/explorer/moTSExplorer.h | 247 +++++++++++++++++++++ 1 file changed, 247 insertions(+) create mode 100644 branches/newMo/src/explorer/moTSExplorer.h diff --git a/branches/newMo/src/explorer/moTSExplorer.h b/branches/newMo/src/explorer/moTSExplorer.h new file mode 100644 index 000000000..adec8cc25 --- /dev/null +++ b/branches/newMo/src/explorer/moTSExplorer.h @@ -0,0 +1,247 @@ +/* + + Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010 + + Sébastien Verel, Arnaud Liefooghe, Jérémie Humeau + + 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 _moTSExplorer_h +#define _moTSExplorer_h + +#include +#include +#include +#include +#include + +/** + * Explorer for a Tabu Search + */ +template< class Neighborhood > +class moTSExplorer : public moNeighborhoodExplorer +{ +public: + typedef typename Neighborhood::EOT EOT ; + typedef typename Neighborhood::Neighbor Neighbor ; + + /** + * Constructor + * @param _neighborhood the neighborhood + * @param _eval the evaluation function + * @param _neighborComparator a neighbor comparator + * @param _solNeighborComparator a comparator between a solution and a neighbor + * @param _tabuList the tabu list + * @param _intensification the intensification box + * @param _diversification the diversification box + * @param _aspiration the aspiration criteria + */ + moTSExplorer(Neighborhood& _neighborhood, + moEval& _eval, + moNeighborComparator& _neighborComparator, + moSolNeighborComparator& _solNeighborComparator, + moTabuList & _tabuList, + moIntensification & _intensification, + moDiversification & _diversification, + moAspiration & _aspiration + ) : + moNeighborhoodExplorer(_neighborhood, _eval), neighborComparator(_neighborComparator), solNeighborComparator(_solNeighborComparator), + tabuList(_tabuList), intensification(_intensification), diversification(_diversification), aspiration(_aspiration) + { + isAccept = false; + current=new Neighbor(); + best=new Neighbor(); + } + + /** + * Destructor + */ + ~moTSExplorer(){ + delete current; + delete best; + } + + /** + * init tabu list, intensification box, diversification box and aspiration criteria + * @param _solution + */ + virtual void initParam(EOT& _solution) + { + tabuList.init(_solution); + intensification.init(_solution); + diversification.init(_solution); + aspiration.init(_solution); + }; + + + /** + * update params of tabu list, intensification box, diversification box and aspiration criteria + * @param _solution + */ + virtual void updateParam(EOT& _solution) + { + if ((*this).moveApplied()) + { + tabuList.add(_solution, *best); + intensification.add(_solution, *best); + diversification.add(_solution, *best); + //bestSoFar = ???; + } + tabuList.update(_solution, *best); + intensification.update(_solution, *best); + diversification.update(_solution, *best); + aspiration.update(_solution, *best); + }; + + + /** + * + */ + virtual void terminate(EOT & solution) + { + //solution = bestSoFar; + }; + + + /** + * Explore the neighborhood of a solution + * @param _solution + */ + virtual void operator()(EOT & _solution) + { + intensification(_solution); + diversification(_solution); + if(neighborhood.hasNeighbor(_solution)) + { + //init the current neighbor + neighborhood.init(_solution, *current); + //eval the current neighbor + eval(_solution, *current); + + //Find the first non-tabu element + if ( (!tabuList.check(_solution, *current)) || aspiration(_solution, *current) ){ + // set best + (*best)= (*current); + found=true; + } + while(neighborhood.cont(_solution) && !found){ + //next neighbor + neighborhood.next(_solution, (*current)); + //eval + eval(_solution, (*current)); + + if ( (!tabuList.check(_solution, *current)) || aspiration(_solution, *current) ){ + // set best + (*best)=(*current); + found=true; + } + } + //Explore the neighborhood + if(found){ + isAccept=true; + while(neighborhood.cont(_solution)){ + //next neighbor + neighborhood.next(_solution, (*current)); + //eval + eval(_solution, (*current)); + //check if the current is better than the best and is not tabu or if it is aspirat (by the aspiration criteria of course) + if ( (!tabuList.check(_solution, *current) && neighborComparator((*best),(*current))) || aspiration(_solution, *current) ){ + // set best + (*best)=(*current); + } + } + } + else{ + isAccept=false; + } + } + else{ + isAccept=false; + } + }; + + + /** + * always continue + * @param _solution the solution + * @return true + */ + virtual bool isContinue(EOT & _solution){ + return true; + }; + + + /** + * move the solution with the best neighbor + * @param _solution the solution to move + */ + virtual void move(EOT & _solution) { + //move the solution + best->move(_solution); + //update its fitness + _solution.fitness(best->fitness()); + }; + + + /** + * accept test if an ameliorated neighbor was be found + * @param _solution the solution + * @return true if the best neighbor ameliorate the fitness + */ + virtual bool accept(EOT & _solution){ + return isAccept; + }; + + + +protected: + + using moNeighborhoodExplorer::neighborhood; + using moNeighborhoodExplorer::eval; + + // comparator between solution and neighbor or between neighbors + moNeighborComparator& neighborComparator; + moSolNeighborComparator& solNeighborComparator; + + // Tabu components + moTabuList & tabuList; + moIntensification & intensification; + moDiversification & diversification; + moAspiration & aspiration; + + Neighbor* best; + Neighbor* current; + + // true if the move is accepted + bool isAccept ; + +}; + + +#endif