No BSD License  

Highlights from
gaevolve

from gaevolve by Gabriele Lombardi
A simple but flexible tool to implement genetic algorithms

SMutateBit(num)
% The mutation function:
function nnum = SMutateBit(num)

% Selecting a position:
pos = ceil(rand*32);

% Flipping that bit:
change = bitset(0,pos);
nnum = bitxor(num,change);

Contact us at files@mathworks.com