git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2129 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
692f4a20e6
commit
0897afd483
2 changed files with 116 additions and 116 deletions
|
|
@ -1,36 +1,36 @@
|
||||||
/*
|
/*
|
||||||
<EvalOneMax.h>
|
<EvalOneMax.h>
|
||||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||||
|
|
||||||
Karima Boufaras, Thé Van LUONG
|
Karima Boufaras, Thé Van LUONG
|
||||||
|
|
||||||
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 __EvalOneMax
|
#ifndef __EvalOneMax
|
||||||
#define __EvalOneMax
|
#define __EvalOneMax
|
||||||
|
|
@ -42,37 +42,37 @@
|
||||||
template<class EOT>
|
template<class EOT>
|
||||||
class EvalOneMax: public eoEvalFunc<EOT> {
|
class EvalOneMax: public eoEvalFunc<EOT> {
|
||||||
|
|
||||||
public:
|
public:
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Constructor
|
* Constructor
|
||||||
*/
|
*/
|
||||||
|
|
||||||
EvalOneMax() {
|
EvalOneMax() {
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Destructor
|
* Destructor
|
||||||
*/
|
*/
|
||||||
|
|
||||||
~EvalOneMax(void) {
|
~EvalOneMax(void) {
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Full evaluation of the solution
|
* Full evaluation of the solution
|
||||||
* @param _bitVector the solution to evaluate
|
* @param _bitVector the solution to evaluate
|
||||||
*/
|
*/
|
||||||
|
|
||||||
void operator()(EOT & _bitVector) {
|
void operator()(EOT & _bitVector) {
|
||||||
|
|
||||||
unsigned sum = 0;
|
unsigned sum = 0;
|
||||||
|
|
||||||
for (unsigned i = 0; i < _bitVector.size(); i++)
|
for (unsigned i = 0; i < _bitVector.size(); i++)
|
||||||
sum += _bitVector[i];
|
sum += _bitVector[i];
|
||||||
|
|
||||||
//set the solution fitness
|
//set the solution fitness
|
||||||
_bitVector.fitness(sum);
|
_bitVector.fitness(sum);
|
||||||
}
|
}
|
||||||
|
|
||||||
};
|
};
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -1,36 +1,36 @@
|
||||||
/*
|
/*
|
||||||
<QAPEval.h>
|
<QAPEval.h>
|
||||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||||
|
|
||||||
Boufaras Karima, Thé Van Luong
|
Boufaras Karima, Thé Van Luong
|
||||||
|
|
||||||
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 __QAPEval
|
#ifndef __QAPEval
|
||||||
#define __QAPEval
|
#define __QAPEval
|
||||||
|
|
@ -38,46 +38,46 @@
|
||||||
#include <problems/data/QAPData.h>
|
#include <problems/data/QAPData.h>
|
||||||
|
|
||||||
template<class EOT, class ElemType = typename EOT::ElemType>
|
template<class EOT, class ElemType = typename EOT::ElemType>
|
||||||
class QAPEval: public eoEvalFunc<EOT> {
|
class QAPEval: public eoEvalFunc<EOT> {
|
||||||
|
|
||||||
public:
|
public:
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Constructor
|
* Constructor
|
||||||
* @param _qapData the specific data problem useful to evalute solution(flow & distance matrices of QAP problem)
|
* @param _qapData the specific data problem useful to evalute solution(flow & distance matrices of QAP problem)
|
||||||
*/
|
*/
|
||||||
|
|
||||||
QAPEval(QAPData<ElemType> & _qapData) {
|
QAPEval(QAPData<ElemType> & _qapData) {
|
||||||
qapData = _qapData;
|
qapData = _qapData;
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Destructor
|
* Destructor
|
||||||
*/
|
*/
|
||||||
|
|
||||||
~QAPEval() {
|
~QAPEval() {
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Full evaluation of the solution
|
* Full evaluation of the solution
|
||||||
* @param _sol the solution to evaluate
|
* @param _sol the solution to evaluate
|
||||||
*/
|
*/
|
||||||
|
|
||||||
void operator()(EOT & _sol) {
|
void operator()(EOT & _sol) {
|
||||||
int cost = 0;
|
int cost = 0;
|
||||||
unsigned int size = qapData.getSize();
|
unsigned int size = qapData.getSize();
|
||||||
for (unsigned int i = 0; i < size; i++)
|
for (unsigned int i = 0; i < size; i++)
|
||||||
for (unsigned int j = 0; j < size; j++) {
|
for (unsigned int j = 0; j < size; j++) {
|
||||||
cost += qapData.a_h[i * size + j] * qapData.b_h[_sol[i] * size
|
cost += qapData.a_h[i * size + j] * qapData.b_h[_sol[i] * size
|
||||||
+ _sol[j]];
|
+ _sol[j]];
|
||||||
}
|
}
|
||||||
|
|
||||||
_sol.fitness(cost);
|
_sol.fitness(cost);
|
||||||
}
|
}
|
||||||
|
|
||||||
protected:
|
protected:
|
||||||
|
|
||||||
QAPData<ElemType> qapData;
|
QAPData<ElemType> qapData;
|
||||||
|
|
||||||
};
|
};
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue