Minimization of Molecular Potential Energy Function Using newly developed Real Coded Genetic Algorithms
DOI:
https://doi.org/10.11121/ijocta.01.2012.0044Abstract
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 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. 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.
Downloads
References
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). CrossRef
Wales, D.J. and Scheraga, H.A., Global optimization of clusters, crystals and biomolecules. Science, 285 (5432), 1368–1372 (1999). CrossRef
Floudas, C. A., Klepeis, J. L. and Pardalos, Global optimization approaches in protein folding and peptide docking. In: M. Farach-Colton, F. S. Roberts, M. Vingron and M. Waterman, eds., Mathematical Support for Molecular Biology. DIMACS Series (47). American Mathematical Society, 141-171 (1999).
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). CrossRef
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). CrossRef
Barbosa, H., Lavor, C. and Raupp, F., A GA-Simplex Hybrid Algorithm for Global Minimization of Molecular Potential Energy Functions. Annals of Operations Research, 138 (1), 189-202 (2005). CrossRef
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). CrossRef
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].
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). CrossRef
Deep, K. and Thakur, M., A new mutation operator for real coded genetic algorithms, Applied Mathematics and Computation, 193 (1), 211–230 (2007). CrossRef
Deep, K. and Thakur, M., A new crossover operator for real coded genetic algorithms. Applied Mathematics and Computation, 188 (1), 895–912 (2007). CrossRef
Hanjawar cellular. (2020). Hanjawar cellular - Pusat Komputer Dan Gadget Terlengkap Dan Terkini. [online] Available at: http://www.hanjawarcell.web.id/ [Accessed 13 Jan. 2020].
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). CrossRef
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).
Downloads
Published
How to Cite
Issue
Section
License
Articles published in IJOCTA are made freely available online immediately upon publication, without subscription barriers to access. All articles published in this journal are licensed under the Creative Commons Attribution 4.0 International License (click here to read the full-text legal code). This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available.
Under the Creative Commons Attribution 4.0 International License, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles in IJOCTA, so long as the original authors and source are credited.
The readers are free to:
- Share — copy and redistribute the material in any medium or format
- Adapt — remix, transform, and build upon the material
- for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
under the following terms:
- Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
This work is licensed under a Creative Commons Attribution 4.0 International License.
