GENETIC ALGORITHMS IN CHEMISTRY

被引:220
作者
HIBBERT, DB
机构
[1] Department of Analytical Chemistry, University of New South Wales, Kensington, NSW 2033
关键词
D O I
10.1016/0169-7439(93)80028-G
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Genetic algorithms (GAs), a set of optimisation techniques, are so called after their similarity to evolutionary processes in nature. The algorithm's equivalents of genes and chromosomes are the unknown parameters of the problem and these may be mated and mutated to give better solutions. The major strengths of GAs, namely the ability to search a large parameter space with no initial guesses per se, no derivatives of the objective function and to cope with local minima, make it a candidate method for several areas of chemistry. Chemical problems that have been tackled by GAs are described and suggestions for new applications are made. Subroutines in object-oriented Pascal are given to set up a simple GA.
引用
收藏
页码:277 / 293
页数:17
相关论文
共 23 条
[1]  
Back T., 1991, 4TH P INT C GEN ALG, P2
[2]  
CARTWRIGHT HM, 1991, 4TH INT C GEN ALG SA, P108
[3]  
Davis L. E.., 1991, HDB GENETIC ALGORITH
[4]  
Dawkins Richard, 1986, BLIND WATCHMAKER
[5]  
De Jong K., 1975, PHD THESIS
[6]  
ESHELMAN L, 1991, F GENETIC ALGORITHMS
[7]  
ESHELMAN LJ, 1991, 4TH P INT C GEN ALG, P115
[8]   DESIGN OF MAGNETIC-RESONANCE EXPERIMENTS BY GENETIC EVOLUTION [J].
FREEMAN, R ;
WU, XL .
JOURNAL OF MAGNETIC RESONANCE, 1987, 75 (01) :184-189
[9]  
GEZELTER JD, 1987, J MAGN RESON, V75, P184
[10]  
Goldberg DE, 1989, GENETIC ALGORITHMS S