realmut1.h

多目标遗传算法的源代码

/* This is the module used to formulate the mutation routine*/

void real_mutate(population *new_pop_ptr);

void real_mutate(population *new_pop_ptr)
{
int i,j,r;
float rnd,delta,indi,*ptr,*ptr1,deltaq;
float y,yl,yu,val,xy;

for(j = 0;j < popsize;j++)
{
for (i = 0;i < nvar; i++)
{
rnd = randomperc();

/*For each variable find whether to do mutation or not*/
if(rnd <= pmut_r)
{
y = new_pop_ptr->ind[j].xreal[i];
yl = lim_r[i][0];
yu = lim_r[i][1];

if(y > yl)
{
/*Calculate delta*/

if((y-yl) < (yu-y))
delta = (y - yl)/(yu - yl);
else
delta = (yu - y)/(yu-yl);

rnd = randomperc();

indi = 1.0/(dim +1.0);

if(rnd <= 0.5)
{
xy = 1.0-delta;
val = 2*rnd+(1-2*rnd)*(pow(xy,(dim+1)));
deltaq = pow(val,indi) - 1.0;
}
else
{
xy = 1.0-delta;
val = 2.0*(1.0-rnd)+2.0*(rnd-0.5)*(pow(xy,(dim+1)));
deltaq = 1.0 - (pow(val,indi));
}

/*Change the value for the parent */
// *ptr = *ptr + deltaq*(yu-yl);
// Added by Deb (31/10/01)
y = y + deltaq * (yu-yl);
if (y < yl) y=yl;
if (y > yu) y=yu;
new_pop_ptr->ind[j].xreal[i] = y;
}
else // y == yl
{
xy = randomperc();
new_pop_ptr->ind[j].xreal[i] = xy*(yu - yl) + yl;
}
nmut++;
}
// ptr++;
}
}
return ;
}