Delete code in developpement again

git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2536 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
verel 2011-12-05 16:58:09 +00:00
commit cff09f267c
8 changed files with 0 additions and 965 deletions

View file

@ -1,114 +0,0 @@
/*
<moPopBitNeighbor.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 _moPopBitNeighbor_h
#define _moPopBitNeighbor_h
#include <eoPop.h>
#include <ga/eoBit.h>
#include <problems/bitString/moPopSol.h>
#include <neighborhood/moIndexNeighbor.h>
/**
* Neighbor related to a vector of Bit
*/
template< class Fitness >
class moPopBitNeighbor : public moIndexNeighbor< moPopSol<eoBit<Fitness> > >
{
public:
typedef moPopSol<eoBit<Fitness> > EOT ;
typedef eoBit<Fitness> SUBEOT;
using moIndexNeighbor<EOT>::fitness;
using moIndexNeighbor<EOT>::key;
/**
* move the solution
* @param _solution the solution to move
*/
virtual void move(EOT & _solution) {
if(_solution[0].size()>0){
unsigned size=_solution[0].size();
unsigned s = key/size;
unsigned b = key%size;
_solution[s][b] = !_solution[s][b];
_solution[s].fitness(subfit);
_solution.invalidate();
}
}
void setSubFit(Fitness _subfit){
subfit=_subfit;
}
/**
* return the class name
* @return the class name as a std::string
*/
virtual std::string className() const {
return "moPopBitNeighbor";
}
/**
* 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;
}
private:
Fitness subfit;
};
#endif

View file

@ -1,199 +0,0 @@
/*
<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

View file

@ -1,136 +0,0 @@
/*
<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

View file

@ -1,62 +0,0 @@
/*
<moPopSol.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 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 _moPopSol_h
#define _moPopSol_h
#include <EO.h>
#include <eoPop.h>
template <class EOT>
class moPopSol : public EO<double>, public std::vector<EOT>{
public:
typedef EOT SUBEOT; // public type of the solution
typedef typename EO<double>::Fitness Fitness;
using EO<double>::invalidate;
moPopSol(): EO<double>() {
}
virtual void printOn(std::ostream& _os) const
{
if (this->invalid()) {
_os << (*this).size() << " " << "INVALID" << '\n';
for(unsigned int i=0; i<(*this).size(); i++)
_os << (*this).operator[](i) << std::endl;
} else {
_os << (*this).size() << " " << (*this).fitness() << '\n';
for(unsigned int i=0; i<(*this).size(); i++)
_os << (*this).operator[](i) << std::endl;
}
}
};
#endif

View file

@ -1,68 +0,0 @@
/*
<moPopSolInit.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 _moPopSolInit_h
#define _moPopSolInit_h
#include <problems/bitString/moPopSol.h>
#include <eoInit.h>
template <class EOT>
class moPopSolInit: public eoInit<EOT> {
public:
typedef typename EOT::SUBEOT SUBEOT;
/**
* Default constructor
*
* @param _rnd initializer of a solution
* @param _popSize population size of the solution-set
*/
moPopSolInit(eoInit<SUBEOT> & _rnd, unsigned int _popSize) : rnd(_rnd), popSize(_popSize){}
void operator()(EOT & _sol) {
SUBEOT tmp;
_sol.clear();
for(unsigned int i = 0; i < popSize; i++){
rnd(tmp);
_sol.push_back(tmp);
}
_sol.invalidate();
}
private:
eoInit<SUBEOT>& rnd;
unsigned int popSize;
};
#endif

View file

@ -1,79 +0,0 @@
/*
<moPopSolNonDomInit.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 _moPopSolNonDomInit_h
#define _moPopSolNonDomInit_h
#include <problems/bitString/moPopSol.h>
#include <eoInit.h>
#include <archive/moeoUnboundedArchive.h>
template <class EOT>
class moPopSolNonDomInit: public eoInit<EOT> {
public:
typedef typename EOT::SUBEOT SUBEOT;
/**
* Default constructor
*
* @param _rnd initializer of a solution
* @param _popSize population size of the solution-set
*/
moPopSolNonDomInit(eoInit<SUBEOT> & _rnd, eoEvalFunc<SUBEOT> & _eval, unsigned int _popSize) : rnd(_rnd), eval(_eval), popSize(_popSize){}
void operator()(EOT & _sol) {
SUBEOT tmp;
_sol.clear();
archive.clear();
while (archive.size() < popSize) {
rnd(tmp);
eval(tmp);
archive(tmp);
}
for(unsigned int i = 0; i < popSize; i++){
_sol.push_back(archive[i]);
}
_sol.invalidate();
}
private:
eoInit<SUBEOT>& rnd;
eoEvalFunc<SUBEOT> & eval;
unsigned int popSize;
moeoUnboundedArchive<SUBEOT> archive;
};
#endif

