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

Migration from SVN

Browse source
This commit is contained in:
quemy 2012-08-30 11:30:11 +02:00
commit 8cd56f37db
29069 changed files with 0 additions and 4096888 deletions
Download patch file Download diff file Expand all files Collapse all files

111
mo/src/problems/bitString/moBitNeighbor.h Normal file
View file

@ -0,0 +1,111 @@
/*
<moBitNeighbor.h>
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 _bitNeighbor_h
#define _bitNeighbor_h
#include <ga/eoBit.h>
#include <neighborhood/moBackableNeighbor.h>
#include <neighborhood/moIndexNeighbor.h>
/**
* Neighbor related to a vector of Bit
*/
template< class Fitness >
class moBitNeighbor : public moBackableNeighbor<eoBit<Fitness> >, public moIndexNeighbor<eoBit<Fitness> >
{
public:
typedef eoBit<Fitness> EOT;
using moBackableNeighbor<EOT>::fitness;
using moIndexNeighbor<EOT>::key;
/**
* move the solution
* @param _solution the solution to move
*/
virtual void move(EOT & _solution) {
_solution[key] = !_solution[key];
_solution.invalidate();
}
/**
* move back the solution (useful for the evaluation by modif)
* @param _solution the solution to move back
*/
virtual void moveBack(EOT & _solution) {
move(_solution);
}
/**
* return the class name
* @return the class name as a std::string
*/
virtual std::string className() const {
return "moBitNeighbor";
}
/**
* 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 {
Fitness repFit;
_is.seekg(pos);
_is >> repFit;
_is >> key;
fitness(repFit);
}
}
/**
* 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() << ' ' << key << std::endl;
}
};
#endif

149
mo/src/problems/bitString/moBitsNeighbor.h Normal file
View file

@ -0,0 +1,149 @@
/*
<moBitsNeighbor.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 _moBitsNeighbor_h
#define _moBitsNeighbor_h
#include <neighborhood/moNeighbor.h>
#include <vector>
/**
* Neighbor to flip several bits
* of a solution of type eoBit
*/
template< class EOT, class Fitness=typename EOT::Fitness >
class moBitsNeighbor : virtual public moNeighbor<EOT, Fitness>, public moBackableNeighbor<EOT>
{
public:
// position of bits which are flipped
std::vector<unsigned int> bits;
// number of bits to flip
unsigned int nBits;
/**
* Default Constructor
*/
moBitsNeighbor() : moNeighbor<EOT, Fitness>() {}
/**
* Copy Constructor
* @param _source the neighbor to copy
*/
moBitsNeighbor(const moBitsNeighbor& _source) : moNeighbor<EOT, Fitness>(_source) {
bits.resize(_source.bits.size());
nBits = _source.nBits;
for(unsigned i = 0; i < bits.size(); i++)
this->bits[i] = _source.bits[i] ;
}
/**
* Assignment operator
* @param _source the source neighbor
*/
moBitsNeighbor<EOT, Fitness> & operator=(const moBitsNeighbor<EOT, Fitness> & _source) {
moNeighbor<EOT, Fitness>::operator=(_source);
if (bits.size() != _source.bits.size())
bits.resize(_source.bits.size());
nBits = _source.nBits;
for(unsigned i = 0; i < bits.size(); i++)
this->bits[i] = _source.bits[i] ;
return *this ;
}
/**
* Return the class Name
* @return the class name as a std::string
*/
virtual std::string className() const {
return "moBitsNeighbor";
}
/**
* flipped the bits according to the bits vector
* @param _solution the solution to move
*/
virtual void move(EOT& _solution) {
for(unsigned i = 0; i < nBits; i++)
_solution[ this->bits[i] ] = !_solution[ this->bits[i] ];
}
/**
* flipped the bits according to the bits vector
* @param _solution the solution to move back
*/
virtual void moveBack(EOT& _solution) {
for(unsigned i = 0; i < nBits; i++)
_solution[ this->bits[i] ] = !_solution[ this->bits[i] ];
}
/**
* @param _neighbor a neighbor
* @return if _neighbor and this one are equals
*/
virtual bool equals(moBitsNeighbor<EOT,Fitness> & _neighbor) {
if (nBits != _neighbor.nBits)
return false;
else {
unsigned int i = 0;
while ((i < nBits) && (bits[i] == _neighbor.bits[i])) i++;
if (i < nBits)
return false;
else
return true;
}
}
/**
* 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 << this->fitness() << " " << nBits ;
for(unsigned int i = 0; i < nBits; i++)
_os << " " << bits[i] ;
}
};
#endif

125
mo/src/problems/bitString/moBitsNeighborhood.h Normal file
View file

@ -0,0 +1,125 @@
/*
<moBitsNeighborhood.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 _moBitsNeighborhood_h
#define _moBitsNeighborhood_h
#include <neighborhood/moNeighborhood.h>
#include <utils/eoRNG.h>
#include <vector>
/**
* A neighborhood for bit string solutions
* where several bits could be flipped
* in a given Hamming distance
*/
template< class Neighbor >
class moBitsNeighborhood : public moNeighborhood<Neighbor>
{
public:
/**
* Define type of a solution corresponding to Neighbor
*/
typedef typename Neighbor::EOT EOT;
/**
* Constructor
* @param _length bit string length
* @param _nBits maximum number of bits to flip (radius of the neighborhood)
* @param _exactDistance when true, only neighbor with exactly k bits flip are considered, other neighbor <= Hamming distance k
*/
moBitsNeighborhood(unsigned _length, unsigned _nBits, bool _exactDistance = false): moNeighborhood<Neighbor>(), length(_length), nBits(_nBits) {
// neighborhood size :
// for distance == nBits : length \choose nBits = length! / ( (length - nBits)! * nBits!)
// for distance <= nBits : sum of previous distances
if (_exactDistance) {
neighborhoodSize = numberOfNeighbors(nBits);
} else {
neighborhoodSize = 0;
for(int d = 1; d <= nBits; d++)
neighborhoodSize += numberOfNeighbors(d);
}
}
/**
* Number fo neighbors at Hamming distance d
*
* @param d Hamming distance
*/
unsigned int numberOfNeighbors(unsigned d) {
unsigned int fact_nBits = 1;
for(unsigned k = 1; k <= d; k++)
fact_nBits *= k;
unsigned int fact_length = 1;
for(unsigned k = length; k > length - d; k--)
fact_length *= k;
return fact_length / fact_nBits;
}
/**
* Test if it exist a neighbor
* @param _solution the solution to explore
* @return true if the neighborhood was not empty (bit string larger than 0)
*/
virtual bool hasNeighbor(EOT& _solution) {
return _solution.size() > 0;
}
/**
* Return the class Name
* @return the class name as a std::string
*/
virtual std::string className() const {
return "moBitsNeighborhood";
}
protected:
// length of the bit strings
unsigned int length;
// radius of the neighborhood
unsigned int nBits;
// size of the neighborhood
unsigned int neighborhoodSize;
};
#endif

199
mo/src/problems/bitString/moBitsWithReplNeighborhood.h Normal file
View file

@ -0,0 +1,199 @@
/*
<moBitsWithReplNeighborhood.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 _moBitsWithReplNeighborhood_h
#define _moBitsWithReplNeighborhood_h
#include <neighborhood/moNeighborhood.h>
#include <problems/bitString/moBitsNeighborhood.h>
#include <utils/eoRNG.h>
#include <vector>
/**
* A neighborhood for bit string solutions
* where several bits could be flipped
* under a given Hamming distance
*
* The neighborhood is explored in a random order
* Each neighbors is visited once time
* and the number of visited neighbors is a parameter
*/
template< class Neighbor >
class moBitsWithReplNeighborhood : public moBitsNeighborhood<Neighbor>
{
using moBitsNeighborhood<Neighbor>::neighborhoodSize;
using moBitsNeighborhood<Neighbor>::length;
using moBitsNeighborhood<Neighbor>::nBits;
using moBitsNeighborhood<Neighbor>::numberOfNeighbors;
public:
/**
* Define type of a solution corresponding to Neighbor
*/
typedef typename Neighbor::EOT EOT;
/**
* Constructor
*
* @param _length bit string length
* @param _nBits maximum number of bits to flip (radius of the neighborhood)
* @param _sampleSize number of neighbor to sample in the neighborhood, if 0 all the neighborhood is sampled
* @param _exactDistance when true, only neighbor with exactly k bits flip are considered, other neighbor <= Hamming distance k
*/
moBitsWithReplNeighborhood(unsigned _length, unsigned _nBits, unsigned _sampleSize, bool _exactDistance = false): moBitsNeighborhood<Neighbor>(_length, _nBits, _exactDistance), sampleSize(_sampleSize), exactDistance(_exactDistance) {
if (sampleSize > neighborhoodSize || sampleSize == 0)
sampleSize = neighborhoodSize;
indexVector.resize(length);
for(unsigned int i = 0; i < length; i++)
indexVector[i] = i;
if (!exactDistance) {
nSize.resize(nBits);
nSize[0] = numberOfNeighbors(1);
for(unsigned d = 2; d <= nBits; d++)
nSize[d - 1] = nSize[d - 2] + numberOfNeighbors(d);
}
nNeighbors = 0;
}
/**
* one random neighbor at Hamming distance _n
*
* @param _solution the solution to explore
* @param _neighbor the first neighbor
* @param _n Hamming distance of the neighbor
*/
virtual void randomNeighbor(EOT & _solution, Neighbor & _neighbor, unsigned _n) {
_neighbor.bits.resize(_n);
_neighbor.nBits = _n;
unsigned i;
unsigned b;
unsigned tmp;
for(unsigned k = 0; k < _n; k++) {
i = rng.random(length - k);
b = indexVector[i];
_neighbor.bits[k] = b;
indexVector[i] = indexVector[length - k - 1];
indexVector[length - k - 1] = b;
}
}
/**
* one random neighbor at maximal Hamming distance _n
*
* @param _solution the solution to explore
* @param _neighbor the first neighbor
*/
virtual void randomNeighbor(EOT & _solution, Neighbor & _neighbor) {
if (exactDistance)
randomNeighbor(_solution, _neighbor, nBits);
else {
// equiprobability between neighbors at maximal Hamming distance nBits
unsigned n = rng.random(neighborhoodSize);
unsigned d = 1;
while (n < nSize[d - 1]) d++;
randomNeighbor(_solution, _neighbor, d);
}
}
/**
* Initialization of the neighborhood:
* one random neighbor
*
* @param _solution the solution to explore
* @param _neighbor the first neighbor
*/
virtual void init(EOT & _solution, Neighbor & _neighbor) {
randomNeighbor(_solution, _neighbor);
nNeighbors = 1;
}
/**
* Give the next neighbor
* apply several bit flips on the solution
* @param _solution the solution to explore (population of solutions)
* @param _neighbor the next neighbor which in order of distance
*/
virtual void next(EOT & _solution, Neighbor & _neighbor) {
randomNeighbor(_solution, _neighbor);
nNeighbors++;
}
/**
* 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 nNeighbors < sampleSize ;
}
/**
* Return the class Name
* @return the class name as a std::string
*/
virtual std::string className() const {
return "moBitsWithReplNeighborhood";
}
protected:
// vector of possible bits
std::vector<unsigned int> indexVector;
// maximum number of visited neighbor i.e. number of neighbor to sample in the neighborhood
unsigned int sampleSize;
// number of visited neighbors
unsigned nNeighbors;
// when true, only neighbors at Hamming distance nBits
bool exactDistance;
// the number of neighbors below the given distance
std::vector<unsigned int> nSize;
};
#endif

229
mo/src/problems/bitString/moBitsWithoutReplNeighborhood.h Normal file
View file

@ -0,0 +1,229 @@
/*
<moBitsWithoutReplNeighborhood.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 _moBitsWithoutReplNeighborhood_h
#define _moBitsWithoutReplNeighborhood_h
#include <neighborhood/moNeighborhood.h>
#include <problems/bitString/moBitsNeighborhood.h>
#include <utils/eoRNG.h>
#include <vector>
/**
* A neighborhood for bit string solutions
* where several bits could be flipped
* under a given Hamming distance
*
* The neighborhood is explored in a random order
* Each neighbors is visited once time
* and the number of visited neighbors is a parameter
*/
template< class Neighbor >
class moBitsWithoutReplNeighborhood : public moBitsNeighborhood<Neighbor>
{
using moBitsNeighborhood<Neighbor>::neighborhoodSize;
using moBitsNeighborhood<Neighbor>::length;
using moBitsNeighborhood<Neighbor>::nBits;
public:
/**
* Define type of a solution corresponding to Neighbor
*/
typedef typename Neighbor::EOT EOT;
/**
* Constructor
* @param _length bit string length
* @param _nBits maximum number of bits to flip (radius of the neighborhood)
* @param _sampleSize number of neighbor to sample in the neighborhood, if 0 all the neighborhood is sampled
* @param _exactDistance when true, only neighbor with exactly k bits flip are considered, other neighbor <= Hamming distance k
*/
moBitsWithoutReplNeighborhood(unsigned _length, unsigned _nBits, unsigned _sampleSize, bool _exactDistance = false): moBitsNeighborhood<Neighbor>(_length, _nBits, _exactDistance), sampleSize(_sampleSize) {
if (sampleSize > neighborhoodSize || sampleSize == 0)
sampleSize = neighborhoodSize;
indexVector.resize(neighborhoodSize);
for(unsigned int i = 0; i < neighborhoodSize; i++)
indexVector[i] = i;
/* all the neighbors */
if (neighborhoodSize >= 1000000) {
std::cout << "moBitsNeighborhood::Warning : the neighborhood size is larger than 10^6 : " << neighborhoodSize << std::endl;
}
int j;
bool last;
unsigned firstIndex;
if (_exactDistance)
firstIndex = nBits;
else
firstIndex = 1;
for(int d = firstIndex; d <= nBits; d++) {
std::vector<unsigned int> bits(d);
// the first one for this Hamming distance
for(unsigned i = 0; i < d; i++)
bits[i] = i;
neighborsVec.push_back(bits);
// the others ones
last = false;
while(!last) {
j = d - 1;
if (bits[j] < length - 1) {
bits[j]++;
neighborsVec.push_back(bits);
} else {
j--;
while ( (j >= 0) && (bits[j] + 1 == bits[j+1]) )
j--;
if (j < 0) {
last = true;
} else {
bits[j]++;
for(unsigned i = j+1; i < d; i++)
bits[i] = bits[i-1] + 1;
neighborsVec.push_back(bits);
}
}
}
}
if (neighborhoodSize != neighborsVec.size())
std::cout << "moBitsNeighborhood::Warning -> error in the neighborhood size computation, please check... : " << neighborhoodSize << " / " << neighborsVec.size() << std::endl;
}
/**
* Initialization of the neighborhood:
* apply several bit flips on the solution
* @param _solution the solution to explore
* @param _neighbor the first neighbor
*/
virtual void init(EOT & _solution, Neighbor & _neighbor) {
maxIndex = neighborhoodSize ;
unsigned i = rng.random(maxIndex);
key = indexVector[i];
unsigned tmp = indexVector[i];
indexVector[i] = indexVector[maxIndex - 1];
indexVector[maxIndex - 1] = tmp;
maxIndex--;
_neighbor.bits.resize(nBits);
setNeighbor(key, _neighbor);
}
/**
* Give the next neighbor
* apply several bit flips on the solution
* @param _solution the solution to explore (population of solutions)
* @param _neighbor the next neighbor which in order of distance
*/
virtual void next(EOT & _solution, Neighbor & _neighbor) {
unsigned i = rng.random(maxIndex);
key = indexVector[i];
unsigned tmp = indexVector[i];
indexVector[i] = indexVector[maxIndex - 1];
indexVector[maxIndex - 1] = tmp;
maxIndex--;
setNeighbor(key, _neighbor);
}
/**
* 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 neighborhoodSize - maxIndex < sampleSize ;
}
/**
* Return the class Name
* @return the class name as a std::string
*/
virtual std::string className() const {
return "moBitsWithoutReplNeighborhood";
}
unsigned int index() {
return key;
}
protected:
// number of remainded neighbors to sample
unsigned int maxIndex;
// vector of possible index
std::vector<unsigned int> indexVector;
// maximum number of visited neighbor i.e. number of neighbor to sample in the neighborhood
unsigned int sampleSize;
// list of neighbors
std::vector< std::vector<unsigned int> > neighborsVec;
// key of the neighbor which is currently explored
unsigned int key;
/**
* Set the neighbor to the correct neighbor
* @param _key index in neighborVec of the neighbor to set
* @param _neighbor neighbor to set
*/
virtual void setNeighbor(unsigned _key, Neighbor & _neighbor) {
_neighbor.nBits = neighborsVec[_key].size();
for(unsigned i = 0; i < _neighbor.nBits; i++)
_neighbor.bits[i] = neighborsVec[_key][i];
}
};
#endif