Skip to main content

GAHC: Hybrid Genetic Algorithm

  • Chapter

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 14))

This paper introduces a novel improved evolutionary algorithm, which combines genetic algorithms and hill climbing. Genetic Algorithms (GA) belong to a class of well established optimization meta-heuristics and their behavior are studied and analyzed in great detail. Various modifications were proposed by different researchers, for example modifications to the mutation operator. These modifications usually change the overall behavior of the algorithm. This paper presents a binary GA with a modified mutation operator, which is based on the well-known Hill Climbing Algorithm (HCA). The resulting algorithm, referred to as GAHC, also uses an elite tournament selection operator. This selection operator preserves the best individual from the GA population during the selection process while maintaining the positive characteristics of the standard tournament selection. This paper discusses the GAHC algorithm and compares its performance with standard GA.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goldberg, D. E., 1989,Genetic Algorithms in Search, Optimization and Machine Learning.Boston, MA: Addison—Wesley

    Google Scholar 

  2. Mitchell, M. and Holland, J. H., 1994, When Will a Genetic Algorithm Outperform Hill Climb ing? In J. D. Cowan, G. Tesauro, and J. Alspector (Eds.),Advances in Neural Information Processing Systems 6.San Mateo, CA: Morgan Kaufmann

    Google Scholar 

  3. Halim, C., 2006, Developing Combined Genetic Algorithm — Hill-Climbing Optimization Method for Area Traffic Control,Journal of Transportation Engineering,Volume 132, Issue Number 8, pp. 663–671

    Google Scholar 

  4. Matousek, R., 1995,GA (GA with HC Mutation) — Implementation and Application (in Czech),Master thesis, Brno University of Technology, Brno, Czech Republic

    Google Scholar 

  5. Bednar, J. and Matousek, R.,Elite Tournament Selection,in the P. Osmera Proceedings of Mendel 2005 Soft Computing Conference, Brno, Czech Republic

    Google Scholar 

  6. Matousek, R., 2004,Selected Methods of Artificial Intelligence — Implementation and Application (in Czech),Ph.D. thesis, Brno, BUT, Czech Republic

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Science+Business Media B.V

About this chapter

Cite this chapter

Matousek, R. (2009). GAHC: Hybrid Genetic Algorithm. In: Ao, SI., Rieger, B., Chen, SS. (eds) Advances in Computational Algorithms and Data Analysis. Lecture Notes in Electrical Engineering, vol 14. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-8919-0_38

Download citation

  • DOI: https://doi.org/10.1007/978-1-4020-8919-0_38

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-8918-3

  • Online ISBN: 978-1-4020-8919-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics