"Deb and Agrawal suggested a polynomial mutation operator with a user-defined index parameter (ηm)...
They also found that a value ηm ∈ [20,100] is adequate in most problems that they tried."
I was trying SBX and polynomial mutation operators with ηm ∈ [20,100] to minimizing the sphere function with 20 genes and the GA founds best solutions around 1e-3. When I used small values of ηm, like ηm ∈ [0,1] and the GA founds best solutions around 1e-13. There's any problem by using values for ηm very smaller than the set recommended by Deb?
I'm using the eaMuPlusLambda algorithm.
Thank in advance!
Deb, K. and ayan Deb, 2014. “Analysing mutation schemes for real-parameter genetic algorithms”. International Journal
of Artificial Intelligence and Soft Computing, Vol. 4, No. 1, p. 1. doi:10.1504/ijaisc.2014.059280.