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

Add moPopBitsNeighbor.h moPopBitsRndNeighborhood.h and problems/eval/moPopBitsEval.h which the population neighbor by flipping bit

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1909 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
verel 2010-08-24 11:51:43 +00:00
commit fd1c792eda
3 changed files with 444 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

199
trunk/paradiseo-mo/src/problems/bitString/moPopBitsNeighbor.h Normal file
View file

@ -0,0 +1,199 @@
/*
<moPopBitsNeighbor.h>
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
Sebastien Verel, Arnaud Liefooghe, Jeremie Humeau
This software is governed by the CeCILL license under French law and
abiding by the rules of distribution of free software. You can ue,
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".
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 _moPopBitsNeighbor_h
#define _moPopBitsNeighbor_h
#include <eoPop.h>
#include <problems/bitString/moPopSol.h>
#include <neighborhood/moNeighbor.h>
/**
* Bits neighbor: apply a bit flip on several solution in the set-solution
*/
template< class EOT >
class moPopBitsNeighbor : public moNeighbor<EOT>
{
public:
typedef typename EOT::SUBEOT SUBEOT ;
typedef typename SUBEOT::Fitness SUBFitness;
using moNeighbor<EOT>::fitness;
/**
* Empty Constructor
*/
moPopBitsNeighbor() : moNeighbor<EOT>() {
}
/**
* Copy Constructor
* @param _neighbor to copy
*/
moPopBitsNeighbor(const moPopBitsNeighbor<EOT>& _neighbor) {
fitness(_neighbor.fitness());
mutate.resize( _neighbor.mutate.size() );
for(unsigned int i = 0; i < mutate.size(); i++)
mutate[i] = _neighbor.mutate[i];
bits.resize( _neighbor.bits.size() );
for(unsigned int i = 0; i < bits.size(); i++)
bits[i] = _neighbor.bits[i];
fitSol.resize( _neighbor.fitSol.size() );
for(unsigned int i = 0; i < fitSol.size(); i++)
fitSol[i] = _neighbor.fitSol[i];
}
/**
* Assignment operator
* @param _neighbor the neighbor to assign
* @return a neighbor equal to the other
*/
virtual moPopBitsNeighbor<EOT>& operator=(const moPopBitsNeighbor<EOT>& _neighbor) {
fitness(_neighbor.fitness());
mutate.resize( _neighbor.mutate.size() );
for(unsigned int i = 0; i < mutate.size(); i++)
mutate[i] = _neighbor.mutate[i];
bits.resize( _neighbor.bits.size() );
for(unsigned int i = 0; i < bits.size(); i++)
bits[i] = _neighbor.bits[i];
fitSol.resize( _neighbor.fitSol.size() );
for(unsigned int i = 0; i < fitSol.size(); i++)
fitSol[i] = _neighbor.fitSol[i];
return (*this);
}
/**
* Move the solution according to the information of this neighbor
* @param _solution the solution to move
*/
virtual void move(EOT & _solution) {
if (_solution.size() > 0) {
for(unsigned i = 0; i < mutate.size(); i++)
if (mutate[i]) {
_solution[i][ bits[i] ] = !_solution[i][ bits[i] ] ;
_solution[i].fitness( fitSol[i] );
}
_solution.invalidate();
}
}
/**
* return the class name
* @return the class name as a std::string
*/
virtual std::string className() const {
return "moPopBitsNeighbor";
}
/**
* Read object.\
* Calls base class, just in case that one had something to do.
* The read and print methods should be compatible and have the same format.
* In principle, format is "plain": they just print a number
* @param _is a std::istream.
* @throw runtime_std::exception If a valid object can't be read.
*/
virtual void readFrom(std::istream& _is) {
std::string fitness_str;
int pos = _is.tellg();
_is >> fitness_str;
if (fitness_str == "INVALID") {
throw std::runtime_error("invalid fitness");
}
else {
typename EOT::Fitness repFit ;
_is.seekg(pos);
_is >> repFit;
fitness(repFit);
unsigned int s ;
_is >> s;
mutate.resize(s);
bits.resize(s);
fitSol.resize(s);
bool m;
unsigned int b;
SUBFitness f;
for(unsigned i = 0; i < s; i++) {
_is >> m;
_is >> b;
_is >> f;
mutate[i] = m;
bits[i] = b;
fitSol[i] = f;
}
}
}
/**
* Write object. Called printOn since it prints the object _on_ a stream.
* @param _os A std::ostream.
*/
virtual void printOn(std::ostream& _os) const {
_os << fitness() ;
_os << ' ' << mutate.size();
for(unsigned int i = 0; i < mutate.size(); i++)
_os << ' ' << mutate[i] << ' ' << bits[i] << ' ' << fitSol[i];
_os << std::endl;
}
// Information on the bitflip on each solution: true=bit flip
vector<bool> mutate;
// Information on the bit which is flipped
vector<unsigned int> bits;
// fitness of the mutated solutions
vector<SUBFitness> fitSol;
};
#endif

136
trunk/paradiseo-mo/src/problems/bitString/moPopBitsRndNeighborhood.h Normal file
View file

