Abstract
Saplings Growing up Algorithm (SGA) is a novel computational intelligence method inspired by sowing and growing up of saplings. This method contains two phases: Sowing Phase and Growing up Phase. Uniformed sowing sampling is aim to scatter evenly in the feasible solution space. Growing up phase contains three operators: mating, branching, and vaccinating operator. In this study thinking capability of SGA has been defined and it has been demonstrated that sapling population generated initially has diversity. The similarity of population concludes the interaction of saplings and at consequent, they will be similar. Furthermore, the operators used in the algorithm uses similarity and hence the population has the convergence property.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Axelrod, R.: The Evolution of Cooperation. Basic Book, New York (1984)
Axelrod, R.: The Dissemination of Culture: A Model with Local Convergence and Global Polarization. Journal of Conflict Resolution 41, 203–226 (1997)
Karci, A., Alatas, B., Akin, E.: Sapling Growing up Algorithm (in Turkish). INISTA, Turkey (2006)
Karci, A., Alatas, B., Akin, E.: Evolutionary Algorithms and Imitating the Saplings (in Turkish). In: IKECCO 2006, Kyrgyzstan (2006)
Gundogan, K.K., Alatas, B., Karci, A., Tatar, Y.: Comprehensible Classification Rule Mining with Two-Level Genetic Algorithm. In: 2nd FAE International Symposium, TRNC, pp. 373–377 (2002)
Alatas, B., Karci, A.: Genetik Sürecin Düzenlilik Operatoruyle Global Cozume Dogru Harekete Zorlanmasi. In: ELECO 2002, Turkey, vol. 18–22, pp. 364–368 (2002)
Karci, A., Arslan, A.: Uniform population in genetic algorithms. I.U. Journal of Electrical & Electronics 2(2), 495–504 (2002)
Karci, A., Cinar, A.: Comparison of Uniform Distributed Initial Population Method and Random Initial Population Method in Genetic Search. In: The 15th International Symposium on Computer and Information Sciences, Istanbul / Turkey, pp. 159–166 (2000)
Karci, A.: Novelty in the Generation of Initial Population for Genetic Algorithms. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds.) KES 2004. LNCS (LNAI), vol. 3214, pp. 268–275. Springer, Heidelberg (2004)
Karci, A., Arslan, A.: Bidirectional evolutionary heuristic for the minimum vertex-cover problem. Journal of Computers and Electrical Engineering 29, 111–120 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karci, A., Alatas, B. (2006). Thinking Capability of Saplings Growing Up Algorithm. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2006. IDEAL 2006. Lecture Notes in Computer Science, vol 4224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11875581_47
Download citation
DOI: https://doi.org/10.1007/11875581_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45485-4
Online ISBN: 978-3-540-45487-8
eBook Packages: Computer ScienceComputer Science (R0)