{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T16:43:59Z","timestamp":1751993039624,"version":"3.41.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T00:00:00Z","timestamp":1750032000000},"content-version":"vor","delay-in-days":15,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005727","name":"Universidade de Coimbra","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005727","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Several mating restriction techniques have been implemented in Evolutionary Algorithms to promote diversity. From similarity-based selection to niche preservation, the general goal is to avoid premature convergence by not having fitness pressure as the single evolutionary force. In a way, such methods can resemble the mechanisms involved in Sexual Selection, although generally assuming a simplified approach. Recently, a selection method called mating Preferences as Ideal Mating Partners (PIMP) has been applied to GP, providing promising results both in performance and diversity maintenance. The method mimics Mate Choice through the unbounded evolution of personal preferences rather than having a single set of rules to shape parent selection. As such, PIMP allows ideal mate representations to evolve freely, thus potentially taking advantage of Sexual Selection as a dynamic secondary force to fitness pressure. However, it is still unclear how mating preferences affect the overall population and how dependent they are on set-up choices. In this work, we tracked the evolution of individual preferences through different mutation types, searching for patterns and evidence of self-reinforcement. Results suggest that mating preferences do not stand on their own, relying on subtree mutation to avoid convergence to single-node trees. Nevertheless, they consistently promote smaller and more balanced solutions depth-wise than a standard tournament selection, reducing the impact of bloat. Furthermore, when coupled with subtree mutation it also results in more solution diversity with statistically significant results.<\/jats:p>","DOI":"10.1007\/s12293-025-00466-2","type":"journal-article","created":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T11:59:45Z","timestamp":1750075185000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Dynamics of Mating Preferences in Genetic Programming"],"prefix":"10.1007","volume":"17","author":[{"given":"Jos\u00e9 Maria","family":"Sim\u00f5es","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nuno","family":"Louren\u00e7o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Penousal","family":"Machado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,16]]},"reference":[{"key":"466_CR1","doi-asserted-by":"publisher","unstructured":"Abdel-Basset M, Abdel-Fatah L, Sangaiah AK (2018) Chapter 10 - metaheuristic algorithms: A comprehensive review. A.K.\u00a0Sangaiah, M.\u00a0Sheng, and Z.\u00a0Zhang (Eds.), Computational intelligence for multimedia big data on the cloud with engineering applications (p.185-231). Academic Press. https:\/\/www.sciencedirect.com\/science\/article\/pii\/B9780128133149000104https:\/\/doi.org\/10.1016\/B978-0-12-813314-9.00010-4","DOI":"10.1016\/B978-0-12-813314-9.00010-4"},{"key":"466_CR2","doi-asserted-by":"publisher","DOI":"10.1098\/rspb.2019.1325","author":"SH Alonzo","year":"2019","unstructured":"Alonzo SH, Servedio M (2019) Grey zones of sexual selection: why is finding a modern definition so hard? Proceedings of the royal society b. https:\/\/doi.org\/10.1098\/rspb.2019.1325","journal-title":"Proceedings of the royal society b"},{"issue":"6","key":"466_CR3","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.tree.2006.03.015","volume":"21","author":"M Andersson","year":"2006","unstructured":"Andersson M, Simmons LW (2006) Sexual selection and mate choice. Trends in Ecology & Evolution 21(6):296\u2013302","journal-title":"Trends in Ecology & Evolution"},{"key":"466_CR4","doi-asserted-by":"publisher","first-page":"3845","DOI":"10.1007\/s11831-023-09922-z","volume":"30","author":"D Angelis","year":"2023","unstructured":"Angelis D, Sofos F, Karakasidis T (2023) Artificial intelligence in physical sciences: Symbolic regression trends and perspectives. Arch Computat Methods Eng 30:3845\u20133865","journal-title":"Arch Computat Methods Eng"},{"key":"466_CR5","doi-asserted-by":"publisher","unstructured":"Boldi R, Ding L, Spector L (2024) Solving deceptive problems without explicit diversity maintenance. (p.171-174). New York, NY, USA: Association for Computing Machinery. https:\/\/doi.org\/10.1145\/3638530.3654099","DOI":"10.1145\/3638530.3654099"},{"issue":"1","key":"466_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/TEVC.2003.819263","volume":"8","author":"E Burke","year":"2004","unstructured":"Burke E, Gustafson S, Kendall G (2004) Diversity in genetic programming: an analysis of measures and correlation with fitness. IEEE Transactions on Evolutionary Computation 8(1):47\u201362. https:\/\/doi.org\/10.1109\/TEVC.2003.819263","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"466_CR7","doi-asserted-by":"crossref","unstructured":"Cheng R, Yao M, Xue X, Shen B (2012) Bisexual evolution: A novel bisexual evolutionary framework based on the fisher\u2019s runaway process. 2012 ieee congress on evolutionary computation (p.1-8)","DOI":"10.1109\/CEC.2012.6256463"},{"key":"466_CR8","doi-asserted-by":"publisher","first-page":"1882","DOI":"10.1126\/science.1133311","volume":"318","author":"T Clutton-Brock","year":"2007","unstructured":"Clutton-Brock T (2007) Sexual selection in males and females. Science 318:1882\u20131885. https:\/\/doi.org\/10.1126\/science.1133311","journal-title":"Science"},{"key":"466_CR9","volume-title":"On the origins of species by means of natural selection","author":"C Darwin","year":"1859","unstructured":"Darwin C (1859) On the origins of species by means of natural selection. Murray, London"},{"key":"466_CR10","doi-asserted-by":"publisher","DOI":"10.5962\/bhl.title.70891","volume-title":"The descent of man, and selection in relation to sex (1871)","author":"C Darwin","year":"1981","unstructured":"Darwin C (1981) The descent of man, and selection in relation to sex (1871). Princeton University Press"},{"key":"466_CR11","doi-asserted-by":"crossref","unstructured":"Drezner T, Drezner Z (2006) Gender-specific genetic algorithms. INFOR: Information Systems and Operational Research, 44(2), 117-127,","DOI":"10.1080\/03155986.2006.11732744"},{"issue":"1","key":"466_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.3233\/FI-1998-35123403","volume":"35","author":"A Eiben","year":"1998","unstructured":"Eiben A, Schippers C (1998) On evolutionary exploration and exploitation. Fundamenta Informaticae 35(1):35\u201350. https:\/\/doi.org\/10.3233\/FI-1998-35123403","journal-title":"Fundamenta Informaticae"},{"key":"466_CR13","doi-asserted-by":"crossref","unstructured":"Eiben A, Smith J (2015) Introduction to evolutionary computing (2 ed.). Springer","DOI":"10.1007\/978-3-662-44874-8"},{"key":"466_CR14","doi-asserted-by":"crossref","unstructured":"Fisher R (1930) The genetical theory of natural selection. Oxford Clarendon Press","DOI":"10.5962\/bhl.title.27468"},{"key":"466_CR15","doi-asserted-by":"crossref","unstructured":"Fry R, Smith S, Tyrrell A (2005) A self-adaptive mate selection model for genetic programming. 2005 ieee congress on evolutionary computation (Vol.\u00a03, p.2707-2714)","DOI":"10.1109\/CEC.2005.1555034"},{"issue":"2","key":"466_CR16","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.crvi.2009.12.001","volume":"333","author":"J Gayon","year":"2010","unstructured":"Gayon J (2010) Sexual selection: Another darwinian process. Comptes Rendus Biologies 333(2):134\u2013144. https:\/\/doi.org\/10.1016\/j.crvi.2009.12.001","journal-title":"Comptes Rendus Biologies"},{"key":"466_CR17","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s10559-013-9570-8","volume":"49","author":"N Glibovets","year":"2013","unstructured":"Glibovets N, Gulayeva N (2013) A review of niching genetic algorithms for multimodal function optimization. Cybernetics and Systems Analysis. 49:815\u2013820. https:\/\/doi.org\/10.1007\/s10559-013-9570-8","journal-title":"Cybernetics and Systems Analysis."},{"key":"466_CR18","unstructured":"Goldberg DE, Richardson J (1987) Genetic algorithms with sharing for multimodal function optimization. Proceedings of the second international conference on genetic algorithms on genetic algorithms and their application (p.41-49). USA: L. Erlbaum Associates Inc"},{"key":"466_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2014.2362729","volume":"19","author":"T Helmuth","year":"2014","unstructured":"Helmuth T, Spector L, Matheson J (2014) Solving uncompromising problems with lexicase selection. IEEE Transactions on Evolutionary Computation 19:1\u20131. https:\/\/doi.org\/10.1109\/TEVC.2014.2362729","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"466_CR20","unstructured":"Hien NT, Hoai NX (2006) A brief overview of population diversity measures in genetic programming. Proc. 3rd asian-pacific workshop on genetic programming, hanoi, vietnam (pp. 128\u2013139)"},{"key":"466_CR21","doi-asserted-by":"crossref","unstructured":"Hollocher H (2013) Speciation, theories of. S.A.\u00a0Levin (Ed.), Encyclopedia of biodiversity (second edition) (Second Edition ed., p.629-639). Waltham: Academic Press","DOI":"10.1016\/B978-0-12-384719-5.00130-1"},{"key":"466_CR22","doi-asserted-by":"crossref","unstructured":"Jalali\u00a0Varnamkhasti M (2012) Sexual selection and evolution of male and female choice in genetic algorithm. Scientific Research and Essays, 7, ,","DOI":"10.5897\/SRE11.1990"},{"issue":"Supplement 1","key":"466_CR23","doi-asserted-by":"publisher","first-page":"10001","DOI":"10.1073\/pnas.0901129106","volume":"106","author":"AG Jones","year":"2009","unstructured":"Jones AG, Ratterman NL (2009) Mate choice and sexual selection: What have we learned since darwin? Proceedings of the National Academy of Sciences 106(Supplement 1):10001\u201310008","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"466_CR24","unstructured":"Jong KAD (1975) Analysis of the behavior of a class of genetic adaptive systems (Unpublished doctoral dissertation). University of Michigan"},{"issue":"3","key":"466_CR25","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10710-019-09351-7","volume":"20","author":"P Ju\u00e1rez-Smith","year":"2019","unstructured":"Ju\u00e1rez-Smith P, Trujillo L, Garc\u00eda-Valdez M, Fern\u00e1ndez de Vega F, Ch\u00e1vez F (2019) Local search in speciation-based bloat control for genetic programming. Genetic Programming and Evolvable Machines 20(3):351\u2013384. https:\/\/doi.org\/10.1007\/s10710-019-09351-7","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"466_CR26","doi-asserted-by":"publisher","unstructured":"La\u00a0Cava W, Spector L, Danai K (2016) Epsilon-lexicase selection for regression. Proceedings of the genetic and evolutionary computation conference 2016 (p.741-748). New York, NY, USA: Association for Computing Machinery. https:\/\/doi.org\/10.1145\/2908812.2908898","DOI":"10.1145\/2908812.2908898"},{"key":"466_CR27","unstructured":"Leit\u00e3o, A (2020) Sexual selection through mate choice in evolutionary computation (Doctoral Dissertation). Universidade de Coimbra"},{"key":"466_CR28","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-319-20883-1_7","volume-title":"Handbook of genetic programming applications","author":"A Leit\u00e3o","year":"2015","unstructured":"Leit\u00e3o A, Machado P (2015) Mate choice in evolutionary computation. In: Gandomi AH, Alavi AH, Ryan C (eds) Handbook of genetic programming applications. Springer International Publishing, Cham, pp 155\u2013177"},{"key":"466_CR29","doi-asserted-by":"crossref","unstructured":"Leit\u00e3o A, Neves J, Machado P (2013) A self-adaptive mate choice model for symbolic regression. 2013 ieee congress on evolutionary computation, cec 2013 (p.8-15)","DOI":"10.1109\/CEC.2013.6557547"},{"issue":"3","key":"466_CR30","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1162\/evco.2006.14.3.309","volume":"14","author":"S Luke","year":"2006","unstructured":"Luke S, Panait L (2006) A comparison of bloat control methods for genetic programming. Evol. Comput. 14(3):309\u2013344. https:\/\/doi.org\/10.1162\/evco.2006.14.3.309","journal-title":"Evol. Comput."},{"key":"466_CR31","unstructured":"Mahfoud SW (1992) Crowding and preselection revisited. Parallel problem solving from nature (p.27-36). Elsevier Science Publishers"},{"key":"466_CR32","doi-asserted-by":"crossref","unstructured":"McDermott J, White DR, Luke S, Manzoni L, Castelli M, Vanneschi L, O\u2019Reilly U-M (2012) Genetic programming needs better benchmarks. Proceedings of the 14th annual conference on genetic and evolutionary computation (p.791-798). New York, NY, USA: Association for Computing Machinery","DOI":"10.1145\/2330163.2330273"},{"key":"466_CR33","doi-asserted-by":"publisher","unstructured":"Miller B, Shaw M (1996) Genetic algorithms with dynamic niche sharing for multimodal function optimization. Proceedings of ieee international conference on evolutionary computation (p.786-791). https:\/\/doi.org\/10.1109\/ICEC.1996.542701","DOI":"10.1109\/ICEC.1996.542701"},{"key":"466_CR34","doi-asserted-by":"crossref","unstructured":"Omori K, Maekawa S, Tamaki H, Kitamura S (2005) Parallelization of genetic algorithm with sexual selection. Electrical Engineering in Japan 150:42\u201349","DOI":"10.1002\/eej.20029"},{"key":"466_CR35","doi-asserted-by":"crossref","unstructured":"Poli R, Langdon WB, Dignum S (2007) On the limiting distribution of program sizes in tree-based genetic programming. Proceedings of the 10th european conference on genetic programming (p.193-204). Berlin, Heidelberg: Springer-Verlag","DOI":"10.1007\/978-3-540-71605-1_18"},{"key":"466_CR36","unstructured":"Poli R, Langdon WB, McPhee NF (2008) A field guide to genetic programming. (Published via http:\/\/lulu.com and freely available at http:\/\/www.gp-field-guide.org.uk)"},{"key":"466_CR37","doi-asserted-by":"crossref","unstructured":"Ralls K, Mesnick S (2009) Sexual dimorphism. W.F.\u00a0Perrin, B.\u00a0W\u00fcrsig, and J.\u00a0Thewissen (Eds.), Encyclopedia of marine mammals (second edition) (Second Edition ed., p.1005-1011). London: Academic Press","DOI":"10.1016\/B978-0-12-373553-9.00233-9"},{"key":"466_CR38","doi-asserted-by":"crossref","unstructured":"Richards JE, Hawley RS (2011) Chapter 8 - sex determination: How genes determine a developmental choice. J.E.\u00a0Richards and R.S.\u00a0Hawley (Eds.), The human genome (third edition) (Third ed., p.273-298). San Diego: Academic Press","DOI":"10.1016\/B978-0-08-091865-5.00008-4"},{"key":"466_CR39","doi-asserted-by":"publisher","unstructured":"Shahbandegan S, Dolson E (2024) On the robustness of lexicase selection to contradictory objectives. Proceedings of the genetic and evolutionary computation conference (p.594-602). New York, NY, USA: Association for Computing Machinery. https:\/\/doi.org\/10.1145\/3638529.3654215","DOI":"10.1145\/3638529.3654215"},{"key":"466_CR40","doi-asserted-by":"crossref","unstructured":"Sim\u00f5es JM, Louren\u00e7o N, Machado P (2023) All you need is sex for diversity. G.\u00a0Pappa, M.\u00a0Giacobini, and Z.\u00a0Vasicek (Eds.), Genetic programming (pp. 276\u2013291). Springer Nature Switzerland","DOI":"10.1007\/978-3-031-29573-7_18"},{"key":"466_CR41","doi-asserted-by":"crossref","unstructured":"Smorodkina E, Tauritz DR (2007) Toward automating ea configuration: The parent selection stage. Proceedings of the 2007 ieee congress on evolutionary computation (p.63-70)","DOI":"10.1109\/CEC.2007.4424455"},{"key":"466_CR42","doi-asserted-by":"publisher","DOI":"10.1145\/2330784.2330846","author":"L Spector","year":"2012","unstructured":"Spector L (2012). Assessment of problem modality by differential performance of lexicase selection in genetic programming: A preliminary report. https:\/\/doi.org\/10.1145\/2330784.2330846","journal-title":"Assessment of problem modality by differential performance of lexicase selection in genetic programming: A preliminary report."},{"issue":"4","key":"466_CR43","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/21.286385","volume":"24","author":"M Srinivas","year":"1994","unstructured":"Srinivas M, Patnaik L (1994) Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics 24(4):656\u2013667","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"466_CR44","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ins.2015.11.010","volume":"333","author":"L Trujillo","year":"2015","unstructured":"Trujillo L, Mu\u00f1oz L, Galv\u00e1n-L\u00f3pez E, Silva S (2015) Neat genetic programming: Controlling bloat naturally. Information Sciences 333:21\u201343","journal-title":"Information Sciences"},{"key":"466_CR45","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1142\/S2010194512005508","volume":"9","author":"MJ Varnamkhasti","year":"2012","unstructured":"Varnamkhasti MJ, Lee LS (2012) A genetic algorithm based on sexual selection for the multidimensional 0\/1 knapsack problems. International Journal of Modern Physics Conference Series 9:422\u2013431","journal-title":"International Journal of Modern Physics Conference Series"},{"key":"466_CR46","doi-asserted-by":"publisher","unstructured":"Virtanen P, Gommers R, Oliphant TE, Haberland M, Reddy T, Cournapeau D (2020) SciPy, 1.0 Contributors, SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python. Nature Methods 17:261\u2013272. https:\/\/doi.org\/10.1038\/s41592-019-0686-2","DOI":"10.1038\/s41592-019-0686-2"},{"key":"466_CR47","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1080\/02286203.2008.11442467","volume":"28","author":"D Vrajitoru","year":"2008","unstructured":"Vrajitoru D (2008) Natural selection and mating constraints with genetic algorithms. International Journal of Modelling and Simulation 28:188\u2013194","journal-title":"International Journal of Modelling and Simulation"},{"issue":"1","key":"466_CR48","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-5193(75)90111-3","volume":"53","author":"A Zahavi","year":"1975","unstructured":"Zahavi A (1975) Mate selection-a selection for a handicap. Journal of Theoretical Biology 53(1):205\u2013214","journal-title":"Journal of Theoretical Biology"},{"key":"466_CR49","doi-asserted-by":"crossref","unstructured":"Zhu Y, Yang Z, Song J (2006) A genetic algorithm with age and sexual features. Intelligent computing (pp. 634\u2013640). Berlin, Heidelberg: Springer Berlin Heidelberg","DOI":"10.1007\/11816157_75"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00466-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-025-00466-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00466-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T09:31:12Z","timestamp":1750930272000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-025-00466-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["466"],"URL":"https:\/\/doi.org\/10.1007\/s12293-025-00466-2","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"type":"print","value":"1865-9284"},{"type":"electronic","value":"1865-9292"}],"subject":[],"published":{"date-parts":[[2025,6]]},"assertion":[{"value":"17 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"30"}}