tests added
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1704 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
jhumeau
parent
f27bb9975c
commit
8129dff882
9 changed files with 316 additions and 42 deletions
|
|
@ -48,6 +48,8 @@ SET (TEST_LIST
|
|||
t-moSolutionStat
|
||||
t-moCheckpoint
|
||||
t-moDummyMemory
|
||||
t-moSolVectorTabuList
|
||||
t-moBestImprAspiration
|
||||
t-moSimpleHCexplorer
|
||||
t-moSimpleHCneutralExplorer
|
||||
t-moHCneutralExplorer
|
||||
|
|
@ -55,8 +57,7 @@ SET (TEST_LIST
|
|||
t-moRandomWalkExplorer
|
||||
t-moMetropolisHastingExplorer
|
||||
t-moRandomNeutralWalkExplorer
|
||||
t-moSolVectorTabuList
|
||||
|
||||
t-moTSExplorer
|
||||
)
|
||||
|
||||
FOREACH (test ${TEST_LIST})
|
||||
|
|
|
|||
76
branches/newMo/test/t-moBestImprAspiration.cpp
Normal file
76
branches/newMo/test/t-moBestImprAspiration.cpp
Normal file
|
|
@ -0,0 +1,76 @@
|
|||
/*
|
||||
<t-moBestImprAspiration.cpp>
|
||||
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
|
||||
*/
|
||||
#include <memory/moBestImprAspiration.h>
|
||||
#include "moTestClass.h"
|
||||
|
||||
#include <iostream>
|
||||
#include <cstdlib>
|
||||
#include <cassert>
|
||||
|
||||
int main(){
|
||||
|
||||
std::cout << "[t-moBestImprAspiration] => START" << std::endl;
|
||||
|
||||
moBestImprAspiration<bitNeighbor> test;
|
||||
eoBit<eoMinimizingFitness> sol1(4);
|
||||
eoBit<eoMinimizingFitness> sol2(4);
|
||||
eoBit<eoMinimizingFitness> sol3(4);
|
||||
eoBit<eoMinimizingFitness> sol4(4);
|
||||
bitNeighbor n1;
|
||||
bitNeighbor n2;
|
||||
bitNeighbor n3;
|
||||
bitNeighbor n4;
|
||||
|
||||
sol3[0]=true;
|
||||
sol4[3]=true;
|
||||
|
||||
sol1.fitness(4);
|
||||
sol2.fitness(5);
|
||||
sol3.fitness(3);
|
||||
sol4.fitness(3);
|
||||
n1.fitness(4);
|
||||
n2.fitness(5);
|
||||
n3.fitness(3);
|
||||
n4.fitness(3);
|
||||
|
||||
test.init(sol1);
|
||||
assert(test.getBest()==sol1);
|
||||
assert(!test(sol2,n2));
|
||||
assert(test(sol3,n3));
|
||||
test.update(sol3,n3);
|
||||
assert(test.getBest()==sol3);
|
||||
assert(!test(sol4,n4));
|
||||
test.update(sol4,n4);
|
||||
assert(test.getBest()==sol3);
|
||||
|
||||
std::cout << "[t-moBestImprAspiration] => OK" << std::endl;
|
||||
|
||||
return EXIT_SUCCESS;
|
||||
}
|
||||
|
||||
|
|
@ -38,39 +38,55 @@ int main(){
|
|||
|
||||
std::cout << "[t-moSolVectorTabuList] => START" << std::endl;
|
||||
|
||||
moSolVectorTabuList<bitNeighbor> test(3);
|
||||
bitNeighbor n;
|
||||
moSolVectorTabuList<bitNeighbor> test(2);
|
||||
bitNeighbor n1;
|
||||
bitNeighbor n2;
|
||||
bitNeighbor n3;
|
||||
bitNeighbor n4;
|
||||
n1.index(0);
|
||||
n2.index(1);
|
||||
n3.index(2);
|
||||
n4.index(3);
|
||||
|
||||
eoBit<eoMinimizingFitness> sol1(4);
|
||||
eoBit<eoMinimizingFitness> sol2(4);
|
||||
eoBit<eoMinimizingFitness> sol3(4);
|
||||
eoBit<eoMinimizingFitness> sol4(4);
|
||||
eoBit<eoMinimizingFitness> sol1(4, true);
|
||||
eoBit<eoMinimizingFitness> sol2(4, true);
|
||||
eoBit<eoMinimizingFitness> sol3(4, true);
|
||||
eoBit<eoMinimizingFitness> sol4(4, true);
|
||||
|
||||
sol2[0]=true;
|
||||
sol3[1]=true;
|
||||
sol4[2]=true;
|
||||
sol2[0]=false;
|
||||
sol3[1]=false;
|
||||
sol4[0]=false;
|
||||
sol4[1]=false;
|
||||
|
||||
test.init(sol1);
|
||||
test.add(sol1,n);
|
||||
test.add(sol2,n);
|
||||
test.add(sol3,n);
|
||||
assert(test.check(sol1,n));
|
||||
assert(test.check(sol2,n));
|
||||
assert(test.check(sol3,n));
|
||||
test.add(sol4,n);
|
||||
assert(!test.check(sol1,n));
|
||||
assert(test.check(sol2,n));
|
||||
assert(test.check(sol3,n));
|
||||
assert(test.check(sol4,n));
|
||||
test.add(sol1,n1);
|
||||
assert(test.check(sol2,n1));
|
||||
assert(!test.check(sol2,n2));
|
||||
assert(!test.check(sol2,n3));
|
||||
assert(!test.check(sol2,n4));
|
||||
|
||||
assert(!test.check(sol3,n1));
|
||||
assert(test.check(sol3,n2));
|
||||
assert(!test.check(sol3,n3));
|
||||
assert(!test.check(sol3,n4));
|
||||
|
||||
assert(!test.check(sol4,n1));
|
||||
assert(!test.check(sol4,n2));
|
||||
assert(!test.check(sol4,n3));
|
||||
assert(!test.check(sol4,n4));
|
||||
|
||||
test.init(sol1);
|
||||
assert(!test.check(sol1,n));
|
||||
assert(!test.check(sol2,n));
|
||||
assert(!test.check(sol3,n));
|
||||
assert(!test.check(sol4,n));
|
||||
assert(!test.check(sol2,n1));
|
||||
assert(!test.check(sol3,n2));
|
||||
|
||||
test.update(sol1,n);
|
||||
test.update(sol1,n1);
|
||||
|
||||
test.add(sol1,n1);
|
||||
test.add(sol2,n1);
|
||||
assert(test.check(sol2,n1));
|
||||
test.add(sol4,n1);
|
||||
assert(!test.check(sol2,n1));
|
||||
assert(test.check(sol2,n2));
|
||||
|
||||
std::cout << "[t-moSolVectorTabuList] => OK" << std::endl;
|
||||
|
||||
|
|
|
|||
163
branches/newMo/test/t-moTSExplorer.cpp
Normal file
163
branches/newMo/test/t-moTSExplorer.cpp
Normal file
|
|
@ -0,0 +1,163 @@
|
|||
/*
|
||||
<t-moTSExplorer.cpp>
|
||||
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
|
||||
*/
|
||||
|
||||
#include <memory/moSolVectorTabuList.h>
|
||||
#include <memory/moDummyIntensification.h>
|
||||
#include <memory/moDummyDiversification.h>
|
||||
#include <memory/moBestImprAspiration.h>
|
||||
#include <explorer/moTSExplorer.h>
|
||||
#include "moTestClass.h"
|
||||
|
||||
#include <iostream>
|
||||
#include <cstdlib>
|
||||
#include <cassert>
|
||||
|
||||
int main(){
|
||||
|
||||
std::cout << "[t-moTSExplorer] => START" << std::endl;
|
||||
|
||||
eoBit<eoMinimizingFitness> sol(4, true);
|
||||
sol.fitness(4);
|
||||
bitNeighborhood nh(4);
|
||||
bitNeighborhood emptyNH(0);
|
||||
evalOneMax eval(4);
|
||||
moNeighborComparator<bitNeighbor> ncomp;
|
||||
moSolNeighborComparator<bitNeighbor> sncomp;
|
||||
moDummyIntensification<bitNeighbor> intens;
|
||||
moDummyDiversification<bitNeighbor> diver;
|
||||
moSolVectorTabuList<bitNeighbor> tabuList(4);
|
||||
moBestImprAspiration<bitNeighbor> aspir;
|
||||
|
||||
moTSExplorer<bitNeighborhood> test(nh, eval, ncomp, sncomp, tabuList, intens, diver, aspir);
|
||||
moTSExplorer<bitNeighborhood> test2(emptyNH, eval, ncomp, sncomp, tabuList, intens, diver, aspir);
|
||||
|
||||
//test d'un voisinage vide
|
||||
test2.initParam(sol);
|
||||
test2(sol);
|
||||
assert(!test2.accept(sol));
|
||||
|
||||
//test le comportement classique de la taboo
|
||||
test.initParam(sol);
|
||||
assert(aspir.getBest()==sol);
|
||||
|
||||
test(sol);
|
||||
test.updateParam(sol);
|
||||
assert(aspir.getBest()==sol);
|
||||
|
||||
//on ameliore et on stock une sol tabou 0111
|
||||
test(sol);
|
||||
test.move(sol);
|
||||
test.moveApplied(true);
|
||||
test.updateParam(sol);
|
||||
assert(aspir.getBest()==sol);
|
||||
|
||||
//on ameliore et on stock une autre sol tabou 0011
|
||||
test(sol);
|
||||
test.move(sol);
|
||||
test.moveApplied(true);
|
||||
test.updateParam(sol);
|
||||
assert(aspir.getBest()==sol);
|
||||
|
||||
//pareil on stock 0001 met pdt la recherche on se rend compte que 0111 est tabou
|
||||
test(sol);
|
||||
test.move(sol);
|
||||
test.moveApplied(true);
|
||||
test.updateParam(sol);
|
||||
assert(aspir.getBest()==sol);
|
||||
|
||||
//on modifie la sol en 1001(fitness 2) pour que la 1er sol exploré(0001) soit tabou
|
||||
//De plus on change la solution mais elle est pas meilleure que la best so Far
|
||||
sol[0]=true;
|
||||
std::cout << sol << std::endl;
|
||||
sol.fitness(2);
|
||||
test(sol);
|
||||
test.move(sol);
|
||||
test.moveApplied(true);
|
||||
test.updateParam(sol);
|
||||
assert( sol[0] && !sol[1] && !sol[2] && !sol[3]);
|
||||
sol[0]=false;
|
||||
sol[3]=true;
|
||||
assert(aspir.getBest()==sol);
|
||||
|
||||
//test du isContinue
|
||||
assert(test.isContinue(sol));
|
||||
|
||||
//test du terminate
|
||||
test.initParam(sol);
|
||||
sol[0]=true;
|
||||
sol[1]=true;
|
||||
sol[2]=true;
|
||||
sol[3]=true;
|
||||
sol.fitness(4);
|
||||
test(sol);
|
||||
test.move(sol);
|
||||
test.moveApplied(true);
|
||||
test.updateParam(sol);
|
||||
assert( !sol[0] && sol[1] && sol[2] && sol[3]);
|
||||
test.terminate(sol);
|
||||
assert( !sol[0] && !sol[1] && !sol[2] && sol[3]);
|
||||
|
||||
//test pour avoir que des mouvement taboo
|
||||
eoBit<eoMinimizingFitness> sol2(2, true);
|
||||
sol2.fitness(2);
|
||||
bitNeighborhood nh2(2);
|
||||
evalOneMax eval2(2);
|
||||
|
||||
moTSExplorer<bitNeighborhood> test3(nh2, eval2, ncomp, sncomp, tabuList, intens, diver, aspir);
|
||||
|
||||
test3.initParam(sol2);
|
||||
test3(sol2);
|
||||
test3.move(sol2);
|
||||
test3.moveApplied(true);
|
||||
test3.updateParam(sol2);
|
||||
|
||||
test3(sol2);
|
||||
test3.move(sol2);
|
||||
test3.moveApplied(true);
|
||||
test3.updateParam(sol2);
|
||||
|
||||
test3(sol2);
|
||||
test3.move(sol2);
|
||||
test3.moveApplied(true);
|
||||
test3.updateParam(sol2);
|
||||
|
||||
test3(sol2);
|
||||
test3.move(sol2);
|
||||
test3.moveApplied(true);
|
||||
test3.updateParam(sol2);
|
||||
|
||||
test3(sol2);
|
||||
assert(!test3.accept(sol2));
|
||||
|
||||
|
||||
std::cout << "[t-moTSExplorer] => OK" << std::endl;
|
||||
|
||||
return EXIT_SUCCESS;
|
||||
}
|
||||
|
||||
Loading…
Add table
Add a link
Reference in a new issue