In a few words, how do I:
- go from
double
to bits, - then do the crossover (one point, two point),
- and go back to
double
I can develop the roulette wheel selection. What I don't see clearly is how mixing two doubles might give me a "better" double. Is that completely random? If the "fittest" of my doubles
and my "weakest" one combine, won't they produce a mid-point double
?
Elaboration: Shortest distance from a point to this curve
EDIT 1: Without slowing down the program too much.
EDIT 2: I considered using a byte[]
, but I don't know if that would go against the genetic algorithm part.