Ajout des fichiers problems/eval/moPopXoverEval.h problems/bitString/moPopXover*.h pour le neighborhood lié au crossover
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1906 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
571fc8d9d1
commit
8189973e2e
1 changed files with 106 additions and 0 deletions
106
trunk/paradiseo-mo/src/problems/eval/moPopXoverEval.h
Normal file
106
trunk/paradiseo-mo/src/problems/eval/moPopXoverEval.h
Normal file
|
|
@ -0,0 +1,106 @@
|
||||||
|
/*
|
||||||
|
<moPopXoverEval.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 moPopXoverEval_H
|
||||||
|
#define moPopXoverEval_H
|
||||||
|
|
||||||
|
#include <eoFunctor.h>
|
||||||
|
#include <eval/moEval.h>
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Class to compute the fitness of the solution-set after the crossover
|
||||||
|
*/
|
||||||
|
template<class Neighbor>
|
||||||
|
class moPopXoverEval : public moEval<Neighbor>
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
typedef typename Neighbor::EOT EOT;
|
||||||
|
typedef typename Neighbor::SUBEOT SUBEOT; // type of the solution
|
||||||
|
|
||||||
|
typedef typename SUBEOT::Fitness Fitness; // 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
|
||||||
|
*/
|
||||||
|
moPopXoverEval(eoEvalFunc<SUBEOT>& _eval, unsigned int _p) : eval(_eval), p(_p) {
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Compute the fitness of the neighbor after the crossover
|
||||||
|
*
|
||||||
|
* @param _sol the solution-set
|
||||||
|
* @param _n the neighbor which is supposed to be a "crossover" neighbor
|
||||||
|
*/
|
||||||
|
void operator()(EOT& _sol, Neighbor& _n){
|
||||||
|
if (_sol[0].size() > 0) {
|
||||||
|
// index of the solutions
|
||||||
|
unsigned int i1 = _n.index1();
|
||||||
|
unsigned int i2 = _n.index2();
|
||||||
|
|
||||||
|
// evaluation of the solutions which are moved
|
||||||
|
eval(_n.solution1());
|
||||||
|
eval(_n.solution2());
|
||||||
|
|
||||||
|
// save the fitness of the solution i1 and i2
|
||||||
|
Fitness f1 = _sol[i1].fitness();
|
||||||
|
Fitness f2 = _sol[i2].fitness();
|
||||||
|
|
||||||
|
_sol[i1].fitness(_n.solution1().fitness());
|
||||||
|
_sol[i2].fitness(_n.solution2().fitness());
|
||||||
|
|
||||||
|
// compute the fitness of the solution-set
|
||||||
|
double fit = 0;
|
||||||
|
for (unsigned int i = 0; i < _sol.size(); i++)
|
||||||
|
fit += pow((double) _sol[i].fitness(), (int) p);
|
||||||
|
|
||||||
|
fit = pow((double) fit, (double)1/p);
|
||||||
|
|
||||||
|
_n.fitness(fit);
|
||||||
|
|
||||||
|
// come back to the fitness of the initial solution
|
||||||
|
_sol[i1].fitness(f1);
|
||||||
|
_sol[i2].fitness(f2);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
eoEvalFunc<SUBEOT> & eval;
|
||||||
|
unsigned int p;
|
||||||
|
|
||||||
|
};
|
||||||
|
|
||||||
|
#endif
|
||||||
Loading…
Add table
Add a link
Reference in a new issue