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

add new dummy neighbor : XCHangeNeighborDummy

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2304 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
boufaras 2011-07-08 12:42:47 +00:00
commit 6c5a1b4e81
1 changed files with 179 additions and 129 deletions
Download patch file Download diff file Expand all files Collapse all files

370
trunk/paradiseo-mo/test/moTestClass.h
View file

@ -1,36 +1,36 @@
/* /*
<moTestClass.h> <moTestClass.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 Sébastien Verel, Arnaud Liefooghe, Jérémie 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 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,
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 _moTestClass_h #ifndef _moTestClass_h
#define _moTestClass_h #define _moTestClass_h
@ -53,171 +53,221 @@
#include <utils/eoUpdater.h> #include <utils/eoUpdater.h>
#include <eoInit.h> #include <eoInit.h>
#include <neighborhood/moXChangeNeighbor.h>
typedef eoBit<eoMinimizingFitness> bitVector; typedef eoBit<eoMinimizingFitness> bitVector;
typedef moBitNeighbor<eoMinimizingFitness> bitNeighbor; typedef moBitNeighbor<eoMinimizingFitness> bitNeighbor;
class moDummyRndNeighborhood: public moOrderNeighborhood<bitNeighbor>, public moRndNeighborhood<bitNeighbor> { class moDummyRndNeighborhood: public moOrderNeighborhood<bitNeighbor> ,
public moRndNeighborhood<bitNeighbor> {
public: public:
moDummyRndNeighborhood(unsigned int a): moOrderNeighborhood<bitNeighbor>(a) {} moDummyRndNeighborhood(unsigned int a) :
moOrderNeighborhood<bitNeighbor> (a) {
}
}; };
typedef moDummyRndNeighborhood bitNeighborhood ; typedef moDummyRndNeighborhood bitNeighborhood;
typedef EO<int> Solution; typedef EO<int> Solution;
class moDummyNeighborTest : public moNeighbor<Solution> { class moDummyNeighborTest: public moNeighbor<Solution> {
public: public:
virtual void move(Solution & _solution) {} virtual void move(Solution & _solution) {
}
}; };
class moDummyBackableNeighbor : public moBackableNeighbor<Solution> { class moDummyBackableNeighbor: public moBackableNeighbor<Solution> {
public: public:
virtual void move(Solution & _solution) {} virtual void move(Solution & _solution) {
virtual void moveBack(Solution & _solution) {} }
virtual void moveBack(Solution & _solution) {
}
}; };
class moDummyNeighborhoodTest : public moNeighborhood<moDummyNeighborTest> { template < class EOT>
class XChangeNeighborDummy: public moXChangeNeighbor<EOT> {
public: public:
typedef moDummyNeighborTest Neighbor;
moDummyNeighborhoodTest():i(0),j(0) {} XChangeNeighborDummy() :
moXChangeNeighbor<EOT> () {
virtual bool hasNeighbor(EOT & _solution) { }
bool res;
if (i%3==0 || i==1) /**
res=false; * Constructor
else * @param _xChange the number of x-change to do
res=true; */
i++;
return res; XChangeNeighborDummy(unsigned int _xChange) :
} moXChangeNeighbor<EOT> (_xChange) {
virtual void init(EOT & _solution, Neighbor & _current) {} }
virtual void next(EOT & _solution, Neighbor & _current) {} /**
virtual bool cont(EOT & _solution) { * Move a solution
j++; * @param _solution the related solution
return (j%10!=0); */
} void move(EOT & _solution) {
}
};
class moDummyNeighborhoodTest: public moNeighborhood<moDummyNeighborTest> {
public:
typedef moDummyNeighborTest Neighbor;
moDummyNeighborhoodTest() :
i(0), j(0) {
}
virtual bool hasNeighbor(EOT & _solution) {
bool res;
if (i % 3 == 0 || i == 1)
res = false;
else
res = true;
i++;
return res;
}
virtual void init(EOT & _solution, Neighbor & _current) {
}
virtual void next(EOT & _solution, Neighbor & _current) {
}
virtual bool cont(EOT & _solution) {
j++;
return (j % 10 != 0);
}
private: private:
int i,j; int i, j;
}; };
class moDummyEvalTest: public eoEvalFunc<Solution> { class moDummyEvalTest: public eoEvalFunc<Solution> {
public: public:
void operator()(Solution& _sol) { void operator()(Solution& _sol) {
if (_sol.invalid()) if (_sol.invalid())
_sol.fitness(100); _sol.fitness(100);
else else
_sol.fitness(_sol.fitness()+50); _sol.fitness(_sol.fitness() + 50);
}
};
class evalOneMax : public moEval< bitNeighbor >
{
private:
unsigned size;
public:
evalOneMax(unsigned _size) : size(_size) {};
~evalOneMax(void) {} ;
void operator() (bitVector& _sol, bitNeighbor& _n) {
unsigned int fit = _sol.fitness();
if (_sol[_n.index()])
fit--;
else
fit++;
_n.fitness(fit);
}
};
class dummyEvalOneMax : public moEval< bitNeighbor >
{
private:
unsigned size;
public:
dummyEvalOneMax(unsigned _size) : size(_size) {};
~dummyEvalOneMax(void) {} ;
void operator() (bitVector& _sol, bitNeighbor& _n) {
unsigned int fit = _sol.fitness();
_n.fitness(fit);
}
};
class monitor1 : public eoMonitor
{
public:
monitor1(unsigned int& _a): a(_a) {}
eoMonitor& operator()() {
a++;
return *this;
}
void lastCall() {
a++;
}
private:
unsigned int& a;
};
class monitor2 : public eoMonitor
{
public:
monitor2(unsigned int& _a): a(_a) {}
eoMonitor& operator()() {
a++;
return *this;
}
void lastCall() {
a++;
}
private:
unsigned int& a;
};
class updater1: public eoUpdater
{
public:
updater1(unsigned int& _a): a(_a) {}
void operator()() {
a++;
}
void lastCall() {
a++;
}
private:
unsigned int& a;
};
class dummyInit: public eoInit<bitVector>{
public:
void operator()(bitVector& sol){
} }
}; };
class dummyInit2: public eoInit<bitVector>{ class evalOneMax: public moEval<bitNeighbor> {
private:
unsigned size;
public: public:
dummyInit2(unsigned int _size):size(_size){} evalOneMax(unsigned _size) :
size(_size) {
}
;
void operator()(bitVector& sol){ ~evalOneMax(void) {
}
;
void operator()(bitVector& _sol, bitNeighbor& _n) {
unsigned int fit = _sol.fitness();
if (_sol[_n.index()])
fit--;
else
fit++;
_n.fitness(fit);
}
};
class dummyEvalOneMax: public moEval<bitNeighbor> {
private:
unsigned size;
public:
dummyEvalOneMax(unsigned _size) :
size(_size) {
}
;
~dummyEvalOneMax(void) {
}
;
void operator()(bitVector& _sol, bitNeighbor& _n) {
unsigned int fit = _sol.fitness();
_n.fitness(fit);
}
};
class monitor1: public eoMonitor {
public:
monitor1(unsigned int& _a) :
a(_a) {
}
eoMonitor& operator()() {
a++;
return *this;
}
void lastCall() {
a++;
}
private:
unsigned int& a;
};
class monitor2: public eoMonitor {
public:
monitor2(unsigned int& _a) :
a(_a) {
}
eoMonitor& operator()() {
a++;
return *this;
}
void lastCall() {
a++;
}
private:
unsigned int& a;
};
class updater1: public eoUpdater {
public:
updater1(unsigned int& _a) :
a(_a) {
}
void operator()() {
a++;
}
void lastCall() {
a++;
}
private:
unsigned int& a;
};
class dummyInit: public eoInit<bitVector> {
public:
void operator()(bitVector& sol) {
}
};
class dummyInit2: public eoInit<bitVector> {
public:
dummyInit2(unsigned int _size) :
size(_size) {
}
void operator()(bitVector& sol) {
sol.resize(0); sol.resize(0);
for(unsigned int i=0; i< size; i++) for (unsigned int i = 0; i < size; i++)
sol.push_back(true); sol.push_back(true);
} }