109 lines
3 KiB
C++
109 lines
3 KiB
C++
/*
|
|
<PPPIncrEval.h>
|
|
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
|
|
|
Karima Boufaras, Thé Van LUONG
|
|
|
|
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 __PPPIncrEval_H
|
|
#define __PPPIncrEval_H
|
|
|
|
#include <eval/moGPUEvalFunc.h>
|
|
|
|
/**
|
|
* Incremental Evaluation of PPP
|
|
*/
|
|
|
|
template<class Neighbor>
|
|
class PPPIncrEval: public moGPUEvalFunc<Neighbor> {
|
|
|
|
public:
|
|
|
|
typedef typename Neighbor::EOT EOT;
|
|
typedef typename EOT::Fitness Fitness;
|
|
typedef typename EOT::ElemType T;
|
|
|
|
/**
|
|
* Constructor
|
|
*/
|
|
|
|
PPPIncrEval() {
|
|
}
|
|
|
|
/**
|
|
* Destructor
|
|
*/
|
|
|
|
~PPPIncrEval() {
|
|
}
|
|
|
|
/**
|
|
* Incremental evaluation of the PPP solution,function inline can be called from host or device
|
|
* @param _sol the solution to evaluate
|
|
* @param _fitness the fitness of the current solution
|
|
* @param _index an array that contains a set of indexes corresponding to the current thread identifier neighbor the last element of this array contains neighborhood size
|
|
*/
|
|
|
|
inline __host__ __device__ Fitness operator() (T* _sol,Fitness _fitness, unsigned int *_index) {
|
|
|
|
int H[Nd];
|
|
int S[Md];
|
|
int tmp_1=0;
|
|
int tmp_2=0;
|
|
|
|
for (unsigned i=0; i<Md; i++) {
|
|
S[i]=0;
|
|
for (int j=0; j<Nd; j++)
|
|
S[i]+=dev_a[i*Nd+j]*_sol[j];
|
|
}
|
|
|
|
|
|
for (unsigned j=0; j<Nd; j++)
|
|
H[j]=0;
|
|
for (unsigned i=0; i<Md; i++) {
|
|
for(unsigned k=0;k<NB_POS;k++)
|
|
S[i]=S[i]-2*dev_a[i*Nd+_index[k]]*_sol[_index[k]];
|
|
tmp_1=tmp_1+abs(S[i])-S[i];
|
|
if(S[i]>0)
|
|
H[S[i]-1]=H[S[i]-1]+1;
|
|
}
|
|
|
|
for (unsigned j=0; j<Nd; j++)
|
|
tmp_2=tmp_2+abs(dev_h[j]-H[j]);
|
|
|
|
return ca*tmp_1+cb*tmp_2;
|
|
|
|
}
|
|
|
|
|
|
};
|
|
|
|
#endif
|
|
|