GENETIC ALGORITHMS, FLOATING POINT NUMBERS AND APPLICATIONS
Yorick Hardy, Willi-Hans Steeb, Ruedi Stoop · International Journal of Modern Physics C · 2005
The core in most genetic algorithms is the bitwise manipulations of bit strings. We show that one can directly manipulate the bits in floating point numbers. This means the main bitwise operations in genetic algorithm mutations and crossings are directly done inside the floating point number. Thus the interval under consideration does not need to be known in advance. For applications, we consider the roots of polynomials and finding solutions of linear equations.