Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Buchtitelbild

2016 | OriginalPaper | Buchkapitel

1. A Simplex Nelder Mead Genetic Algorithm for Minimizing Molecular Potential Energy Function

verfasst von : Ahmed Fouad Ali, Aboul-Ella Hassanien

Erschienen in: Applications of Intelligent Optimization in Biology and Medicine

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, we propose a new algorithm, namely genetic Nelder Mead algorithm (GNMA), for minimizing molecular potential energy function. The minimization of molecular potential energy function problem is very challenging, since the number of local minima grows exponentially with the molecular size. The new algorithm combines a global search genetic algorithm with a local search Nelder-Mead algorithm in order to search for the global minimum of molecular potential energy function. Such hybridization enhances the power of the search technique by combining the wide exploration capabilities of genetic algorithm and the deep exploitation capabilities of Nelder-Mead algorithm. The proposed algorithm can reach the global or near-global optimum for the molecular potential energy function with up to 200\(^\circ \) of freedom. We compared the proposed GNMA results with the results of 9 existing algorithms from the literature. Experimental results show efficiency of the proposed GNMA to have more accurate solutions with low computational costs.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Nächstes Kapitel A Survey of Metaheuristics Methods for Bioinformatics Applications
Literatur
1.
B̈ack, T., Fogel, D.B., Michalewicz, T.: Evolutionary Computation: Basic Algorithms and Operators. Institute of Physics Publishing, Bristol (2000)
2.
Bansal, J.C., Shashi, Deep, K., Katiyar, V.K.: Minimization of molecular potential energy function using particle swarm optimization. Int. J. Appl. Math. Mech. 6(9), 1–9 (2010)
3.
Barbosa, H.J.C., Lavor, C., Raupp, F.M.: A GA-simplex hybrid algorithm for global minimization of molecular potential energy function. Ann. Oper. Res. 138, 189–202 (2005)MathSciNetCrossRefMATH
4.
Birru, H.K., Chellapilla, K., Rao, S.S.: Local search operators in fast evolutionary programming. In: Proceedings of the 1999 Congress on Evolutionary Computation, vol. 2, pp. 1506–1513, July 1999
5.
Cheng, C.T., Ou, C.P., Chau, K.W.: Combining a fuzzy optimal model with a genetic algorithm to solve multiobjective rainfallrunoff model calibration. J. Hydrol. 268(14), 72–86 (2002)CrossRef
6.
Deep, K., Thakur, M.: A new mutation operator for real coded genetic algorithms. Appl. Math. Comput. 193(1), 211–230 (2007)MathSciNetCrossRefMATH
7.
Deep, K., Thakur, M.: A new crossover operator for real coded genetic algorithms. Appl. Math. Comput. 188(1), 895–912 (2007)MathSciNetCrossRefMATH
8.
Deep, K., Shashi, Katiyar, V.K., Nagar, A.K.: Minimization of molecular potential energy function using newly developed real coded genetic algorithms. Int. J. Optim. Control: Theor. Appl. (IJOCTA) 2(1), 51–58 (2012)
9.
De Jong, K.A.: Genetic algorithms: a 10 year perspective. In: International Conference on Genetic Algorithms, pp. 169–177 (1985)
10.
Dra\(\breve{{{\rm z}}}\)i\(\acute{{{\rm c}}}\), M., Lavor, C., Maculan, N., Mladenovi\(\acute{{{\rm c}}}\), N.: A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule. Eur. J. Oper. Res. 185, 1265–1273 (2008)
11.
Floudas, C.A., Klepeis, J.L., Pardalos, P.M.: Global optimization approaches in protein folding and peptide docking, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society (1999)
12.
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
13.
Gong, M., Jiao, L., Zhang, L.: Baldwinian learning in clonal selection algorithm for optimization. Inf. Sci. 180, 1218–1236 (2010)CrossRef
14.
Hedar, A., Ali, A.F.: Tabu search with multi-level neighborhood structures for high dimensional problems. Appl. Intell. 37, 189–206 (2012)CrossRef
15.
Hedar, A., Ali, A.F., Hassan, T.: Genetic algorithm and tabu search based methods for molecular 3D-structure prediction. Int. J. Numer. Algebra, Control Optim. (NACO) (2011)
16.
Hedar, A., Ali, A.F., Hassan, T.: Finding the 3D-structure of a molecule using genetic algorithm and tabu search methods. In: Proceedings of the 10th International Conference on Intelligent Systems Design and Applications (ISDA2010), Cairo, Egypt (2010)
17.
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
18.
Kimura, S., Konagaya, A.: High dimensional function optimization using a new genetic local search suitable for parallel computers. In: Proceedings of IEEE International Conference on Systems, Man and Cybernetics, vol. 1, pp. 335–342, Oct 2003
19.
KoroS̃ec, P., S̃ilc, J., Filipic, B.: The differential ant-stigmergy algorithm. Inf. Sci. 192, 82–97 (2012)CrossRef
20.
Kova\(\breve{{{\rm c}}}\)evi\(\acute{{{\rm c}}}\)-Vuj\(\breve{{{\rm c}}}\)i\(\acute{{{\rm c}}}\), V., \(\check{{{\rm c}}}\)angalovi\(\acute{{{\rm c}}}\), M., Dra\(\breve{{{\rm z}}}\)i\(\acute{{{\rm c}}}\), M., Mladenovi\(\acute{{{\rm c}}}\), N.: VNS-based heuristics for continuous global optimization. In: Hoai An, L.T., Tao, P.D. (eds.) Modelling, Computation and Optimization in Information Systems and Management Sciences, pp. 215–222. Hermes Science Publishing Ltd. (2004)
21.
Krasnogor, N., Smith, J.E.: A tutorial for competent memetic algorithms: model, taxonomy, and design issue. IEEE Trans. Evol. Comput. 9(5), 474–488 (2005)CrossRef
22.
Liu, B., Wang, L., Jin, Y.H.: An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Trans. Syst. Man Cybern. 37(1), 18–27 (2007)CrossRef
23.
Molina, D., Lozano, M., Herrera, F.: Memetic algorithm with local search chaining for large scale continuous optimization problems. In: Proceedings of the 2009 IEEE Congress on Evolutionary Computation, Trondheim, Norway, pp. 830–837 (2009)
24.
Muttil, N., Chau, K.W.: Neural network and genetic programming for modelling coastal algal blooms. Int. J. Env. Pollut. 28(34), 223–238 (2006)CrossRefMATH
25.
Neri, F., Tirronen, V.: Scale factor local search in differential evolution. Memetic Comput. J. 1(2), 153–171 (2009)CrossRef
26.
Pardalos, P.M., Shalloway, D., Xue, G.L.: Optimization methods for computing global minima of nonconvex potential energy function. J. Global Optim. 4, 117–133 (1994)MathSciNetCrossRef
27.
Pogorelov, A.: Geometry. Mir Publishers, Moscow (1987)
28.
Tirronen, V., Neri, F., Karkkainen, T., Majava, K., Rossi, T.: An enhanced memetic differential evolution in filter design for defect detection in paper production. Evol. Comput. J. 16(4), 529–555 (2008)CrossRef
29.
Wales, D.J., Scheraga, H.A.: Global optimization of clusters, crystals and biomolecules. Science 285, 1368–1372 (1999)CrossRef
30.
Wang, Y.X., Zhao, Z.D., Ren, R.: Hybrid particle swarm optimizer with tabu strategy for global numerical optimization. In: Proceedings of the 2007 Congress on Evolutionary Computation, pp. 2310–2316 (2007)
31.
Yang, Z., Tang, K., Yao, X.: Large scale evolutionary optimization using cooperative coevolution. Inf. Sci. 178, 2985–2999 (2008)MathSciNetCrossRefMATH
32.
Zhong, W., Liu, J., Xue, M., Jiao, L.: A multiagent genetic algorithm for global numerical optimization. IEEE Trans. Syst. Man Cybern. Part B 34(2), 1128–1141 (2004)CrossRef
Metadaten
Titel
A Simplex Nelder Mead Genetic Algorithm for Minimizing Molecular Potential Energy Function
verfasst von
Ahmed Fouad Ali
Aboul-Ella Hassanien
Copyright-Jahr
2016
Buch
Applications of Intelligent Optimization in Biology and Medicine

Print ISBN: 978-3-319-21211-1

Electronic ISBN: 978-3-319-21212-8

Copyright-Jahr: 2016

DOI
https://doi.org/10.1007/978-3-319-21212-8_1