{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T07:12:54Z","timestamp":1777360374069,"version":"3.51.4"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031700545","type":"print"},{"value":"9783031700552","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-70055-2_17","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:54Z","timestamp":1725663774000},"page":"273-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["The Inefficiency of\u00a0Genetic Programming for\u00a0Symbolic Regression"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3012-3189","authenticated-orcid":false,"given":"Gabriel","family":"Kronberger","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2741-8736","authenticated-orcid":false,"given":"Fabricio","family":"Olivetti de Franca","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0685-9791","authenticated-orcid":false,"given":"Harry","family":"Desmond","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9426-7723","authenticated-orcid":false,"given":"Deaglan J.","family":"Bartlett","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8236-4294","authenticated-orcid":false,"given":"Lukas","family":"Kammerer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-981-99-8413-8_4","volume-title":"Genetic Programming Theory and Practice XX","author":"W Banzhaf","year":"2024","unstructured":"Banzhaf, W., Hu, T., Ochoa, G.: How the combinatorics of neutral spaces leads genetic programming to discover simple solutions. In: Winkler, S., Trujillo, L., Ofria, C., Hu, T. (eds.) Genetic Programming Theory and Practice XX, pp. 65\u201386. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-99-8413-8_4"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Bartlett, D.J., Desmond, H.: Marginalised Normal Regression: unbiased curve fitting in the presence of x-errors. Open J. Astrophys. 6, 42 (2023). https:\/\/doi.org\/10.21105\/astro.2309.00948","DOI":"10.21105\/astro.2309.00948"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1109\/TEVC.2023.3280250","volume":"28","author":"DJ Bartlett","year":"2023","unstructured":"Bartlett, D.J., Desmond, H., Ferreira, P.G.: Exhaustive symbolic regression. IEEE Trans. Evol. Comput. 28, 950\u2013964 (2023)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Burlacu, B., Affenzeller, M., Kronberger, G., Kommenda, M.: Online diversity control in symbolic regression via a fast hash-based tree similarity measure. In: 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 2175\u20132182. IEEE (2019)","DOI":"10.1109\/CEC.2019.8790162"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-030-45093-9_44","volume-title":"Computer Aided Systems Theory \u2013 EUROCAST 2019","author":"B Burlacu","year":"2020","unstructured":"Burlacu, B., Kammerer, L., Affenzeller, M., Kronberger, G.: Hash-based tree similarity and simplification in genetic programming for symbolic regression. In: Moreno-D\u00edaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2019, Part I. LNCS, vol. 12013, pp. 361\u2013369. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45093-9_44"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Burlacu, B., Kronberger, G., Kommenda, M.: Operon C++ an efficient genetic programming framework for symbolic regression. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion, pp. 1562\u20131570 (2020)","DOI":"10.1145\/3377929.3398099"},{"key":"17_CR7","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-981-99-8132-8_22","volume-title":"ICONIP 2023","author":"L Cao","year":"2023","unstructured":"Cao, L., Zheng, Z., Ding, C., Cai, J., Jiang, M.: Genetic programming symbolic regression with simplification-pruning operator for solving differential equations. In: Luo, B., Cheng, L., Wu, Z.G., Li, H., Li, C. (eds.) ICONIP 2023. CCIS, vol. 1962, pp. 287\u2013298. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8132-8_22"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Cranmer, M.: Interpretable machine learning for science with PySR and SymbolicRegression.Jl (2023). https:\/\/doi.org\/10.48550\/ARXIV.2305.01582","DOI":"10.48550\/ARXIV.2305.01582"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1007\/3-540-45110-2_58","volume-title":"Genetic and Evolutionary Computation \u2014 GECCO 2003","author":"JM Daida","year":"2003","unstructured":"Daida, J.M., Hilss, A.M.: Identifying structural mechanisms in standard genetic programming. In: Cant\u00fa-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1639\u20131651. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45110-2_58"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.1007\/3-540-45110-2_60","volume-title":"Genetic and Evolutionary Computation \u2014 GECCO 2003","author":"JM Daida","year":"2003","unstructured":"Daida, J.M., Li, H., Tang, R., Hilss, A.M.: What makes a problem GP-Hard? Validating a hypothesis of structural causes. In: Cant\u00fa-Paz, E., et al. (eds.) GECCO 2003, Part II. LNCS, vol. 2724, pp. 1665\u20131677. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45110-2_60"},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1817","DOI":"10.1093\/mnras\/stad597","volume":"521","author":"H Desmond","year":"2023","unstructured":"Desmond, H., Bartlett, D.J., Ferreira, P.G.: On the functional form of the radial acceleration relation. Monthly Not. RAS 521(2), 1817\u20131831 (2023). https:\/\/doi.org\/10.1093\/mnras\/stad597","journal-title":"Monthly Not. RAS"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Ebner, M.: On the search space of genetic programming and its relation to Nature\u2019s search space. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), vol.\u00a02, pp. 1357\u20131361. IEEE (1999)","DOI":"10.1109\/CEC.1999.782609"},{"key":"17_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2015","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-44874-8"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ins.2018.02.040","volume":"442","author":"FO de Fran\u00e7a","year":"2018","unstructured":"de Fran\u00e7a, F.O.: A greedy search tree heuristic for symbolic regression. Inf. Sci. 442, 18\u201332 (2018)","journal-title":"Inf. Sci."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"de\u00a0Fran\u00e7a, F.O.: Transformation-interaction-rational representation for symbolic regression. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 920\u2013928 (2022)","DOI":"10.1145\/3512290.3528695"},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1162\/evco_a_00285","volume":"29","author":"FO de Franca","year":"2021","unstructured":"de Franca, F.O., Aldeia, G.S.I.: Interaction-transformation evolutionary algorithm for symbolic regression. Evol. Comput. 29(3), 367\u2013390 (2021)","journal-title":"Evol. Comput."},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"de\u00a0Franca, F.O., Kronberger, G.: Reducing overparameterization of symbolic regression models with equality saturation. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1064\u20131072 (2023)","DOI":"10.1145\/3583131.3590346"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Guimer\u00e0, R., et al.: A Bayesian machine scientist to aid in the solution of challenging scientific problems. Sci. Adv. 6(5) (2020). https:\/\/doi.org\/10.1126\/sciadv.aav6971","DOI":"10.1126\/sciadv.aav6971"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Gustafson, S., Burke, E.K., Krasnogor, N.: On improving genetic programming for symbolic regression. In: 2005 IEEE Congress on Evolutionary Computation, vol.\u00a01, pp. 912\u2013919. IEEE (2005)","DOI":"10.1109\/CEC.2005.1554780"},{"issue":"3","key":"17_CR20","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1007\/s10462-020-09906-6","volume":"54","author":"AH Halim","year":"2021","unstructured":"Halim, A.H., Ismail, I., Das, S.: Performance assessment of the metaheuristic optimization algorithms: an exhaustive review. Artif. Intell. Rev. 54(3), 2323\u20132409 (2021). https:\/\/doi.org\/10.1007\/s10462-020-09906-6","journal-title":"Artif. Intell. Rev."},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1080\/10556788.2020.1808977","volume":"36","author":"N Hansen","year":"2021","unstructured":"Hansen, N., Auger, A., Ros, R., Mersmann, O., Tu\u0161ar, T., Brockhoff, D.: COCO: a platform for comparing continuous optimizers in a black-box setting. Optim. Methods Softw. 36, 114\u2013144 (2021). https:\/\/doi.org\/10.1080\/10556788.2020.1808977","journal-title":"Optim. Methods Softw."},{"key":"17_CR22","series-title":"Genetic and Evolutionary Computation","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-97088-2_7","volume-title":"Genetic Programming Theory and Practice XIV","author":"T Hu","year":"2018","unstructured":"Hu, T., Banzhaf, W.: Neutrality, robustness, and evolvability in genetic programming. In: Riolo, R., Worzel, B., Goldman, B., Tozier, B. (eds.) Genetic Programming Theory and Practice XIV. GEC, pp. 101\u2013117. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-97088-2_7"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-031-29573-7_4","volume-title":"EuroGP 2023","author":"T Hu","year":"2023","unstructured":"Hu, T., Ochoa, G., Banzhaf, W.: Phenotype search trajectory networks for linear genetic programming. In: Pappa, G., Giacobini, M., Vasicek, Z. (eds.) EuroGP 2023. LNCS, vol. 13986, pp. 52\u201367. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-29573-7_4"},{"key":"17_CR24","series-title":"Genetic and Evolutionary Computation","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-030-39958-0_5","volume-title":"Genetic Programming Theory and Practice XVII","author":"L Kammerer","year":"2020","unstructured":"Kammerer, L., Kronberger, G., Burlacu, B., Winkler, S.M., Kommenda, M., Affenzeller, M.: Symbolic regression by exhaustive search: reducing the search space using syntactical constraints and efficient semantic structure deduplication. In: Banzhaf, W., Goodman, E., Sheneman, L., Trujillo, L., Worzel, B. (eds.) Genetic Programming Theory and Practice XVII. GEC, pp. 79\u201399. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39958-0_5"},{"issue":"1","key":"17_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1186\/s40537-023-00743-2","volume":"10","author":"A Kartelj","year":"2023","unstructured":"Kartelj, A., Djukanovi\u0107, M.: RILS-ROLS: robust symbolic regression via iterated local search and ordinary least squares. J. Big Data 10(1), 71 (2023)","journal-title":"J. Big Data"},{"issue":"3","key":"17_CR26","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10710-019-09371-3","volume":"21","author":"M Kommenda","year":"2020","unstructured":"Kommenda, M., Burlacu, B., Kronberger, G., Affenzeller, M.: Parameter identification for symbolic regression using nonlinear least squares. Genet. Program Evolvable Mach. 21(3), 471\u2013501 (2020)","journal-title":"Genet. Program Evolvable Mach."},{"key":"17_CR27","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Kronberger, G., Burlacu, B., Kommenda, M., Winkler, S.M., Affenzeller, M.: Symbolic Regression. Chapman & Hall \/ CRC Press, Boca Raton (2024)","DOI":"10.1201\/9781315166407"},{"key":"17_CR29","unstructured":"Kronberger, G., de\u00a0Franca, F.O.: Effects of reducing redundant parameters in parameter optimization for symbolic regression using genetic programming. J. Symb. Comput. (2024)"},{"issue":"1","key":"17_CR30","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10710-021-09405-9","volume":"23","author":"WB Langdon","year":"2021","unstructured":"Langdon, W.B.: Genetic programming convergence. Genet. Program Evolvable Mach. 23(1), 71\u2013104 (2021). https:\/\/doi.org\/10.1007\/s10710-021-09405-9","journal-title":"Genet. Program Evolvable Mach."},{"issue":"2","key":"17_CR31","doi-asserted-by":"publisher","first-page":"152","DOI":"10.3847\/1538-4357\/836\/2\/152","volume":"836","author":"F Lelli","year":"2017","unstructured":"Lelli, F., McGaugh, S.S., Schombert, J.M., Pawlowski, M.S.: One law to rule them all: the radial acceleration relation of galaxies. Astrophys. J. 836(2), 152 (2017). https:\/\/doi.org\/10.3847\/1538-4357\/836\/2\/152","journal-title":"Astrophys. J."},{"issue":"4","key":"17_CR32","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1305","volume":"9","author":"CC Margossian","year":"2019","unstructured":"Margossian, C.C.: A review of automatic differentiation and its efficient implementation. Wiley Interdiscip. Rev. Data Min. Knowl. Discov. 9(4), e1305 (2019)","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov."},{"issue":"2","key":"17_CR33","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1139\/cjp-2014-0203","volume":"93","author":"SS McGaugh","year":"2015","unstructured":"McGaugh, S.S.: A tale of two paradigms: the mutual incommensurability of $${\\varLambda }$$CDM and MOND. Can. J. Phys. 93(2), 250\u2013259 (2015). https:\/\/doi.org\/10.1139\/cjp-2014-0203","journal-title":"Can. J. Phys."},{"key":"17_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-78671-9_12","volume-title":"Genetic Programming","author":"NF McPhee","year":"2008","unstructured":"McPhee, N.F., Ohs, B., Hutchison, T.: Semantic Building Blocks in Genetic Programming. In: O\u2019Neill, M., Vanneschi, L., Gustafson, S., Esparcia Alc\u00e1zar, A.I., De Falco, I., Della Cioppa, A., Tarantino, E. (eds.) EuroGP 2008. LNCS, vol. 4971, pp. 134\u2013145. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78671-9_12"},{"key":"17_CR35","unstructured":"Nelson, C.G.: Techniques for program verification. Stanford University (1980)"},{"issue":"2","key":"17_CR36","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1162\/evco.2007.15.2.199","volume":"15","author":"J Niehaus","year":"2007","unstructured":"Niehaus, J., Igel, C., Banzhaf, W.: Reducing the number of fitness evaluations in graph genetic programming using a canonical graph indexed database. Evol. Comput. 15(2), 199\u2013221 (2007)","journal-title":"Evol. Comput."},{"key":"17_CR37","doi-asserted-by":"crossref","unstructured":"Nikuradse, J.: Laws of flow in rough pipes. Technical report, National Advisory Committee for Aeronautics Washington, NACA TM 1292 - Translation of \u201cStr\u00f6mungsgesetze in rauhen Rohren\" VDI-Forschungsheft 361. Beilage zu \u201cForschung auf dem Gebiete des Ingenieurwesens\u201d Ausgabe B Band 4, July\/August 1933 (1950)","DOI":"10.1007\/BF02716946"},{"key":"17_CR38","doi-asserted-by":"crossref","unstructured":"Randall, D.L., Townsend, T.S., Hochhalter, J.D., Bomarito, G.F.: Bingo: a customizable framework for symbolic regression with genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 2282\u20132288 (2022)","DOI":"10.1145\/3520304.3534031"},{"key":"17_CR39","doi-asserted-by":"publisher","unstructured":"Reichardt, I., Pallar\u00e8s, J., Sales-Pardo, M., Guimer\u00e0, R.: Bayesian machine scientist to compare data collapses for the Nikuradse dataset. Phys. Rev. Lett. 124(8) (2020). https:\/\/doi.org\/10.1103\/physrevlett.124.084503","DOI":"10.1103\/physrevlett.124.084503"},{"key":"17_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116712","volume":"198","author":"D Rivero","year":"2022","unstructured":"Rivero, D., Fernandez-Blanco, E., Pazos, A.: DoMe: a deterministic technique for equation development and symbolic regression. Expert Syst. Appl. 198, 116712 (2022)","journal-title":"Expert Syst. Appl."},{"key":"17_CR41","doi-asserted-by":"crossref","unstructured":"Seidyo Imai\u00a0Aldeia, G., Olivetti\u00a0de Franca, F., La\u00a0Cava, W.G.: Inexact simplification of symbolic regression expressions with locality-sensitive hashing. arXiv e-prints pp. arXiv\u20132404 (2024)","DOI":"10.1145\/3638529.3654147"},{"key":"17_CR42","unstructured":"Sipper, M.: Tiny genetic programming in Python (2019). https:\/\/github.com\/moshesipper\/tiny_gp"},{"key":"17_CR43","doi-asserted-by":"crossref","unstructured":"Virgolin, M., Alderliesten, T., Witteveen, C., Bosman, P.A.: Scalable genetic programming by gene-pool optimal mixing and input-space entropy-based building-block learning. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1041\u20131048 (2017)","DOI":"10.1145\/3071178.3071287"},{"key":"17_CR44","doi-asserted-by":"publisher","unstructured":"Wang, H., Vermetten, D., Ye, F., Doerr, C., B\u00e4ck, T.: IOHanalyzer: detailed performance analyses for iterative optimization heuristics. ACM Trans. Evol. Learn. Optim. 2(1) (2022). https:\/\/doi.org\/10.1145\/3510426","DOI":"10.1145\/3510426"},{"key":"17_CR45","doi-asserted-by":"crossref","unstructured":"Willsey, M., Nandi, C., Wang, Y.R., Flatt, O., Tatlock, Z., Panchekha, P.: Egg: fast and extensible equality saturation. Proc. ACM Program. Lang. 5(POPL), 1\u201329 (2021)","DOI":"10.1145\/3434304"},{"key":"17_CR46","doi-asserted-by":"crossref","unstructured":"Worm, T., Chiu, K.: Prioritized grammar enumeration: symbolic regression by dynamic programming. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, pp. 1021\u20131028 (2013)","DOI":"10.1145\/2463372.2463486"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70055-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T21:39:19Z","timestamp":1732743559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70055-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700545","9783031700552"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70055-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}