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

Tous les *VNselect compilent et marchent

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1929 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
verel 2010-08-29 13:03:23 +00:00
commit 7870d8dcfe
1 changed files with 73 additions and 72 deletions
Download patch file Download diff file Expand all files Collapse all files

129
trunk/paradiseo-mo/src/neighborhood/moRndVectorVNSelection.h
View file

@ -1,30 +1,30 @@
/* /*
<moRndVectorVNSelection.h> <moRndVectorVNSelection.h>
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010 Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
Sébastien Verel, Arnaud Liefooghe, Jérémie Humeau Sebastien Verel, Arnaud Liefooghe, Jeremie Humeau
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 ue, abiding by the rules of distribution of free software. You can ue,
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".
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,
that may mean that it is complicated to manipulate, and that also that may mean that it is complicated to manipulate, and that also
therefore means that it is reserved for developers and experienced therefore means that it is reserved for developers and experienced
professionals having in-depth computer knowledge. Users are therefore professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or 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 data to be ensured and, more generally, to use and operate it in the
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
*/ */
#ifndef _moRndVectorVNSelection_h #ifndef _moRndVectorVNSelection_h
@ -38,58 +38,59 @@ Contact: paradiseo-help@lists.gforge.inria.fr
template< class EOT > template< class EOT >
class moRndVectorVNSelection: public moVectorVNSelection<EOT>{ class moRndVectorVNSelection: public moVectorVNSelection<EOT>{
using moVectorVNSelection<EOT>::LSvector; using moVectorVNSelection<EOT>::LSvector;
using moVectorVNSelection<EOT>::shakeVector; using moVectorVNSelection<EOT>::shakeVector;
using moVectorVNSelection<EOT>::current; using moVectorVNSelection<EOT>::current;
public: public:
moRndVectorVNSelection(eoMonOp<EOT>& _firstLS, eoMonOp<EOT>& _firstShake, bool _cycle):moVectorVNSelection<EOT>(_firstLS, _firstShake), cycle(_cycle){} moRndVectorVNSelection(eoMonOp<EOT>& _firstLS, eoMonOp<EOT>& _firstShake, bool _cycle = true):moVectorVNSelection<EOT>(_firstLS, _firstShake), cycle(_cycle){}
/** /**
* Return the class id. * Return the class id.
* @return the class name as a std::string * @return the class name as a std::string
*/ */
virtual std::string className() const { virtual std::string className() const {
return "moRndVectorVNSelection"; return "moRndVectorVNSelection";
} }
/** /**
* test if there is still some neighborhood to explore * test if there is still some neighborhood to explore
* @return true if there is some neighborhood to explore * @return true if there is some neighborhood to explore
*/ */
virtual bool cont(EOT& _solution, eoMonOp<EOT>& _shake, eoMonOp<EOT>& _ls){ virtual bool cont(EOT& _solution){
return (cycle || (current <= (LSvector.size()-2))); return ( cycle || (currentOrder <= (order.size() - 2)) );
} }
/** /**
* put the current neighborhood on the first one * put the current neighborhood on the first one
*/ */
virtual void init(EOT& _solution, eoMonOp<EOT>& _shake, eoMonOp<EOT>& _ls){ virtual void init(EOT& _solution) {
if(order.size()==0){ if(order.size() == 0)
for(unsigned int i=0; i<LSvector.size(); i++) for(unsigned int i = 0; i < LSvector.size(); i++)
order.push_back(i); order.push_back(i);
}
std::random_shuffle(order.begin(), order.end(),gen); std::random_shuffle(order.begin(), order.end(), gen);
current=0;
_ls=*(LSvector[order[current]]);
_shake=*(shakeVector[order[current]]);
}
/** currentOrder = 0;
* put the current neighborhood on the next one current = order[currentOrder];
*/ }
virtual void next(EOT& _solution, eoMonOp<EOT>& _shake, eoMonOp<EOT>& _ls){
current= (current+1) % LSvector.size(); /**
_ls=*(LSvector[order[current]]); * put the current neighborhood on the next one
_shake=*(shakeVector[order[current]]); */
} virtual void next(EOT& _solution){
currentOrder = (currentOrder + 1) % order.size();
current = order[currentOrder];
}
private: private:
bool cycle; bool cycle;
std::vector<unsigned int> order; unsigned int currentOrder;
UF_random_generator<unsigned int> gen; std::vector<unsigned int> order;
UF_random_generator<unsigned int> gen;
}; };