Skip to main content
SpringerLink
Log in

Modelling Hierarchical Genetic Strategy as a Family of Markov Chains

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics (PPAM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2328))

Abstract

We present Hierarchical Genetic Strategy (HGS) as a family of Markov chains applying Vose’s mathematical model for Simple Genetic Algorithm. Studying its asymptotic properties and performing simply experiments we try to compare efficiency of HGS and sequential genetic algorithms.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kołodziej J., Gwizdała R., Wojtusiak J.: Hierarchical Genetic Strategy as a Method of Improving Search Efficiency, Advances in Multi-Agents Systems, R Schaefer and S. Sędziwy eds.,UJ Press, Chapter 7, 200, pp. 149–161.

    Google Scholar 

  2. Obuchowicz A.: Performance Analysis of Crossing Multi-Dimensional Saddles by Evolutionary Search Algorithms, Proc. of the 4-th Polish Conference on Evolutionary Algorithms, Lcadek Zdrój, 2000.06.05-08, pp. 155–162.

    Google Scholar 

  3. Schaefer R., Jabłoński Z. J.: On The Convergence Of Sampling Measures In Global Genetic Search, Submitted to Proc. of the PPAM’01, 4-th International Conference On Parallel Processing And Applied Mathematics, Nałęczów, Poland, 2001,09.9-12.

    Google Scholar 

  4. Vose M.D.: The Simple Genetic Algorithm, MIT Press (1999).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, Lódź Technical University Branch in Bielsko-Biała, Bielsko-Biała, Poland

    Joanna Kolodziej

Authors
  1. Joanna Kolodziej
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Technical University of Czestochowa, Dabrowskiego 73, 42-200, Czestochowa, Poland

    Roman Wyrzykowski

  2. Computer Science Department, University of Tennessee, 122 Volunteer Blvd, Knoxville, TN, 37996-3450, USA

    Jack Dongarra

  3. Computer Science Department, Oklahoma State University, 700 N. Greenwood Ave., Tulsa, OK, 74106, USA

    Marcin Paprzycki

  4. DTU, UNI-C, Danish Computing Centre for Research and Education, Bldg. 304, 2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kolodziej, J. (2002). Modelling Hierarchical Genetic Strategy as a Family of Markov Chains. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_65

Download citation

  • DOI: https://doi.org/10.1007/3-540-48086-2_65

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43792-5

  • Online ISBN: 978-3-540-48086-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation