00001 #include <stdlib.h>
00002
00003 #if !defined ( __GRADE__ )
00004 #include "grade.h"
00005 #endif
00006
00007
00008
00009 #if defined ( __PARALLEL__ )
00010 #include "parallel.c"
00011 #endif
00012
00013 grade::grade ( void )
00014 {
00015
00016
00017
00018
00019
00020
00021 ActualSize=0;
00022 generation=0;
00023 fitness_call=0;
00024 PoolSize=0;
00025 SelectedSize=0;
00026 Force=NULL;
00027 mutagen=NULL;
00028 bsf=NULL;
00029 bsf_value=MinDouble;
00030 bsf_birth=0;
00031 btg=0;
00032 btg_value=MinDouble;
00033 }
00034
00035 grade::~grade ( void )
00036 {
00037 }
00038
00039
00040
00041 void grade::new_point ( double* p )
00042 {
00043 int i;
00044
00045 for ( i=0; i<F->Dim; i++ )
00046 {
00047 p[i] = RND.give_double ( F->Domain[i][0], F->Domain[i][1] );
00048 }
00049 }
00050
00051 void grade::configuration ( void )
00052 {
00053 fprintf ( stderr, "\n GRADE algorithm is used: \n\n" ) ;
00054 fprintf ( stderr, " pool_rate: %ld \n", pool_rate ) ;
00055 fprintf ( stderr, " radioactivity: %f \n", radioactivity ) ;
00056 fprintf ( stderr, " cross_limit: %f \n", cross_limit ) ;
00057
00058 if ( !F ) {
00059 fprintf (stderr,"\n\n You must allocate obj. function first! Exit.");
00060 fprintf (stderr,"\n grade::configuration (file %s, line %d).\n",
00061 __FILE__,__LINE__);
00062 exit ( 1 ) ;
00063 }
00064
00065 PoolSize = 2*pool_rate*F->Dim;
00066 SelectedSize = pool_rate*F->Dim;
00067
00068 long i;
00069 mutagen = new double [F->Dim];
00070 for ( i=0; i<F->Dim; i++ )
00071 {
00072 mutagen[i] = (F->Domain[i][1]-F->Domain[i][0])/mutagen_rate;
00073 if ( F->Domain[i][2]>mutagen[i] ) mutagen[i] = F->Domain[i][2];
00074 }
00075 RND.init();
00076 }
00077
00078 #if !defined ( __PARALLEL__ )
00079 void grade::EVALUATE_GENERATION ( long start )
00080 {
00081 long i, k;
00082
00083
00084 for ( i=start*SelectedSize; i<ActualSize; i++ )
00085 {
00086 if ( F->Return_to_domain )
00087 {
00088 for ( k=0; k<F->Dim; k++ )
00089 {
00090 if ( CH[i][k]<F->Domain[k][0] ) CH[i][k]=F->Domain[k][0];
00091 if ( CH[i][k]>F->Domain[k][1] ) CH[i][k]=F->Domain[k][1];
00092 }
00093 }
00094 Force[i] = F->value ( CH[i] );
00095 fitness_call++;
00096 if ( Force[i]>btg_value )
00097 {
00098 btg_value = Force[i];
00099 btg=i;
00100 btg_or = origine[i];
00101 }
00102 }
00103 if ( btg_value>bsf_value )
00104 {
00105 memcpy ( bsf, CH[btg], F->Dim*sizeof ( double ) );
00106 bsf_value = btg_value;
00107 bsf_birth = fitness_call;
00108
00109 }
00110 }
00111 #endif
00112
00113 void grade::SELECT ( void )
00114 {
00115 long i1, i2, dead, last;
00116
00117 while ( ActualSize > SelectedSize )
00118 {
00119 i1 = RND.give_long ( 0,ActualSize-1 );
00120 i2 = RND.give_long ( 1,ActualSize-1 );
00121 if ( i1==i2 ) i2--;
00122 if ( Force[i1] >= Force[i2] ) dead = i2;
00123 else dead = i1;
00124 last = ActualSize-1;
00125 memcpy( CH[dead], CH[last], F->Dim*sizeof(double) );
00126 if ( btg==last ) btg=dead;
00127 Force[dead] = Force[last];
00128 origine[dead] = origine[last];
00129 ActualSize--;
00130 }
00131 }
00132
00133 void grade::MUTATE ( void )
00134 {
00135 double p, *x;
00136 long i, j, index;
00137
00138 for ( i=0; i<SelectedSize; i++ )
00139 {
00140 if ( ActualSize == PoolSize ) break;
00141 p = RND.give_double ( 0.0, 1.0 );
00142 if ( p<=radioactivity )
00143 {
00144 index = RND.give_long ( 0,SelectedSize-1 );
00145 mutation_rate=RND.give_double ( 0.0, cross_limit );
00146 x = new double[F->Dim] ;
00147 new_point ( x ) ;
00148 for ( j=0; j<F->Dim; j++ )
00149 {
00150 CH[ActualSize][j] = CH[index][j]+mutation_rate*( x[j]-CH[index][j] );
00151 }
00152 delete [] x;
00153 origine[ActualSize] = 2;
00154 ActualSize++;
00155 }
00156 }
00157 }
00158
00159 void grade::CROSS ( void )
00160 {
00161 long i1,i2,i3,j ;
00162 long direction = 1;
00163 while ( ActualSize < PoolSize )
00164 {
00165 i1 = RND.give_long( 0,SelectedSize-1 );
00166 i2 = RND.give_long( 1,SelectedSize-1 );
00167 if ( i1==i2 ) i2--;
00168 i3 = i2;
00169 cross_rate = RND.give_double( 0.0, 1.0 );
00170 if ( Force[i1]>Force[i2] ) {
00171 i3 = i1;
00172 direction=-1;
00173 }
00174
00175 for ( j=0 ; j<F->Dim ; j++ )
00176 CH[ActualSize][j] = CH[i3][j]+cross_rate*(double)(direction)*( CH[i2][j]-CH[i1][j] ) ;
00177 origine[ActualSize] = 1;
00178 ActualSize++;
00179 }
00180 }
00181
00182 void grade::FIRST_GENERATION ( void)
00183 {
00184 long i;
00185
00186 Force = new double [PoolSize];
00187 origine = new long [PoolSize];
00188 allocm ( PoolSize, F->Dim, CH ) ;
00189 for ( i=0; i<PoolSize; i++ )
00190 {
00191 new_point ( CH[i] ) ;
00192 origine[i] = 0;
00193 }
00194 bsf = new double [F->Dim];
00195 ActualSize = PoolSize;
00196 EVALUATE_GENERATION ( 0 );
00197 SELECT ();
00198
00199 }
00200
00201 void grade::clear_pool ( void )
00202 {
00203 if ( Force ) delete [] Force;
00204 if ( bsf ) delete [] bsf;
00205 if ( mutagen ) delete [] mutagen;
00206 if ( origine ) delete [] origine;
00207 }
00208
00209
00210
00211 long grade::to_continue ()
00212 {
00213 if ( fitness_call > fitness_calls_limit ) return 0;
00214 if ( F->optimum ) if ( *F->optimum-bsf_value<=F->precision ) return 0;
00215 return 1;
00216 }
00217
00218
00219
00220 void grade::run ( double *assessment )
00221 {
00222 long stop=0 ;
00223
00224 ceraf=1;
00225 configuration ();
00226
00227
00228 FIRST_GENERATION ();
00229
00230 while ( !stop )
00231 {
00232 MUTATE ();
00233 CROSS ();
00234 EVALUATE_GENERATION ( 1 );
00235 SELECT ();
00236
00237 if ( !to_continue () ) stop=1;
00238 generation++;
00239 }
00240
00241
00242
00243 F->user_evaluate ( bsf );
00244 if ( assessment ) *assessment = bsf_value/(double)fitness_call;
00245
00246
00247 clear_pool ();
00248 }