Skip to main content
SpringerLink
Log in

On the Convergence of Sampling Measures in the Global Genetic Search

  • 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

The paper contains a simple observation that allows to recognize specific subsets in the admissible domain D, by using the measure on D transported from the space of states of the Simple Genetic Algorithm (SGA). The particular sets which are recognized may be the central parts of level sets or the central parts of basins of attraction of fitness. The measure transport method can be extended to the group of algorithms for which the “heuristic operator” can be effectively defined.

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. Cabib E., Davini C., Chong-Quing Ru: A problem in the optimal design of network under transverse loading, Quaterly of Appl. Mathematics, Vol. XLVIII, 252–263.

    Google Scholar 

  2. Cabib E., Schaefer R., Telega H.: A parallel Genatic Clustering for Inverse Problems, LNCS 1541, Springer (1998), 551–556.

    Google Scholar 

  3. Nix A. E., Vose M. D.: Modeling Genetic Algorithms with Markov Chains, Annales of Math. And Artificial Intelligence, 5 (1) (1992), 78–88.

    MathSciNet  Google Scholar 

  4. Telega H.: Parallel algorithms for solving selected inerse problems, (in Polish). PhD Thesis, Academy of Mining and Metalurgy, Cracow, Poland 1999.

    Google Scholar 

  5. Telega H., Schaefer R.: Testing the genetic clustering with SGA evolutionary engine, Proc. of KAEGiOG, Ladek Zdroj, (2000), 227–263.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instytut Informatyki, Uniwersytet Jagielloński, ul. Nawojki 11, PL-30072, Kraków

    Robert Schaefer

  2. Instytut Matematyki, Uniwersytet Jagielloński, ul. Reymonta 4, PL-30059, Kraków

    Zenon J. Jabłoński

Authors
  1. Robert Schaefer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zenon J. Jabłoński
    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

Schaefer, R., Jabłoński, Z.J. (2002). On the Convergence of Sampling Measures in the Global Genetic Search. 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_67

Download citation

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

  • 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