Classical Canonical Evolutionary Algorithm

• Classical genetic algorithms used only binary strings.

• A classical problem was the ONEMAX, c-ones or count-ones problem: find the string where all bits were set to 1.

• sub fitness ($;$) {

• my $indi=shift;

• return scalar( grep( $_ == 1, split(//,$indi )));

• }

Notas: