{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:56:03Z","timestamp":1743134163135,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031812408"},{"type":"electronic","value":"9783031812415"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-81241-5_16","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T13:45:22Z","timestamp":1735652722000},"page":"226-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Recombination Problem in\u00a0Genetic Programming for\u00a0Boolean Functions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2469-023X","authenticated-orcid":false,"given":"Aleksey","family":"Zakharov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,1]]},"reference":[{"issue":"4","key":"16_CR1","first-page":"1765","volume":"13","author":"MT Ahvanooey","year":"2019","unstructured":"Ahvanooey, M.T., Li, Q., Wu, M., Wang, S.: A survey of genetic programming and its applications. KSII Trans. Internet Inf. Syst. (TIIS) 13(4), 1765\u20131794 (2019)","journal-title":"KSII Trans. Internet Inf. Syst. (TIIS)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1009646528813","volume":"4","author":"E Balas","year":"1998","unstructured":"Balas, E., Niehaus, W.: Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems. J. Heuristics 4, 107\u2013122 (1998)","journal-title":"J. Heuristics"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Chicano, F., Ochoa, G., Whitley, D., Tin\u00f3s, R.: Quasi-optimal recombination operator. In: Evolutionary Computation in Combinatorial Optimization: 19th European Conference, EvoCOP 2019, Held as Part of EvoStar 2019, Leipzig, Germany, April 24\u201326, 2019, Proceedings, pp. 131\u2013146. Springer (2019)","DOI":"10.1007\/978-3-030-16711-0_9"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"D\u2019haeseleer, P.: Context preserving crossover in genetic programming. In: Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence, pp. 256\u2013261. IEEE (1994)","DOI":"10.1109\/ICEC.1994.350006"},{"key":"16_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2023.103906","volume":"319","author":"B Doerr","year":"2023","unstructured":"Doerr, B., Lissovoi, A., Oliveto, P.S.: (1+ 1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error. Artif. Intell. 319, 103906 (2023)","journal-title":"Artif. Intell."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Durrett, G., Neumann, F., O\u2019Reilly, U.M.: Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics. In: FOGA11: Proceedings of the 11th Workshop Proceedings on Foundations of Genetic Algorithms, pp. 69\u201380 (2011)","DOI":"10.1145\/1967654.1967661"},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.2298\/YJOR131030041E","volume":"24","author":"AV Eremeev","year":"2014","unstructured":"Eremeev, A.V., Kovalenko, J.V.: Optimal recombination in genetic algorithms for combinatorial optimization problems: part ii. Yugoslav J. Oper. Res. 24(2), 165\u2013186 (2014)","journal-title":"Yugoslav J. Oper. Res."},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s12293-019-00291-4","volume":"12","author":"AV Eremeev","year":"2020","unstructured":"Eremeev, A.V., Kovalenko, Y.V.: A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem. Memetic Comput. 12(1), 23\u201336 (2020)","journal-title":"Memetic Comput."},{"key":"16_CR9","unstructured":"Eremeev, A., Zakharova, Y.V.: On recombination operators in case of solution tree representation in evolutionary algorithms. In: Proceedings of IX International Scientific Conference Mathematics and Computer Science Modelling, pp. 305\u2013307 (2021)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Francoso Dal Piccol Sotto, L., Kaufmann, P., Atkinson, T.: Graph representations in genetic programming. Genet. Program Evolvable Mach. 22, 607\u2013636 (2021)","DOI":"10.1007\/s10710-021-09413-9"},{"key":"16_CR11","unstructured":"Frank, A., Asuncion, A.: UCI machine learning repository: Center for machine learning and intelligent systems (2009)"},{"key":"16_CR12","unstructured":"Gustafson, S.M.: An analysis of diversity in genetic programming. Ph.D. thesis, University of Nottingham (2004)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Hodan, D., Mrazek, V., Vasicekly, Z.: Semantically-oriented mutation operator in cartesian genetic programming for evolutionary circuit design. In: GECCO20: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, pp. 940\u2013948 (2020)","DOI":"10.1145\/3377930.3390188"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Kalkreuth, R.: A comprehensive study on subgraph crossover in cartesian genetic programming. In: Proceedings of the 12th International Joint Conference on Computational Intelligence (IJCCI 2020), pp. 59\u201370 (2020)","DOI":"10.5220\/0010110700590070"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Kalkreuth, R., Vasicek, Z., Husa, J., Vermetten, D., Ye, F., Back, T.: Towards a general Boolean function benchmark suite. In: GECCO23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary Computation, pp. 591\u2013594 (2023)","DOI":"10.1145\/3583133.3590685"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Kotzing, T., Neumann, A.M.S.F., O\u2019Reilly, U.M.: The max problem revisited: the importance of mutation in genetic programming. In: GECCO12: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, pp. 1333\u20131340 (2012)","DOI":"10.1145\/2330163.2330348"},{"key":"16_CR17","volume-title":"Genetic Programming, on Programming of Computer by Natural Selection","author":"JR Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming, on Programming of Computer by Natural Selection. MIT Press Cambridge, MA (1992)"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10710-010-9112-3","volume":"11","author":"JR Koza","year":"2010","unstructured":"Koza, J.R.: Human-competitive results produced by genetic programming. Genet. Program Evolvable Mach. 11, 251\u2013284 (2010)","journal-title":"Genet. Program Evolvable Mach."},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/0-387-28356-0_5","volume-title":"Genetic Programming, Search Methodologies","author":"JR Koza","year":"2005","unstructured":"Koza, J.R., Poli, R.: Genetic Programming, Search Methodologies, pp. 127\u2013164. Search Methodologies. Springer, Boston, MA pp (2005)"},{"key":"16_CR20","unstructured":"Koza, J.R., Poli, R.: A genetic programming tutorial. Introductory tutorials in optimization, search and decision support 8 (2003)"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1010024515191","volume":"1","author":"WB Langdon","year":"2000","unstructured":"Langdon, W.B.: Size fair and homologous tree crossovers for tree genetic programming. Genet. Program Evolvable Mach. 1, 95\u2013119 (2000)","journal-title":"Genet. Program Evolvable Mach."},{"key":"16_CR22","unstructured":"Langdon, W.B., Poli, R.: Foundations of genetic programming. Springer Science & Business Media (2013)"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Miranda, I.M., Aranha, C., Ladeira, M.: Classification of EEG signals using genetic programming for feature construction. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2019), pp. 1275\u20131283 (2019)","DOI":"10.1145\/3321707.3321737"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Moraglio, A., Krawiec, K., Johnson, C.G.: Geometric semantic genetic programming. In: Parallel Problem Solving from Nature-PPSN XII: 12th International Conference, Taormina, Italy, September 1-5, 2012, Proceedings, Part I 12, pp. 21\u201331. Springer (2012)","DOI":"10.1007\/978-3-642-32937-1_3"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Oliveto, P., Mambrini, A.: On the analysis of simple genetic programming for evolving Boolean functions. In: 19th European Conference on Genetic Programmingn. LNCS. vol.\u00a09594, pp. 99\u2013114 (2016)","DOI":"10.1007\/978-3-319-30668-1_7"},{"key":"16_CR26","unstructured":"Poli, R., Langdon, W.B.: On the search properties of different crossover operators in genetic programming. Genetic Programming, pp. 293\u2013301 (1998)"},{"key":"16_CR27","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/A:1010068314282","volume":"1","author":"R Poli","year":"2000","unstructured":"Poli, R., Page, J.: Solving high-order Boolean parity problems with smooth uniform crossover, sub-machine code GP and demes. Genet. Program Evolvable Mach. 1, 37\u201356 (2000)","journal-title":"Genet. Program Evolvable Mach."},{"key":"16_CR28","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01531276","volume":"10","author":"NJ Radcliffe","year":"1994","unstructured":"Radcliffe, N.J.: The algebra of genetic algorithms. Ann. Math. Artif. Intell. 10, 339\u2013384 (1994)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"31","key":"16_CR29","first-page":"e11","volume":"8","author":"LW Santoso","year":"2021","unstructured":"Santoso, L.W., Singh, B., Rajest, S.S., Regin, R., Kadhim, K.H.: A genetic programming approach to binary classification problem. EAI Endorsed Trans. Energy Web 8(31), e11\u2013e11 (2021)","journal-title":"EAI Endorsed Trans. Energy Web"},{"issue":"2","key":"16_CR30","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1162\/evco_a_00254","volume":"28","author":"R Tin\u00f3s","year":"2020","unstructured":"Tin\u00f3s, R., Whitley, D., Ochoa, G.: A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Evol. Comput. 28(2), 255\u2013288 (2020)","journal-title":"Evol. Comput."},{"issue":"2","key":"16_CR31","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0377-2217(94)00301-7","volume":"92","author":"M Yagiura","year":"1996","unstructured":"Yagiura, M., Ibaraki, T.: The use of dynamic programming in genetic algorithms for permutation problems. Eur. J. Oper. Res. 92(2), 387\u2013401 (1996)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Numerical Computations: Theory and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81241-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T14:03:52Z","timestamp":1735653832000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81241-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031812408","9783031812415"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81241-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NUMTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Computations: Theory and Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pizzo Calabro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"14 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.numta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}