{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T20:44:00Z","timestamp":1770151440743,"version":"3.49.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100019125","name":"Sorbonne Universit?","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100019125","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1109\/tevc.2024.3462758","type":"journal-article","created":{"date-parts":[[2024,9,17]],"date-time":"2024-09-17T14:51:24Z","timestamp":1726584684000},"page":"1774-1782","source":"Crossref","is-referenced-by-count":16,"title":["Using the Empirical Attainment Function for Analyzing Single-Objective Black-Box Optimization Algorithms"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9974-1295","authenticated-orcid":false,"given":"Manuel","family":"L\u00f3pez-Ib\u00e1\u00f1ez","sequence":"first","affiliation":[{"name":"Alliance Manchester Business School, University of Manchester, Manchester, U.K."}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3040-7162","authenticated-orcid":false,"given":"Diederick","family":"Vermetten","sequence":"additional","affiliation":[{"name":"Leiden Institute for Advanced Computer Science, Leiden University, Leiden, CA, The Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2727-9569","authenticated-orcid":false,"given":"Johann","family":"Dreo","sequence":"additional","affiliation":[{"name":"Department of Computational Biology, Systems Biology Group, Pasteur Institute, Université Paris Cité, Bioinformatics and Biostatistics Hub, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4981-3227","authenticated-orcid":false,"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[{"name":"Sorbonne Université, CNRS, LIP6, Paris, France"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1808977"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3210897"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.5.860"},{"key":"ref4","first-page":"238","article-title":"Evaluating Las Vegas algorithms\u2014Pitfalls and remedies","volume-title":"Proc. 14th Conf. Uncertain. Artif. Intell.","author":"Hoos"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44719-9_15"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02538-9_5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02538-9_9"},{"key":"ref8","article-title":"Adaptation de la m\u00e9taheuristique des colonies de fourmis pour l\u2019optimisation difficile en variables continues: Application en g\u00e9nie biologique et m\u00e9dical","author":"Dr\u00e9o","year":"2003"},{"key":"ref9","article-title":"Stochastic local search methods for highly constrained combinatorial optimisation problems","author":"Chiarandini","year":"2005"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1570256.1570301"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3510426"},{"key":"ref12","article-title":"Real-parameter blackbox optimization benchmarking 2009: Noiseless functions definitions","author":"Hansen","year":"2010"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1830761.1830790"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-7152(02)00046-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3159087"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0056872"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2015575"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.10.043"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35533-2_3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19893-9_8"},{"key":"ref21","article-title":"Nevergrad: A gradientfree optimization platform.","author":"Rapin","year":"2018"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00342"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/6.3.222"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/13.3.317"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2307\/2004873"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1970-0274029-X"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1038\/s41592-019-0686-2"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1996.542381"},{"key":"ref29","article-title":"CMA-ES\/pycma on Github.","author":"Hansen","year":"2019"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8330-5_4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.07.032"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-7349-6"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31880-4_18"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2022.2084405"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37140-0_61"},{"key":"ref37","article-title":"Biobjective performance assessment with the COCO platform","author":"Brockhoff","year":"2016","journal-title":"arXiv:1605.01746"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001677"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4235\/11199991\/10681433.pdf?arnumber=10681433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:35:47Z","timestamp":1760160947000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10681433\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":38,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2024.3462758","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10]]}}}