Riolo's GA algorithm in pseudo-code (see Sci. Am.)
while (NewPopNotFull) {
i=random()/PopSize;
j=random()/PopSize;
if (URand01() < 0.75)
Copy most fit of Pop[i],Pop[j] to NewPop
else
Copy least fit of Pop[i],Pop[j] to NewPop;
}
Pop = NewPop;
Previous slide
Next slide
Back to first slide
View graphic version