{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,28]],"date-time":"2026-10-28T17:10:10Z","timestamp":1793207410936,"version":"4.5.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147135","type":"print"},{"value":"9783031147142","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14714-2_41","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T21:03:13Z","timestamp":1660424593000},"page":"590-602","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Increasing the\u00a0Diversity of\u00a0Benchmark Function Sets Through Affine Recombination"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5383-7475","authenticated-orcid":false,"given":"Konstantin","family":"Dietrich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7720-4939","authenticated-orcid":false,"given":"Olaf","family":"Mersmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"41_CR1","doi-asserted-by":"publisher","unstructured":"Dietrich, K., Mersmann, O.: Changing function landscape of two dimensional recombinations (2022). https:\/\/doi.org\/10.5281\/zenodo.6456367","DOI":"10.5281\/zenodo.6456367"},{"key":"41_CR2","doi-asserted-by":"publisher","unstructured":"Dietrich, K., Mersmann, O.: Exploratory Landscape Analysis Feature Data of Recombinations and noiseless BBOB Instances, pp. 1\u201315 (2022). https:\/\/doi.org\/10.5281\/zenodo.6456361","DOI":"10.5281\/zenodo.6456361"},{"key":"41_CR3","unstructured":"Doerr, C., Wang, H., Ye, F., van Rijn, S., B\u00e4ck, T.: IOHprofiler: A benchmarking and profiling tool for iterative optimization heuristics arxiv.org\/abs\/1810.05281, October 2018"},{"issue":"1","key":"41_CR4","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(1), 114\u2013144 (2021). https:\/\/doi.org\/10.1080\/10556788.2020.1808977","journal-title":"Optim. Methods Softw."},{"key":"41_CR5","unstructured":"Hansen, N., Finck, S., Ros, R., Auger, A.: Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions. Research Report RR-6829, Inria (2009). https:\/\/hal.inria.fr\/inria-00362633"},{"issue":"1","key":"41_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02430364","volume":"1","author":"J Hooker","year":"1995","unstructured":"Hooker, J.: Testing heuristics: we have it all wrong. J. Heuristics 1(1), 33\u201342 (1995). https:\/\/doi.org\/10.1007\/BF02430364","journal-title":"J. Heuristics"},{"key":"41_CR7","doi-asserted-by":"publisher","unstructured":"Kerschke, P., Preuss, M., Wessing, S., Trautmann, H.: Detecting funnel structures by means of exploratory landscape analysis. In: GECCO 2015 - Proceedings of the 2015 Genetic and Evolutionary Computation Conference, pp. 265\u2013272 (2015). https:\/\/doi.org\/10.1145\/2739480.2754642","DOI":"10.1145\/2739480.2754642"},{"key":"41_CR8","series-title":"Studies in Classification, Data Analysis, and Knowledge Organization","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-030-25147-5_7","volume-title":"Applications in Statistical Computing","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Trautmann, H.: Comprehensive feature-based landscape analysis of continuous and constrained optimization problems using the R-package Flacco. In: Bauer, N., Ickstadt, K., L\u00fcbke, K., Szepannek, G., Trautmann, H., Vichi, M. (eds.) Applications in Statistical Computing. SCDAKO, pp. 93\u2013123. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25147-5_7"},{"key":"41_CR9","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/J.ASOC.2014.11.006","volume":"27","author":"T Liao","year":"2015","unstructured":"Liao, T., Molina, D., St\u00fctzle, T.: Performance evaluation of automatically tuned continuous optimizers on different benchmark sets. Appl. Soft Comput. J. 27, 490\u2013503 (2015). https:\/\/doi.org\/10.1016\/J.ASOC.2014.11.006","journal-title":"Appl. Soft Comput. J."},{"key":"41_CR10","doi-asserted-by":"publisher","unstructured":"Lunacek, M., Whitley, D.: The dispersion metric and the CMA evolution strategy. In: GECCO 2006 - Genetic and Evolutionary Computation Conference, vol. 1, pp. 477\u2013484 (2006). https:\/\/doi.org\/10.1145\/1143997.1144085","DOI":"10.1145\/1143997.1144085"},{"key":"41_CR11","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00500-011-0781-5","volume":"16","author":"J Mar\u00edn","year":"2012","unstructured":"Mar\u00edn, J.: How landscape ruggedness influences the performance of real-coded algorithms: a comparative study. Soft Comput. 16, 683\u2013698 (2012). https:\/\/doi.org\/10.1007\/s00500-011-0781-5","journal-title":"Soft Comput."},{"key":"41_CR12","doi-asserted-by":"publisher","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., Rudolph, G.: Exploratory landscape analysis. In: Genetic and Evolutionary Computation Conference, GECCO 2011, pp. 829\u2013836 (2011). https:\/\/doi.org\/10.1145\/2001576.2001690","DOI":"10.1145\/2001576.2001690"},{"key":"41_CR13","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/TEVC.2014.2302006","volume":"19","author":"MA Mu\u00f1oz","year":"2015","unstructured":"Mu\u00f1oz, M.A., Kirley, M., Halgamuge, S.K.: Exploratory landscape analysis of continuous space optimization problems using information content. IEEE Trans. Evol. Comput. 19, 74\u201387 (2015). https:\/\/doi.org\/10.1109\/TEVC.2014.2302006","journal-title":"IEEE Trans. Evol. Comput."},{"key":"41_CR14","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1162\/EVCO\\_a_00194","volume":"25","author":"MA Mu\u00f1oz","year":"2017","unstructured":"Mu\u00f1oz, M.A., Smith-Miles, K.: Performance analysis of continuous black-box optimization algorithms via footprints in instance space. Evol. Comput. 25, 529\u2013554 (2017). https:\/\/doi.org\/10.1162\/EVCO_a_00194","journal-title":"Evol. Comput."},{"key":"41_CR15","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1162\/EVCO\\_A\\_00262","volume":"28","author":"MA Mu\u00f1oz","year":"2020","unstructured":"Mu\u00f1oz, M.A., Smith-Miles, K.: Generating new space-filling test instances for continuous black-box optimization. Evol. Comput. 28, 379\u2013404 (2020). https:\/\/doi.org\/10.1162\/EVCO_A_00262","journal-title":"Evol. Comput."},{"issue":"4","key":"41_CR16","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1006\/jcom.1998.0487","volume":"14","author":"AB Owen","year":"1998","unstructured":"Owen, A.B.: Scrambling sobol\u2019 and Niederreiter-Xing points. J. Complex. 14(4), 466\u2013489 (1998). https:\/\/doi.org\/10.1006\/jcom.1998.0487","journal-title":"J. Complex."},{"key":"41_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-030-58115-2_10","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"Q Renau","year":"2020","unstructured":"Renau, Q., Doerr, C., Dreo, J., Doerr, B.: Exploratory landscape analysis is strongly sensitive to the sampling strategy. In: B\u00e4ck, T., et al. (eds.) PPSN 2020, Part II. LNCS, vol. 12270, pp. 139\u2013153. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58115-2_10"},{"key":"41_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-030-72699-7_2","volume-title":"Applications of Evolutionary Computation","author":"Q Renau","year":"2021","unstructured":"Renau, Q., Dreo, J., Doerr, C., Doerr, B.: Towards explainable exploratory landscape analysis: extreme feature selection for classifying BBOB functions. In: Castillo, P.A., Jim\u00e9nez Laredo, J.L. (eds.) EvoApplications 2021. LNCS, vol. 12694, pp. 17\u201333. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72699-7_2"},{"key":"41_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3799-8","volume-title":"The Design and Analysis of Computer Experiments","author":"TJ Santner","year":"2003","unstructured":"Santner, T.J., Williams, B.J., Notz, W.I.: The Design and Analysis of Computer Experiments. Springer, New York (2003). https:\/\/doi.org\/10.1007\/978-1-4757-3799-8"},{"key":"41_CR20","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1162\/EVCO.2007.15.2.169","volume":"15","author":"DI Seo","year":"2007","unstructured":"Seo, D.I., Moon, B.R.: An information-theoretic analysis on the interactions of variables in combinatorial optimization problems. Evol. Comput. 15, 169\u2013198 (2007). https:\/\/doi.org\/10.1162\/EVCO.2007.15.2.169","journal-title":"Evol. Comput."},{"key":"41_CR21","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0041-5553(67)90144-9","volume":"7","author":"IM Sobol\u2019","year":"1967","unstructured":"Sobol\u2019, I.M.: On the distribution of points in a cube and the approximate evaluation of integrals. USSR Comput. Math. Math. Phys. 7, 86\u2013112 (1967). https:\/\/doi.org\/10.1016\/0041-5553(67)90144-9","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"41_CR22","doi-asserted-by":"publisher","unstructured":"\u0160kvorc, U., Eftimov, T., Koro\u0161ec, P.: Transfer learning analysis of multi-class classification for landscape-aware algorithm selection. Mathematics 10(3) (2022). https:\/\/doi.org\/10.3390\/math10030432","DOI":"10.3390\/math10030432"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14714-2_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:46:26Z","timestamp":1710261986000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14714-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147135","9783031147142"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14714-2_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}