Prev: compute cos(x) using taylor series
Next: Using waitbar while calling a time consuming function in a GUI
From: Marcus on 9 Mar 2010 07:55
Just getting started with GA using a constrained two variable function; 0 < x1 < 180, 0 < x2 < 6. The default 'Adaptive Feasible' mutation operator sets the mutation step for both of these variables initially to 1, so that x2 finds a good value but x1 is not able to explore the whole domain. I find the documentation on this operator pretty lacking - any recommendations?

Cheers!
 | 
Pages: 1
Prev: compute cos(x) using taylor series
Next: Using waitbar while calling a time consuming function in a GUI