On the Benefits of Random Memorizing in Local Evolutionary Search

Authors:
Hans-Michael Voigt;Jan Matti Lange
Affiliations:
-;-
Venue:
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Year:
1998

Citing 6
Cited 0

Numerical recipes in C (2nd ed.): the art of scientific computing

Numerical recipes in C (2nd ed.): the art of scientific computing
A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives

Journal of the ACM (JACM)
On the Adaptation of Arbitrary Normal Mutation Distributions in Evolution Strategies: The Generating Set Adaptation

Proceedings of the 6th International Conference on Genetic Algorithms
A Preliminary Investigation into Directed Mutations in Evolutionary Algorithms

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Fuzzy Recombination for the Breeder Genetic Algorithm

Proceedings of the 6th International Conference on Genetic Algorithms
Toward a theory of evolution strategies: Some asymptotical results from the (1,+ λ)-theory

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the calibration of laser induced plasma spectrometers robust and efficient local search methods are required. Therefore, several local optimizers from nonlinear optimization, random search and evolutionary computation are compared. It is shown that evolutionary algorithms are superior with respect to reliability and efficiency. To enhance the local search of an evolutionary algorithm a new method of random memorizing is introduced. It leads to a substantial gain in efficiency for a reliable local search.