Genetic algorithms conformational search problems

Genetic algorithms are a class of robust optimizers that simulate the process of evolution in nature [50]. Their objective is to find optimal solutions for a given problem. Before discussing their application to conformational search problems, the basic ideas and methods of genetic algorithms are briefly described. Fig. 27 illustrates... 

J. C. Meza and M. L. Martinez,/. Comput. Chem., 15, 627 (1994). Direct Search Mediods for the Molecular Conformation Problem. J. C. Meza, R. S. Judson, T. R. Faulkner, and A. M. Treasurywala, y. Comput. Chem., 17,1142 (1996). A Comparison of a Direct Search Method and a Genetic Algorithm for Conformational Arching. 

In SAR research, this directed stochastic search makes genetic algorithms a very robust and universal tool for global optimization problem of conformation search, which can be expressed in a reasonably small set of parameters. 

---