from moeoFastNonDominantedSortingFitnessAssignment to moeoDominanceDepthFitnessAssignment
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1269 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
bc932bb89d
commit
b32c1704e8
9 changed files with 34 additions and 42 deletions
|
|
@ -44,7 +44,6 @@ SET (TEST_LIST
|
|||
t-moeoFitnessThenDiversityComparator
|
||||
t-moeoAchievementFitnessAssignment
|
||||
t-moeoExpBinaryIndicatorBasedFitnessAssignment
|
||||
t-moeoFastNonDominatedSortingFitnessAssignment
|
||||
t-moeoCrowdingDiversityAssignment
|
||||
t-moeoSharingDiversityAssignment
|
||||
t-moeoIBEA
|
||||
|
|
@ -56,6 +55,7 @@ SET (TEST_LIST
|
|||
t-moeoDominanceCountFitnessAssignment
|
||||
t-moeoDominanceRankFitnessAssignment
|
||||
t-moeoDominanceCountRankingFitnessAssignment
|
||||
t-moeoDominanceDepthFitnessAssignment
|
||||
t-moeoNearestNeighborDiversityAssignment
|
||||
t-moeoSPEA2Archive
|
||||
t-moeoSPEA2
|
||||
|
|
|
|||
|
|
@ -1,7 +1,7 @@
|
|||
/*
|
||||
* <t-moeoFastNonDominatedSortingFitnessAssignment.cpp>
|
||||
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
|
||||
* (C) OPAC Team, LIFL, 2002-2007
|
||||
* <t-moeoDominanceDepthFitnessAssignment.cpp>
|
||||
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
|
||||
* (C) OPAC Team, LIFL, 2002-2008
|
||||
*
|
||||
* Arnaud Liefooghe
|
||||
*
|
||||
|
|
@ -34,7 +34,7 @@
|
|||
*
|
||||
*/
|
||||
//-----------------------------------------------------------------------------
|
||||
// t-moeoFastNonDominatedSortingFitnessAssignment.cpp
|
||||
// t-moeoDominanceDepthFitnessAssignment.cpp
|
||||
//-----------------------------------------------------------------------------
|
||||
|
||||
#include <eo>
|
||||
|
|
@ -67,7 +67,7 @@ typedef MOEO < ObjectiveVector, double, double > Solution;
|
|||
|
||||
int main()
|
||||
{
|
||||
std::cout << "[moeoFastNonDominatedSortingFitnessAssignment]\t=>\t";
|
||||
std::cout << "[moeoDominanceDepthFitnessAssignment]\t=>\t";
|
||||
|
||||
// objective vectors
|
||||
ObjectiveVector obj0, obj1, obj2, obj3, obj4, obj5;
|
||||
|
|
@ -95,7 +95,7 @@ int main()
|
|||
pop[5].objectiveVector(obj5); // class 1
|
||||
|
||||
// fitness assignment
|
||||
moeoFastNonDominatedSortingFitnessAssignment< Solution > fitnessAssignment;
|
||||
moeoDominanceDepthFitnessAssignment< Solution > fitnessAssignment;
|
||||
fitnessAssignment(pop);
|
||||
|
||||
// pop[0]
|
||||
|
|
@ -100,7 +100,7 @@ int main()
|
|||
eoRealInitBounded < Solution > init(bounds);
|
||||
eoPop < Solution > pop(20, init);
|
||||
eoGenContinue < Solution > term(20);
|
||||
moeoFastNonDominatedSortingFitnessAssignment < Solution > fitnessAssignment;
|
||||
moeoDominanceDepthFitnessAssignment < Solution > fitnessAssignment;
|
||||
moeoFrontByFrontCrowdingDiversityAssignment < Solution > diversityAssignment;
|
||||
moeoFitnessThenDiversityComparator < Solution > comparator;
|
||||
moeoDetTournamentSelect < Solution > selectOne(comparator, 2);
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue