On the application of evolutionary pattern search algorithms
This paper presents an experimental evaluation of evolutionary pattern search algorithms (EPSAs). Our experimental evaluation of EPSAs indicates that EPSAs can achieve similar performance to EAs on challenging global optimization problems. Additionally, we describe a stopping rule for EPSAs that reliably terminated them near a stationary point of the objective function. The ability for EPSAs to reliably terminate near stationary points offers a practical advantage over other EAs, which are typically stopped by heuristic stopping rules or simple bounds on the number of iterations. Our experiments also illustrate how the rate of the crossover operator can influence the tradeoff between the number of iterations before termination and the quality of the solution found by an EPSA.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 519125
- Report Number(s):
- SAND-97-0486C; CONF-970740-1; CONF-980330-; ON: DE97004389; TRN: 97:004988
- Resource Relation:
- Conference: 7. international conference on genetic algorithms, Lansing, MI (United States); San Diego, CA (United States), 19 Jul 1997; 25-27 Mar 1998; Other Information: PBD: Feb 1997
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Performance Analysis of Evolutionary Pattern Search with Generalized Mutation Steps
Comparing Evolutionary Programs and Evolutionary Pattern Search Algorithms: A Drug Docking Application