{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T22:28:21Z","timestamp":1769552901953,"version":"3.49.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031302282","type":"print"},{"value":"9783031302299","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30229-9_22","type":"book-chapter","created":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T19:02:39Z","timestamp":1680980559000},"page":"335-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["To Switch or\u00a0Not to\u00a0Switch: Predicting the\u00a0Benefit of\u00a0Switching Between Algorithms Based on\u00a0Trajectory Features"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3040-7162","authenticated-orcid":false,"given":"Diederick","family":"Vermetten","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4933-5181","authenticated-orcid":false,"given":"Hao","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6555-7721","authenticated-orcid":false,"given":"Kevin","family":"Sim","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5405-4413","authenticated-orcid":false,"given":"Emma","family":"Hart","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,9]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Adriaensen, S., et al.: Automated dynamic algorithm configuration. arXiv:2205.13881 (2022)","DOI":"10.1613\/jair.1.13922"},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Biedenkapp, A., Bozkurt, H.F., Eimer, T., Hutter, F., Lindauer, M.: Dynamic algorithm configuration: foundation of a new meta-algorithmic framework. In: ECAI (2020). https:\/\/doi.org\/10.3233\/FAIA200122","DOI":"10.3233\/FAIA200122"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Eimer, T., Biedenkapp, A., Reimer, M., Adriaensen, S., Hutter, F., Lindauer, M.: DACBench: a benchmark library for dynamic algorithm configuration. arXiv:2105.08541 (2021)","DOI":"10.24963\/ijcai.2021\/230"},{"key":"22_CR4","doi-asserted-by":"crossref","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. Optimiz. Methods Softw. 36, 1808977 (2020)","DOI":"10.1080\/10556788.2020.1808977"},{"key":"22_CR5","unstructured":"Hansen, N., Finck, S., Ros, R., Auger, A.: Real-parameter black-box optimization benchmarking 2009: noiseless functions definitions. Tech. Rep. RR-6829, INRIA (2009). https:\/\/hal.inria.fr\/inria-00362633\/document"},{"key":"22_CR6","doi-asserted-by":"publisher","unstructured":"Hansen, N., Ostermeier, A.: Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: CEC 1996. IEEE (1996). https:\/\/doi.org\/10.1109\/ICEC.1996.542381","DOI":"10.1109\/ICEC.1996.542381"},{"key":"22_CR7","doi-asserted-by":"publisher","unstructured":"Jankovi\u0107, A., Doerr, C.: Adaptive landscape analysis. In: GECCO 2019. ACM (2019). https:\/\/doi.org\/10.1145\/3319619.3326905","DOI":"10.1145\/3319619.3326905"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-030-72699-7_38","volume-title":"Applications of Evolutionary Computation","author":"A Jankovic","year":"2021","unstructured":"Jankovic, A., Eftimov, T., Doerr, C.: Towards feature-based performance regression using trajectory data. In: Castillo, P.A., Jim\u00e9nez Laredo, J.L. (eds.) EvoApplications 2021. LNCS, vol. 12694, pp. 601\u2013617. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72699-7_38"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Karafotias, G., Hoogendoorn, M., Eiben, \u00c1.E.: Parameter control in evolutionary algorithms: trends and challenges. IEEE Trans. Evol. Comput. 19, 167\u2013187 (2014)","DOI":"10.1109\/TEVC.2014.2308294"},{"key":"22_CR10","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: ICNN 1995. IEEE (1995)"},{"key":"22_CR11","doi-asserted-by":"publisher","unstructured":"Kerschke, P., Trautmann, H.: The R-Package FLACCO for exploratory landscape analysis with applications to multi-objective optimization problems. In: CEC (2016). https:\/\/doi.org\/10.1109\/CEC.2016.7748359","DOI":"10.1109\/CEC.2016.7748359"},{"key":"22_CR12","doi-asserted-by":"publisher","DOI":"10.1162\/evco\\_a_00242","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Hoos, H.H., Neumann, F., Trautmann, H.: Automated algorithm selection: survey and perspectives. Evol. Comput. (2019). https:\/\/doi.org\/10.1162\/evco_a_00242","journal-title":"Evol. Comput."},{"key":"22_CR13","doi-asserted-by":"publisher","unstructured":"Kostovska, A., et al.: Per-run algorithm selection with warm-starting using trajectory-based features. In: Rudolph, G., Kononova, A.V., Aguirre, H., Kerschke, P., Ochoa, G. (eds.) Parallel Problem Solving from Nature \u2013 PPSN XVII. PPSN 2022. LNCS, vol. 13398. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14714-2_4","DOI":"10.1007\/978-3-031-14714-2_4"},{"key":"22_CR14","doi-asserted-by":"publisher","unstructured":"Long, F.X., van Stein, B., Frenzel, M., Krause, P., Gitterle, M., B\u00e4ck, T.: Learning the characteristics of engineering optimization problems with applications in automotive crash. In: GECCO 2022. ACM (2022). https:\/\/doi.org\/10.1145\/3512290.3528712","DOI":"10.1145\/3512290.3528712"},{"key":"22_CR15","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., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: 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":"22_CR16","unstructured":"Lundberg, S.M., Lee, S.I.: A unified approach to interpreting model predictions. In: Advances in Neural Information Processing Systems 30 (2017)"},{"key":"22_CR17","doi-asserted-by":"publisher","unstructured":"McInnes, L., Healy, J., Melville, J.: UMAP: uniform manifold approximation and projection for dimension reduction (2018). https:\/\/doi.org\/10.48550\/ARXIV.1802.03426","DOI":"10.48550\/ARXIV.1802.03426"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., Rudolph, G.: Exploratory landscape analysis. In: GECCO 2011. ACM (2011)","DOI":"10.1145\/2001576.2001690"},{"issue":"3","key":"22_CR19","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":"22_CR20","doi-asserted-by":"crossref","unstructured":"Neri, F., Cotta, C.: Memetic algorithms and memetic computing optimization: a literature review. Swarm Evolut. Comput. 2, 1\u201314 (2012)","DOI":"10.1016\/j.swevo.2011.11.003"},{"key":"22_CR21","doi-asserted-by":"publisher","unstructured":"de Nobel, J., Vermetten, D., Wang, H., Doerr, C., B\u00e4ck, T.: Tuning as a means of assessing the benefits of new ideas in interplay with existing algorithmic modules. In: GECCO 2021. ACM (2021). https:\/\/doi.org\/10.1145\/3449726.3463167","DOI":"10.1145\/3449726.3463167"},{"key":"22_CR22","unstructured":"de Nobel, J., Ye, F., Vermetten, D., Wang, H., Doerr, C., B\u00e4ck, T.: Iohexperimenter: benchmarking platform for iterative optimization heuristics (2021). https:\/\/arxiv.org\/abs\/2111.04077"},{"key":"22_CR23","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12(85), 2825\u20132830 (2011)"},{"key":"22_CR24","doi-asserted-by":"publisher","unstructured":"Powell, M.J.: A direct search optimization method that models the objective and constraint functions by linear interpolation. In: Gomez, S., Hennart, JP. (eds.) Advances in Optimization and Numerical Analysis. Mathematics and Its Applications, vol. 275. Springer, Dordrecht (1994). https:\/\/doi.org\/10.1007\/978-94-015-8330-5_4","DOI":"10.1007\/978-94-015-8330-5_4"},{"key":"22_CR25","unstructured":"Ram\u00f3n, D.C.: Python advanced differential evolution (pyade). https:\/\/github.com\/xKuZz\/pyade (2019)"},{"key":"22_CR26","unstructured":"Rapin, J., Teytaud, O.: Nevergrad - a gradient-free optimization platform. https:\/\/GitHub.com\/FacebookResearch\/Nevergrad (2018)"},{"key":"22_CR27","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":"22_CR28","doi-asserted-by":"crossref","unstructured":"Rice, J.R.: The algorithm selection problem. In: Advances in computers. Elsevier (1976)","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"22_CR29","doi-asserted-by":"publisher","unstructured":"Schr\u00f6der, D., Vermetten, D., Wang, H., Doerr, C., B\u00e4ck, T.: Chaining of numerical black-box algorithms: warm-starting and switching points (2022). https:\/\/doi.org\/10.48550\/arXiv.2204.06539","DOI":"10.48550\/arXiv.2204.06539"},{"key":"22_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/978-3-030-58112-1_48","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"G Shala","year":"2020","unstructured":"Shala, G., Biedenkapp, A., Awad, N., Adriaensen, S., Lindauer, M., Hutter, F.: Learning step-size adaptation in\u00a0CMA-ES. In: B\u00e4ck, T., et al. (eds.) PPSN 2020. LNCS, vol. 12269, pp. 691\u2013706. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_48"},{"key":"22_CR31","doi-asserted-by":"publisher","unstructured":"Storn, R., Price, K.: Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J. Global optimiz. 11, 341\u2013359 (1997). https:\/\/doi.org\/10.1023\/A:1008202821328","DOI":"10.1023\/A:1008202821328"},{"key":"22_CR32","doi-asserted-by":"crossref","unstructured":"Tanabe, R., Fukunaga, A.: Success-history based parameter adaptation for differential evolution. In: 2013 IEEE congress on evolutionary computation. IEEE (2013)","DOI":"10.1109\/CEC.2013.6557555"},{"key":"22_CR33","doi-asserted-by":"publisher","unstructured":"Vermetten, D., van Rijn, S., B\u00e4ck, T., Doerr, C.: Online selection of CMA-ES variants. In: GECCO 2019. ACM (2019). https:\/\/doi.org\/10.1145\/3321707.3321803","DOI":"10.1145\/3321707.3321803"},{"key":"22_CR34","doi-asserted-by":"publisher","unstructured":"Vermetten, D., Wang, H., B\u00e4ck, T., Doerr, C.: Towards dynamic algorithm selection for numerical black-box optimization: investigating BBOB as a use case. In: GECCO 2020. ACM (2020). https:\/\/doi.org\/10.1145\/3377930.3390189","DOI":"10.1145\/3377930.3390189"},{"key":"22_CR35","doi-asserted-by":"publisher","unstructured":"Vermetten, D., Wang, H., L\u00f3pez-Ib\u00e1\u00f1ez, M., Doerr, C., B\u00e4ck, T.: Analyzing the impact of undersampling on the benchmarking and configuration of evolutionary algorithms. In: GECCO 2022. ACM (2022). https:\/\/doi.org\/10.1145\/3512290.3528799","DOI":"10.1145\/3512290.3528799"},{"key":"22_CR36","doi-asserted-by":"publisher","unstructured":"Vermetten, D., Wang, H., Sim, K., Hart, E.: Reproducibility files and additional figures, Zenodo repository (2022). https:\/\/doi.org\/10.5281\/zenodo.7249389. Figshare repository. https:\/\/doi.org\/10.6084\/m9.figshare.21395304.v1","DOI":"10.5281\/zenodo.7249389"},{"key":"22_CR37","doi-asserted-by":"crossref","unstructured":"Wang, H., Vermetten, D., Ye, F., Doerr, C., B\u00e4ck, T.: IOHanalyzer: detailed performance analyses for iterative optimization heuristics. Trans. Evol. Learn. Optimiz. 2(1), 1\u201329 (2022)","DOI":"10.1145\/3510426"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30229-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T23:09:12Z","timestamp":1681081752000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30229-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031302282","9783031302299"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30229-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2023\/evoapps\/","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":"78","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":"37","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":"14","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":"47% - 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":"3","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)"}}]}}