View file

@ -1,162 +0,0 @@
/*
<moPopXoverNeighbor.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 _moPopXoverNeighbor_h
#define _moPopXoverNeighbor_h
#include <eoPop.h>
#include <problems/bitString/moPopSol.h>
#include <neighborhood/moNeighbor.h>
/**
* Crossover neighbor: apply one crossover operator between 2 random solutions of the population
*/
template< class EOT >
class moPopXoverNeighbor : public moNeighbor<EOT>
{
public:
typedef typename EOT::SUBEOT SUBEOT ;
using moNeighbor<EOT>::fitness;
/**
* 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) {
_solution[i1] = sol1;
_solution[i2] = sol2;
_solution.invalidate();
}
}
/**
* Set the index of the solutions on which the crossover is applied
*
* @param _i1 index of the first solution
* @param _i2 index of the second solution
*/
void setIndexes(unsigned int _i1, unsigned int _i2){
i1 = _i1;
i2 = _i2;
}
/**
* Give the variable on the first solution
*
* @return first solution
*/
SUBEOT& solution1() {
return sol1;
}
/**
* Give the variable on the second solution
*
* @return second solution
*/
SUBEOT& solution2() {
return sol2;
}
/**
* Give the index in the population of the first solution
*
* @return index of the first solution
*/
unsigned int index1() {
return i1;
}
/**
* Give the index in the population of the second solution
*
* @return index of the second solution
*/
unsigned int index2() {
return i2;
}
/**
* return the class name
* @return the class name as a std::string
*/
virtual std::string className() const {
return "moPopXoverNeighbor";
}
/**
* 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;
_is >> i1;
_is >> i2;
_is >> sol1;
_is >> sol2;
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() << ' ' << i1 << ' ' << i2 << ' ' << sol1 << ' ' << sol2 << std::endl;
}
private:
// the two solutions which are the results of the crossover operator
SUBEOT sol1, sol2;
// index of the two solutions
unsigned int i1, i2;
};
#endif

View file

@ -1,145 +0,0 @@
/*
<moPopXoverRndNeighborhood.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 _moPopXoverRndNeighborhood_h
#define _moPopXoverRndNeighborhood_h
#include <neighborhood/moRndNeighborhood.h>
#include <eoOp.h>
#include <utils/eoRNG.h>
/**
* A Xover neighborhood with random crossover between random solutions
*/
template< class Neighbor >
class moPopXoverRndNeighborhood : 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 _crossover the crossover operator
* @param _maxNeighbor maximum neighbors to explore in the neighborhood
*/
moPopXoverRndNeighborhood(eoQuadOp<SUBEOT> & _crossover, unsigned int _maxNeighbor = 0): moRndNeighborhood<Neighbor>(), crossover(_crossover), maxNeighbor(_maxNeighbor) {}
/**
* Test if it exist a neighbor
* @param _solution the solution to explore
* @return true if the neighborhood was not empty: the opulation soze is at least 2
*/
virtual bool hasNeighbor(EOT& _solution) {
return _solution.size() > 1;
}
/**
* Initialization of the neighborhood:
* apply a ones the crossover operato between random solutions
* @param _solution the solution to explore (population of solutions)
* @param _neighbor the first neighbor
*/
virtual void init(EOT & _solution, Neighbor & _neighbor) {
next(_solution, _neighbor);
nbNeighbor = 0;
}
/**
* Give the next neighbor
* apply a ones the crossover operato between random solutions
* @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();
// random solutions in the population
unsigned int i1, i2;
i1 = rng.random(popSize);
i2 = rng.random(popSize);
while (i2 == i1)
i2 = rng.random(popSize);
_neighbor.setIndexes(i1, i2);
// copy the solutions
_neighbor.solution1() = _solution[i1];
_neighbor.solution2() = _solution[i2];
// apply the crossover
crossover(_neighbor.solution1(), _neighbor.solution2());
// increase the number of neighbor explored
nbNeighbor++;
}
/**
* 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 2
*/
virtual bool cont(EOT & _solution) {
if (maxNeighbor != 0)
return (_solution.size() > 1) && (nbNeighbor < maxNeighbor);
else
return _solution.size() > 1;
}
/**
* Return the class Name
* @return the class name as a std::string
*/
virtual std::string className() const {
return "moPopXoverRndNeighborhood";
}
private:
eoQuadOp<SUBEOT> & crossover;
unsigned int maxNeighbor;
unsigned int nbNeighbor;
};
#endif