量子算法QGA 优化 函数 c++语言 绝对原创.docVIP

/**************量子遗传算法*cpp********************/ #include iostream #include faiheader.h using namespace std; #include stdlib.h void main() {int nm=14;int mn=2; double * test=INITIAL_Ofai(nm,mn);double * stest=INITIAL_Ofai(nm,mn); CHSC* p=FAI2Ch(nm,mn,test,stest); CH_X * pch_x=XCalculate(nm,mn,p); Pnum_MaxV pnm; pnm=FindBestFit(pch_x,nm,mn); coutBest pnm.best_p pnm.cos_in pnm.maxendl; int Maxiter=550; for(int iter=0;iterMaxiter;iter++) {Evolvo(nm,mn,test,stest,p,pnm); p=FAI2Ch(nm,mn,test,stest); pch_x=XCalculate(nm,mn,p); pnm=FindBestFit(pch_x,nm,mn); Mutation(nm,mn,test,stest,pnm,0.12); p=FAI2Ch(nm,mn,test,stest); pch_x=XCalculate(nm,mn,p); pnm=FindBestFit(pch_x,nm,mn); if ((iter%100)==0) coutiter 500Best pnm.best_p pnm.cos_in pnm.maxendl; } for(int n=0;n6;n++){//out: the chromX cout(*(pch_x+n)).x1 (*(pch_x+n)).x2 (*(pch_x+n)).x3endl;//((*pch_x)+1) } for(int i(0);i3;i++){ double x2=(*(pch_x+i)).x2;// print x2 coutx2endl; } cout(*(p+1+1)).Ch_ss1 (*(p+1)).Ch_ss1 (*(p+3)).Ch_ss1 endl;//sin cos for(int tem=0;temmn;tem++) { coutrand() rand()endl;} cout**madendl; int* ad=*mad; ad=fun(/*mad[1][2],*/ad); Chrom_x f1(pi/4,0.314159); f1.Calculate(); f1.SHOW(); //f1.FAI2Ch(); f1.SHOW(); } /*class shape { public: shape(); ~shape(); virtual char* getclassname(); int getnumberofshapes(); private: static int numberofshapes; }; int shape::numberofshapes = 0; shape::shape() { numberofshapes++; } shape::~shape() { numberofshapes--; } shape::getnumberofshapes() { return numberofshapes; } char* shape::getclassname() { return NULL; } class circle : public shape { public: // same stuff goes here as in original circle // add some calls here circle(const double* cert,double radius) { coutthis\t center cert[this-getnumberofshapes()-1] radius radiusendl; } char* getclassname(); } ; // this member defines the virtual member of shape char* circle::getclassname() { return (char *)this; } void print( shape s) { cout s.getclassname()