{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:24:19Z","timestamp":1780637059363,"version":"3.54.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031295720","type":"print"},{"value":"9783031295737","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-29573-7_1","type":"book-chapter","created":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T13:03:02Z","timestamp":1680008582000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Self-Adaptive Approach to\u00a0Exploit Topological Properties of\u00a0Different GAs\u2019 Crossover Operators"],"prefix":"10.1007","author":[{"given":"Jos\u00e9","family":"Ferreira","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mauro","family":"Castelli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luca","family":"Manzoni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7623-8419","authenticated-orcid":false,"given":"Gloria","family":"Pietropolli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,29]]},"reference":[{"key":"1_CR1","unstructured":"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)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"B\u00e4ck, T., Fogel, D.B., Michalewicz, Z.: Handbook of evolutionary computation. Release 97(1), B1 (1997)","DOI":"10.1201\/9781420050387"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Castelli, M., Manzoni, L., Gon\u00e7alves, I., Vanneschi, L., Trujillo, L., Silva, S.: An analysis of geometric semantic crossover: a computational geometry approach. In: IJCCI (ECTA), pp. 201\u2013208 (2016)","DOI":"10.5220\/0006056402010208"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10710-015-9251-7","volume":"17","author":"M Castelli","year":"2016","unstructured":"Castelli, M., Manzoni, L., Vanneschi, L., Silva, S., Popovi\u010d, A.: Self-tuning geometric semantic genetic programming. Genet. Program. Evolvable Mach. 17(1), 55\u201374 (2016)","journal-title":"Genet. Program. Evolvable Mach."},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1162\/evco.2009.17.4.17401","volume":"17","author":"T Friedrich","year":"2009","unstructured":"Friedrich, T., Oliveto, P.S., Sudholt, D., Witt, C.: Analysis of diversity-preserving mechanisms for global exploration. Evol. Comput. 17(4), 455\u2013476 (2009)","journal-title":"Evol. Comput."},{"key":"1_CR6","unstructured":"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)"},{"issue":"5","key":"1_CR7","first-page":"56","volume":"2","author":"D Gupta","year":"2012","unstructured":"Gupta, D., Ghafir, S.: An overview of methods maintaining diversity in genetic algorithms. Int. J. Emerg. Technol. Adv. Eng. 2(5), 56\u201360 (2012)","journal-title":"Int. J. Emerg. Technol. Adv. Eng."},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland, J.H.: Genetic algorithms. Sci. Am. 267(1), 66\u201373 (1992)","journal-title":"Sci. Am."},{"issue":"6","key":"1_CR9","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1109\/TEVC.2010.2043365","volume":"14","author":"H Ishibuchi","year":"2010","unstructured":"Ishibuchi, H., Tsukamoto, N., Nojima, Y.: Diversity improvement by non-geometric binary crossover in evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 14(6), 985\u2013998 (2010)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Jassadapakorn, C., Chongstitvatana, P.: Self-adaptation mechanism to control the diversity of the population in genetic algorithm. arXiv preprint arXiv:1109.0085 (2011)","DOI":"10.5121\/ijcsit.2011.3409"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.18178\/ijmlc.2017.7.1.611","volume":"7","author":"SM Lim","year":"2017","unstructured":"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\u201312 (2017)","journal-title":"Int. J. Mach. Learn. Comput."},{"issue":"5","key":"1_CR12","first-page":"889","volume":"19","author":"WY Lin","year":"2003","unstructured":"Lin, W.Y., Lee, W.Y., Hong, T.P.: Adapting crossover and mutation rates in genetic algorithms. J. Inf. Sci. Eng. 19(5), 889\u2013903 (2003)","journal-title":"J. Inf. Sci. Eng."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Maan, V., Malik, A.: Genetic algorithm application on 3D pipe routing: a review. Recent Innov. Comput. 139\u2013148 (2022)","DOI":"10.1007\/978-981-16-8892-8_11"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"McKnight, P.E., Najab, J.: Mann-Whitney u test. Corsini Encycl. Psychol. 1 (2010)","DOI":"10.1002\/9780470479216.corpsy0524"},{"key":"1_CR15","unstructured":"Moraglio, A.: Towards a geometric unification of evolutionary algorithms. Ph.D. thesis, Department of Computer Science, University of Essex, UK (2007)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Moraglio, A.: Abstract convex evolutionary search. In: Proceedings of the 11th Workshop Proceedings on Foundations of Genetic Algorithms, pp. 151\u2013162 (2011)","DOI":"10.1145\/1967654.1967668"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-73482-6_1","volume-title":"Foundations of Genetic Algorithms","author":"A Moraglio","year":"2007","unstructured":"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\u201314. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73482-6_1"},{"issue":"4","key":"1_CR18","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1162\/EVCO_a_00099","volume":"21","author":"A Moraglio","year":"2013","unstructured":"Moraglio, A., Togelius, J., Silva, S.: Geometric differential evolution for combinatorial and programs spaces. Evol. Comput. 21(4), 591\u2013624 (2013)","journal-title":"Evol. Comput."},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Sharma, S., Kumar, V.: Application of genetic algorithms in healthcare: a review. Next Generation Healthcare Informatics, pp. 75\u201386 (2022)","DOI":"10.1007\/978-981-19-2416-3_5"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Shimodaira, H.: DCGA: a diversity control oriented genetic algorithm. In: Second International Conference On Genetic Algorithms in Engineering Systems: Innovations and Applications, pp. 444\u2013449 (1997). https:\/\/doi.org\/10.1049\/cp:19971221","DOI":"10.1049\/cp:19971221"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"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\u201351 (2001). https:\/\/doi.org\/10.1109\/CEC.2001.934369","DOI":"10.1109\/CEC.2001.934369"},{"issue":"4","key":"1_CR22","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/21.286385","volume":"24","author":"M Srinivas","year":"1994","unstructured":"Srinivas, M., Patnaik, L.M.: Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans. Syst. Man Cybern. 24(4), 656\u2013667 (1994)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"6","key":"1_CR23","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/2.294849","volume":"27","author":"M Srinivas","year":"1994","unstructured":"Srinivas, M., Patnaik, L.M.: Genetic algorithms: a survey. Computer 27(6), 17\u201326 (1994)","journal-title":"Computer"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.swevo.2017.04.003","volume":"36","author":"L Vanneschi","year":"2017","unstructured":"Vanneschi, L., Henriques, R., Castelli, M.: Multi-objective genetic algorithm with variable neighbourhood search for the electoral redistricting problem. Swarm Evol. Comput. 36, 37\u201351 (2017)","journal-title":"Swarm Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-29573-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:01:52Z","timestamp":1710360112000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29573-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031295720","9783031295737"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29573-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EuroGP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Genetic Programming (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurogp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2023\/eurogp\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.95","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}