Predatory genetic algorithms

FR Manby; RL Johnston; C Roberts

Predatory genetic algorithms

FR Manby^*
, RL Johnston
, C Roberts

^*Corresponding author for this work

School of Chemistry

Research output: Contribution to journal › Article (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 language	English
Pages (from-to)	111-122
Number of pages	12
Journal	Match-Communications in mathematical and in computer chemistry
Issue number	38
Publication status	Published - Oct 1998

Keywords

OPTIMIZATION

Handle.net

Persistent link

Cite this

@article{ecbc9dc84a664ed48e4a8fefbc93d270,

title = "Predatory genetic algorithms",

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.",

keywords = "OPTIMIZATION",

author = "FR Manby and RL Johnston and C Roberts",

year = "1998",

month = oct,

language = "English",

pages = "111--122",

journal = "Match-Communications in mathematical and in computer chemistry",

issn = "0340-6253",

publisher = "University of Kragujevac, Faculty of Science",

number = "38",

}

TY - JOUR

T1 - Predatory genetic algorithms

AU - Manby, FR

AU - Johnston, RL

AU - Roberts, C

PY - 1998/10

Y1 - 1998/10

N2 - 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.

AB - 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.

KW - OPTIMIZATION

M3 - Article (Academic Journal)

SN - 0340-6253

SP - 111

EP - 122

JO - Match-Communications in mathematical and in computer chemistry

JF - Match-Communications in mathematical and in computer chemistry

IS - 38

ER -

Predatory genetic algorithms

Abstract

Keywords

Handle.net

Fingerprint

Cite this