Simple GA SGA for Single-Objective Problems

The single-objective optimization problem involving two decision variables that we have chosen for illustration is given by 

An example of two chromosomes (strings) generated using a random number generating code (if the random number, R, is between 0 and 0.5, use the binary, 0, while if 0.5 / 1.0, use the binary, 1) and with 

The binary substrings are mapped into following mapping rule  

Clearly, the larger the value of kmng, the larger are the number of intervals in ], and the higher is the accuracy of search. In 

The actual methodology used for this is the roulette wheel selection. We divide the range of random number, R, into Np zones 0 / Pj  

---