Skip to main content

2020 | OriginalPaper | Buchkapitel

3. DNA Double-Helix and SQP Hybrid Genetic Algorithm

verfasst von : Jili Tao, Ridong Zhang, Yong Zhu

Erschienen in: DNA Computing Based Genetic Algorithm

Verlag: Springer Singapore

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

search-config
loading …

Abstract

By utilizing the global exploration of GA and local exploitation characteristics of sequential quadratic programming (SQP), a hybrid genetic algorithm (HGA) is proposed in this chapter for the highly nonlinear constrained functions. Thereafter, the theoretical analysis for the convergence of the HGA is then made. In the global exploration phase, the Hamming cliff problem is solved by DNA double-helix structure, and DNA computing inspired operators are introduced to improve the global searching capability of GA.

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!

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!

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!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
1.
Zurück zum Zitat Michalewicz, Z. 1994. Genetic Algorithms + Data Structures = Evolution Programs. Springer Science & Business Media. Michalewicz, Z. 1994. Genetic Algorithms + Data Structures = Evolution Programs. Springer Science & Business Media.
2.
Zurück zum Zitat Sivanandam, S, and S Deepa. 2008. Genetic Algorithms. In Introduction to genetic algorithms, 15–37. Springer. Sivanandam, S, and S Deepa. 2008. Genetic Algorithms. In Introduction to genetic algorithms, 15–37. Springer.
3.
Zurück zum Zitat Cukras, A.R., et al. 1999. Chess games: A model for RNA based computation. Biosystems 52 (1–3): 35–45.CrossRef Cukras, A.R., et al. 1999. Chess games: A model for RNA based computation. Biosystems 52 (1–3): 35–45.CrossRef
4.
5.
Zurück zum Zitat Adleman, L.M. 1994. Molecular computation of solutions to combinatorial problems. Science 266 (1): 1021–1024.CrossRef Adleman, L.M. 1994. Molecular computation of solutions to combinatorial problems. Science 266 (1): 1021–1024.CrossRef
6.
Zurück zum Zitat Ding, Y, and L Ren. 2000. DNA Genetic Algorithm For Design of the Generalized Membership-Type Takagi-Sugeno Fuzzy Control System. In 2000 IEEE international conference on systems, man and cybernetics. IEEE. Ding, Y, and L Ren. 2000. DNA Genetic Algorithm For Design of the Generalized Membership-Type Takagi-Sugeno Fuzzy Control System. In 2000 IEEE international conference on systems, man and cybernetics. IEEE.
7.
Zurück zum Zitat Yoshikawa, T, Furuhashi, and Y Uchikawa. 1997. The effects of combination of DNA coding method with pseudo-bacterial GA. In Proceedings of 1997 IEEE international conference on evolutionary computation (ICEC’97). IEEE. Yoshikawa, T, Furuhashi, and Y Uchikawa. 1997. The effects of combination of DNA coding method with pseudo-bacterial GA. In Proceedings of 1997 IEEE international conference on evolutionary computation (ICEC’97). IEEE.
8.
Zurück zum Zitat Tao, J.L., and N. Wang. 2007. Engineering, DNA computing based RNA genetic algorithm with applications in parameter estimation of chemical engineering processes. Computers & Chemical Engineering 31 (12): 1602–1618.CrossRef Tao, J.L., and N. Wang. 2007. Engineering, DNA computing based RNA genetic algorithm with applications in parameter estimation of chemical engineering processes. Computers & Chemical Engineering 31 (12): 1602–1618.CrossRef
9.
Zurück zum Zitat Yan, W., et al. 2006. A hybrid genetic algorithm-interior point method for optimal reactive power flow. IEEE Transactions on Power Systems 21 (3): 1163–1169.CrossRef Yan, W., et al. 2006. A hybrid genetic algorithm-interior point method for optimal reactive power flow. IEEE Transactions on Power Systems 21 (3): 1163–1169.CrossRef
10.
Zurück zum Zitat Myung, H., and J.H. Kim. 1996. Hybrid evolutionary programming for heavily constrained problems. Biosystems 38 (1): 29–43.CrossRef Myung, H., and J.H. Kim. 1996. Hybrid evolutionary programming for heavily constrained problems. Biosystems 38 (1): 29–43.CrossRef
11.
Zurück zum Zitat Gudla, P.K., and R. Ganguli. 2005. An automated hybrid genetic-conjugate gradient algorithm for multimodal optimization problems. Applied Mathematics Computation 167 (2): 1457–1474.MathSciNetCrossRef Gudla, P.K., and R. Ganguli. 2005. An automated hybrid genetic-conjugate gradient algorithm for multimodal optimization problems. Applied Mathematics Computation 167 (2): 1457–1474.MathSciNetCrossRef
12.
Zurück zum Zitat Başokur, A.T., I. Akca, and N.W. Siyam. 2007. Hybrid genetic algorithms in view of the evolution theories with application for the electrical sounding method. Geophysical Prospecting 55 (3): 393–406.CrossRef Başokur, A.T., I. Akca, and N.W. Siyam. 2007. Hybrid genetic algorithms in view of the evolution theories with application for the electrical sounding method. Geophysical Prospecting 55 (3): 393–406.CrossRef
13.
Zurück zum Zitat Tao, J., and N. Wang. 2008. DNA double helix based hybrid GA for the gasoline blending recipe optimization problem. Chemical Engineering Technology 31 (3): 440–451.CrossRef Tao, J., and N. Wang. 2008. DNA double helix based hybrid GA for the gasoline blending recipe optimization problem. Chemical Engineering Technology 31 (3): 440–451.CrossRef
14.
Zurück zum Zitat Ponsich, A., et al. 2008. Constraint handling strategies in Genetic Algorithms application to optimal batch plant design. Chemical Engineering and Processing 47 (3): 420–434.CrossRef Ponsich, A., et al. 2008. Constraint handling strategies in Genetic Algorithms application to optimal batch plant design. Chemical Engineering and Processing 47 (3): 420–434.CrossRef
15.
Zurück zum Zitat Rey Horn, J., N Nafpliotis, and D. E. Goldberg. 1994.A niched Pareto genetic algorithm for multiobjective optimization. In Proceedings of the first IEEE conference on evolutionary computation, IEEE world congress on computational intelligence. Citeseer. Rey Horn, J., N Nafpliotis, and D. E. Goldberg. 1994.A niched Pareto genetic algorithm for multiobjective optimization. In Proceedings of the first IEEE conference on evolutionary computation, IEEE world congress on computational intelligence. Citeseer.
16.
Zurück zum Zitat Chakraborty, U.K., and C.Z. Janikow. 2003. An analysis of Gray versus binary encoding in genetic search. Information Sciences 156 (3): 253–269.MathSciNetCrossRef Chakraborty, U.K., and C.Z. Janikow. 2003. An analysis of Gray versus binary encoding in genetic search. Information Sciences 156 (3): 253–269.MathSciNetCrossRef
17.
Zurück zum Zitat Tao, J., and Wang, N. 2007. DNA computing based RNA genetic algorithm with applications in parameter estimation of chemical engineering processes. Computers and Chemical Engineering 31 (12): 1602–1618. Tao, J., and Wang, N. 2007. DNA computing based RNA genetic algorithm with applications in parameter estimation of chemical engineering processes. Computers and Chemical Engineering 31 (12): 1602–1618.
18.
Zurück zum Zitat Athreya, K.B., and P. Ney. 1978. A new approach to the limit theory of recurrent Markov chains. Transactions of the American Mathematical Society 245: 493–501. MathSciNetCrossRef Athreya, K.B., and P. Ney. 1978. A new approach to the limit theory of recurrent Markov chains. Transactions of the American Mathematical Society 245: 493–501. MathSciNetCrossRef
19.
Zurück zum Zitat Rosenthal, J.S. 1995. Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo. Publications of the American Statistical Association 90 (430): 558–566.MathSciNetCrossRef Rosenthal, J.S. 1995. Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo. Publications of the American Statistical Association 90 (430): 558–566.MathSciNetCrossRef
20.
Zurück zum Zitat Deb, K. 2000. An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics Engineering 186 (2): 311–338.CrossRef Deb, K. 2000. An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics Engineering 186 (2): 311–338.CrossRef
Metadaten
Titel
DNA Double-Helix and SQP Hybrid Genetic Algorithm
verfasst von
Jili Tao
Ridong Zhang
Yong Zhu
Copyright-Jahr
2020
Verlag
Springer Singapore
DOI
https://doi.org/10.1007/978-981-15-5403-2_3