Predatory Genetic algorithms

F. R. Manby*, R. L. Johnston, C. Roberts

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

25 Citations (Scopus)

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 languageEnglish
Pages (from-to)111-122
Number of pages12
JournalMatch
Volume38
Publication statusPublished - 1 Dec 1998

ASJC Scopus subject areas

  • Chemistry(all)
  • 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