This is a function that initializes and sets the parameters of the algorithm.
It generates a list of parameters, to be used with the malschains function.
malschains.control(
popsize = 50,
ls = "cmaes",
istep = 500,
effort = 0.5,
alpha = 0.5,
optimum = -Inf,
threshold = 1e-08,
lsOnly = FALSE,
lsParam1 = 0,
lsParam2 = 0
)returns a list with the parameter names and values of the supplied parameters.
The population size of the evolutionary algorithm.
The local search method. Currently implementend are cmaes, sw, simplex, and ssw.
Usually, the cmaes local search strategy will give good results. However, it does not scale well with the problem size.
So, if performance is needed, the sw strategy is a better choice. If the problem is high-dimensional, the ssw strategy is promising,
which selects randomly 20% of the variables for optimization.
The number of iterations of the local search. I.e., if the local search is started or re-started on an individual, it will be executed for an
istep number of iterations.
This parameter depends on the local search used. For cmaes, usually an istep of 300 is
a good choice. For the other local search methods, an istep of 100 performs better.
A value between 0 and 1 which gives the ratio between the amount of evaluations that are used for the local search and
for the evolutionary algorithm, respectively. A higher effort means more evaluations for the evolutionary algorithm. So, if exploration
of the search space is more important than finding local optima, effort is to be chosen higher.
The alpha parameter from crossover BLX-alpha. A lower value (< 0.3) reduces diversity, a higher value increases diversity.
The optimum to achieve. The default is zero, as in many minimization problems a value of zero can be considered optimal.
A threshold which defines for the local search how much improvement is considered as no improvement. If this value is chosen too low (zero), then the local search will usually always try to improve on the best individual, even if it is already located very close to a local optimum.
Apply only the local search algorithm, and not MA-LS-Chains
First (optional) parameter. Currently, if local search is cmaes, this is the parameter popsize/lambda of cmaes. If it is not set or not positive, cmaes will calculate this automatically using a heuristic.
Second (optional) parameter. Currently, if local search is cmaes, this is the parameter parentssize/mu of cmaes. If it is not set, not positive, or not smaller lambda, cmaes will calculate this automatically using a heuristic.
Molina, D., Lozano, M., Sánchez, A.M., Herrera, F. Memetic algorithms based on local search chains for large scale continuous optimisation problems: MA-SSW-Chains (2011) Soft Computing, 15 (11), pp. 2201-2220.
Molina, D., Lozano, M., García-Martínez, C., Herrera, F. Memetic algorithms for continuous optimisation based on local search chains (2010) Evolutionary Computation, 18 (1), pp. 27-63.