Abstract
Genetic algorithms (GAs) have excelled in locating global minima, but in many instances other low-lying minima are sought. A method is introduced here which has the analogue of predation in natural evolution, and which is linked to a variational theory on a metric space. The method is used to find the two most stable structures of small Morse, Aln and Cn clusters.
| Original language | English |
|---|---|
| Pages (from-to) | 111-122 |
| Number of pages | 12 |
| Journal | Match |
| Volume | 38 |
| Publication status | Published - 1 Dec 1998 |
ASJC Scopus subject areas
- General Chemistry
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Predatory Genetic algorithms'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver