{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:12:21Z","timestamp":1750219941485,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"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"}],"funder":[{"name":"University Natural Sciences Research Project of Anhui Province","award":["KJ2020A0661"],"award-info":[{"award-number":["KJ2020A0661"]}]},{"name":"National Natural Science Foundation of China","award":["61673359"],"award-info":[{"award-number":["61673359"]}]},{"name":"Key Research Plan of Anhui","award":["2022k07020011","202104d07020006"],"award-info":[{"award-number":["2022k07020011","202104d07020006"]}]},{"name":"Hefei Specially Recruited Foreign Expert program"},{"name":"Hefei Foreign Expert Office program"},{"name":"Youth Project of the Provincial Natural Science Foundation of Anhui","award":["1908085QF285"],"award-info":[{"award-number":["1908085QF285"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583133.3596306","type":"proceedings-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T23:30:33Z","timestamp":1690241433000},"page":"1891-1899","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Replicable Self-Documenting Experiments with Arbitrary Search Spaces and Algorithms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9687-8509","authenticated-orcid":false,"given":"Thomas","family":"Weise","sequence":"first","affiliation":[{"name":"Institute of Applied Optimization, School of Artificial Intelligence and Big Data, Hefei University, Hefei, Anhui, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7416-5711","authenticated-orcid":false,"given":"Zhize","family":"Wu","sequence":"additional","affiliation":[{"name":"Institute of Applied Optimization, School of Artificial Intelligence and Big Data, Hefei University, Hefei, Anhui, China"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"ACM. 2020. Artifact Review and Badging Version 1.1. Retrieved 2023-01-21 from https:\/\/www.acm.org\/publications\/policies\/artifact-review-and-badging-current  ACM. 2020. Artifact Review and Badging Version 1.1. Retrieved 2023-01-21 from https:\/\/www.acm.org\/publications\/policies\/artifact-review-and-badging-current"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1990.166"},{"key":"e_1_3_2_1_4_1","first-page":"23","article-title":"Permuted Congruential Generator (64-bit, PCG64). In NumPy Reference","volume":"1","author":"Community NumPy","year":"2022","unstructured":"NumPy Community . 2022 . Permuted Congruential Generator (64-bit, PCG64). In NumPy Reference , Release 1 . 23 .0. NumFOCUS, Inc., Austin, TX, USA. Retrieved 2023-01-21 from https:\/\/numpy.org\/doc\/1.23\/numpy-ref.pdf NumPy Community. 2022. Permuted Congruential Generator (64-bit, PCG64). In NumPy Reference, Release 1.23.0. NumFOCUS, Inc., Austin, TX, USA. Retrieved 2023-01-21 from https:\/\/numpy.org\/doc\/1.23\/numpy-ref.pdf","journal-title":"Release"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45356-3_83"},{"key":"e_1_3_2_1_6_1","volume-title":"IOHprofiler: A Benchmarking and Profiling Tool for Iterative Optimization Heuristics","author":"Doerr Carola","year":"2023","unstructured":"Carola Doerr , Hao Wang , Furong Ye , Sander van Rijn , and Thomas B\u00e4ck . 2018. IOHprofiler: A Benchmarking and Profiling Tool for Iterative Optimization Heuristics . Cornell University , New York, NY, USA . Retrieved 2023 -01-21 from https:\/\/arxiv.org\/pdf\/1810.05281.pdf arXiv:1810.05281v1 [cs.NE] 11 Oct 2018. Carola Doerr, Hao Wang, Furong Ye, Sander van Rijn, and Thomas B\u00e4ck. 2018. IOHprofiler: A Benchmarking and Profiling Tool for Iterative Optimization Heuristics. Cornell University, New York, NY, USA. Retrieved 2023-01-21 from https:\/\/arxiv.org\/pdf\/1810.05281.pdf arXiv:1810.05281v1 [cs.NE] 11 Oct 2018."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.106027"},{"volume-title":"Ant Colony Optimization","author":"Dorigo Marco","key":"e_1_3_2_1_8_1","unstructured":"Marco Dorigo and Thomas St\u00fctzle . 2004. Ant Colony Optimization . MIT Press , Cambridge, MA, USA . Marco Dorigo and Thomas St\u00fctzle. 2004. Ant Colony Optimization. MIT Press, Cambridge, MA, USA."},{"issue":"2","key":"e_1_3_2_1_9_1","first-page":"2021","article-title":"YAML Ain't Markup Language (YAML\u00ae) version 1.2","volume":"1","author":"\u00f6t Net Ingy","year":"2021","unstructured":"Ingy d \u00f6t Net , Tina M\u00fcller , Pantelis Antoniou , Eemeli Aro , and Thomas Smith . 2021 . YAML Ain't Markup Language (YAML\u00ae) version 1.2 , Revision 1 . 2 .2 ( 2021 - 2010 -01). YAML Language Development Team, Seattle, WA, USA. Retrieved 2023-01-21 from https:\/\/yaml.org\/spec\/1.2.2\/ Ingy d\u00f6t Net, Tina M\u00fcller, Pantelis Antoniou, Eemeli Aro, and Thomas Smith. 2021. YAML Ain't Markup Language (YAML\u00ae) version 1.2, Revision 1.2.2 (2021-10-01). YAML Language Development Team, Seattle, WA, USA. Retrieved 2023-01-21 from https:\/\/yaml.org\/spec\/1.2.2\/","journal-title":"Revision"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449726.3463276"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1961.10482090"},{"volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg David Edward","key":"e_1_3_2_1_12_1","unstructured":"David Edward Goldberg . 1989. Genetic Algorithms in Search, Optimization, and Machine Learning . Addison-Wesley Longman , Boston, MA, USA . David Edward Goldberg. 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Longman, Boston, MA, USA."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v39i3.2816"},{"key":"e_1_3_2_1_14_1","volume-title":"Real-Parameter Black-Box Optimization Benchmarking 2010: Experimental Setup. Rapports de Recherche RR-7215","author":"Hansen Nikolaus","year":"2023","unstructured":"Nikolaus Hansen , Anne Auger , Steffen Finck , and Raymond Ros . 2010. Real-Parameter Black-Box Optimization Benchmarking 2010: Experimental Setup. Rapports de Recherche RR-7215 . Institut National de Recherche en Informatique et en Automatique (INRIA). Retrieved 2023 -01-21 from http:\/\/hal.inria.fr\/inria-00462481 inria-00462481. Nikolaus Hansen, Anne Auger, Steffen Finck, and Raymond Ros. 2010. Real-Parameter Black-Box Optimization Benchmarking 2010: Experimental Setup. Rapports de Recherche RR-7215. Institut National de Recherche en Informatique et en Automatique (INRIA). Retrieved 2023-01-21 from http:\/\/hal.inria.fr\/inria-00462481 inria-00462481."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1808977"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365601750190398"},{"key":"e_1_3_2_1_17_1","volume-title":"COCO: The Experimental Procedure","author":"Hansen Nikolaus","year":"2016","unstructured":"Nikolaus Hansen , Tea Tu\u0161ar , Olaf Mersmann , Anne Auger , and Dimo Brockhoff . 2016 . COCO: The Experimental Procedure . Cornell University , New York, NY, USA . Retrieved 2023-01-21 from https:\/\/arxiv.org\/abs\/1603.08776 arXiv:1603.08776v2 [cs.AI] 19 May 2016. Nikolaus Hansen, Tea Tu\u0161ar, Olaf Mersmann, Anne Auger, and Dimo Brockhoff. 2016. COCO: The Experimental Procedure. Cornell University, New York, NY, USA. Retrieved 2023-01-21 from https:\/\/arxiv.org\/abs\/1603.08776 arXiv:1603.08776v2 [cs.AI] 19 May 2016."},{"volume-title":"Nonparametric Statistical Methods","author":"Hollander Myles","key":"e_1_3_2_1_18_1","unstructured":"Myles Hollander and Douglas Alan Wolfe . 1973. Nonparametric Statistical Methods . John Wiley and Sons Ltd ., New York, NY, USA. Myles Hollander and Douglas Alan Wolfe. 1973. Nonparametric Statistical Methods. John Wiley and Sons Ltd., New York, NY, USA."},{"key":"e_1_3_2_1_19_1","volume-title":"Evaluating Las Vegas Algorithms - Pitfalls and Remedies. In 14th Conf. on Uncertainty in Artificial Intelligence (UAI'98)","author":"Holger","year":"1998","unstructured":"Holger H. Hoos and Thomas St\u00fctzle. 1998 . Evaluating Las Vegas Algorithms - Pitfalls and Remedies. In 14th Conf. on Uncertainty in Artificial Intelligence (UAI'98) , July 24 --26 , 1998 , Madison, WI, USA, Gregory F. Cooper and Seraf\u00edn Moral (Eds.). Morgan Kaufmann, San Francisco, CA, USA, 238--245. Holger H. Hoos and Thomas St\u00fctzle. 1998. Evaluating Las Vegas Algorithms - Pitfalls and Remedies. In 14th Conf. on Uncertainty in Artificial Intelligence (UAI'98), July 24--26, 1998, Madison, WI, USA, Gregory F. Cooper and Seraf\u00edn Moral (Eds.). Morgan Kaufmann, San Francisco, CA, USA, 238--245."},{"key":"e_1_3_2_1_20_1","volume-title":"Hoos and Thomas St\u00fctzle","author":"Holger","year":"2005","unstructured":"Holger H. Hoos and Thomas St\u00fctzle . 2005 . Stochastic Local Search: Foundations and Applications. Elsevier , Amsterdam, The Netherlands. Holger H. Hoos and Thomas St\u00fctzle. 2005. Stochastic Local Search: Foundations and Applications. Elsevier, Amsterdam, The Netherlands."},{"key":"e_1_3_2_1_21_1","volume-title":"open, openat - open file","author":"IEEE and The Open Group","year":"2018","unstructured":"IEEE and The Open Group . 2018. open, openat - open file . In The Open Group Base Specifications Issue 7, 2018 Edition, IEEE Std 1003.1-2017 (Revision of IEEE Std 1003.1-2008). IEEE and The Open Group, Burlington, MA, USA. https:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/open.html IEEE and The Open Group. 2018. open, openat - open file. In The Open Group Base Specifications Issue 7, 2018 Edition, IEEE Std 1003.1-2017 (Revision of IEEE Std 1003.1-2008). IEEE and The Open Group, Burlington, MA, USA. https:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/open.html"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CIPLS.2014.7007174"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI51031.2022.10022296"},{"key":"e_1_3_2_1_24_1","volume-title":"Baptiste Roziere, Jeremy Rapin, Olivier Teytaud, Antoine Moreau, and Carola Doerr.","author":"Meunier Laurent","year":"2021","unstructured":"Laurent Meunier , Herilalaina Rakotoarison , Pak Kan Wong , Baptiste Roziere, Jeremy Rapin, Olivier Teytaud, Antoine Moreau, and Carola Doerr. 2021 . Black-Box Optimization Revisited: Improving Algorithm Selection Wizards through Massive Benchmarking. Cornell University , New York, NY, USA. Retrieved 2023-01-21 from https:\/\/arxiv.org\/abs\/2010.04542v3 arXiv:2010.04542v3 [cs.LG] 23 Feb 2021. Laurent Meunier, Herilalaina Rakotoarison, Pak Kan Wong, Baptiste Roziere, Jeremy Rapin, Olivier Teytaud, Antoine Moreau, and Carola Doerr. 2021. Black-Box Optimization Revisited: Improving Algorithm Selection Wizards through Massive Benchmarking. Cornell University, New York, NY, USA. Retrieved 2023-01-21 from https:\/\/arxiv.org\/abs\/2010.04542v3 arXiv:2010.04542v3 [cs.LG] 23 Feb 2021."},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of Parallel Problem Solving from Nature 2 (PPSN-II), Sept. 28--30","author":"M\u00fchlenbein Heinz","year":"1992","unstructured":"Heinz M\u00fchlenbein . 1992 . How Genetic Algorithms Really Work: Mutation and Hillclimbing . In Proceedings of Parallel Problem Solving from Nature 2 (PPSN-II), Sept. 28--30 , 1992, Brussels, Belgium. Elsevier, Amsterdam, The Netherlands, 15--26. Heinz M\u00fchlenbein. 1992. How Genetic Algorithms Really Work: Mutation and Hillclimbing. In Proceedings of Parallel Problem Solving from Nature 2 (PPSN-II), Sept. 28--30, 1992, Brussels, Belgium. Elsevier, Amsterdam, The Netherlands, 15--26."},{"key":"e_1_3_2_1_26_1","volume-title":"PCG: A Family of Simple Fast Space-Efficient Statistically Good Algorithms for Random Number Generation. Technical Report HMC-CS-2014-0905","author":"O'Neill Melissa E.","year":"2014","unstructured":"Melissa E. O'Neill . 2014 . PCG: A Family of Simple Fast Space-Efficient Statistically Good Algorithms for Random Number Generation. Technical Report HMC-CS-2014-0905 . Harvey Mudd College, Computer Science Department , Claremont, CA, USA. Retrieved 2023-01-21 from https:\/\/www.cs.hmc.edu\/tr\/hmc-cs-2014-0905.pdf Melissa E. O'Neill. 2014. PCG: A Family of Simple Fast Space-Efficient Statistically Good Algorithms for Random Number Generation. Technical Report HMC-CS-2014-0905. Harvey Mudd College, Computer Science Department, Claremont, CA, USA. Retrieved 2023-01-21 from https:\/\/www.cs.hmc.edu\/tr\/hmc-cs-2014-0905.pdf"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.FIPS.180-4"},{"key":"e_1_3_2_1_29_1","volume-title":"Nevergrad - A Gradient-Free Optimization Platform. GitHub","author":"Rapin Jeremy","year":"2023","unstructured":"Jeremy Rapin and Olivier Teytaud . 2018. Nevergrad - A Gradient-Free Optimization Platform. GitHub , San Francisco, CA, USA . Retrieved 2023 -01-21 from https:\/\/gitHub.com\/FacebookResearch\/Nevergrad Jeremy Rapin and Olivier Teytaud. 2018. Nevergrad - A Gradient-Free Optimization Platform. GitHub, San Francisco, CA, USA. Retrieved 2023-01-21 from https:\/\/gitHub.com\/FacebookResearch\/Nevergrad"},{"key":"e_1_3_2_1_30_1","volume-title":"List of optimization packages in Python. GitHub","author":"Tafakkori Keivan","year":"2023","unstructured":"Keivan Tafakkori . 2023. List of optimization packages in Python. GitHub , San Francisco, CA, USA . Retrieved on 2023 -01-15 from https:\/\/ktafakkori.github.io\/optimization-packages-in-python-list\/ Keivan Tafakkori. 2023. List of optimization packages in Python. GitHub, San Francisco, CA, USA. Retrieved on 2023-01-15 from https:\/\/ktafakkori.github.io\/optimization-packages-in-python-list\/"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11527695_24"},{"key":"e_1_3_2_1_32_1","unstructured":"Unicode Consortium (Ed.). 2022. The Unicode\u00ae Standard Version 15.0 - Core Specification. Unicode Inc. Mountain View CA USA. Retrieved 2023-01-21 from https:\/\/www.unicode.org\/versions\/Unicode15.0.0\/  Unicode Consortium (Ed.). 2022. The Unicode\u00ae Standard Version 15.0 - Core Specification. Unicode Inc. Mountain View CA USA. Retrieved 2023-01-21 from https:\/\/www.unicode.org\/versions\/Unicode15.0.0\/"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41592-019-0686-2"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3510426"},{"key":"e_1_3_2_1_35_1","volume-title":"Global Optimization Algorithms - Theory and Application","author":"Weise Thomas","year":"2023","unstructured":"Thomas Weise . 2009. Global Optimization Algorithms - Theory and Application . Institute of Applied Optimization, Hefei University , Hefei, Anhui , China. Retrieved 2023 -01-21 from http:\/\/iao.hfuu.edu.cn\/images\/publications\/W2009GOEB.pdf Thomas Weise. 2009. Global Optimization Algorithms - Theory and Application. Institute of Applied Optimization, Hefei University, Hefei, Anhui, China. Retrieved 2023-01-21 from http:\/\/iao.hfuu.edu.cn\/images\/publications\/W2009GOEB.pdf"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCI-CC.2017.8109794"},{"key":"e_1_3_2_1_37_1","volume-title":"Optimization Algorithms","author":"Weise Thomas","year":"2023","unstructured":"Thomas Weise . 2020--2023. Optimization Algorithms . Institute of Applied Optimization, School of Artificial Intelligence and Big Data, Hefei University , Hefei, Anhui, China. Retrieved 2023 -01-21 from https:\/\/thomasweise.github.io\/oa Thomas Weise. 2020--2023. Optimization Algorithms. Institute of Applied Optimization, School of Artificial Intelligence and Big Data, Hefei University, Hefei, Anhui, China. Retrieved 2023-01-21 from https:\/\/thomasweise.github.io\/oa"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106269"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2014.2326101"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830761.1830763"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.08.030"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-016-0417-5"}],"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.3596306","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583133.3596306","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.3596306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,15]]},"references-count":40,"alternative-id":["10.1145\/3583133.3596306","10.1145\/3583133"],"URL":"https:\/\/doi.org\/10.1145\/3583133.3596306","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"}}]}}