{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T20:17:08Z","timestamp":1777407428138,"version":"3.51.4"},"publisher-location":"Cham","reference-count":29,"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_2","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T21:03:13Z","timestamp":1660424593000},"page":"18-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Improving Nevergrad\u2019s Algorithm Selection Wizard NGOpt Through Automated Algorithm Configuration"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3604-2515","authenticated-orcid":false,"given":"Risto","family":"Trajanov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6983-9627","authenticated-orcid":false,"given":"Ana","family":"Nikolikj","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2723-0821","authenticated-orcid":false,"given":"Gjorgjina","family":"Cenikj","sequence":"additional","affiliation":[]},{"given":"Fabien","family":"Teytaud","sequence":"additional","affiliation":[]},{"given":"Mathurin","family":"Videau","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Teytaud","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7330-1902","authenticated-orcid":false,"given":"Tome","family":"Eftimov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9974-1295","authenticated-orcid":false,"given":"Manuel","family":"L\u00f3pez-Ib\u00e1\u00f1ez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4981-3227","authenticated-orcid":false,"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Aziz-Alaoui, A., Doerr, C., Dr\u00e9o, J.: Towards large scale automated algorithm design by integrating modular benchmarking frameworks. In: Chicano, F., Krawiec, K. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO Companion 2021, New York, NY, pp. 1365\u20131374. ACM Press (2021). https:\/\/doi.org\/10.1145\/3449726.3463155","DOI":"10.1145\/3449726.3463155"},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1162\/evco_a_00263","volume":"28","author":"LCT Bezerra","year":"2020","unstructured":"Bezerra, L.C.T., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Automatically designing state-of-the-art multi- and many-objective evolutionary algorithms. Evol. Comput. 28(2), 195\u2013226 (2020). https:\/\/doi.org\/10.1162\/evco_a_00263","journal-title":"Evol. Comput."},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Birattari, M.: Tuning Metaheuristics: A Machine Learning Perspective, Studies in Computational Intelligence, vol. 197. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00483-4","DOI":"10.1007\/978-3-642-00483-4"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Cartis, C., Fiala, J., Marteau, B., Roberts, L.: Improving the flexibility and robustness of model-based derivative-free optimization solvers (2018)","DOI":"10.1145\/3338517"},{"key":"2_CR5","unstructured":"Hansen, N., Auger, A., Finck, S., Ros, R.: Real-parameter black-box optimization benchmarking 2009: Experimental setup. Technical report, RR-6828, INRIA, France (2009). https:\/\/hal.inria.fr\/inria-00362633\/document"},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556788.2020.1808977","volume":"36","author":"N Hansen","year":"2020","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. Meth. Software 36(1), 1\u201331 (2020). https:\/\/doi.org\/10.1080\/10556788.2020.1808977","journal-title":"Optim. Meth. Software"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9(2), 159\u2013195 (2001). https:\/\/doi.org\/10.1162\/106365601750190398","journal-title":"Evol. Comput."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-21434-9_3","volume-title":"Autonomous Search","author":"HH Hoos","year":"2011","unstructured":"Hoos, H.H.: Automated algorithm configuration and parameter tuning. In: Hamadi, Y., Monfroy, E., Saubion, F. (eds.) Autonomous Search, pp. 37\u201371. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21434-9_3"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TEVC.2019.2921598","volume":"24","author":"C Huang","year":"2020","unstructured":"Huang, C., Li, Y., Yao, X.: A survey of automatic parameter tuning methods for metaheuristics. IEEE Trans. Evol. Comput. 24(2), 201\u2013216 (2020). https:\/\/doi.org\/10.1109\/TEVC.2019.2921598","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2_CR10","unstructured":"Johnson, S.G.: The nlopt nonlinear-optimization package (1994). http:\/\/github.com\/stevengj\/nlopt"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/evco_a_00242","volume":"27","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Hoos, H.H., Neumann, F., Trautmann, H.: Automated algorithm selection: survey and perspectives. Evol. Comput. 27(1), 3\u201345 (2019). https:\/\/doi.org\/10.1162\/evco_a_00242","journal-title":"Evol. Comput."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.artint.2015.11.002","volume":"232","author":"AR KhudaBukhsh","year":"2016","unstructured":"KhudaBukhsh, A.R., Xu, L., Hoos, H.H., Leyton-Brown, K.: SATenstein: automatically building local search SAT solvers from components. Artif. Intell. 232, 20\u201342 (2016). https:\/\/doi.org\/10.1016\/j.artint.2015.11.002","journal-title":"Artif. Intell."},{"key":"2_CR13","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. 27, 490\u2013503 (2015)","journal-title":"Appl. Soft Comput."},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Liao, T., Montes de Oca, M.A., St\u00fctzle, T.: Computational results for an automatically tuned CMA-ES with increasing population size on the CEC 2005 benchmark set. Soft Comput. 17(6), 1031\u20131046 (2013). https:\/\/doi.org\/10.1007\/s00500-012-0946-x","DOI":"10.1007\/s00500-012-0946-x"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.ejor.2013.10.024","volume":"234","author":"T Liao","year":"2014","unstructured":"Liao, T., St\u00fctzle, T., Montes de Oca, M.A., Dorigo, M.: A unified ant colony optimization algorithm for continuous optimization. Eur. J. Oper. Res. 234(3), 597\u2013609 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., P\u00e9rez C\u00e1ceres, L., St\u00fctzle, T., Birattari, M.: The irace pacskage: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016). https:\/\/doi.org\/10.1016\/j.orp.2016.09.002","journal-title":"Oper. Res. Perspect."},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-642-32937-1_36","volume-title":"Parallel Problem Solving from Nature - PPSN XII","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2012","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Liao, T., St\u00fctzle, T.: On the anytime behavior of IPOP-CMA-ES. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012. LNCS, vol. 7491, pp. 357\u2013366. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32937-1_36"},{"issue":"6","key":"2_CR18","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1109\/TEVC.2011.2182651","volume":"16","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2012","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: The automatic design of multi-objective ant colony optimization algorithms. IEEE Trans. Evol. Comput. 16(6), 861\u2013875 (2012). https:\/\/doi.org\/10.1109\/TEVC.2011.2182651","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.cor.2014.05.020","volume":"51","author":"F Mascia","year":"2014","unstructured":"Mascia, F., L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., St\u00fctzle, T.: Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools. Comput. Oper. Res. 51, 190\u2013199 (2014). https:\/\/doi.org\/10.1016\/j.cor.2014.05.020","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1109\/TEVC.2021.3108185","volume":"26","author":"L Meunier","year":"2022","unstructured":"Meunier, L., et al.: Black-box optimization revisited: improving algorithm selection wizards through massive benchmarking. IEEE Trans. Evol. Comput. 26(3), 490\u2013500 (2022). https:\/\/doi.org\/10.1109\/TEVC.2021.3108185","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ejor.2019.01.018","volume":"276","author":"F Pagnozzi","year":"2019","unstructured":"Pagnozzi, F., St\u00fctzle, T.: Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems. Eur. J. Oper. Res. 276, 409\u2013421 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2019.01.018","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR22","unstructured":"Rapin, J., Teytaud, O.: Nevergrad: a gradient-free optimization platform (2018). https:\/\/github.com\/FacebookResearch\/Nevergrad"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-87700-4_30","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN X","author":"R Ros","year":"2008","unstructured":"Ros, R., Hansen, N.: A simple modification in CMA-ES achieving linear time and space complexity. In: Rudolph, G., Jansen, T., Beume, N., Lucas, S., Poloni, C. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 296\u2013305. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87700-4_30"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Schede, E., et al.: A survey of methods for automated algorithm configuration (2022). https:\/\/doi.org\/10.48550\/ARXIV.2202.01651","DOI":"10.48550\/ARXIV.2202.01651"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Styles, J., Hoos, H.H.: Ordered racing protocols for automatically configuring algorithms for scaling performance. In: Blum, C., Alba, E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2013, New York, NY, pp. 551\u2013558. ACM Press (2013). ISBN 978-1-4503-1963-8, https:\/\/doi.org\/10.1145\/2463372.2463438","DOI":"10.1145\/2463372.2463438"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-031-02056-8_18","volume-title":"EuroGP 2022","author":"M Videau","year":"2022","unstructured":"Videau, M., Leite, A., Teytaud, O., Schoenauer, M.: Multi-objective genetic programming for explainable reinforcement learning. In: Medvet, E., Pappa, G., Xue, B. (eds.) EuroGP 2022. LNCS, vol. 13223, pp. 256\u2013281. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-02056-8_18"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H.H., Leyton-Brown, K.: Hydra: automatically configuring algorithms for portfolio-based selection. In: Fox, M., Poole, D. (eds.) Proceedings of the AAAI Conference on Artificial Intelligence. AAAI Press (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32, 565\u2013606 (2008). https:\/\/doi.org\/10.1613\/jair.2490","journal-title":"J. Artif. Intell. Res."}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:40:23Z","timestamp":1710261623000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14714-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147135","9783031147142"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14714-2_2","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)"}}]}}