Abstract
This paper presents an experimental evaluation of evolutionary pattern search algorithms (EPSAs). This analysis provides a first step towards understanding of how the broad theory of EPSAs needs to be applied to define practical EPSAs. We evaluate the effect that different types of mutation operators have on the frequency with which an EPSA could update its step length, as well as the effects of different crossover rates. Additionally, we describe a stopping rule for EPSAs that empirically terminates them near a stationary point. The empirical performance of EPSAs confirms that they can perform nonlocal optimization on standard test optimization problems.
Preview
Unable to display preview. Download preview PDF.
References
D. H. Ackley, A Connectionist Machine for Genetic Hillclimbing, Kluwer Academic Publishers, Boston, 1987.
J. J. Dennis and R. B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, 1983.
L. J. Eshelman, The CHC adaptive search algorithm: How to have a safe search when engaging in nontraditional genetic recombination, in Foundations of Genetic Algorithms, G. J. Rawlins, ed., Morgan-Kaufmann, 1991, pp. 265–285.
D. E. Goldberg and K. Deb, A comparative analysis of selection schemes used in genetic algorithms, in Foundations of Genetic Algorithms, G. J. Rawlins, ed., Morgan-Kauffmann, San Mateo, CA, 1991, pp. 301–315.
W. E. Hart, A generalized stationary point convergence theory for evolutionary algorithms, in Proc 7th Intl Conf on Genetic Algorithms (ICGA97), T. Baeck, ed., San Francisco, CA, 1997, Morgan Kaufmann, pp. 127–134.
-, A stationary point convergence theory for evolutionary algorithms, in Foundations of Genetic Algorithms 4, R. K. Belew and M. D. Vose, eds., San Fransico, CA, 1997, Morgan Kaufmann Pub, Inc., pp. 325–342.
-, Stochastic pattern search and evolutionary algorithms, SIAM J Optimization, (1997). (submitted).
J. Meza and M. L. Martinez, Direct search methods for the molecular conformotion problem, Journal of Computational Chemistry, 15 (1994), pp. 627–632.
H. Mühlenbein, M. Schomisch, and J. Born, The parallel genetic algorithm as function optimizer, Parallel Computing, 17 (1991), pp. 619–632.
W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling, Numerical Recipies in C — The Art of Scientific Computing, Cambridge University Press, 1990.
R. Salomon, Performance degradation of genetic algorithms under coordinate rotation, in Proc. of the Fifth Annual Conf. on Evolutionary Programming, L. J. Fogel, P. Angeline, and T. Bäck, eds., Cambridge, Massachusetts, 1996, MIT Press, pp. 155–161.
V. Torczon, Multi-directional search: A direct search algorithm for parallel machines, Tech. Rep. TR90-7, Rice University, May 1989.
-, May 1996. Personal Communication.
-, On the convergence of pattern search methods, SIAM J Optimization, 7 (1997), pp. 1–25.
M. Wright, Direct search methods: Once scorned, now respected, Tech. Rep. 96-4-01, Computing Science Research Center, AT&T Bell Laboratories, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hart, W.E. (1998). On the application of evolutionary pattern search algorithms. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds) Evolutionary Programming VII. EP 1998. Lecture Notes in Computer Science, vol 1447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0040783
Download citation
DOI: https://doi.org/10.1007/BFb0040783
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64891-8
Online ISBN: 978-3-540-68515-9
eBook Packages: Springer Book Archive