{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T15:53:41Z","timestamp":1771602821852,"version":"3.50.1"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T00:00:00Z","timestamp":1673222400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T00:00:00Z","timestamp":1673222400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We propose a novel technique for algorithm-selection, applicable to optimisation domains in which there is implicit sequential information encapsulated in the data, e.g., in online bin-packing. Specifically we train two types of recurrent neural networks to predict a packing heuristic in online bin-packing, selecting from four well-known heuristics. As input, the RNN methods only use the sequence of item-sizes. This contrasts to typical approaches to algorithm-selection which require a model to be trained using domain-specific instance features that need to be first derived from the input data. The RNN approaches are shown to be capable of achieving within 5% of the oracle performance on between 80.88 and 97.63% of the instances, depending on the dataset. They are also shown to outperform classical machine learning models trained using derived features. Finally, we hypothesise that the proposed methods perform well when the instances exhibit some implicit structure that results in discriminatory performance with respect to a set of heuristics. We test this hypothesis by generating fourteen new datasets with increasing levels of structure, and show that there is a critical threshold of structure required before algorithm-selection delivers benefit.<\/jats:p>","DOI":"10.1007\/s10732-022-09505-4","type":"journal-article","created":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T18:18:02Z","timestamp":1673288282000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9548-863X","authenticated-orcid":false,"given":"Mohamad","family":"Alissa","sequence":"first","affiliation":[]},{"given":"Kevin","family":"Sim","sequence":"additional","affiliation":[]},{"given":"Emma","family":"Hart","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,9]]},"reference":[{"key":"9505_CR1","doi-asserted-by":"crossref","unstructured":"Alissa, M., Sim, K., Hart, E.: Algorithm selection using deep learning without feature extraction. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 198\u2013206. ACM (2019)","DOI":"10.1145\/3321707.3321845"},{"issue":"1","key":"9505_CR2","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s11390-014-1416-y","volume":"29","author":"A Amini","year":"2014","unstructured":"Amini, A., Wah, T.Y., Saboohi, H.: On density-based data streams clustering algorithms: a survey. J. Comput. Sci. Technol. 29(1), 116\u2013141 (2014)","journal-title":"J. Comput. Sci. Technol."},{"key":"9505_CR3","doi-asserted-by":"crossref","unstructured":"Brownlee, A., Woodward, J.R., Veerapen, N.: Relating Training Instances to Automatic Design of Algorithms for Bin Packing Via Features (Detailed Experiments and Results). University of Stirling, Tech. rep. (2018)","DOI":"10.1145\/3205651.3205748"},{"key":"9505_CR4","doi-asserted-by":"crossref","unstructured":"Byeon, W., Breuel, T.M., Raue, F., Liwicki, M.: Scene labeling with lstm recurrent neural networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3547\u20133555 (2015)","DOI":"10.1109\/CVPR.2015.7298977"},{"key":"9505_CR5","first-page":"1","volume":"66","author":"M Carnein","year":"2019","unstructured":"Carnein, M., Trautmann, H.: Optimizing data stream representation: an extensive survey on stream clustering algorithms. Bus. Inf. Syst. Eng. 66, 1\u201321 (2019)","journal-title":"Bus. Inf. Syst. Eng."},{"key":"9505_CR6","doi-asserted-by":"crossref","unstructured":"Carnein, M., Assenmacher, D., Trautmann, H.: An empirical comparison of stream clustering algorithms. In: Proceedings of the Computing Frontiers Conference, pp. 361\u2013366. ACM (2017)","DOI":"10.1145\/3075564.3078887"},{"key":"9505_CR7","doi-asserted-by":"crossref","unstructured":"Cho, K., Van\u00a0Merri\u00ebnboer, B., Gulcehre, C., Bahdanau, D., Bougares, F., Schwenk, H., Bengio, Y.: Learning phrase representations using rnn encoder\u2013decoder for statistical machine translation. arXiv preprint arXiv:1406.1078 (2014)","DOI":"10.3115\/v1\/D14-1179"},{"issue":"5","key":"9505_CR8","first-page":"530","volume":"3","author":"YK Cho","year":"2008","unstructured":"Cho, Y.K., Moore, J.T., Hill, R.R., Reilly, C.H.: Exploiting empirical knowledge for bi-dimensional knapsack problem heuristics. Int. J. Ind. Syst. Eng. 3(5), 530\u2013548 (2008)","journal-title":"Int. J. Ind. Syst. Eng."},{"key":"9505_CR9","unstructured":"Chung, J., Gulcehre, C., Cho, K., Bengio, Y.: Empirical evaluation of gated recurrent neural networks on sequence modeling. arXiv preprint arXiv:1412.3555 (2014)"},{"key":"9505_CR10","doi-asserted-by":"crossref","unstructured":"Collautti, M., Malitsky, Y., Mehta, D., O\u2019Sullivan, B.: Snnap: Solver-based nearest neighbor for algorithm portfolios. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 435\u2013450. Springer (2013)","DOI":"10.1007\/978-3-642-40994-3_28"},{"key":"9505_CR11","doi-asserted-by":"crossref","unstructured":"Cruz-Reyes, L., G\u00f3mez-Santill\u00e1n, C., P\u00e9rez-Ortega, J., Landero, V., Quiroz, M., Ochoa, A.: Algorithm selection: from meta-learning to hyper-heuristics. In: Intelligent Systems, IntechOpen (2012)","DOI":"10.5772\/36710"},{"key":"9505_CR12","doi-asserted-by":"publisher","unstructured":"Delorme, M., Iori, M., Martello, S.: Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur. J. Oper. Res. 255(1), 1\u201320 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2016.04.030","DOI":"10.1016\/j.ejor.2016.04.030"},{"key":"9505_CR13","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-662-43948-7_36","volume-title":"Automata, Languages, and Programming","author":"G D\u00f3sa","year":"2014","unstructured":"D\u00f3sa, G., Sgall, J.: Optimal analysis of best fit bin packing. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) Automata, Languages, and Programming, pp. 429\u2013441. Springer, Heidelberg (2014)"},{"key":"9505_CR14","unstructured":"Eibe, F., Mark, A.H., Ian, H.W.: The WEKA Workbench. Practical Machine Learning Tools and Techniques, 4th edn. Morgan Kaufmann (2016); Online Appendix for Data Mining"},{"key":"9505_CR15","doi-asserted-by":"crossref","unstructured":"Falkenauer, E., Delchambre, A.: A genetic algorithm for bin packing and line balancing. In: Proceedings of the 1992 IEEE International Conference on Robotics and Automation, pp. 1186\u20131192. IEEE (1992)","DOI":"10.1109\/ROBOT.1992.220088"},{"key":"9505_CR16","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing problems: a survey. In: Analysis and Design of Algorithms in Combinatorial Optimization, pp. 147\u2013172. Springer (1981)","DOI":"10.1007\/978-3-7091-2748-3_8"},{"issue":"4","key":"9505_CR17","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1145\/3186728.3164136","volume":"11","author":"S Gong","year":"2017","unstructured":"Gong, S., Zhang, Y., Yu, G.: Clustering stream data by exploring the evolution of density mountain. Proc. VLDB Endow. 11(4), 393\u2013405 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"9505_CR18","doi-asserted-by":"crossref","unstructured":"Graves, A.: Supervised sequence labelling. In: Supervised Sequence Labelling with Recurrent Neural Networks, pp. 5\u201313. Springer (2012)","DOI":"10.1007\/978-3-642-24797-2_2"},{"key":"9505_CR19","doi-asserted-by":"crossref","unstructured":"Hains, D., Whitley, D., Howe, A.: Improving Lin\u2013Kernighan\u2013Helsgaun with crossover on clustered instances of the tsp. In: International Conference on Parallel Problem Solving from Nature, pp. 388\u2013397. Springer (2012)","DOI":"10.1007\/978-3-642-32964-7_39"},{"issue":"2","key":"9505_CR20","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1057\/jors.2010.116","volume":"62","author":"DR Hains","year":"2011","unstructured":"Hains, D.R., Whitley, L.D., Howe, A.E.: Revisiting the big valley search space structure in the tsp. J. Oper. Res. Soc. 62(2), 305\u2013312 (2011)","journal-title":"J. Oper. Res. Soc."},{"key":"9505_CR21","volume-title":"Neural Networks and Learning Machines\/Simon Haykin","author":"SS Haykin","year":"2009","unstructured":"Haykin, S.S., et al.: Neural Networks and Learning Machines\/Simon Haykin. Prentice Hall, New York (2009)"},{"issue":"8","key":"9505_CR22","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":"9505_CR23","unstructured":"Hu, H., Zhang, X., Yan, X., Wang, L., Xu, Y.: Solving a new 3d bin packing problem with deep reinforcement learning method. arXiv preprint arXiv:1708.05930 (2017)"},{"key":"9505_CR24","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"issue":"4","key":"9505_CR25","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D Johnson","year":"1974","unstructured":"Johnson, D., Demers, A., Ullman, J., Garey, M., Graham, R.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3(4), 299\u2013325 (1974)","journal-title":"SIAM J. Comput."},{"key":"9505_CR26","unstructured":"Kandanaarachchi, S., Munoz, M.A., Hyndman, R.J., Smith-Miles, K., et al.: On Normalization and Algorithm Selection for Unsupervised Outlier Detection. Monash University, Department of Econometrics and Business Statistics, Tech. rep. (2018)"},{"key":"9505_CR27","doi-asserted-by":"publisher","first-page":"1662","DOI":"10.1109\/ACCESS.2017.2779939","volume":"6","author":"F Karim","year":"2017","unstructured":"Karim, F., Majumdar, S., Darabi, H., Chen, S.: Lstm fully convolutional networks for time series classification. IEEE Access 6, 1662\u20131669 (2017)","journal-title":"IEEE Access"},{"issue":"1","key":"9505_CR28","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":"9505_CR29","first-page":"1","volume":"66","author":"P Kerschke","year":"2018","unstructured":"Kerschke, P., Hoos, H.H., Neumann, F., Trautmann, H.: Automated algorithm selection: survey and perspectives. Evol. Comput. 66, 1\u201347 (2018)","journal-title":"Evol. Comput."},{"issue":"4","key":"9505_CR30","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1162\/evco_a_00215","volume":"26","author":"P Kerschke","year":"2018","unstructured":"Kerschke, P., Kotthoff, L., Bossek, J., Hoos, H.H., Trautmann, H.: Leveraging tsp solver complementarity through machine learning. Evol. Comput. 26(4), 597\u2013620 (2018)","journal-title":"Evol. Comput."},{"key":"9505_CR31","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization (2014). arXiv preprint arXiv:1412.6980"},{"key":"9505_CR32","doi-asserted-by":"crossref","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. In: Data Mining and Constraint Programming, pp. 149\u2013190. Springer (2016)","DOI":"10.1007\/978-3-319-50137-6_7"},{"key":"9505_CR33","unstructured":"Kroc, L., Sabharwal, A., Gomes, C.P., Selman, B.: Integrating systematic and local search paradigms: a new strategy for maxsat. In: Twenty-First International Joint Conference on Artificial Intelligence (2009)"},{"issue":"3","key":"9505_CR34","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"CC Lee","year":"1985","unstructured":"Lee, C.C., Lee, D.T.: A simple on-line bin-packing algorithm. J. ACM 32(3), 562\u2013572 (1985)","journal-title":"J. ACM"},{"key":"9505_CR35","doi-asserted-by":"publisher","unstructured":"Lee, J.Y., Dernoncourt, F.: Sequential short-text classification with recurrent and convolutional neural networks. In: Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Association for Computational Linguistics, San Diego, CA, pp. 515\u2013520 (2016). https:\/\/doi.org\/10.18653\/v1\/N16-1062","DOI":"10.18653\/v1\/N16-1062"},{"key":"9505_CR36","unstructured":"Lipton, Z.C., Berkowitz, J., Elkan, C.: A critical review of recurrent neural networks for sequence learning. arXiv preprint arXiv:1506.00019 (2015)"},{"issue":"21\u201323","key":"9505_CR37","doi-asserted-by":"publisher","first-page":"2099","DOI":"10.1016\/j.tcs.2009.01.007","volume":"410","author":"M Liu","year":"2009","unstructured":"Liu, M., Xu, Y., Chu, C., Zheng, F.: Online scheduling on two uniform machines to minimize the makespan. Theor. Comput. Sci. 410(21\u201323), 2099\u20132109 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9505_CR38","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.ijpe.2013.04.041","volume":"145","author":"E L\u00f3pez-Camacho","year":"2013","unstructured":"L\u00f3pez-Camacho, E., Terashima-Mar\u00edn, H., Ochoa, G., Conant-Pablos, S.E.: Understanding the structure of bin packing problems through principal component analysis. Int. J. Prod. Econ. 145(2), 488\u2013499 (2013)","journal-title":"Int. J. Prod. Econ."},{"key":"9505_CR39","doi-asserted-by":"crossref","unstructured":"Loreggia, A., Malitsky, Y., Samulowitz, H., Saraswat, V.A.: Deep learning for algorithm portfolios. In: AAAI, pp. 1280\u20131286 (2016)","DOI":"10.1609\/aaai.v30i1.10170"},{"issue":"4","key":"9505_CR40","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/sam.11380","volume":"11","author":"S Mansalis","year":"2018","unstructured":"Mansalis, S., Ntoutsi, E., Pelekis, N., Theodoridis, Y.: An evaluation of data stream clustering algorithms. Stat. Anal. Data Min. ASA Data Sci. J. 11(4), 167\u2013187 (2018)","journal-title":"Stat. Anal. Data Min. ASA Data Sci. J."},{"key":"9505_CR41","doi-asserted-by":"crossref","unstructured":"Mao, F., Blanco, E., Fu, M., Jain, R., Gupta, A., Mancel, S., Yuan, R., Guo, S., Kumar, S., Tian, Y.: Small boxes big data: a deep learning approach to optimize variable sized bin packing. In: Third IEEE International Conference on Big Data Computing Service and Applications (BigDataService 2017), Redwood City, CA, USA, April 6\u20139, 2017, pp. 80\u201389 (2017)","DOI":"10.1109\/BigDataService.2017.18"},{"key":"9505_CR42","volume-title":"Neural Networks and Deep Learning","author":"MA Nielsen","year":"2015","unstructured":"Nielsen, M.A.: Neural Networks and Deep Learning, vol. 25. Determination Press, San Francisco (2015)"},{"key":"9505_CR43","doi-asserted-by":"crossref","unstructured":"Nudelman, E., Leyton-Brown, K., Hoos, H.H., Devkar, A., Shoham, Y.: Understanding random sat: beyond the clauses-to-variables ratio. In: Wallace, M. (Ed.) Principles and Practice of Constraint Programming\u2014CP 2004, pp. 438\u2013452. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-30201-8_33"},{"key":"9505_CR44","doi-asserted-by":"crossref","unstructured":"Perez, J., Frausto, J., Cruz, L., Fraire, H., Santiago, E., et\u00a0al.: A machine learning approach for modeling algorithm performance predictors. In: International Conference on Modeling Decisions for Artificial Intelligence, pp. 70\u201380. Springer (2004)","DOI":"10.1007\/978-3-540-27774-3_8"},{"key":"9505_CR45","doi-asserted-by":"crossref","unstructured":"P\u00e9rez, J., Pazos, R.A., Frausto, J., Rodr\u00edguez, G., Romero, D., Cruz, L.: A statistical approach for algorithm selection. In: International Workshop on Experimental and Efficient Algorithms, pp. 417\u2013431. Springer (2004)","DOI":"10.1007\/978-3-540-24838-5_31"},{"key":"9505_CR46","doi-asserted-by":"publisher","unstructured":"Pihera, J., Musliu, N.: Application of machine learning to algorithm selection for tsp. In: 2014 IEEE 26th International Conference on Tools with Artificial Intelligence, pp. 47\u201354 (2014). https:\/\/doi.org\/10.1109\/ICTAI.2014.18","DOI":"10.1109\/ICTAI.2014.18"},{"key":"9505_CR47","doi-asserted-by":"publisher","unstructured":"Pouyanfar, S., Sadiq, S., Yan, Y., Tian, H., Tao, Y., Reyes, M.P., Shyu, M.L., Chen, S.C., Iyengar, S.S.: A survey on deep learning: algorithms, techniques, and applications. ACM Comput. Surv. 51(5):92:1\u201392:36 (2018). https:\/\/doi.org\/10.1145\/3234150","DOI":"10.1145\/3234150"},{"issue":"4","key":"9505_CR48","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1109\/TEVC.2009.2033579","volume":"14","author":"M Qasem","year":"2009","unstructured":"Qasem, M., Pr\u00fcgel-Bennett, A.: Learning the large-scale structure of the max-sat landscape using populations. IEEE Trans. Evol. Comput. 14(4), 518\u2013529 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"9505_CR49","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0196-6774(89)90031-X","volume":"10","author":"P Ramanan","year":"1989","unstructured":"Ramanan, P., Brown, D.J., Lee, C.C., Lee, D.T.: On-line bin packing in linear time. J. Algorithms 10(3), 305\u2013326 (1989)","journal-title":"J. Algorithms"},{"key":"9505_CR50","doi-asserted-by":"crossref","unstructured":"Rice, J.R.: The algorithm selection problem. In: Rubinoff, M., Yovits, M.C. (Eds.) Advances in Computers, vol. 15, pp. 65\u2013118. Elsevier (1976)","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"9505_CR51","doi-asserted-by":"crossref","unstructured":"van Rijn, J.N., Holmes, G., Pfahringer, B., Vanschoren, J.: Algorithm Selection on Data Streams. In: International Conference on Discovery Science, pp. 325\u2013336. Springer (2014)","DOI":"10.1007\/978-3-319-11812-3_28"},{"issue":"1","key":"9505_CR52","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10994-017-5686-9","volume":"107","author":"JN van Rijn","year":"2018","unstructured":"van Rijn, J.N., Holmes, G., Pfahringer, B., Vanschoren, J.: The online performance estimation framework: heterogeneous ensemble learning for data streams. Mach. Learn. 107(1), 149\u2013176 (2018)","journal-title":"Mach. Learn."},{"issue":"3","key":"9505_CR53","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1038\/nbt0308-303","volume":"26","author":"M Ringn\u00e9r","year":"2008","unstructured":"Ringn\u00e9r, M.: What is principal component analysis? Nat. Biotechnol. 26(3), 303 (2008)","journal-title":"Nat. Biotechnol."},{"key":"9505_CR54","unstructured":"Ross, P., Schulenburg, S., Mar\u00edn-Bl\u00e4zquez, J.G., Hart, E.: Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. In: Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation, pp. 942\u2013948. Morgan Kaufmann (2002)"},{"key":"9505_CR55","doi-asserted-by":"crossref","unstructured":"Seiler, M., Pohl, J., Bossek, J., Kerschke, P., Trautmann, H.: Deep learning as a competitive feature-free approach for automated algorithm selection on the traveling salesperson problem. In: International Conference on Parallel Problem Solving from Nature, pp. 48\u201364. Springer (2020)","DOI":"10.1007\/978-3-030-58112-1_4"},{"key":"9505_CR56","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press (2014)","DOI":"10.1017\/CBO9781107298019"},{"key":"9505_CR57","doi-asserted-by":"crossref","unstructured":"Sim, K., Hart, E., Paechter, B.: A hyper-heuristic classifier for one dimensional bin packing problems: improving classification accuracy by attribute evolution. In: International Conference on Parallel Problem Solving from Nature, pp. 348\u2013357. Springer (2012)","DOI":"10.1007\/978-3-642-32964-7_35"},{"issue":"1","key":"9505_CR58","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1162\/EVCO_a_00121","volume":"23","author":"K Sim","year":"2015","unstructured":"Sim, K., Hart, E., Paechter, B.: A lifelong learning hyper-heuristic method for bin packing. Evol. Comput. 23(1), 37\u201367 (2015)","journal-title":"Evol. Comput."},{"key":"9505_CR59","doi-asserted-by":"crossref","unstructured":"Skansi, S.: Introduction to Deep Learning: From Logical Calculus to Artificial Intelligence. Springer (2018)","DOI":"10.1007\/978-3-319-73004-2"},{"issue":"2","key":"9505_CR60","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10472-011-9230-5","volume":"61","author":"K Smith-Miles","year":"2011","unstructured":"Smith-Miles, K., van Hemert, J.: Discovering the suitability of optimisation algorithms by learning from evolved instances. Ann. Math. Artif. Intell. 61(2), 87\u2013104 (2011). https:\/\/doi.org\/10.1007\/s10472-011-9230-5","journal-title":"Ann. Math. Artif. Intell."},{"issue":"5","key":"9505_CR61","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K Smith-Miles","year":"2012","unstructured":"Smith-Miles, K., Lopes, L.: Measuring instance difficulty for combinatorial optimization problems. Comput. Oper. Res. 39(5), 875\u2013889 (2012)","journal-title":"Comput. Oper. Res."},{"key":"9505_CR62","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K., van Hemert, J., Lim, X.Y.: Understanding tsp difficulty by learning from evolved instances. In: International Conference on Learning and Intelligent Optimization, pp. 266\u2013280. Springer (2010)","DOI":"10.1007\/978-3-642-13800-3_29"},{"key":"9505_CR63","doi-asserted-by":"publisher","unstructured":"Smith-Miles, K., Baatar, D., Wreford, B., Lewis, R.: Towards objective measures of algorithm performance across instance space. Comput. Oper. Res. 45, 12\u201324 (2014). https:\/\/doi.org\/10.1016\/j.cor.2013.11.015","DOI":"10.1016\/j.cor.2013.11.015"},{"issue":"1","key":"9505_CR64","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1456650.1456656","volume":"41","author":"KA Smith-Miles","year":"2009","unstructured":"Smith-Miles, K.A.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41(1), 1\u201325 (2009). https:\/\/doi.org\/10.1145\/1456650.1456656","journal-title":"ACM Comput. Surv."},{"key":"9505_CR65","unstructured":"Wang, H., Raj, B.: On the origin of deep learning (2017). arXiv preprint arXiv:1702.07800"},{"issue":"2","key":"9505_CR66","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10845-008-0073-9","volume":"19","author":"GR Weckman","year":"2008","unstructured":"Weckman, G.R., Ganduri, C.V., Koonce, D.A.: A neural network job-shop scheduler. J. Intell. Manuf. 19(2), 191\u2013201 (2008)","journal-title":"J. Intell. Manuf."},{"key":"9505_CR67","unstructured":"Weisstein, E.W.: Bonferroni Correction (2004). https:\/\/mathworldwolfram.com\/"},{"issue":"2","key":"9505_CR68","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1162\/evco.1995.3.2.149","volume":"3","author":"SW Wilson","year":"1995","unstructured":"Wilson, S.W.: Classifier fitness based on accuracy. Evol. Comput. 3(2), 149\u2013175 (1995)","journal-title":"Evol. Comput."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-022-09505-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-022-09505-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-022-09505-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T21:56:11Z","timestamp":1728683771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-022-09505-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,9]]},"references-count":68,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["9505"],"URL":"https:\/\/doi.org\/10.1007\/s10732-022-09505-4","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,9]]},"assertion":[{"value":"31 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest\/Competing interests"}},{"value":".","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Availability of data and material"}},{"value":"The code will be made available when the paper published.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}