paradiseo/eo/test/t-eoOrderXover.cpp
2020-03-27 00:48:23 +01:00

72 lines
1.8 KiB
C++
Raw Blame History

//-----------------------------------------------------------------------------
// t-eoOrderXover.cpp
//-----------------------------------------------------------------------------
#include <set>
#include <eo>
#include <eoInt.h>
#include <eoOrderXover.h>
//-----------------------------------------------------------------------------
typedef eoInt<int> Chrom;
//-----------------------------------------------------------------------------
// Return true if the given chromosome corresponds to a permutation
bool check_permutation(const Chrom& _chrom){
unsigned size= _chrom.size();
std::set<unsigned> verif;
for(unsigned i=0; i< size; i++){
if(verif.insert(_chrom[i]).second==false){
std::cout << " Error: Wrong permutation !" << std::endl;
std::string s;
s.append( " Wrong permutation in t-eoShiftMutation");
throw eoException( s );
return false;
}
}
return true;
}
int main()
{
const unsigned POP_SIZE = 3, CHROM_SIZE = 8;
unsigned i;
// a chromosome randomizer
eoInitPermutation <Chrom> random(CHROM_SIZE);
// the population:
eoPop<Chrom> pop;
// Evaluation
//eoEvalFuncPtr<Chrom> eval( real_value );
for (i = 0; i < POP_SIZE; ++i)
{
Chrom chrom(CHROM_SIZE);
random(chrom);
//eval(chrom);
pop.push_back(chrom);
}
// a shift mutation
eoOrderXover<Chrom> cross;
for (i = 0; i < POP_SIZE; ++i)
std::cout << " Initial chromosome n<>" << i << " : " << pop[i] << "..." << std::endl;
cross(pop[0],pop[1]);
cross(pop[1],pop[2]);
for (i = 0; i < POP_SIZE; ++i) {
std::cout << " Initial chromosome n<>" << i << " becomes : " << pop[i] << " after orderXover" << std::endl;
check_permutation(pop[i]);
}
return 0;
}
//-----------------------------------------------------------------------------