Application of a simple binary genetic algorithm to a noiseless testbed benchmark

One of the earliest evolutionary computation algorithms, the genetic algorithm, is applied to the noise-free BBOB 2009 testbed. It is adapted to the continuous domain by increasing the number of bits encoding each variable, un-til a desired resolution is possible to achieve. Good results and scaling are obtained for separable functions, but poor performance is achieved on the other functions, particularly ill-conditioned functions. Overall running times remain fast throughout