{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:10:15Z","timestamp":1757617815170,"version":"3.44.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031899904"},{"type":"electronic","value":"9783031899911"}],"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-89991-1_9","type":"book-chapter","created":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T08:23:29Z","timestamp":1745310209000},"page":"139-155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ant-Based Metaheuristics Struggle to\u00a0Solve the\u00a0Cartesian Genetic Programming Learning Task"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-3913-5896","authenticated-orcid":false,"given":"Julian","family":"Trautwein","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3140-1993","authenticated-orcid":false,"given":"Michael","family":"Heider","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5483-5079","authenticated-orcid":false,"given":"Henning","family":"Cui","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0107-264X","authenticated-orcid":false,"given":"J\u00f6rg","family":"H\u00e4hner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,18]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Akiba, T., Sano, S., Yanase, T., Ohta, T., Koyama, M.: Optuna: a next-generation hyperparameter optimization framework. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2019)","DOI":"10.1145\/3292500.3330701"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Altiparmak, F., Karaoglan, I.: A genetic ant colony optimization approach for concave cost transportation problems. In: 2007 IEEE Congress on Evolutionary Computation, pp. 1685\u20131692 (2007). https:\/\/doi.org\/10.1109\/CEC.2007.4424676","DOI":"10.1109\/CEC.2007.4424676"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Baykaso\u01e7lu, A., \u00d6zbakir, L., Tapkan, P.: Artificial bee colony algorithm and its application to generalized assignment problem. In: Chan, F.T., Tiwari, M.K. (eds.) Swarm Intelligence, chap.\u00a08. IntechOpen, Rijeka (2007). https:\/\/doi.org\/10.5772\/5101","DOI":"10.5772\/5101"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Becker, B., Kohavi, R.: Adult. UCI Machine Learning Repository (1996). https:\/\/doi.org\/10.24432\/C5XW20","DOI":"10.24432\/C5XW20"},{"issue":"1","key":"9_CR5","first-page":"2653","volume":"18","author":"A Benavoli","year":"2017","unstructured":"Benavoli, A., Corani, G., Dem\u0161ar, J., Zaffalon, M.: Time for a change: a tutorial for comparing multiple classifiers through Bayesian analysis. J. Mach. Learn. Res. 18(1), 2653\u20132688 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Calvo, B., Ceberio, J., Lozano, J.A.: Bayesian inference for algorithm ranking analysis. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO \u201918, pp. 324\u2013325. Association for Computing Machinery, New York (2018). https:\/\/doi.org\/10.1145\/3205651.3205658","DOI":"10.1145\/3205651.3205658"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Cortez, P., Cerdeira, A., Almeida, F., Matos, T., Reis, J.: Wine Quality. UCI Machine Learning Repository (2009). https:\/\/doi.org\/10.24432\/C56S3T","DOI":"10.24432\/C56S3T"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Cortez, P., Morais, A.: Forest Fires. UCI Machine Learning Repository (2007). https:\/\/doi.org\/10.24432\/C5D88D","DOI":"10.24432\/C5D88D"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Cui, H., Heider, M., H\u00e4hner, J.: Positional bias does not influence cartesian genetic programming with crossover. In: Affenzeller, M., et al. (eds.) Parallel Problem Solving from Nature \u2013 PPSN XVIII, pp. 151\u2013167. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-70055-2_10","DOI":"10.1007\/978-3-031-70055-2_10"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Cui, H., P\u00e4tzel, D., Margraf, A., H\u00e4hner, J.: Weighted mutation of connections to mitigate search space limitations in cartesian genetic programming. In: Proceedings of the 17th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms. FOGA \u201923, pp. 50\u201360. Association for Computing Machinery, New York (2023). https:\/\/doi.org\/10.1145\/3594805.3607130","DOI":"10.1145\/3594805.3607130"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53\u201366 (1997). https:\/\/doi.org\/10.1109\/4235.585892","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 26(1), 29\u201341 (1996). https:\/\/doi.org\/10.1109\/3477.484436","DOI":"10.1109\/3477.484436"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1007\/s40747-020-00241-5","volume":"7","author":"W Fang","year":"2021","unstructured":"Fang, W., Gu, M.: FMCGP: frameshift mutation cartesian genetic programming. Complex Intell. Syst. 7(3), 1195\u20131206 (2021). https:\/\/doi.org\/10.1007\/s40747-020-00241-5","journal-title":"Complex Intell. Syst."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-37207-0_6","volume-title":"Genetic Programming","author":"BW Goldman","year":"2013","unstructured":"Goldman, B.W., Punch, W.F.: Reducing wasted evaluations in cartesian genetic programming. In: Krawiec, K., Moraglio, A., Hu, T., Etaner-Uyar, A.\u015e, Hu, B. (eds.) Genetic Programming, pp. 61\u201372. Springer, Heidelberg (2013)"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Hara, A., Watanabe, M., Takahama, T.: Cartesian ant programming. In: 2011 IEEE International Conference on Systems, Man, and Cybernetics, pp. 3161\u20133166 (2011). https:\/\/doi.org\/10.1109\/ICSMC.2011.6084146","DOI":"10.1109\/ICSMC.2011.6084146"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Harding, S., Graziano, V., Leitner, J., Schmidhuber, J.: MT-CGP: mixed type cartesian genetic programming. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation. GECCO \u201912, pp. 751\u2013758. Association for Computing Machinery, New York (2012). https:\/\/doi.org\/10.1145\/2330163.2330268","DOI":"10.1145\/2330163.2330268"},{"issue":"5","key":"9_CR17","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1109\/TEVC.2005.863127","volume":"10","author":"M Hutter","year":"2006","unstructured":"Hutter, M., Legg, S.: Fitness uniform optimization. IEEE Trans. Evol. Comput. 10(5), 568\u2013589 (2006). https:\/\/doi.org\/10.1109\/TEVC.2005.863127","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Kalkreuth, R.: Two new mutation techniques for cartesian genetic programming. In: Proceedings of the 11th International Joint Conference on Computational Intelligence, IJCCI 2019, pp. 82\u201392. SCITEPRESS - Science and Technology Publications, Lda, Setubal, PRT (2019). https:\/\/doi.org\/10.5220\/0008070100820092","DOI":"10.5220\/0008070100820092"},{"issue":"3","key":"9_CR19","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39(3), 459\u2013471 (2007). https:\/\/doi.org\/10.1007\/s10898-007-9149-x","journal-title":"J. Global Optim."},{"key":"9_CR20","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 \u201917, pp. 231\u2013232. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3067695.3075980","DOI":"10.1145\/3067695.3075980"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Kaufmann, P., Kalkreuth, R.: On the parameterization of cartesian genetic programming. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp.\u00a01\u20138 (2020). https:\/\/doi.org\/10.1109\/CEC48606.2020.9185492","DOI":"10.1109\/CEC48606.2020.9185492"},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1037\/a0029146","volume":"142","author":"JK Kruschke","year":"2013","unstructured":"Kruschke, J.K.: Bayesian estimation supersedes the t test. J. Exp. Psychol. Gen. 142(2), 573\u2013603 (2013). https:\/\/doi.org\/10.1037\/a0029146","journal-title":"J. Exp. Psychol. Gen."},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Kushida, J.I., Hara, A., Takahama, T., Nagura, S.: Cartesian ant programming with transition rule considering internode distance. In: 2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA), pp. 101\u2013105 (2016). https:\/\/doi.org\/10.1109\/IWCIA.2016.7805756","DOI":"10.1109\/IWCIA.2016.7805756"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-37207-0_10","volume-title":"Genetic Programming","author":"S Luis","year":"2013","unstructured":"Luis, S., dos Santos, M.V.: On the evolvability of a hybrid ant colony-cartesian genetic programming methodology. In: Krawiec, K., Moraglio, A., Hu, T., Etaner-Uyar, A.\u015e, Hu, B. (eds.) EuroGP 2013. LNCS, vol. 7831, pp. 109\u2013120. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37207-0_10"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Margraf, A., Stein, A., Engstler, L., Geinitz, S., Hahner, J.: An evolutionary learning approach to self-configuring image pipelines in the context of carbon fiber fault detection. In: 2017 16th IEEE International Conference on Machine Learning and Applications (ICMLA), pp. 147\u2013154 (2017). https:\/\/doi.org\/10.1109\/ICMLA.2017.0-165","DOI":"10.1109\/ICMLA.2017.0-165"},{"key":"9_CR26","unstructured":"Miller, J.F.: An empirical study of the efficiency of learning Boolean functions using a cartesian genetic programming approach. In: Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation. GECCO\u201999, vol. 2, pp. 1135\u20131142. Morgan Kaufmann Publishers Inc., San Francisco (1999)"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Miller, J.F.: Cartesian genetic programming. In: Miller, J.F. (ed.) Cartesian Genetic Programming. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-17310-3_2","DOI":"10.1007\/978-3-642-17310-3_2"},{"issue":"1","key":"9_CR28","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10710-019-09360-6","volume":"21","author":"JF Miller","year":"2020","unstructured":"Miller, J.F.: Cartesian genetic programming: its status and future. Genet. Program Evol. Mach. 21(1), 129\u2013168 (2020)","journal-title":"Genet. Program Evol. Mach."},{"key":"9_CR29","doi-asserted-by":"publisher","unstructured":"Prakasam, A., Savarimuthu, N.: Metaheuristic algorithms and polynomial turing reductions: a case study based on ant colony optimization. In: Proceedings of the International Conference on Information and Communication Technologies, ICICT, vol.\u00a046, pp. 388\u2013395. Procedia Computer Science (2015). https:\/\/doi.org\/10.1016\/j.procs.2015.02.035","DOI":"10.1016\/j.procs.2015.02.035"},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Rubini, L., Soundarapandian, P., Eswaran, P.: Chronic Kidney Disease. UCI Machine Learning Repository (2015). https:\/\/doi.org\/10.24432\/C5G020","DOI":"10.24432\/C5G020"},{"issue":"8","key":"9_CR31","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: Max-min ant system. Future Gener. Comput. Syst. 16(8), 889\u2013914 (2000). https:\/\/doi.org\/10.1016\/S0167-739X(00)00043-1","journal-title":"Future Gener. Comput. Syst."},{"key":"9_CR32","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"},{"issue":"4","key":"9_CR33","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10710-015-9244-6","volume":"16","author":"AJ Turner","year":"2015","unstructured":"Turner, A.J., Miller, J.F.: Neutral genetic drift: an investigation using Cartesian Genetic Programming. Genet. Program Evol. Mach. 16(4), 531\u2013558 (2015). https:\/\/doi.org\/10.1007\/s10710-015-9244-6","journal-title":"Genet. Program Evol. Mach."},{"issue":"1","key":"9_CR34","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10710-012-9177-2","volume":"14","author":"DR White","year":"2013","unstructured":"White, D.R., et al.: Better GP benchmarks: community survey results and proposals. Genet. Program Evol. Mach. 14(1), 3\u201329 (2013). https:\/\/doi.org\/10.1007\/s10710-012-9177-2","journal-title":"Genet. Program Evol. Mach."},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-45105-6_11","volume-title":"Genetic and Evolutionary Computation \u2014 GECCO 2003","author":"T White","year":"2003","unstructured":"White, T., Kaegi, S., Oda, T.: Revisiting elitism in ant colony optimization. In: Cant\u00fa-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 122\u2013133. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45105-6_11"}],"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-89991-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T11:46:51Z","timestamp":1757159211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-89991-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031899904","9783031899911"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-89991-1_9","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":"18 April 2025","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":"Trieste","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurogp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2025\/eurogp\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}