@ -0,0 +1,136 @@
/*
<moPopBitsRndNeighborhood.h>
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
Sebastien Verel, Arnaud Liefooghe, Jeremie 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 _moPopBitsRndNeighborhood_h
#define _moPopBitsRndNeighborhood_h
#include <neighborhood/moRndNeighborhood.h>
#include <utils/eoRNG.h>
/**
* A Bits neighborhood with one random bit flip on random solutions
*/
template< class Neighbor >
class moPopBitsRndNeighborhood : public moRndNeighborhood<Neighbor>
{
public:
/**
* Define type of a solution corresponding to Neighbor
*/
typedef typename Neighbor::EOT EOT;
/**
* Define type of a sub-solution which compose the population
*/
typedef typename EOT::SUBEOT SUBEOT;
/**
* Constructor
* @param _rate mutation rate
*/
moPopBitsRndNeighborhood(double _rate): moRndNeighborhood<Neighbor>(), mutationRate(_rate) {}
/**
* Test if it exist a neighbor
* @param _solution the solution to explore
* @return true if the neighborhood was not empty: the population size is at least 1
*/
virtual bool hasNeighbor(EOT& _solution) {
return _solution.size() > 0;
}
/**
* Initialization of the neighborhood:
* apply one bit flip on several solutions according to the mutation rate
* @param _solution the solution to explore (population of solutions)
* @param _neighbor the first neighbor
*/
virtual void init(EOT & _solution, Neighbor & _neighbor) {
unsigned int popSize = _solution.size();
unsigned int length = _solution[0].size();
_neighbor.mutate.resize(popSize);
_neighbor.bits.resize(popSize);
_neighbor.fitSol.resize(popSize);
for(unsigned int i = 0; i < popSize; i++) {
_neighbor.mutate[i] = rng.uniform() < mutationRate;
if (_neighbor.mutate[i])
_neighbor.bits[i] = rng.random(length);
}
}
/**
* Give the next neighbor
* apply one bit flip on several solutions according to the mutation rate
* @param _solution the solution to explore (population of solutions)
* @param _neighbor the next neighbor which is "random"
*/
virtual void next(EOT & _solution, Neighbor & _neighbor) {
unsigned int popSize = _solution.size();
unsigned int length = _solution[0].size();
for(unsigned int i = 0; i < popSize; i++) {
_neighbor.mutate[i] = rng.uniform() < mutationRate;
if (_neighbor.mutate[i])
_neighbor.bits[i] = rng.random(length);
}
}
/**
* Test if all neighbors are explored or not,if false, there is no neighbor left to explore
* @param _solution the solution to explore
* @return true if there is again a neighbor to explore: population size larger or equals than 1
*/
virtual bool cont(EOT & _solution) {
return _solution.size() > 0;
}
/**
* Return the class Name
* @return the class name as a std::string
*/
virtual std::string className() const {
return "moPopBitsRndNeighborhood";
}
private:
//mutation rate
double mutationRate;
};
#endif

109
trunk/paradiseo-mo/src/problems/eval/moPopBitsEval.h Normal file
View file

@ -0,0 +1,109 @@
/*
<moPopBitsEval.h>
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
Sebastien Verel, Arnaud Liefooghe, Jeremie 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 moPopBitsEval_H
#define moPopBitsEval_H
#include <eoFunctor.h>
#include <eval/moEval.h>
/**
* Class to compute the fitness of the solution-set after one bit flip of several solutions
*/
template<class Neighbor>
class moPopBitsEval : public moEval<Neighbor>
{
public:
typedef typename Neighbor::EOT EOT;
typedef typename Neighbor::SUBEOT SUBEOT; // type of the solution
typedef typename SUBEOT::Fitness SUBFitness; // fitness type of the solution
/**
* Default constructor
*
* @param _eval evaluation function of the solution
* @param _p exponent of the p-norm to compute the fitness of the solution-set
*/
moPopBitsEval(eoEvalFunc<SUBEOT>& _eval, unsigned int _p) : eval(_eval), p(_p) {
}
/**
* Compute the fitness of the neighbor after the bit flip mutations
*
* @param _sol the solution-set
* @param _n the neighbor which is supposed to be a "bits" neighbor
*/
void operator()(EOT& _sol, Neighbor& _n) {
double fit = 0;
for(unsigned int i = 0; i < _sol.size(); i++) {
if (_n.mutate[i]) {
// save the fitness of the solution i
SUBFitness f = _sol[i].fitness();
// modify the solution
_sol[i][ _n.bits[i] ] = !_sol[i][ _n.bits[i] ];
_sol[i].invalidate();
// evaluation of the solution
eval(_sol[i]);
// save the fitness in the neighbor
_n.fitSol[i] = _sol[i].fitness();
// compute the fitness of the solution-set
fit += pow((double) _sol[i].fitness(), (int) p);
// come back to the fitness of the initial solution
_sol[i].fitness(f);
_sol[i][ _n.bits[i] ] = !_sol[i][ _n.bits[i] ];
} else
// compute the fitness of the solution-set
fit += pow((double) _sol[i].fitness(), (int) p);
}
fit = pow((double) fit, (double)1/p);
_n.fitness(fit);
}
private:
eoEvalFunc<SUBEOT> & eval;
unsigned int p;
};
#endif