Abstract
The saplings sowing and growing up algorithm (SGA) was inspired by a natural events – evolution of growing up of trees. This algorithm contains two phases: Sowing Phase and Growing up Phase. In this paper, the theoretical foundations of SGA were determined. SGA is defined as a computational model, and it was depicted that there are a collection of Turing Machines for simulating SGA.
This is a preview of subscription content, log in via an institution to check access.
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
Alatas, B., Karci, A., Alli, H.: A Novel Approach in Genetic Evolution for Determination of Weight Distribution of Neural Networks. In: 3rd International Coference on Mathematical & Computational Applications, ICMCA’2002, Konya, Turkey, pp. 306–314 (2002)
Goldberg, D.: Genetic Algorithm in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
Dorigo, M., Maziezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Ants. IEEE Trans. on Systems, Man and Cybernetics B 26(1), 29–41 (1996)
Karci, A., Arslan, A.: Bidirectional evolutinary heuristic for the minimum vertex-cover problem. Journal of Computers and Electrical Engineerings 29, 111–120 (2003)
Karci, A., Arslan, A.: Uniform Population in Genetic algorithms. I.U. Journal of Electrical & Electronics 2(2), 495–504 (2002)
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)
Gundogan, K.K., Alatas, B., Karci, A.: Mining Classification Rules by Using Genetic Algorithms with Non-random Initial Population and Uniform Operator. Turkish Journal of Electrical Engineering & Computer Sciences 12, 43–52 (2004)
Karci, A.: Turing Machine. Turkish Encyclopaedia of Informatics, pp. 778-782. Papatya yayıncilik (2006)
Eberbach, E.: The Role of Completeness in Convergence of Evolutionary Algorithms. In: The 2005 IEEE Congress on Evolutionary Computation, vol. 2, pp. 1706–1713 (2005)
Karci, A., Alatas, B., Akin, E.: Sapling Growing up Algorithm (in Turkish). In: ASYU-2006 Akıllı Sistemlerde Yenilikler ve Uygulamaları Sempozyomu, Istanbul, pp. 57–61 (2006)
Karci, A., Alatas, B.: Thinking Capability of Saplings Growing Up Algorithm. In: Corchado, E.S., Yin, H., Botti, V., Fyfe, C. (eds.) IDEAL 2006. LNCS, vol. 4224, pp. 386–393. Springer, Heidelberg (2006)
Karci, A., Alatas, B.: Evolutionary Algorithms and Simulating Saplings. In: IKECCO-2006- 3rd Conference on Electronics and Computer Engineering, Bishkek, Kyrgyzstan (2006)
Leung, Y.W., Wang, Y.: An Orthogonal Genetic Algorithm with Quantization for Global Numerical Optimization. Trans. on Evolutionary Computation 5(1), 41–53 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Karci, A. (2007). Theory of Saplings Growing Up Algorithm. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2007. Lecture Notes in Computer Science, vol 4431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71618-1_50
Download citation
DOI: https://doi.org/10.1007/978-3-540-71618-1_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71589-4
Online ISBN: 978-3-540-71618-1
eBook Packages: Computer ScienceComputer Science (R0)