On the benefits of random memorizing in local evolutionary search

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Voigt, H. M., & Lange, J. M. (1998). On the benefits of random memorizing in local evolutionary search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1424, pp. 255–262). Springer Verlag. https://doi.org/10.1007/3-540-69115-4_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free