{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:06:23Z","timestamp":1764785183064,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583133.3596305","type":"proceedings-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T23:30:33Z","timestamp":1690241433000},"page":"2056-2063","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Fitness Landscape Analysis of Genetic Programming Search Spaces with Local Optima Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9171-3502","authenticated-orcid":false,"given":"Yifan","family":"He","sequence":"first","affiliation":[{"name":"Zhejiang University of Finance & Economics, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6100-6532","authenticated-orcid":false,"given":"Ferrante","family":"Neri","sequence":"additional","affiliation":[{"name":"University of Surrey, Guildford, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319619.3326852"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02227-3"},{"key":"e_1_3_2_1_4_1","volume-title":"PPSN 2020, Leiden, The Netherlands, September 5--9, 2020, Proceedings, Part II 16","author":"Durasevic Marko","year":"2020","unstructured":"Marko Durasevic , Domagoj Jakobovic , Marcella Scoczynski Ribeiro Martins , Stjepan Picek , and Markus Wagner . 2020 . Fitness landscape analysis of dimensionally-aware genetic programming featuring feynman equations. In Parallel Problem Solving from Nature-PPSN XVI: 16th International Conference , PPSN 2020, Leiden, The Netherlands, September 5--9, 2020, Proceedings, Part II 16 . Springer, 111--124. Marko Durasevic, Domagoj Jakobovic, Marcella Scoczynski Ribeiro Martins, Stjepan Picek, and Markus Wagner. 2020. Fitness landscape analysis of dimensionally-aware genetic programming featuring feynman equations. In Parallel Problem Solving from Nature-PPSN XVI: 16th International Conference, PPSN 2020, Leiden, The Netherlands, September 5--9, 2020, Proceedings, Part II 16. Springer, 111--124."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/3322706.3361996"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108509"},{"key":"e_1_3_2_1_7_1","first-page":"184","article-title":"Fitness distance correlation as a measure of problem difficulty for genetic algorithms","volume":"95","author":"Jones Terry","year":"1995","unstructured":"Terry Jones , Stephanie Forrest , 1995 . Fitness distance correlation as a measure of problem difficulty for genetic algorithms .. In ICGA , Vol. 95. 184 -- 192 . Terry Jones, Stephanie Forrest, et al. 1995. Fitness distance correlation as a measure of problem difficulty for genetic algorithms.. In ICGA, Vol. 95. 184--192.","journal-title":"ICGA"},{"volume-title":"Genetically breeding populations of computer programs to solve problems in artificial intelligence. In [1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence","author":"Koza John R","key":"e_1_3_2_1_8_1","unstructured":"John R Koza . 1990. Genetically breeding populations of computer programs to solve problems in artificial intelligence. In [1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence . IEEE , 819--827. John R Koza. 1990. Genetically breeding populations of computer programs to solve problems in artificial intelligence. In [1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence. IEEE, 819--827."},{"key":"e_1_3_2_1_9_1","volume-title":"Genetic programming as a means for programming computers by natural selection. Statistics and computing 4","author":"Koza John R","year":"1994","unstructured":"John R Koza . 1994. Genetic programming as a means for programming computers by natural selection. Statistics and computing 4 ( 1994 ), 87--112. John R Koza. 1994. Genetic programming as a means for programming computers by natural selection. Statistics and computing 4 (1994), 87--112."},{"key":"e_1_3_2_1_10_1","unstructured":"Joel Lehman Kenneth O Stanley etal 2008. Exploiting open-endedness to solve problems through the search for novelty.. In ALIFE. 329--336.  Joel Lehman Kenneth O Stanley et al. 2008. Exploiting open-endedness to solve problems through the search for novelty.. In ALIFE. 329--336."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-020-09390-5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.09.019"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.3390\/a14020040"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3275518"},{"key":"e_1_3_2_1_15_1","volume-title":"Illuminating search spaces by mapping elites. arXiv preprint arXiv:1504.04909","author":"Mouret Jean-Baptiste","year":"2015","unstructured":"Jean-Baptiste Mouret and Jeff Clune . 2015. Illuminating search spaces by mapping elites. arXiv preprint arXiv:1504.04909 ( 2015 ). Jean-Baptiste Mouret and Jeff Clune. 2015. Illuminating search spaces by mapping elites. arXiv preprint arXiv:1504.04909 (2015)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2464576.2466800"},{"key":"e_1_3_2_1_17_1","volume-title":"PPSN 2022, Dortmund, Germany, September 10--14, 2022, Proceedings, Part I. Springer, 603--615","author":"Ochoa Gabriela","year":"2022","unstructured":"Gabriela Ochoa and Nadarajen Veerapen . 2022 . Neural Architecture Search: A Visual Analysis. In Parallel Problem Solving from Nature-PPSN XVII: 17th International Conference , PPSN 2022, Dortmund, Germany, September 10--14, 2022, Proceedings, Part I. Springer, 603--615 . Gabriela Ochoa and Nadarajen Veerapen. 2022. Neural Architecture Search: A Visual Analysis. In Parallel Problem Solving from Nature-PPSN XVII: 17th International Conference, PPSN 2022, Dortmund, Germany, September 10--14, 2022, Proceedings, Part I. Springer, 603--615."},{"key":"e_1_3_2_1_18_1","volume-title":"Local optima networks: A new model of combinatorial fitness landscapes. Recent advances in the theory and application of fitness landscapes","author":"Ochoa Gabriela","year":"2014","unstructured":"Gabriela Ochoa , S\u00e9bastien Verel , Fabio Daolio , and Marco Tomassini . 2014. Local optima networks: A new model of combinatorial fitness landscapes. Recent advances in the theory and application of fitness landscapes ( 2014 ), 233--262. Gabriela Ochoa, S\u00e9bastien Verel, Fabio Daolio, and Marco Tomassini. 2014. Local optima networks: A new model of combinatorial fitness landscapes. Recent advances in the theory and application of fitness landscapes (2014), 233--262."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.07.040"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71605-1_29"},{"key":"e_1_3_2_1_21_1","volume-title":"A study of fitness distance correlation as a difficulty measure in genetic programming. Evolutionary computation 13, 2","author":"Tomassini Marco","year":"2005","unstructured":"Marco Tomassini , Leonardo Vanneschi , Philippe Collard , and Manuel Clergue . 2005. A study of fitness distance correlation as a difficulty measure in genetic programming. Evolutionary computation 13, 2 ( 2005 ), 213--239. Marco Tomassini, Leonardo Vanneschi, Philippe Collard, and Manuel Clergue. 2005. A study of fitness distance correlation as a difficulty measure in genetic programming. Evolutionary computation 13, 2 (2005), 213--239."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-010-9121-2"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.03.011"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11729976_16"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71605-1_22"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3067695.3082518"},{"key":"e_1_3_2_1_27_1","volume-title":"Visualising the global structure of search landscapes: genetic improvement as a case study. Genetic programming and evolvable machines 19, 3","author":"Veerapen Nadarajen","year":"2018","unstructured":"Nadarajen Veerapen and Gabriela Ochoa . 2018. Visualising the global structure of search landscapes: genetic improvement as a case study. Genetic programming and evolvable machines 19, 3 ( 2018 ), 317--349. Nadarajen Veerapen and Gabriela Ochoa. 2018. Visualising the global structure of search landscapes: genetic improvement as a case study. Genetic programming and evolvable machines 19, 3 (2018), 317--349."},{"key":"e_1_3_2_1_28_1","volume-title":"Artificial Evolution: 10th International Conference","author":"Verel S\u00e9bastien","year":"2011","unstructured":"S\u00e9bastien Verel , Fabio Daolio , Gabriela Ochoa , and Marco Tomassini . 2012. Local optima networks with escape edges . In Artificial Evolution: 10th International Conference , Evolution Artificielle, EA 2011 , Angers, France, October 24--26, 2011, Revised Selected Papers 10. Springer , 49--60. S\u00e9bastien Verel, Fabio Daolio, Gabriela Ochoa, and Marco Tomassini. 2012. Local optima networks with escape edges. In Artificial Evolution: 10th International Conference, Evolution Artificielle, EA 2011, Angers, France, October 24--26, 2011, Revised Selected Papers 10. Springer, 49--60."},{"key":"e_1_3_2_1_29_1","series-title":"SIAM journal on computing 18, 6","volume-title":"Simple fast algorithms for the editing distance between trees and related problems","author":"Zhang Kaizhong","year":"1989","unstructured":"Kaizhong Zhang and Dennis Shasha . 1989. Simple fast algorithms for the editing distance between trees and related problems . SIAM journal on computing 18, 6 ( 1989 ), 1245--1262. Kaizhong Zhang and Dennis Shasha. 1989. Simple fast algorithms for the editing distance between trees and related problems. SIAM journal on computing 18, 6 (1989), 1245--1262."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI51031.2022.10022277"}],"event":{"name":"GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lisbon Portugal","acronym":"GECCO '23 Companion"},"container-title":["Proceedings of the Companion Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3596305","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583133.3596305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:54Z","timestamp":1750182534000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3596305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,15]]},"references-count":29,"alternative-id":["10.1145\/3583133.3596305","10.1145\/3583133"],"URL":"https:\/\/doi.org\/10.1145\/3583133.3596305","relation":{},"subject":[],"published":{"date-parts":[[2023,7,15]]},"assertion":[{"value":"2023-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}