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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
Cabib E., Schaefer R., Telega H.: A parallel Genatic Clustering for Inverse Problems, LNCS 1541, Springer (1998), 551–556.
Nix A. E., Vose M. D.: Modeling Genetic Algorithms with Markov Chains, Annales of Math. And Artificial Intelligence, 5 (1) (1992), 78–88.
Telega H.: Parallel algorithms for solving selected inerse problems, (in Polish). PhD Thesis, Academy of Mining and Metalurgy, Cracow, Poland 1999.
Telega H., Schaefer R.: Testing the genetic clustering with SGA evolutionary engine, Proc. of KAEGiOG, Ladek Zdroj, (2000), 227–263.
Vose M. D., The Simple Genetic Algorithm, MIT Press (1999).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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