{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:10:33Z","timestamp":1778213433259,"version":"3.51.4"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032236036","type":"print"},{"value":"9783032236043","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-23604-3_21","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T03:21:38Z","timestamp":1778210498000},"page":"333-349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalisation of\u00a0Automated Algorithm Selection in\u00a0Black-Box Optimisation: The Role of\u00a0Algorithm Portfolio and\u00a0Learning Model"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-3541-4222","authenticated-orcid":false,"given":"Behzad","family":"Moradi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7254-2808","authenticated-orcid":false,"given":"Mario Andr\u00e9s","family":"Mu\u00f1oz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6030-858X","authenticated-orcid":false,"given":"Michael","family":"Kirley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"21_CR1","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. Elsevier 15, 65\u2013118 (1976)","journal-title":"Adv. comput. Elsevier"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Lacroix, B., McCall, J.: Limitations of benchmark sets and landscape features for algorithm selection and performance prediction. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 261\u2013262 (2019)","DOI":"10.1145\/3319619.3322051"},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1080\/10556788.2020.1808977","volume":"36","author":"N Hansen","year":"2020","unstructured":"Hansen, N., Auger, A., Mersmann, O., Tu\u0161ar, T., Brockhoff, D.: COCO: a platform for comparing continuous optimizers in a black-box setting. Optimiz. Meth. Softw. 36(1), 114\u2013144 (2020)","journal-title":"Optimiz. Meth. Softw."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Lacroix, B., Christie, L.\u00a0A., McCall, J.\u00a0A.: Interpolated continuous optimisation problems with tunable landscape features. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 169\u2013170 (2017)","DOI":"10.1145\/3067695.3076045"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Kostovska, A., et al.: Per-run algorithm selection with warm-starting using trajectory-based features. In: International Conference on Parallel Problem Solving from Nature. Springer, pp. 46\u201360 (2022)","DOI":"10.1007\/978-3-031-14714-2_4"},{"key":"21_CR6","unstructured":"Rapin, J., Teytaud, O.: Nevergrad-a gradient-free optimization platform. GitHub. Com. FacebookResearch\/Nevergrad, vol.\u00a02, no.\u00a05, p.\u00a08 (2018)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Petelin, G., Cenikj, G.: How far out of distribution can we go with ELA features and still be able to rank algorithms?. In: IEEE Symposium Series on Computational Intelligence (SSCI). IEEE, vol. 2023, pp. 341\u2013346 (2023)","DOI":"10.1109\/SSCI52147.2023.10371880"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"\u0160kvorc, U., Eftimov, T., Koro\u0161ec, P.: Transfer learning analysis of multi-class classification for landscape-aware algorithm selection. Mathematics 10(3), 432 (2022)","DOI":"10.3390\/math10030432"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"\u0160kvorc, U., Eftimov, T., Koro, P.: Analyzing the generalizability of automated algorithm selection: a case study for numerical optimization. In: IEEE Symposium Series on Computational Intelligence (SSCI). IEEE, vol. 2023, 335\u2013340 (2023)","DOI":"10.1109\/SSCI52147.2023.10371868"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TAI.2020.3022339","volume":"1","author":"Y Tian","year":"2020","unstructured":"Tian, Y., Peng, S., Zhang, X., Rodemann, T., Tan, K.C., Jin, Y.: A recommender system for metaheuristic algorithms for continuous optimization based on deep recurrent neural networks. IEEE Trans. Artif. Intell. 1(1), 5\u201318 (2020)","journal-title":"IEEE Trans. Artif. Intell."},{"key":"21_CR11","unstructured":"Lundberg, S.\u00a0M., Lee, S.-I.: A unified approach to interpreting model predictions. In: Advances in Neural Information Processing Systems, vol.\u00a030 (2017)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Nikolikj, A., et al.: Assessing the generalizability of a performance predictive model. In: Proceedings of the Companion Conference on Genetic and Evolutionary Computation, pp. 311\u2013314 (2023)","DOI":"10.1145\/3583133.3590617"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Nikolikj, A., Kostovska, A., Cenikj, G., Doerr, C., Eftimov, T.: Generalization ability of feature-based performance prediction models: a statistical analysis across benchmarks. In: IEEE Congress on Evolutionary Computation (CEC). IEEE, vol. 2024, pp. 1\u20138 (2024)","DOI":"10.1109\/CEC60901.2024.10611952"},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001)","journal-title":"Mach. Learn."},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Nikolikj, A., Doerr, C., Eftimov, T.: RF+ clust for leave-one-problem-out performance prediction. In: International Conference on the Applications of Evolutionary Computation (Part of EvoStar). Springer, pp. 285\u2013301 (2023)","DOI":"10.1007\/978-3-031-30229-9_19"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Nikolikj, A., Pluh\u00e1\u010dek, M., Doerr, C., Koro\u0161ec, P., Eftimov, T.: Sensitivity analysis of RF+ clust for leave-one-problem-out performance prediction. In: IEEE Congress on Evolutionary Computation (CEC). IEEE, vol. 2023, pp. 1\u20138 (2023)","DOI":"10.1109\/CEC53210.2023.10254146"},{"key":"21_CR17","unstructured":"Liang, J., Qu, B., Suganthan, P., Chen, Q.: Problem definitions and evaluation criteria for the CEC 2015 competition on learning-based real-parameter single objective optimization. In: Technical Report201411A. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore, vol. 29, pp. 625\u2013640 (2014)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Dietrich, K., Vermetten, D., Doerr, C., Kerschke, P.: Impact of training instance selection on automated algorithm selection models for numerical black-box optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1007\u20131016 (2024)","DOI":"10.1145\/3638529.3654100"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., Rudolph, G.: Exploratory landscape analysis. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, pp. 829\u2013836 (2011)","DOI":"10.1145\/2001576.2001690"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Petelin, G., Cenikj, G., Eftimov, T.: TLA: topological landscape analysis for single-objective continuous optimization problem instances. In: IEEE Symposium Series on Computational Intelligence (SSCI). IEEE, vol. 2022, pp. 1698\u20131705 (2022)","DOI":"10.1109\/SSCI51031.2022.10022126"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Seiler, M.\u00a0V., Kerschke, P., Trautmann, H.: Deep-ELA: deep exploratory landscape analysis with self-supervised pretrained transformers for single-and multi-objective continuous optimization problems. Evolut. Comput., 1\u201327 (2025)","DOI":"10.1162\/evco_a_00367"},{"key":"21_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2025.101894","volume":"94","author":"G Cenikj","year":"2025","unstructured":"Cenikj, G., Petelin, G., Seiler, M., Cenikj, N., Eftimov, T.: Landscape features in single-objective continuous optimization: have we hit a wall in algorithm selection generalization? Swarm Evol. Comput. 94, 101894 (2025)","journal-title":"Swarm Evol. Comput."},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2024.101534","volume":"87","author":"G Cenikj","year":"2024","unstructured":"Cenikj, G., Petelin, G., Eftimov, T.: A cross-benchmark examination of feature-based algorithm selector generalization in single-objective numerical optimization. Swarm Evol. Comput. 87, 1\u201317 (2024)","journal-title":"Swarm Evol. Comput."},{"key":"21_CR24","unstructured":"Cenikj, G., Petelin, G., Eftimov, T.: TransOpt: transformer-based representation learning for optimization problem classification. arXiv preprint arXiv:2311.18035 (2023)"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Petelin, G., Cenikj, G.: On generalization of ELA feature groups. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 419\u2013422 (2024)","DOI":"10.1145\/3638530.3654124"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Ceniki, G., Petelin, G., Eftimov, T.: Impact of scaling in ELA feature calculation on algorithm selection cross-benchmark transferability. In: IEEE Congress on Evolutionary Computation (CEC). IEEE, vol. 2024, pp. 1\u20138 (2024)","DOI":"10.1109\/CEC60901.2024.10612032"},{"key":"21_CR27","unstructured":"Liang, J.J., Qu, B.Y., Suganthan, P.N., et al.: Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore 635(2), 2014 (2013)"},{"key":"21_CR28","unstructured":"Wu, G., Mallipeddi, R., Suganthan, P.: Problem definitions and evaluation criteria for the CEC 2017 competition and special session on constrained single objective real-parameter optimization. Nanyang Technol. Univ., Singapore, Tech. Rep, pp. 1\u201318 (2016)"},{"key":"21_CR29","doi-asserted-by":"publisher","first-page":"8262","DOI":"10.1109\/ACCESS.2022.3144067","volume":"10","author":"J Kudela","year":"2022","unstructured":"Kudela, J., Matousek, R.: New benchmark functions for single-objective optimization based on a zigzag pattern. IEEE Access 10, 8262\u20138278 (2022)","journal-title":"IEEE Access"},{"key":"21_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101448","volume":"84","author":"G Petelin","year":"2024","unstructured":"Petelin, G., Cenikj, G., Eftimov, T.: TinyTLA: topological landscape analysis for optimization problem classification in a limited sample setting. Swarm Evol. Comput. 84, 101448 (2024)","journal-title":"Swarm Evol. Comput."},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"van Stein, B., Long, F.\u00a0X., Frenzel, M., Krause, P., Gitterle, M., B\u00e4ck, T.: DoE2Vec: deep-learning based features for exploratory landscape analysis. In: Proceedings of the Companion Conference on Genetic and Evolutionary Computation, pp. 515\u2013518 (2023)","DOI":"10.1145\/3583133.3590609"},{"key":"21_CR32","doi-asserted-by":"crossref","unstructured":"Cenikj, G., Petelin, G., Doerr, C., Koro\u0161ec, P., Eftimov, T.: Beyond landscape analysis: dynamoRep features for capturing algorithm-problem interaction in single-objective continuous optimization. Evolutionary Computation, pp. 1\u201328 (2025)","DOI":"10.1162\/evco_a_00370"},{"issue":"3","key":"21_CR33","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1162\/EVCO_a_00116","volume":"22","author":"A Sinha","year":"2014","unstructured":"Sinha, A., Malo, P., Deb, K.: Test problem construction for single-objective bilevel optimization. Evol. Comput. 22(3), 439\u2013477 (2014)","journal-title":"Evol. Comput."},{"key":"21_CR34","doi-asserted-by":"crossref","unstructured":"Sinha, A., Malo, P., Deb, K.: A review on Bilevel optimization: from classical to evolutionary approaches and applications. IEEE Trans. Evolut. Comput. 22(2), 276\u2013295 (2017)","DOI":"10.1109\/TEVC.2017.2712906"},{"key":"21_CR35","doi-asserted-by":"crossref","unstructured":"Prager, R.\u00a0P., Trautmann, H.: Nullifying the inherent bias of non-invariant exploratory landscape analysis features. In: International Conference on the Applications of Evolutionary Computation (Part of EvoStar). Springer, pp. 411\u2013425 (2023)","DOI":"10.1007\/978-3-031-30229-9_27"},{"key":"21_CR36","doi-asserted-by":"crossref","unstructured":"Prager, R.P., Trautmann, H.: Pflacco: feature-based landscape analysis of continuous and constrained optimization problems in python. Evolut. Comput. 32(3), 211\u2013216 (2024)","DOI":"10.1162\/evco_a_00341"},{"issue":"4","key":"21_CR37","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-a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Global Optim."},{"issue":"1","key":"21_CR38","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland, J.H.: Genetic algorithms. Sci. Am. 267(1), 66\u201373 (1992)","journal-title":"Sci. Am."},{"key":"21_CR39","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN\u201995-International Conference on Neural Networks, vol.\u00a04, pp. 1942\u20131948. IEEE (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"2","key":"21_CR40","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)","journal-title":"Evol. Comput."},{"key":"21_CR41","doi-asserted-by":"crossref","unstructured":"Rechenberg, I.: Evolutionsstrategien. In: Simulationsmethoden in der Medizin und Biologie: Workshop, Hannover, 29. Sept.\u20131. Okt. 1977. Springer, pp. 83\u2013114 (1978)","DOI":"10.1007\/978-3-642-81283-5_8"},{"issue":"4","key":"21_CR42","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":"21_CR43","doi-asserted-by":"crossref","unstructured":"Blank, J., Deb, K.: pymoo: multi-objective optimization in python. IEEE Access 8, 89\u00a0497\u201389\u00a0509 (2020)","DOI":"10.1109\/ACCESS.2020.2990567"},{"key":"21_CR44","unstructured":"Nalluri, M., Pentela, M., Eluri, N.R.: A scalable tree boosting system: XG boost. Int. J. Res. Stud. Sci. Eng. Technol. 7(12), 36\u201351 (2020)"},{"issue":"1","key":"21_CR45","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T Cover","year":"1967","unstructured":"Cover, T., Hart, P.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theory 13(1), 21\u201327 (1967)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"21_CR46","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1023\/A:1022627411411","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"key":"21_CR47","doi-asserted-by":"crossref","unstructured":"Rumelhart, D.\u00a0E., Hinton, G.\u00a0E., Williams, R.\u00a0J.: Learning representations by back-propagating errors. Nature 323(6088), 533\u2013536 (1986)","DOI":"10.1038\/323533a0"},{"key":"21_CR48","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"21_CR49","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 785\u2013794 (2016)","DOI":"10.1145\/2939672.2939785"}],"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-032-23604-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T03:21:54Z","timestamp":1778210514000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-23604-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032236036","9783032236043"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-23604-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 May 2026","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":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2026\/evoapps\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}