{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:14:20Z","timestamp":1757625260615,"version":"3.44.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T00:00:00Z","timestamp":1755561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T00:00:00Z","timestamp":1755561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["03VP09291"],"award-info":[{"award-number":["03VP09291"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Universit\u00e4t Augsburg"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>\n            <jats:italic>Cartesian Genetic Programming<\/jats:italic> (CGP) suffers from a specific limitation: <jats:italic>Positional bias<\/jats:italic>, a phenomenon in which mostly genes at the start of the genome contribute to a program output, while genes at the end rarely do. This can lead to an overall worse performance of CGP. One solution to overcome positional bias is to introduce <jats:italic>reordering methods<\/jats:italic>, which shuffle the current genotype without changing its corresponding phenotype. There are currently two different reorder operators that extend the classic CGP formula and improve its fitness value. In this work, we discuss possible shortcomings of these two existing operators. Afterwards, we introduce <jats:italic>three novel operators<\/jats:italic> which reorder the genotype of a graph defined by CGP. We show empirically on four Boolean and four symbolic regression benchmarks that the number of iterations until a solution is found and\/or the fitness value improves by using CGP with a reorder method. However, there is no consistently best performing reorder operator. Furthermore, their behaviour is analysed by investigating their convergence plots and we show that all behave the same in terms of convergence type.<\/jats:p>","DOI":"10.1007\/s42979-025-04296-4","type":"journal-article","created":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T11:33:27Z","timestamp":1755603207000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analysing the Influence of Reorder Strategies for Cartesian Genetic Programming"],"prefix":"10.1007","volume":"6","author":[{"given":"Henning","family":"Cui","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Margraf","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg","family":"H\u00e4hner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,19]]},"reference":[{"key":"4296_CR1","unstructured":"Miller JF. An empirical study of the efficiency of learning Boolean functions using a cartesian genetic programming approach, GECCO\u201999. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.; 1999. pp. 1135\u201342."},{"key":"4296_CR2","first-page":"99","volume":"64","author":"S Froehlich","year":"2022","unstructured":"Froehlich S, Drechsler R. Unlocking approximation for in-memory computing with cartesian genetic programming and computer algebra for arithmetic circuits. IT Inf Technol. 2022;64:99\u2013107.","journal-title":"IT Inf Technol"},{"key":"4296_CR3","doi-asserted-by":"crossref","unstructured":"Manazir A, Raza K. PCGP: a parallel implementation of cartesian genetic programming for combinatorial circuit design and time-series prediction; 2022. pp. 1\u20134.","DOI":"10.1109\/ICECET55527.2022.9872630"},{"key":"4296_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17310-3","volume-title":"Cartesian genetic programming","author":"JF Miller","year":"2011","unstructured":"Miller JF. Cartesian genetic programming. Berlin: Springer; 2011."},{"key":"4296_CR5","doi-asserted-by":"crossref","unstructured":"Torabi A, Sharifi A, Teshnehlab M. Using cartesian genetic programming approach with new crossover technique to design convolutional neural networks; 2022.","DOI":"10.1007\/s11063-022-11093-0"},{"key":"4296_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1162\/evco_a_00253","volume":"28","author":"M Suganuma","year":"2020","unstructured":"Suganuma M, Kobayashi M, Shirakawa S, Nagao T. Evolution of deep convolutional neural networks using cartesian genetic programming. Evol Comput. 2020;28:141\u201363.","journal-title":"Evol Comput"},{"key":"4296_CR7","doi-asserted-by":"crossref","unstructured":"Goldman BW, Punch WF. Length bias and search limitations in cartesian genetic programming, GECCO \u201913. New York, NY, USA: Association for Computing Machinery; 2013. pp. 933\u201340.","DOI":"10.1145\/2463372.2463482"},{"key":"4296_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1109\/TEVC.2014.2324539","volume":"19","author":"BW Goldman","year":"2015","unstructured":"Goldman BW, Punch WF. Analysis of cartesian genetic programming? Evolutionary mechanisms. IEEE Trans Evol Comput. 2015;19:359\u201373.","journal-title":"IEEE Trans Evol Comput"},{"key":"4296_CR9","doi-asserted-by":"crossref","unstructured":"Cui H, Margraf A, H\u00e4hner J. Equidistant reorder operator for cartesian genetic programming. INSTICC (SciTePress); 2023. pp. 64\u201374.","DOI":"10.5220\/0012174100003595"},{"key":"4296_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TEVC.2006.871253","volume":"10","author":"J Miller","year":"2006","unstructured":"Miller J, Smith S. Redundancy and computational efficiency in cartesian genetic programming. IEEE Trans Evol Comput. 2006;10:167\u201374.","journal-title":"IEEE Trans Evol Comput"},{"key":"4296_CR11","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10710-015-9244-6","volume":"16","author":"AJ Turner","year":"2015","unstructured":"Turner AJ, Miller JF. Neutral genetic drift: an investigation using cartesian genetic programming. Genet Prog Evol Mach. 2015;16:531\u201358.","journal-title":"Genet Prog Evol Mach"},{"key":"4296_CR12","doi-asserted-by":"crossref","unstructured":"Payne AJ, Stepney S. Representation and structural biases in CGP; 2009. pp. 1064\u201371.","DOI":"10.1109\/CEC.2009.4983064"},{"key":"4296_CR13","doi-asserted-by":"crossref","unstructured":"Kalkreuth R. Phenotypic duplication and inversion in cartesian genetic programming applied to Boolean function learning, GECCO \u201922. New York, NY, USA: Association for Computing Machinery; 2022. pp. 566\u2013569.","DOI":"10.1145\/3520304.3529065"},{"key":"4296_CR14","first-page":"187","volume-title":"Evolution and acquisition of modules in cartesian genetic programming","author":"JA Walker","year":"2004","unstructured":"Walker JA, Miller JF. Evolution and acquisition of modules in cartesian genetic programming. Berlin: Springer; 2004. p. 187\u201397."},{"key":"4296_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-17310-3_4","volume-title":"Self-Modifying cartesian genetic programming","author":"SL Harding","year":"2011","unstructured":"Harding SL, Miller JF, Banzhaf W. Self-Modifying cartesian genetic programming. Berlin: Springer; 2011. p. 101\u201324."},{"key":"4296_CR16","unstructured":"Wilson DG, Miller JF, Cussat-Blanc S, Luga H. Positional cartesian genetic programming; 2018. arXiv:1810.04119."},{"key":"4296_CR17","doi-asserted-by":"crossref","unstructured":"Cui H, P\u00e4tzel D, Margraf A, H\u00e4hner J. Weighted mutation of connections to mitigate search space limitations in cartesian genetic programming, FOGA \u201923. New York, NY, USA: Association for Computing Machinery; 2023. pp. 50\u201360.","DOI":"10.1145\/3594805.3607130"},{"key":"4296_CR18","first-page":"252","volume-title":"The advantages of landscape neutrality in digital circuit evolution","author":"VK Vassilev","year":"2000","unstructured":"Vassilev VK, Miller JF. The advantages of landscape neutrality in digital circuit evolution. Berlin: Springer; 2000. p. 252\u201363."},{"key":"4296_CR19","first-page":"204","volume-title":"Neutrality and the evolvability of Boolean function landscape","author":"T Yu","year":"2001","unstructured":"Yu T, Miller J. Neutrality and the evolvability of Boolean function landscape. Berlin: Springer; 2001. p. 204\u201317."},{"key":"4296_CR20","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-031-21094-5_14","volume-title":"Bioinspired optimization methods and their applications","author":"H Cui","year":"2022","unstructured":"Cui H, Margraf A, H\u00e4hner J, Mernik M, Eftimov T, \u010crepin\u0161ek M. Refining mutation variants in cartesian genetic programming. In: Mernik M, Eftimov T, \u010crepin\u0161ek M, editors. Bioinspired optimization methods and their applications. Cham: Springer; 2022. p. 185\u2013200."},{"key":"4296_CR21","doi-asserted-by":"crossref","unstructured":"Kaufmann P, Kalkreuth R. On the parameterization of cartesian genetic programming; 2020. pp. 1\u20138.","DOI":"10.1109\/CEC48606.2020.9185492"},{"key":"4296_CR22","first-page":"39","volume-title":"Bridging the gap between evolvable hardware and industry using cartesian genetic programming","author":"Z Vasicek","year":"2018","unstructured":"Vasicek Z. Bridging the gap between evolvable hardware and industry using cartesian genetic programming. Cham: Springer; 2018. p. 39\u201355."},{"key":"4296_CR23","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1037\/a0029146","volume":"142","author":"JK Kruschke","year":"2013","unstructured":"Kruschke JK. Bayesian estimation supersedes the t test. J Exp Psychol Gen. 2013;142:573.","journal-title":"J Exp Psychol Gen"},{"key":"4296_CR24","unstructured":"P\u00e4tzel D. cmpbayes; 2023. https:\/\/github.com\/dpaetzel\/cmpbayes, commit = 4de0abc37ee28b35267db173d32bb96ca9e69236."},{"key":"4296_CR25","doi-asserted-by":"crossref","unstructured":"Calvo B, Ceberio J, Lozano JA. Bayesian inference for algorithm ranking analysis, GECCO \u201918. New York, NY, USA: Association for Computing Machinery; 2018. pp. 324\u20135.","DOI":"10.1145\/3205651.3205658"},{"key":"4296_CR26","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, Castelli M, Sekanina L, Zhang M, Cagnoni S, Garc\u00eda-S\u00e1nchez P. A comparative study on crossover in cartesian genetic programming. In: Castelli M, Sekanina L, Zhang M, Cagnoni S, Garc\u00eda-S\u00e1nchez P, editors. Genetic programming. Cham: Springer; 2018. p. 203\u201319."},{"key":"4296_CR27","first-page":"61","volume-title":"Reducing wasted evaluations in cartesian genetic programming","author":"BW Goldman","year":"2013","unstructured":"Goldman BW, Punch WF. Reducing wasted evaluations in cartesian genetic programming. Berlin: Springer; 2013. p. 61\u201372."},{"key":"4296_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10710-012-9177-2","volume":"14","author":"D White","year":"2013","unstructured":"White D, et al. Better GP benchmarks: community survey results and proposals. Genet Prog Evol Mach. 2013;14:3\u201329.","journal-title":"Genet Prog Evol Mach"},{"key":"4296_CR29","doi-asserted-by":"crossref","unstructured":"Kaufmann P, Kalkreuth R. An empirical study on the parametrization of cartesian genetic programming, GECCO \u201917. New York, NY, USA: Association for Computing Machinery; 2017. p. 231\u201332.","DOI":"10.1145\/3067695.3075980"},{"key":"4296_CR30","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TEVC.2007.903549","volume":"12","author":"JA Walker","year":"2008","unstructured":"Walker JA, Miller JF. The automatic acquisition, evolution and reuse of modules in cartesian genetic programming. IEEE Trans Evol Comput. 2008;12:397\u2013417.","journal-title":"IEEE Trans Evol Comput"},{"key":"4296_CR31","doi-asserted-by":"crossref","unstructured":"Kalkreuth R. A comprehensive study on subgraph crossover in cartesian genetic programming. INSTICC (SciTePress); 2020. p. 59\u201370.","DOI":"10.5220\/0010110700590070"},{"key":"4296_CR32","doi-asserted-by":"crossref","unstructured":"Stegherr H, Heider M, H\u00e4hner J. Assisting convergence behaviour characterisation with unsupervised clustering, INSTICC (SciTePress); 2023. p. 108\u201318.","DOI":"10.5220\/0012202100003595"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-04296-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-025-04296-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-04296-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T17:06:13Z","timestamp":1757437573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-025-04296-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,19]]},"references-count":32,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2025,10]]}},"alternative-id":["4296"],"URL":"https:\/\/doi.org\/10.1007\/s42979-025-04296-4","relation":{},"ISSN":["2661-8907"],"issn-type":[{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2025,8,19]]},"assertion":[{"value":"10 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 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 to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"754"}}