Predatory genetic algorithms

FR Manby*, RL Johnston, C Roberts

*Corresponding author for this work

Research output: Contribution to journalArticle (Academic Journal)peer-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, Al-n and C-n clusters.

Original languageEnglish
Pages (from-to)111-122
Number of pages12
JournalMatch-Communications in mathematical and in computer chemistry
Issue number38
Publication statusPublished - Oct 1998

Keywords

  • OPTIMIZATION

Fingerprint

Dive into the research topics of 'Predatory genetic algorithms'. Together they form a unique fingerprint.

Cite this