{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:38:19Z","timestamp":1759847899275,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147203"},{"type":"electronic","value":"9783031147210"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14721-0_5","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"63-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Towards Discrete Phenotypic Recombination in\u00a0Cartesian Genetic Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1449-5131","authenticated-orcid":false,"given":"Roman","family":"Kalkreuth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"5_CR1","unstructured":"B\u00e4ck, T., Hoffmeister, F., Schwefel, H.: A survey of evolution strategies. In: Belew, R.K., Booker, L.B. (eds.) Proceedings of the 4th International Conference on Genetic Algorithms, San Diego, CA, USA, July 1991, pp. 2\u20139. Morgan Kaufmann (1991)"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Beyer, H., Schwefel, H.: Evolution strategies - a comprehensive introduction. Nat. Comput. 1(1), 3\u201352 (2002). https:\/\/doi.org\/10.1023\/A:1015059928466","DOI":"10.1023\/A:1015059928466"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Clegg, J., Walker, J.A., Miller, J.F.: A new crossover technique for cartesian genetic programming. In: Thierens, D., et al. (eds.) Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECCO 2007, London, 7\u201311 July 2007, vol. 2, pp. 1580\u20131587. ACM Press (2017). https:\/\/doi.org\/10.1145\/1276958.1277276. http:\/\/www.cs.bham.ac.uk\/~wbl\/biblio\/gecco2007\/docs\/p1580.pdf","DOI":"10.1145\/1276958.1277276"},{"key":"5_CR4","unstructured":"De Jong, K., Spears, W.: On the virtues of parameterized uniform crossover. In: Proceedings of the 4th International Conference on Genetic Algorithms, pp. 230\u2013236. Morgan Kaufmann Publishers, San Mateo (1991)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-319-10762-2_41","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"R Hrbacek","year":"2014","unstructured":"Hrbacek, R., Dvorak, V.: Bent function synthesis by means of cartesian genetic programming. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 414\u2013423. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_41"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-77553-1_13","volume-title":"Genetic Programming","author":"J Husa","year":"2018","unstructured":"Husa, J., Kalkreuth, R.: A comparative study on crossover in cartesian genetic programming. In: Castelli, M., Sekanina, L., Zhang, M., Cagnoni, S., Garc\u00eda-S\u00e1nchez, P. (eds.) EuroGP 2018. LNCS, vol. 10781, pp. 203\u2013219. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77553-1_13"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Husa, J., Sekanina, L.: Evolving cryptographic boolean functions with minimal multiplicative complexity. In: IEEE Congress on Evolutionary Computation, CEC 2020, Glasgow, United Kingdom, 19\u201324 July 2020, pp. 1\u20138. IEEE (2020). https:\/\/doi.org\/10.1109\/CEC48606.2020.9185517.","DOI":"10.1109\/CEC48606.2020.9185517"},{"key":"5_CR8","unstructured":"Kalganova, T.: Evolutionary approach to design multiple-valued combinational circuits. In: Proceedings of the 4th International Conference on Applications of Computer Systems, ACS 1997, Szczecin, Poland, pp. 333\u2013339 (1997)"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Kalkreuth, R.: A comprehensive study on subgraph crossover in cartesian genetic programming. In: Guerv\u00f3s, J.J.M., Garibaldi, J.M., Wagner, C., B\u00e4ck, T., Madani, K., Warwick, K. (eds.) Proceedings of the 12th International Joint Conference on Computational Intelligence, IJCCI 2020, Budapest, Hungary, 2\u20134 November 2020, pp. 59\u201370. SCITEPRESS (2020). https:\/\/doi.org\/10.5220\/0010110700590070.","DOI":"10.5220\/0010110700590070"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-319-55696-3_19","volume-title":"Genetic Programming","author":"R Kalkreuth","year":"2017","unstructured":"Kalkreuth, R., Rudolph, G., Droschinsky, A.: A new subgraph crossover for cartesian genetic programming. In: McDermott, J., Castelli, M., Sekanina, L., Haasdijk, E., Garc\u00eda-S\u00e1nchez, P. (eds.) EuroGP 2017. LNCS, vol. 10196, pp. 294\u2013310. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55696-3_19"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Kalkreuth, R.T.: Reconsideration and Extension of Cartesian Genetic Programming. Ph.D. thesis (2021). https:\/\/doi.org\/10.17877\/DE290R-22504. http:\/\/dx.doi.org\/10.17877\/DE290R-22504","DOI":"10.17877\/DE290R-22504"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Kaufmann, P., Kalkreuth, R.: An empirical study on the parametrization of cartesian genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2017, pp. 231\u2013232. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3067695.3075980. http:\/\/doi.acm.org\/10.1145\/3067695.3075980","DOI":"10.1145\/3067695.3075980"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"McDermott, J., et al.: Genetic programming needs better benchmarks. In: Proceedings of the 14th International Conference on Genetic and Evolutionary Computation Conference, GECCO 2012, Philadelphia, Pennsylvania, USA, 7\u201311 July 2012, pp. 791\u2013798. ACM (2012). https:\/\/doi.org\/10.1145\/2330163.2330273","DOI":"10.1145\/2330163.2330273"},{"key":"5_CR14","unstructured":"Miller, J.F., Thomson, P., Fogarty, T.: Designing electronic circuits using evolutionary algorithms. arithmetic circuits: a case study. In: Genetic Algorithms and Evolution Strategies in Engineering and Computer Science, pp. 105\u2013131. Wiley (1997)"},{"key":"5_CR15","unstructured":"Miller, J.F.: An empirical study of the efficiency of learning boolean functions using a cartesian genetic programming approach. In: Banzhaf, W., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, Florida, USA, 13\u201317 July 1999, vol. 2, pp. 1135\u20131142. Morgan Kaufmann (1999). http:\/\/citeseer.ist.psu.edu\/153431.html"},{"key":"5_CR16","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-030-15792-0_2","volume-title":"From Astrophysics to Unconventional Computation","author":"JF Miller","year":"2020","unstructured":"Miller, J.F., Wilson, D.G., Cussat-Blanc, S.: Evolving programs to build artificial neural networks. In: Adamatzky, A., Kendon, V. (eds.) From Astrophysics to Unconventional Computation. ECC, vol. 35, pp. 23\u201371. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-15792-0_2"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Miller, J.F.: Cartesian genetic programming: its status and future. Genet. Program. Evolvable Mach. 21(1), 129\u2013168 (2020). https:\/\/doi.org\/10.1007\/s10710-019-09360-6","DOI":"10.1007\/s10710-019-09360-6"},{"key":"5_CR18","unstructured":"Poli, R., Langdon, W.B.: On the ability to search the space of programs of standard, one-point and uniform crossover in genetic programming. Technical report CSRP-98-7, University of Birmingham, School of Computer Science (January 1998). ftp:\/\/ftp.cs.bham.ac.uk\/pub\/tech-reports\/1998\/CSRP-98-07.ps.gz. Presented at GP-98"},{"key":"5_CR19","unstructured":"Poli, R., Langdon, W.B.: On the search properties of different crossover operators in genetic programming. In: Koza, J.R., et al. (eds.) Genetic Programming 1998: Proceedings of the 3rd Annual Conference, University of Wisconsin, Madison, Wisconsin, USA, 22\u201325 July 1998, pp. 293\u2013301. Morgan Kaufmann (1998). http:\/\/www.cs.essex.ac.uk\/staff\/poli\/papers\/Poli-GP1998.pdf"},{"key":"5_CR20","unstructured":"Rechenberg, I.: Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Dr.-Ing. Ph.D. thesis, Thesis, Technical University of Berlin, Department of Process Engineering (1971)"},{"key":"5_CR21","unstructured":"Rechenberg, I.: Evolutionsstrategie Optimierung technischer Systeme nach Prinzipien der biologishen Evolution. Frommann Holzboog Verlag, Stuttgart (1973)"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BFb0029754","volume-title":"Parallel Problem Solving from Nature","author":"G Rudolph","year":"1991","unstructured":"Rudolph, G.: Global optimization by means of distributed evolution strategies. In: Schwefel, H.-P., M\u00e4nner, R. (eds.) PPSN 1990. LNCS, vol. 496, pp. 209\u2013213. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0029754"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Schwefel, H.P.: Evolutionsstrategien f\u00fcr die numerische Optimierung, pp. 123\u2013176. Birkh\u00e4user Basel, Basel (1977). https:\/\/doi.org\/10.1007\/978-3-0348-5927-1_5","DOI":"10.1007\/978-3-0348-5927-1_5"},{"key":"5_CR24","volume-title":"Numerical Optimization of Computer Models","author":"HP Schwefel","year":"1981","unstructured":"Schwefel, H.P.: Numerical Optimization of Computer Models. Wiley, USA (1981)"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Scott, E.O., Luke, S.: ECJ at 20: toward a general metaheuristics toolkit. In: L\u00f3pez-Ib\u00e1\u00f1ez, M., Auger, A., St\u00fctzle, T. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2019, Prague, Czech Republic, 13\u201317 July 2019, pp. 1391\u20131398. ACM (2019). https:\/\/doi.org\/10.1145\/3319619.3326865","DOI":"10.1145\/3319619.3326865"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Sekanina, L., Walker, J.A., Kaufmann, P., Platzner, M.: Evolution of electronic circuits. In: Miller, J.F. (ed.) Cartesian Genetic Programming. Natural Computing Series, pp. 125\u2013179. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-17310-3_5","DOI":"10.1007\/978-3-642-17310-3_5"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"da Silva, J.E.H., Bernardino, H.: Cartesian genetic programming with crossover for designing combinational logic circuits. In: 7th Brazilian Conference on Intelligent Systems, BRACIS 2018, S\u00e3o Paulo, Brazil, 22\u201325 October 2018, pp. 145\u2013150. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/BRACIS.2018.00033","DOI":"10.1109\/BRACIS.2018.00033"},{"key":"5_CR28","doi-asserted-by":"publisher","unstructured":"Suganuma, M., Kobayashi, M., Shirakawa, S., Nagao, T.: Evolution of deep convolutional neural networks using cartesian genetic programming. Evol. Comput. 28(1), 141\u2013163 (2020). https:\/\/doi.org\/10.1162\/evco_a_00253","DOI":"10.1162\/evco_a_00253"},{"key":"5_CR29","unstructured":"Syswerda, G.: Uniform crossover in genetic algorithms. In: Schaffer, J.D. (ed.) Proceedings of the 3rd International Conference on Genetic Algorithms, George Mason University, Fairfax, Virginia, USA, June 1989, pp. 2\u20139. Morgan Kaufmann (1989)"},{"key":"5_CR30","unstructured":"Turner, A.J.: Improving crossover techniques in a genetic program. Master\u2019s thesis, Department of Electronics, University of York (2012)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14721-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:47:46Z","timestamp":1710262066000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","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":"185","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":"85","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":"0","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":"46% - 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":"3.75","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":"3.11","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)"}}]}}