Abstract
This paper presents a method of generating the initial population of genetic algorithms (GAs) for continuous global optimization by using upper and lower bounds of variables instead of a pseudo-random sequence. In order to make population lead to a more reliable solution, the generated initial population is much more evenly distributed, which can avoid causing rapid clustering around an arbitrary local optimal. Another important point is that the simplicity of a population illustrates the more symmetry, self-similarity, repetitions, periodicity such that they guide the computational process to go ahead to desired aim. We design a GA based on this initial population for global numerical optimization with continuous variables. So, the obtained population is more evenly distributed and resulting GA process is more robust. We executed the proposed algorithm to solve 3 benchmark problems with 128 dimensions and very large number of local minimums. The results showed that the proposed algorithm can find optimal or near-to-optimal solutions.
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
Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
Stybinski, M.A., Tang, T.S.: Experiments in Nonconvex Optimization: Stochastic Approximmation and Function Smoothing and Simulated Annealing. Neural Networks 3, 467–483 (1990)
Hager, W.W., Hearn, W., Pardalos, P.M.: Large Scale of Optimization: State of the Art. Kluwer, Dordrecht (1994)
Floudas, C.A., Pardalos, P.M.: State of the Art in Global Optimization: Computational Methods and Applications. Kluwer, Dordrecht (1996)
Michalewicz, Z.: Genetic Algorithms+Data Structures=Evolution Programs. Springer, Heidelberg (1996)
Siarry, P., Berthiau, G., Durbin, F., Haussy, J.: Enhanced Simulated Annealing for Global Minimizing Functions of Many-Continuous Variables. ACM Trans. Math. Software 23, 209–228 (1997)
Karcı, A., Çınar, A., Ergen, B.: Genetik Algoritma Kullanılarak Minimum Düğüm Kapsama Probleminin Çözümü, Elektrik-Elektronik-Bilgisayar Mühendisliği 8. Ulusal Kongresi, 6-12 Eylül, Gaziantep, Türkiye, pp. 20-23 (1999)
Karcı, A., Arslan, A.: Bidirectional Evolutionary Heuristic for the Minimum Vertex-Cover Problem. Journal of Computer and Electrical Engineering 29, 111–120 (2003)
Karcı, A., Çınar, A.: Comparison of Uniform Distributed Initial Population Method and Random Initial Population Method in Genetic Search. In: 15th International Symposium on Computer and Information Sciences, Istanbul, Turkey, October 11-13, 2000, pp. 159–166 (2000)
Karcı, A., Arslan, A.: Genetik Algoritmalarda Düzenli Populasyon, GAP IV: Mühendislik konferansı, 06-08 Haziran 2002, Harran Üniversitesi, Şanlıurfa (2002)
Karcı, A., Arslan, A.: Uniform Population in Genetic Algorithms. Journal of Electrical and Electronics, İstanbul Ünv. Temmuz (2002)
Karci, A.: Genetik Algoritmalarda Iraksama ve Yerel Çözümde Kalma Problemlerinin Giderilmesi, F. Ü. Fen Bilimleri Enst. (2002)
Yao, X., Liu, Y.: Fast Evolution Strategies. In: Evolutionary Programming VI, pp. 151–161. Springer, Heidelberg (1997)
Siarry, P., Berthiau, G., Durbin, F., Haussy, J.: Enhanced Simulated Annealing for Globally Minimizing Functions of Many-Continuous Variables. ACM Trans. Math. Software 23, 209–228 (1997)
Angeline, P.J.: Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences. In: Proc. Evol. Prog. VII, pp. 601–610. Springer, Heidelberg (1998)
Chellapilla, K.: Combining Mutation Operators in Evolutionary Programming. IEEE Trans. Evol. Comput. 2, 91–96 (1998)
Leung, Y.-W., Wang, Y.: An Orthogonal Genetic Algorithm with Quantization for Global Numerical Optimization. In: Evolutionary Computation, vol. 5, pp. 41–53. MIT Press, Cambridge (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karci, A. (2004). Novelty in the Generation of Initial Population for Genetic Algorithms. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2004. Lecture Notes in Computer Science(), vol 3214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30133-2_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-30133-2_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23206-3
Online ISBN: 978-3-540-30133-2
eBook Packages: Springer Book Archive