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

test modifiée

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1862 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
jhumeau 2010-06-22 09:58:43 +00:00
commit 5f7696a342
5 changed files with 32 additions and 25 deletions
Download patch file Download diff file Expand all files Collapse all files

1
trunk/paradiseo-moeo/src/algo/moeoPLS1.h
View file

@ -81,6 +81,7 @@ public:
*(new moeoNumberUnvisitedSelect<MOEOT>(1)) *(new moeoNumberUnvisitedSelect<MOEOT>(1))
){} ){}
}; };
#endif /*MOEOPLS1_H_*/ #endif /*MOEOPLS1_H_*/

17
trunk/paradiseo-moeo/test/t-moeoDMLSGenUpdater.cpp
View file

@ -60,14 +60,15 @@ int main(){
eoGenContinue<Solution> genCont(2); eoGenContinue<Solution> genCont(2);
//Create a solution //Create a solution
s.push_back(true); s.resize(8);
s.push_back(true); s[0]=true;
s.push_back(true); s[1]=true;
s.push_back(true); s[2]=true;
s.push_back(true); s[3]=true;
s.push_back(true); s[4]=true;
s.push_back(true); s[5]=true;
s.push_back(true); s[6]=true;
s[7]=true;
//Set its objective Vector //Set its objective Vector
o[0]=8; o[0]=8;

5
trunk/paradiseo-moeo/test/t-moeoEpsilonHyperboxArchive.cpp
View file

@ -4,6 +4,7 @@
* (C) OPAC Team, LIFL, 2002-2007 * (C) OPAC Team, LIFL, 2002-2007
* *
* Arnaud Liefooghe * Arnaud Liefooghe
* Jérémie Humeau
* *
* 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,
@ -67,6 +68,8 @@ typedef MOEO < ObjectiveVector, double, double > Solution;
int main() int main()
{ {
//!!!!!!!!!!!!VRAI TEST A FAIRE!!!!!!!!!!!!!!
std::cout << "[moeoEpsilonHyperboxArchive]\t=>\t"; std::cout << "[moeoEpsilonHyperboxArchive]\t=>\t";
std::cout << std::endl; std::cout << std::endl;
@ -83,7 +86,7 @@ int main()
unsigned int o3=50; unsigned int o3=50;
unsigned int o4=50; unsigned int o4=50;
double tmp;
for(int i=0; i< pop.size()/2; i++){ for(int i=0; i< pop.size()/2; i++){
// tmp=rng.uniform()*100; // tmp=rng.uniform()*100;

17
trunk/paradiseo-moeo/test/t-moeoPLS1.cpp
View file

@ -55,14 +55,15 @@ int main(){
eoPop<Solution> src; eoPop<Solution> src;
//Create a solution //Create a solution
s.push_back(true); s.resize(8);
s.push_back(true); s[0]=true;
s.push_back(true); s[1]=true;
s.push_back(true); s[2]=true;
s.push_back(true); s[3]=true;
s.push_back(true); s[4]=true;
s.push_back(true); s[5]=true;
s.push_back(true); s[6]=true;
s[7]=true;
//Set its objective Vector //Set its objective Vector
o[0]=8; o[0]=8;

17
trunk/paradiseo-moeo/test/t-moeoPLS2.cpp
View file

@ -55,14 +55,15 @@ int main(){
eoPop<Solution> src; eoPop<Solution> src;
//Create a solution //Create a solution
s.push_back(true); s.resize(8);
s.push_back(true); s[0]=true;
s.push_back(true); s[1]=true;
s.push_back(true); s[2]=true;
s.push_back(true); s[3]=true;
s.push_back(true); s[4]=true;
s.push_back(true); s[5]=true;
s.push_back(true); s[6]=true;
s[7]=true;
//Set its objective Vector //Set its objective Vector
o[0]=8; o[0]=8;