Implementation of Adaptive Probability Generation Strategy for Genetic Algorithm

In Genetic Algorithm probability of crossover and mutation operation can be generated in an adaptive manner. Some experiment was done related to this and published in this article "https://www.ijcaonline.org/archives/volume175/number10/basak-2020-ijca-920572.pdf".

Currently Apache's API works on constant probability strategy. I would like to propose incorporation of rank based adaptive probability generation strategy as described in the mentioned article. This will improve the performance and robustness of the algorithm and would make this more suitable for use in higher dimensional problems like machine learning or deep learning.