Buradasınız

Minimization of Molecular Potential Energy Function Using newly developed Real Coded Genetic Algorithms

Journal Name:

Publication Year:

AMS Codes:

Abstract (Original Language): 
The problem of finding the global minimum of molecular potential energy function is very challenging for algorithms which attempt to determine global optimal solution. The principal difficulty in minimizing the molecular potential energy function is that the number of local minima increases exponentially with the size of the molecule. The global minimum of the potential energy of a molecule corresponds to its most stable conformation, which dictates the majority of its properties. In this paper the efficiency of four newly developed real coded genetic algorithms is tested on the molecular potential energy function and their supremacy is established over other existing algorithms. The minimization of the function is performed on an independent set of internal coordinates involving only torsion angles. Computational results with up to 100 degrees of freedom are presented.
51
58

REFERENCES

References: 

[1] Troyer, J.M. and Cohen, F.E., Simplified
Models for Understanding and Predicting
Protein Structure. Reviews in Computational
Chemistry (Wiley-VCH), 2, 57–80 (1991).
[2] Wales, D.J. and Scheraga, H.A., Global
optimization of clusters, crystals and
biomolecules. Science, 285 (5432), 1368–1372
(1999).
[3] Floudas, C. A., Klepeis, J. L. and Pardalos,
Global optimization approaches in protein
folding and peptide docking. In: M. FarachColton,
F. S. Roberts, M. Vingron and M.
Waterman, eds., Mathematical Support for
Molecular Biology. DIMACS Series (47).
American Mathematical Society, 141-171
(1999).
[4] Pardalos, P.M., Shalloway, D. and Xue, G.L.,
Optimization Methods for Computing Global
Minima of Nonconvex Potential Energy
Functions. Journal of Global Optimization, 4
(2), 117–133 (1994).
[5] Lavor, C. and Maculan, N., A Function to Test
Methods Applied to Global Minimization of
Potential Energy of Molecules. Numerical
Algorithms, 35 (2-4), 287–300 (2004).
[6] Barbosa, H., Lavor, C. and Raupp, F., A GASimplex
Hybrid Algorithm for Global
Minimization of Molecular Potential Energy
Functions. Annals of Operations Research,
138 (1), 189-202 (2005)
[7] Drazic, M., Lavour, C., Maculan, N., and
Mladenovic, N., A Continuous Neighborhood
Search Heuristic for Finding the Three
Dimensional Structure of a Molecule.
European Journal of Operational Research,
185 (3), 1265-1273 (2008).
[8] Shashi, Deep, K., Singh, K.P. and Katiyar,
V.K., 2010. Global Optimization of Molecular
Potential Energy Function Using a Real
Coded Genetic Algorithm [online]. The 2010
International Conference on Bioinformatics &
Computational Biology (BIOCOMP'10).
Available from:ftp://amd64gcc.dyndns.org/
WORLDCOMP10/2010%20Papers/BIC3593.
pdf [Accessed 12 Feb 2011].
[9] Hedar, A.R., Ali, A.F. and Hamid, T.H.A.,
Genetic Algorithm and Tabu search based
methods for molecular 3D-structure prediction.
Numerical Algebra Control and Optimization,
1(1), 191-209 (2011).
[10] Deep, K. and Thakur, M., A new mutation
operator for real coded genetic algorithms,
Applied Mathematics and Computation, 193
(1), 211–230 (2007).
[11] Deep, K. and Thakur, M., A new crossover
operator for real coded genetic algorithms.
Applied Mathematics and Computation, 188
(1), 895–912 (2007).
[12] Bharti, Controlled random search technique
and their applications. Thesis (PhD).
University of Roorkee, India (1994).
[13] Mohan, C. and Nguyen, H.T., A controlled
random search technique incorporating the
simulating annealing concept for solving
integer and mixed integer global optimization
problems. Computational Optimization and
Applications, 14 (1), 103–132 (1999).
[14] Bansal, J.C., Shashi, Deep, K. and Katiyar,
V.K., Minimization of molecular potential
energy function using particle swarm
optimization. International Journal of Applied
Mathematics and Mechanics, 6 (9), 1-9 (2010).

Thank you for copying data from http://www.arastirmax.com