{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:33:11Z","timestamp":1742995991031,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581114"},{"type":"electronic","value":"9783030581121"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58112-1_19","type":"book-chapter","created":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:04:30Z","timestamp":1599062670000},"page":"273-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Continuous Optimization Benchmarks by\u00a0Simulation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2372-2092","authenticated-orcid":false,"given":"Martin","family":"Zaefferer","sequence":"first","affiliation":[]},{"given":"Frederik","family":"Rehbach","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,31]]},"reference":[{"key":"19_CR1","unstructured":"Ardia, D., Mullen, K.M., Peterson, B.G., Ulrich, J.: DEoptim: differential evolution in R, Version 2.2-5 (2020). \nhttps:\/\/CRAN.R-project.org\/package=DEoptim\n\n. Accessed 25 Feb 2020"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1007\/978-3-662-43505-2_56","volume-title":"Springer Handbook of Computational Intelligence","author":"T Bartz-Beielstein","year":"2015","unstructured":"Bartz-Beielstein, T.: How to create generalizable results. In: Kacprzyk, J., Pedrycz, W. (eds.) Springer Handbook of Computational Intelligence, pp. 1127\u20131142. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-43505-2_56"},{"key":"19_CR3","unstructured":"Bartz-Beielstein, T., et al.: SPOT - Sequential Parameter Optimization Toolbox - v20200429 (2020). \nhttps:\/\/github.com\/bartzbeielstein\/SPOT\/releases\/tag\/v20200429\n\n. Accessed 29 Apr 2020"},{"key":"19_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/9781119115151","volume-title":"Statistics for Spatial Data","author":"NA Cressie","year":"1993","unstructured":"Cressie, N.A.: Statistics for Spatial Data. Wiley, New York (1993)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Dang, N., P\u00e9rez C\u00e1ceres, L., De Causmaecker, P., St\u00fctzle, T.: Configuring irace using surrogate configuration benchmarks. In: Genetic and Evolutionary Computation Conference (GECCO 2017), pp. 243\u2013250. ACM, Berlin, July 2017","DOI":"10.1145\/3071178.3071238"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-319-99259-4_24","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"SJ Daniels","year":"2018","unstructured":"Daniels, S.J., Rahat, A.A.M., Everson, R.M., Tabor, G.R., Fieldsend, J.E.: A suite of computationally expensive shape optimisation problems using computational fluid dynamics. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 296\u2013307. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-99259-4_24"},{"key":"19_CR7","unstructured":"Fischbach, A., Zaefferer, M., Stork, J., Friese, M., Bartz-Beielstein, T.: From real world data to test functions. In: 26th Workshop Computational Intelligence, pp. 159\u2013177. KIT Scientific Publishing, Dortmund, November 2016"},{"key":"19_CR8","unstructured":"Flasch, O.: A modular genetic programming system. Ph.D. thesis, Technische Universit\u00e4t Dortmund, Dortmund, Germany, May 2015"},{"key":"19_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/9780470770801","volume-title":"Engineering Design via Surrogate Modelling","author":"A Forrester","year":"2008","unstructured":"Forrester, A., Sobester, A., Keane, A.: Engineering Design via Surrogate Modelling. Wiley, New York (2008)"},{"key":"19_CR10","unstructured":"Goodfellow, I.J., et al.: Generative adversarial nets. In: Proceedings of the 27th International Conference on Neural Information Processing Systems, NIPS 2014, vol. 2, pp. 2672\u20132680. MIT Press, Cambridge (2014)"},{"key":"19_CR11","unstructured":"Hansen, N., Auger, A., Mersmann, O., Tusar, T., Brockhoff, D.: COCO: a platform for comparing continuous optimizers in a black-box setting. ArXiv e-prints, August 2016. \narXiv:1603.08785v3"},{"key":"19_CR12","doi-asserted-by":"publisher","unstructured":"Hansen, N., et al.: COmparing Continuous Optimizers: numbbo\/COCO on Github, March 2019. \nhttps:\/\/doi.org\/10.5281\/zenodo.2594848","DOI":"10.5281\/zenodo.2594848"},{"key":"19_CR13","unstructured":"Hansen, N., Finck, S., Ros, R., Auger, A.: Real-parameter black-box optimization benchmarking 2009: noiseless functions definitions. Research report RR-6829, inria-00362633, INRIA, February 2009. \nhttps:\/\/hal.inria.fr\/inria-00362633"},{"key":"19_CR14","volume-title":"Mining Geostatistics","author":"AG Journel","year":"1978","unstructured":"Journel, A.G., Huijbregts, C.J.: Mining Geostatistics. Academic Press, London (1978)"},{"key":"19_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04808-5","volume-title":"Geostatistical Simulation: Models and Algorithms","author":"C Lantu\u00e9joul","year":"2002","unstructured":"Lantu\u00e9joul, C.: Geostatistical Simulation: Models and Algorithms. Springer, Heidelberg (2002)"},{"issue":"4","key":"19_CR16","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7(4), 308\u2013313 (1965)","journal-title":"Comput. J."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Preuss, M., Rudolph, G., Wessing, S.: Tuning optimization algorithms for real-world problems by means of surrogate modeling. In: Genetic and Evolutionary Computation Conference (GECCO 2010), pp. 401\u2013408. ACM, Portland, July 2010","DOI":"10.1145\/1830483.1830558"},{"key":"19_CR18","unstructured":"Rudolph, G., Preuss, M., Quadflieg, J.: Two-layered surrogate modeling for tuning optimization metaheuristics. Technical report TR09-2-005, TU Dortmund, Dortmund, Germany. Algorithm Engineering Report, September 2009"},{"issue":"4","key":"19_CR19","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution \u2013 a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Glob. Optim."},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Volz, V., Naujoks, B., Kerschke, P., Tu\u0161ar, T.: Single- and multi-objective game-benchmark for evolutionary algorithms. In: Genetic and Evolutionary Computation Conference (GECCO2019). ACM, Prague, July 2019","DOI":"10.1145\/3321707.3321805"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Wang, H., van Stein, B., Emmerich, M., B\u00e4ck, T.: Time complexity reduction in efficient global optimization using cluster Kriging. In: Genetic and Evolutionary Computation Conference (GECCO 2017), pp. 889\u2013896. ACM, Berlin, July 2017","DOI":"10.1145\/3071178.3071321"},{"key":"19_CR22","unstructured":"Ypma, J., Borchers, H.W., Eddelbuettel, D.: NLoptr vers-1.2.1: R interface to NLopt (2019). \nhttp:\/\/cran.r-project.org\/package=nloptr\n\n. Accessed 20 Nov 2019"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Zaefferer, M., Fischbach, A., Naujoks, B., Bartz-Beielstein, T.: Simulation-based test functions for optimization algorithms. In: Genetic and Evolutionary Computation Conference (GECCO 2017), pp. 905\u2013912. ACM, Berlin, July 2017","DOI":"10.1145\/3071178.3071190"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58112-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:16:22Z","timestamp":1599063382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58112-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581114","9783030581121"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58112-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"31 August 2020","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":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"268","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":"99","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":"37% - 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","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":"2.2","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)"}}]}}