Abstract
The initial population distribution is an essential issue in evolutionary computation performance. Population initialization methods for grammar-guided genetic programming have some difficulties generating a representative sample of the search space, which negatively affects the overall evolutionary process. This paper presents a grammatically uniform population initialization method to address this issue by improving the initial population uniformity: the equiprobability of obtaining any individual of the search space defined by the context-free grammar. The proposed initialization method assigns and updates probabilities dynamically to the production rules of the grammar to pursue uniformity and includes a code bloat control mechanism. We have conducted empirical experiments to compare the proposed algorithm with a standard initialization approach very often used in grammar-guided genetic programming. The results report that the proposed initialization method approximates very well a uniform distribution of the individuals in the search space. Moreover, the overall evolutionary process that takes place after the population initialization performs better in terms of convergence speed and quality of the final solutions achieved when the proposed method generates the initial population than when the usual approach does. The results also show that these performance differences are more significant when the experiments involve large search spaces.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Burke E, Gustafson S, Kendall G (2004) Diversity in genetic programming: an analysis of measures and correlation with fitness. IEEE Trans Evol Comput 8(1):47–62
Chellapilla K (1997) Evolving computer programs without subtree crossover. IEEE Trans Evol Comput 1(3):209–216
Couchet J, Manrique D, Porras L (2007) Grammar-guided neural architecture evolution. In: Bio-inspired modeling of cognitive tasks. Second international work-conference on the interplay between natural and artificial computation (IWINAC07) Part I, La Manga del Mar Menor, Spain, pp 223–240
Crane EF, McPhee NF (2006) The effects of size and depth limits on tree based genetic programming. Springer, Boston, pp 223–240
Darwin C (1959) On the origin of the species by means of natural selection, or the preservation of favoured races in the struggle for life. John Murray, London
Deng W, Zhao H, Zou L, Li G, Yang X, Wu D (2016) A novel collaborative optimization algorithm in solving complex optimization problems. Soft Comput 21(15):4387–4398. https://doi.org/10.1007/s00500-016-2071-8
Deng W, Zhao H, Yang X, Xiong J, Sun M, Li B (2017) Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment. Appl Soft Comput 59:288–302. https://doi.org/10.1016/j.asoc.2017.06.004
Deng W, Xu J, Zhao H (2019) An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem. IEEE Access 7:20281–20292. https://doi.org/10.1109/ACCESS.2019.2897580
Fagan D, Fenton M, O’Neill M (2016) Exploring position independent initialisation in grammatical evolution. In: 2016 IEEE congress on evolutionary computation (CEC), Vancouver, BC, Canada, pp 5060–5067
García Arnau M, Manrique D, Ríos J, Rodríguez Patón A (2007) Initialization method for grammar-guided genetic programming. Knowl Based Syst 20(2):127–133
Harper R (2010) Ge, explosive grammars and the lasting legacy of bad initialisation. In: IEEE congress on evolutionary computation, Barcelona, Spain, pp 1–8
Hassanat A, Surya Prasath V, Abbadi M, Abu-Qdari S, Faris H (2018) An improved genetic algorithm with a new initialization mechanism based on regression techniques. Information 9(7):167. https://doi.org/10.3390/info9070167
Hien N, Hoai N (2006) A brief overview of population diversity measures in genetic programming. In: Pham TL, Le HK, Nguyen XH (eds) Proceedings of the third asian-pacific workshop on genetic programming, Hanoi, Vietnam, pp 128–139
Hopcroft J, Motwani R, Ullman JD (2006) Introduction to automata theory, languages and computation, 3rd edn. Addison-Wesley Longman Publishing, Boston
Kari L, Rozenberg G (2008) The many facets of natural computing. Commun ACM 51(10):72–83
Kim K, McKay R (2013) Stochastic diversity loss and scalability in estimation of distribution genetic programming. IEEE Trans Evol Comput 17(3):301–320
Kim K, Shan Y, Nguyen X, McKay R (2014) Probabilistic model building in genetic programming: a critical review. Genet Program Evol Mach 15(2):115–167
Koza J (1992) Genetic programming: on the programming of computers by means of natural selection. MIT Press, Cambridge
Koza JR, Keane MA, Streeter MJ, Mydlowec W, Yu J, Lanza G (2006) Genetic programming IV: routine human-competitive machine intelligence. Springer, New York
Krithivasan K (2009) Introduction to formal languages, automata theory and computation. Pearson Education, Noida
McKay R, Hoai N, Whigham P, Shan Y, O’Neill M (2010) Grammar-based genetic programming: a survey. Genet Program Evol Mach 11(3–4):365–396
Moll RN, Arbib MA, Kfoury AJ (2012) An introduction to formal language theory. Springer, New York
Murphy E, Hemberg E, Nicolau M, O’Neill M, Brabazon A (2012) Grammar bias and initialisation in grammar based genetic programming. In: Moraglio A, Silva S, Krawiec K, Machado P, Cotta C (eds) Genetic programming. Springer, Berlin, pp 85–96
Nicolau M (2017) Understanding grammatical evolution: initialisation. Genet Program Evol Mach 18:467–507
Nicolau M, Fenton M (2016) Managing repetition in grammar-based genetic programming. In: Proceedings of the genetic and evolutionary computation conference 2016, ACM, New York, NY, USA, GECCO ’16, pp 765–772
Poli R, Langdon W, McPhee N, Koza J (2008) A field guide to genetic programming. Lulu.com, UK
Ramos Criado P (2017) New techniques for grammar guided genetic programming: dealing with large derivation trees and high cardinality terminal symbol sets. PhD thesis, Universidad Politécnica de Madrid, Spain
Roth R (2006) Introduction to coding theory. Cambridge University Press, Cambridge, p 298
Schweim D, Thorhauer A, Rothlauf F (2018) On the non-uniform redundancy of representations for grammatical evolution: the influence of grammars. Springer, Cham, pp 55–78
Sipser M (2013) Introduction to the theory of computation, 3rd edn. Cengage Learning, Boston
Tanev I (2004) Implications of incorporating learning probabilistic context-sensitive grammar in genetic programming on evolvability of adaptive locomotion gaits of snakebot. In: Proceedings of GECCO 2004, Seatle, Washington, pp 155–166
Thorhauer A (2016) On the non-uniform redundancy in grammatical evolution. In: Handl J, Hart E, Lewis PR, López-Ibáñez M, Ochoa G, Paechter B (eds) Parallel problem solving from nature - PPSN XIV. Springer, Cham, pp 292–302
Vanneschi L, Castelli M, Silva S (2014) A survey of semantic methods in genetic programming. Genet Program Evol Mach 15(2):195–214
Whigham P (1995) Grammatically-based genetic programming. In: Rosca JP (ed) Proceedings of the workshop on genetic programming: from theory to real-world applications, Tahoe City, California, USA, pp 33–41
Acknowledgements
This research was partially funded by Ministerio de Economía, Industria y Competitividad, Spain, research grant number MTM2014-54053-P, and Artificial Intelligence Lab. at Universidad Politécnica de Madrid. The authors also thank the reviewers and editors for their valuable comments and suggestions, which have improved this paper.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Communicated by A. Di Nola.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Ramos Criado, P., Barrios Rolanía, D., Manrique, D. et al. Grammatically uniform population initialization for grammar-guided genetic programming. Soft Comput 24, 11265–11282 (2020). https://doi.org/10.1007/s00500-020-05061-w
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-020-05061-w