#include #include #include #include #include using namespace std; int target =40; // target to reach int population =5; vector fit; vector fit2; vector achieved; bool done=0; bool first =1; bool firstF2 =1; bool lup = 1; int generation = 0; vector > gene; void individual() // asigns gene to an individual { vectorro; for(int i =0; i<5; i++) { int r=0; r=rand()%10; ro.push_back(r); } gene.push_back(ro); } vector crossover() // crossover of fitest members { vectorco; for(int i=0; i<2; i++) { co.push_back(fit[i]); } for(int i=0; i<2; i++) { co.push_back(fit2[i]); } int r_ = rand()%2; if(r_==0) { co.push_back(fit[4]); } else { co.push_back(fit2[4]); } return co; } vector mutate() // mutation of { vectormo; int r_ = rand()%2; if(r_==0) { for(int i=0; i<5; i++) { if(i%2 ==0) { mo.push_back(fit[i]); } else { int rand_ = rand()%10; mo.push_back(rand_); } } } else { for(int i=0; i<5; i++) { if(i%2 !=0) { mo.push_back(fit2[i]); } else { int rand_ = rand()%10; mo.push_back(rand_); } } } return mo; } void reproduce() // selects between crossover and mutation { vectorro; int p =0; p = rand()%2; if(p==0) { ro=crossover(); } else { ro=mutate(); } gene.push_back(ro); } void fitness(vector> gene_) // returns fitest member { int n=NULL; if(first) { for (int i=0; i<5; i++) { fit.push_back(gene_[0][i]); } first=0; n=0; } for(int i=0; i

Genetic Algorithm[c++]