{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:39:04Z","timestamp":1759847944576,"version":"3.37.3"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council (ARC)","doi-asserted-by":"publisher","award":["FT200100536"],"award-info":[{"award-number":["FT200100536"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["0221\u201314380009"],"award-info":[{"award-number":["0221\u201314380009"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,7,1]]},"DOI":"10.1109\/cec53210.2023.10254181","type":"proceedings-article","created":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T18:04:21Z","timestamp":1695665061000},"page":"1-9","source":"Crossref","is-referenced-by-count":3,"title":["Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler"],"prefix":"10.1109","author":[{"given":"Frank","family":"Neumann","sequence":"first","affiliation":[{"name":"Optimisation and Logistics, The University of Adelaide,Adelaide,Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"Optimisation and Logistics, The University of Adelaide,Adelaide,Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Qian","sequence":"additional","affiliation":[{"name":"for Novel Software Technology, Nanjing University,State Key Laboratory,Nanjing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anh Viet","family":"Do","sequence":"additional","affiliation":[{"name":"Optimisation and Logistics, The University of Adelaide,Adelaide,Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"de Nobel","sequence":"additional","affiliation":[{"name":"LIACS, Leiden University,Leiden,The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diederick","family":"Vermetten","sequence":"additional","affiliation":[{"name":"LIACS, Leiden University,Leiden,The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saba Sadeghi","family":"Ahouei","sequence":"additional","affiliation":[{"name":"Optimisation and Logistics, The University of Adelaide,Adelaide,Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Furong","family":"Ye","sequence":"additional","affiliation":[{"name":"LIACS, Leiden University,Leiden,The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Wang","sequence":"additional","affiliation":[{"name":"LIACS, Leiden University,Leiden,The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"B\u00e4ck","sequence":"additional","affiliation":[{"name":"LIACS, Leiden University,Leiden,The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Iohexperimenter: Benchmarking platform for iterative optimization heuristics","author":"de nobel","year":"2021","journal-title":"CoRR"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299908"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321869"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3510426"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/31\/41\/011"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8790107"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.823470"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1016\/j.ins.2014.02.154","article-title":"A chess rating system for evolutionary algorithms: A new method for the comparison and ranking of evolutionary algorithms","volume":"277","author":"ve?ek","year":"2014","journal-title":"Information Sciences"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58112-1_28"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1997.5.3.303"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.3.3.177"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139177801.004"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-14714-2_21"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30162-4_219"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/956755.956769"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718518"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"ref26","article-title":"Towards a more practice-aware runtime analysis of evolutionary algorithms","author":"pinto","year":"2018","journal-title":"CoRR"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-012-0262-1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.09.035"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i02.5504"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2013.6557681"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071279"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58115-2_41"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17458"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i02.5504"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00159"},{"key":"ref3","first-page":"253","article-title":"Submodularity and curvature: The optimal algorithm","volume":"b23","author":"vondr\u00e1k","year":"2010","journal-title":"RIMS Kôyûoku Bessatsu"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012272"},{"key":"ref5","first-page":"1774","article-title":"Subset selection by Pareto optimization","author":"qian","year":"0","journal-title":"Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1 NIPS 2015"}],"event":{"name":"2023 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2023,7,1]]},"location":"Chicago, IL, USA","end":{"date-parts":[[2023,7,5]]}},"container-title":["2023 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10253662\/10253666\/10254181.pdf?arnumber=10254181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T17:49:48Z","timestamp":1697478588000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10254181\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,1]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/cec53210.2023.10254181","relation":{},"subject":[],"published":{"date-parts":[[2023,7,1]]}}}