Abstract
Evolutionary algorithms (EAs) are a family of optimization algorithms inspired by the Darwinian theory of evolution, and Genetic Algorithm (GA) is a popular technique among EAs. Similar to other EAs, common limitations of GAs have geometrical origins, like premature convergence, where the final population’s convex hull might not include the global optimum. Population diversity maintenance is a central idea to tackle this problem but is often performed through methods that constantly diminish the search space’s area. This work presents a self-adaptive approach, where the non-geometric crossover is strategically employed with geometric crossover to maintain diversity from a geometrical/topological perspective. To evaluate the performance of the proposed method, the experimental phase compares it against well-known diversity maintenance methods over well-known benchmarks. Experimental results clearly demonstrate the suitability of the proposed self-adaptive approach and the possibility of applying it to different types of crossover and EAs.
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
References
Awad, N., Ali, M., Liang, J., Qu, B., Suganthan, P., Definitions, P.: Evaluation criteria for the cec 2017 special session and competition on single objective real-parameter numerical optimization. Technical report (2016)
Bäck, T., Fogel, D.B., Michalewicz, Z.: Handbook of evolutionary computation. Release 97(1), B1 (1997)
Castelli, M., Manzoni, L., Gonçalves, I., Vanneschi, L., Trujillo, L., Silva, S.: An analysis of geometric semantic crossover: a computational geometry approach. In: IJCCI (ECTA), pp. 201–208 (2016)
Castelli, M., Manzoni, L., Vanneschi, L., Silva, S., Popovič, A.: Self-tuning geometric semantic genetic programming. Genet. Program. Evolvable Mach. 17(1), 55–74 (2016)
Friedrich, T., Oliveto, P.S., Sudholt, D., Witt, C.: Analysis of diversity-preserving mechanisms for global exploration. Evol. Comput. 17(4), 455–476 (2009)
Goldberg, D.E., Richardson, J., et al.: Genetic algorithms with sharing for multimodal function optimization. In: Genetic algorithms and their applications: Proceedings of the Second International Conference on Genetic Algorithms, vol. 4149. Lawrence Erlbaum, Hillsdale, NJ (1987)
Gupta, D., Ghafir, S.: An overview of methods maintaining diversity in genetic algorithms. Int. J. Emerg. Technol. Adv. Eng. 2(5), 56–60 (2012)
Holland, J.H.: Genetic algorithms. Sci. Am. 267(1), 66–73 (1992)
Ishibuchi, H., Tsukamoto, N., Nojima, Y.: Diversity improvement by non-geometric binary crossover in evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 14(6), 985–998 (2010)
Jassadapakorn, C., Chongstitvatana, P.: Self-adaptation mechanism to control the diversity of the population in genetic algorithm. arXiv preprint arXiv:1109.0085 (2011)
Lim, S.M., Sultan, A.B.M., Sulaiman, M.N., Mustapha, A., Leong, K.Y.: Crossover and mutation operators of genetic algorithms. Int. J. Mach. Learn. Comput. 7(1), 9–12 (2017)
Lin, W.Y., Lee, W.Y., Hong, T.P.: Adapting crossover and mutation rates in genetic algorithms. J. Inf. Sci. Eng. 19(5), 889–903 (2003)
Maan, V., Malik, A.: Genetic algorithm application on 3D pipe routing: a review. Recent Innov. Comput. 139–148 (2022)
McKnight, P.E., Najab, J.: Mann-Whitney u test. Corsini Encycl. Psychol. 1 (2010)
Moraglio, A.: Towards a geometric unification of evolutionary algorithms. Ph.D. thesis, Department of Computer Science, University of Essex, UK (2007)
Moraglio, A.: Abstract convex evolutionary search. In: Proceedings of the 11th Workshop Proceedings on Foundations of Genetic Algorithms, pp. 151–162 (2011)
Moraglio, A., Poli, R.: Inbreeding properties of geometric crossover and non-geometric recombinations. In: Stephens, C.R., Toussaint, M., Whitley, D., Stadler, P.F. (eds.) FOGA 2007. LNCS, vol. 4436, pp. 1–14. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73482-6_1
Moraglio, A., Togelius, J., Silva, S.: Geometric differential evolution for combinatorial and programs spaces. Evol. Comput. 21(4), 591–624 (2013)
Sharma, S., Kumar, V.: Application of genetic algorithms in healthcare: a review. Next Generation Healthcare Informatics, pp. 75–86 (2022)
Shimodaira, H.: DCGA: a diversity control oriented genetic algorithm. In: Second International Conference On Genetic Algorithms in Engineering Systems: Innovations and Applications, pp. 444–449 (1997). https://doi.org/10.1049/cp:19971221
Shimodaira, H.: A diversity-control-oriented genetic algorithm (DCGA): performance in function optimization. In: Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546), vol. 1, pp. 44–51 (2001). https://doi.org/10.1109/CEC.2001.934369
Srinivas, M., Patnaik, L.M.: Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans. Syst. Man Cybern. 24(4), 656–667 (1994)
Srinivas, M., Patnaik, L.M.: Genetic algorithms: a survey. Computer 27(6), 17–26 (1994)
Vanneschi, L., Henriques, R., Castelli, M.: Multi-objective genetic algorithm with variable neighbourhood search for the electoral redistricting problem. Swarm Evol. Comput. 36, 37–51 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Ferreira, J., Castelli, M., Manzoni, L., Pietropolli, G. (2023). A Self-Adaptive Approach to Exploit Topological Properties of Different GAs’ Crossover Operators. In: Pappa, G., Giacobini, M., Vasicek, Z. (eds) Genetic Programming. EuroGP 2023. Lecture Notes in Computer Science, vol 13986. Springer, Cham. https://doi.org/10.1007/978-3-031-29573-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-031-29573-7_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-29572-0
Online ISBN: 978-3-031-29573-7
eBook Packages: Computer ScienceComputer Science (R0)