{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T17:46:45Z","timestamp":1745344005330,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700675"},{"type":"electronic","value":"9783031700682"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-70068-2_5","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:02:54Z","timestamp":1725649374000},"page":"70-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Identifying Easy Instances to\u00a0Improve Efficiency of\u00a0ML Pipelines for\u00a0Algorithm-Selection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2487-981X","authenticated-orcid":false,"given":"Quentin","family":"Renau","sequence":"first","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":[[2024,9,7]]},"reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-022-09505-4","volume":"29","author":"M Alissa","year":"2023","unstructured":"Alissa, M., Sim, K., Hart, E.: Automated algorithm selection: from feature-based to feature-free approaches. J. Heuristics 29(1), 1\u201338 (2023). https:\/\/doi.org\/10.1007\/s10732-022-09505-4","journal-title":"J. Heuristics"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Buttazzo, G.C.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications, vol.\u00a024. Springer Science & Business Media, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4614-0676-1","DOI":"10.1007\/978-1-4614-0676-1"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Cenikj, G., Petelin, G., Doerr, C., Korosec, P., Eftimov, T.: Dynamorep: trajectory-based population dynamics for classification of black-box optimization problems. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2023, Lisbon, Portugal, 15-19 July 2023, pp. 813\u2013821. ACM (2023). https:\/\/doi.org\/10.1145\/3583131.3590401","DOI":"10.1145\/3583131.3590401"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-85778-5_11","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"A Degorre","year":"2008","unstructured":"Degorre, A., Maler, O.: On scheduling policies for streams of structured jobs. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 141\u2013154. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85778-5_11"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR-Spektrum 22, 425\u2013460 (2000)","journal-title":"OR-Spektrum"},{"issue":"1\u20132","key":"5_CR6","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1002\/mcda.1574","volume":"24","author":"JR Figueira","year":"2017","unstructured":"Figueira, J.R., et al.: Easy to say they are hard, but hard to see they are easy-towards a categorization of tractable multiobjective combinatorial optimization problems. J. Multi-Criteria Decis. Anal. 24(1\u20132), 82\u201398 (2017)","journal-title":"J. Multi-Criteria Decis. Anal."},{"key":"5_CR7","unstructured":"Finck, S., Hansen, N., Ros, R., Auger, A.: Real-Parameter Black-Box Optimization Benchmarking 2010: presentation of the Noiseless Functions (2010). http:\/\/coco.gforge.inria.fr\/downloads\/download16.00\/bbobdocfunctions.pdf"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s11276-006-4960-8","volume":"13","author":"CH Gan","year":"2007","unstructured":"Gan, C.H., Lin, P., Perng, N.C., Kuo, T.W., Hsu, C.C.: Scheduling for time-division based shared channel allocation for UMTS. Wireless Netw. 13, 189\u2013202 (2007)","journal-title":"Wireless Netw."},{"issue":"1","key":"5_CR9","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., Tusar, 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."},{"issue":"2","key":"5_CR10","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."},{"issue":"8","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9(8), 1735\u20131780 (1997). https:\/\/doi.org\/10.1162\/neco.1997.9.8.1735","journal-title":"Neural Comput."},{"key":"5_CR12","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":"5_CR13","doi-asserted-by":"publisher","unstructured":"Jankovic, A., Vermetten, D., Kostovska, A., de\u00a0Nobel, J., Eftimov, T., Doerr, C.: Trajectory-based algorithm selection with warm-starting. In: IEEE Congress on Evolutionary Computation, CEC 2022, Padua, Italy, 18-23 July 2022, pp.\u00a01\u20138. IEEE (2022). https:\/\/doi.org\/10.1109\/CEC55065.2022.9870222","DOI":"10.1109\/CEC55065.2022.9870222"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN 1995 - International Conference on Neural Networks, vol.\u00a04, pp. 1942\u20131948 (1995). https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"1","key":"5_CR15","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., Neumann, F., Trautmann, H.: Automated algorithm selection: survey and perspectives. Evol. Comput. 27(1), 3\u201345 (2019)","journal-title":"Evol. Comput."},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Kerschke, P., Preuss, M.: Exploratory landscape analysis. In: Proceedings of the Companion Conference on Genetic and Evolutionary Computation, p. 990-1007. GECCO 2023 Companion, Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3583133.3595058","DOI":"10.1145\/3583133.3595058"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1162\/evco_a_00236","volume":"27","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Trautmann, H.: Automated algorithm selection on continuous black-box problems by combining exploratory landscape analysis and machine learning. Evol. Comput. 27(1), 99\u2013127 (2019)","journal-title":"Evol. Comput."},{"key":"5_CR18","unstructured":"Kingma, D., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"key":"5_CR19","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., Tu\u0161ar, T. (eds) International Conference on Parallel Problem Solving from Nature, vol. 13398, pp. 46\u201360. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14714-2_4","DOI":"10.1007\/978-3-031-14714-2_4"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-19084-6_18","volume-title":"Learning and Intelligent Optimization","author":"L Kotthoff","year":"2015","unstructured":"Kotthoff, L., Kerschke, P., Hoos, H., Trautmann, H.: Improving the state of the art in inexact TSP solving using per-instance algorithm selection. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 202\u2013217. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19084-6_18"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., Rudolph, G.: Exploratory Landscape Analysis. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2011, pp. 829\u2013836. ACM (2011). https:\/\/doi.org\/10.1145\/2001576.2001690","DOI":"10.1145\/2001576.2001690"},{"issue":"3","key":"5_CR22","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1162\/evco_a_00262","volume":"28","author":"M Mu\u00f1oz","year":"2020","unstructured":"Mu\u00f1oz, M., Smith-Miles, K.: Generating new space-filling test instances for continuous black-box optimization. Evol. Comput. 28(3), 379\u2013404 (2020)","journal-title":"Evol. Comput."},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Pinedo, M.: Planning and Scheduling in Manufacturing and Services. Springer, New York (2005). https:\/\/doi.org\/10.1007\/978-1-4419-0910-7","DOI":"10.1007\/978-1-4419-0910-7"},{"issue":"2","key":"5_CR24","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","volume":"10","author":"S Raff","year":"1983","unstructured":"Raff, S.: Routing and scheduling of vehicles and crews: the state of the art. Comput. Oper. Res. 10(2), 63\u2013211 (1983)","journal-title":"Comput. Oper. Res."},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Renau, Q., Hart, E.: Identifying easy instances to improve efficiency of ml pipelines for algorithm-selection - code and data (2024). https:\/\/doi.org\/10.5281\/zenodo.10590233","DOI":"10.5281\/zenodo.10590233"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Renau, Q., Hart, E.: Improving algorithm-selection and performance-prediction via learning discriminating training samples. In: In Press of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, 14-18 July 2024, pp. 813\u2013821. ACM (2024). https:\/\/doi.org\/10.1145\/3638529.3654025","DOI":"10.1145\/3638529.3654025"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Renau, Q., Hart, E.: On the utility of probing trajectories for algorithm-selection. In: Smith, S., Correia, J., Cintrano, C. (eds.) Applications of Evolutionary Computation - 27th European Conference, EvoApplications 2024, Held as Part of EvoStar 2024, Aberystwyth, UK, 3-5 April 2024, Proceedings, Part I. LNCS, vol. 14634, pp. 98\u2013114. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-56852-7_7","DOI":"10.1007\/978-3-031-56852-7_7"},{"key":"5_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105184","volume":"128","author":"K Smith-Miles","year":"2021","unstructured":"Smith-Miles, K., Christiansen, J., Mu\u00f1oz, M.: Revisiting where are the hard knapsack problems? Via instance space analysis. Comput. Oper. Res. 128, 105184 (2021)","journal-title":"Comput. Oper. Res."},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-13800-3_29","volume-title":"Learning and Intelligent Optimization","author":"K Smith-Miles","year":"2010","unstructured":"Smith-Miles, K., van Hemert, J., Lim, X.Y.: Understanding TSP difficulty by learning from evolved instances. In: Blum, C., Battiti, R. (eds.) LION 2010. LNCS, vol. 6073, pp. 266\u2013280. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13800-3_29"},{"issue":"4","key":"5_CR30","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). https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J. Global Optim."},{"issue":"6","key":"5_CR31","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1109\/TEVC.2022.3169770","volume":"26","author":"R Tanabe","year":"2022","unstructured":"Tanabe, R.: Benchmarking feature-based algorithm selection systems for black-box numerical optimization. IEEE Trans. Evol. Comput. 26(6), 1321\u20131335 (2022). https:\/\/doi.org\/10.1109\/TEVC.2022.3169770","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR32","doi-asserted-by":"publisher","unstructured":"Vermetten, D., Hao, W., Sim, K., Hart, E.: To Switch or not to Switch: Predicting the Benefit of Switching between Algorithms based on Trajectory Features - Dataset (2022). https:\/\/doi.org\/10.5281\/zenodo.7249389","DOI":"10.5281\/zenodo.7249389"},{"key":"5_CR33","doi-asserted-by":"publisher","unstructured":"Vermetten, D., Wang, H., Sim, K., Hart, E.: To switch or not to switch: predicting the benefit of switching between algorithms based on trajectory features. In: Correia, J., Smith, S., Qaddoura, R. (eds.) Applications of Evolutionary Computation, vol. 13989, pp. 335\u2013350. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30229-9_22","DOI":"10.1007\/978-3-031-30229-9_22"},{"key":"5_CR34","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., Leyton-Brown, K.: Satzilla: portfolio-based algorithm selection for sat. Journal of artificial intelligence research 32, 565\u2013606 (2008)","journal-title":"Journal of artificial intelligence research"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70068-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:06:29Z","timestamp":1725649589000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70068-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700675","9783031700682"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70068-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interest"}},{"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":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}