{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:46:51Z","timestamp":1742957211231,"version":"3.40.3"},"publisher-location":"Cham","reference-count":92,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031368042"},{"type":"electronic","value":"9783031368059"}],"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-36805-9_45","type":"book-chapter","created":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T23:03:04Z","timestamp":1688079784000},"page":"694-712","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["From Selecting Best Algorithm to Explaining Why It is: A General Review, Formal Problem Statement and Guidelines Towards to an Empirical Generalization"],"prefix":"10.1007","author":[{"given":"Vanesa Landero","family":"N\u00e1jera","sequence":"first","affiliation":[]},{"given":"Joaqu\u00edn P\u00e9rez","family":"Ortega","sequence":"additional","affiliation":[]},{"given":"Carlos Andr\u00e9s","family":"Collazos Morales","sequence":"additional","affiliation":[]},{"given":"Sandra Silvia","family":"Roblero Aguilar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,30]]},"reference":[{"key":"45_CR1","unstructured":"Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization, Algorithms and Complexity. Prentice Hall(1982)"},{"issue":"1","key":"45_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1996","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for optimizations. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1996)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/S1571-0653(04)00332-4","volume":"9","author":"M Lagoudakis","year":"2001","unstructured":"Lagoudakis, M., Littman, M.: Learning to select branching rules in the dpll procedure for satisfiability. Electron. Notes Discr. Math. 9, 344\u2013359 (2001)","journal-title":"Electron. Notes Discr. Math."},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1007\/s00170-012-4571-8","volume":"67","author":"R Vanchipura","year":"2013","unstructured":"Vanchipura, R., Sridharan, R.: Development and analysis of constructive heuristic algorithms for flow shop scheduling problems with sequence-dependent setup times. Int. J. Adv. Manuf. Technol. 67, 1337\u20131353 (2013)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"45_CR5","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)","journal-title":"Evol. Comput."},{"key":"45_CR6","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., Leyton-Brown, K.: Algorithm runtime prediction: Methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H., Leyton-Brown, K.: Hydra: Automatically configuring algorithms for portfolio-based selection. In: Proceedings of the 25th National Conference on Artificial Intelligence (AAAI\u201910), pp. 210\u2013216 (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"45_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_40"},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ins.2013.05.015","volume":"246","author":"A Cayci","year":"2013","unstructured":"Cayci, A., Menasalvas, E., Saygin, Y., Eibe, S.: Self-configuring data mining for ubiquitous computing. Inf. Sci. 246, 83\u201399 (2013)","journal-title":"Inf. Sci."},{"key":"45_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.asoc.2014.01.032","volume":"18","author":"E Yeguas","year":"2014","unstructured":"Yeguas, E., Luz\u00f3n, M., Pav\u00f3n, R., Laza, R., Arroyo, G., D\u00edaz, F.: Automatic parameter tuning for evolutionary algorithms using a bayesian case-based reasoning system. Appl. Soft Comput. 18, 185\u2013195 (2014)","journal-title":"Appl. Soft Comput."},{"issue":"5","key":"45_CR11","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1057\/jors.2014.46","volume":"66","author":"J Ries","year":"2015","unstructured":"Ries, J., Beullens, P.: A semi-automated design of instance-based fuzzy parameter tuning for metaheuristics based on decision tree induction. J. Oper. Res. Soc. 66(5), 782\u2013793 (2015)","journal-title":"J. Oper. Res. Soc."},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1613\/jair.1.13676","volume":"75","author":"E Schede","year":"2022","unstructured":"Schede, E., et al.: A survey of methods for automated algorithm configuration. J. Artif. Intell. Res. 75, 425\u2013487 (2022)","journal-title":"J. Artif. Intell. Res."},{"issue":"5","key":"45_CR13","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/2594413.2594424","volume":"57","author":"K Leyton-Brown","year":"2014","unstructured":"Leyton-Brown, K., Hoos, H., Hutter, F., Xu, L.: Understanding the empirical hardness of NP-complete problems. Magaz. Commun. ACM 57(5), 98\u2013107 (2014)","journal-title":"Magaz. Commun. ACM"},{"key":"45_CR14","unstructured":"Cruz, L., G\u00f3mez, C., P\u00e9rez, J., Landero, V., Quiroz, M., Ochoa, A.: Algorithm Selection: From Meta-Learning to Hyper-Heuristics, INTECH Open Access Publisher (2012)"},{"issue":"2","key":"45_CR15","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2019.07.073","volume":"285","author":"JH Drake","year":"2020","unstructured":"Drake, J.H., Kheiri, A., \u00d6zcan, E., Burke, E.K.: Recent advances in selection hyper-heuristics. Eur. J. Oper. Res. 285(2), 405\u2013428 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"45_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/3-540-46135-3_37","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"K Leyton-Brown","year":"2002","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y.: Learning the empirical hardness of optimization problems: The case of combinatorial auctions. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 556\u2013572. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46135-3_37"},{"key":"45_CR17","unstructured":"Yong, X., Feng, D., Rongchun, Z.: Optimal selection of image segmentation algorithms based on performance prediction. In: Proceedings of the Pan-Sydney Area Workshop on Visual Information Processing, Australian Computer Society, Inc., pp. 105\u2013108 (2003)"},{"key":"45_CR18","unstructured":"Guerri, A., Milano, M.: Learning techniques for automatic algorithm portfolio selection. In: Burke, V.A. (ed.) Proceedings of the 16th Biennial European Conference on Artificial Intelligence, pp. 475\u2013479. IOS Press, Spain (2004)"},{"key":"45_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-30549-1_28","volume-title":"AI 2004: Advances in Artificial Intelligence","author":"H Guo","year":"2004","unstructured":"Guo, H., Hsu, W.H.: A learning-based algorithm selection meta-reasoner for the real-time MPE problem. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol. 3339, pp. 307\u2013318. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30549-1_28"},{"key":"45_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-27774-3_8","volume-title":"Modeling Decisions for Artificial Intelligence","author":"J Perez O.","year":"2004","unstructured":"Perez O., J., et al.: A machine learning approach for modeling algorithm performance predictors. In: Torra, V., Narukawa, Y. (eds.) MDAI 2004. LNCS (LNAI), vol. 3131, pp. 70\u201380. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27774-3_8"},{"key":"45_CR21","doi-asserted-by":"crossref","unstructured":"Yuen, S., Zhang, X.: Multiobjective evolutionary algorithm portfolio: Choosing suitable algorithm for multiobjective optimization problem. In: 2014 IEEE Congress on Evolutionary Computation (CEC), Beijing, China, pp. 1967\u20131973 (2014)","DOI":"10.1109\/CEC.2014.6900470"},{"issue":"1","key":"45_CR22","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/TEVC.2014.2302006","volume":"19","author":"M Munoz","year":"2015","unstructured":"Munoz, M., Kirley, M., Halgamuge, S.: Exploratory landscape analysis of continuous space optimization problems using information content. Evolution. Comput. IEEE Trans. 19(1), 74\u201387 (2015)","journal-title":"Evolution. Comput. IEEE Trans."},{"issue":"3","key":"45_CR23","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1016\/j.ejor.2022.01.034","volume":"302","author":"D M\u00fcller","year":"2022","unstructured":"M\u00fcller, D., M\u00fcller, M.G., Kress, D., Pesch, E.: An algorithm selection approach for the flexible job shop scheduling problem: Choosing constraint programming solvers through machine learning. Eur. J. Oper. Res. 302(3), 874\u2013891 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"45_CR24","unstructured":"Tsang, E., Borrett, J., Kwan, A.: An attempt to map the performance of a range of algorithm and heuristic combinations. In: Hallam, J. et al. (ed.) Hybrid Problems, Hybrid Solutions. Proceedings of the AISB-95, vol. 27, pp. 203\u2013216. IOS Press, Amsterdam (1995)"},{"key":"45_CR25","doi-asserted-by":"crossref","unstructured":"Alsouly, H., Kirley, M., Mu\u00f1oz, M.A.: An instance space analysis of constrained multi-objective optimization problems. IEEE Trans. Evolution. Comput. (2022)","DOI":"10.1109\/TEVC.2022.3208595"},{"key":"45_CR26","volume-title":"Empirical Methods for Artificial Intelligence","author":"P Cohen","year":"1995","unstructured":"Cohen, P.: Empirical Methods for Artificial Intelligence. The MIT Press Cambridge, London, England (1995)"},{"issue":"1","key":"45_CR27","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"R Barr","year":"1995","unstructured":"Barr, R., Golden, B., Kelly, J., Resende, M., Stewart, W.: Designing and reporting on computational experiments with heuristic methods. J. Heurist. 1(1), 9\u201332 (1995)","journal-title":"J. Heurist."},{"key":"45_CR28","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"C Reeves","year":"1993","unstructured":"Reeves, C.: Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publishing, England (1993)"},{"key":"45_CR29","unstructured":"Frost, D., Rish, I., Vila, L.: Summarizing CSP hardness with continuous probability distributions. In: Proceedings of the 14th National Conference on AI, American Association for Artificial Intelligence, pp. 327\u2013333 (1997)"},{"key":"45_CR30","doi-asserted-by":"crossref","unstructured":"Lee, J., Giraud, C.: Predicting algorithm accuracy with a small set of effective meta-features. In Machine Learning and Applications, In: Eleventh International Conference on IEEE, pp. 808\u2013812 (2008)","DOI":"10.1109\/ICMLA.2008.62"},{"key":"45_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-540-74484-9_58","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2007","author":"J P\u00e9rez O","year":"2007","unstructured":"P\u00e9rez O, J., Pazos R, R., Cruz R, L., Reyes S, G., Basave T, R., Fraire H, H.: Improving the efficiency and efficacy of the K-means clustering algorithm through a new convergence condition. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007. LNCS, vol. 4707, pp. 674\u2013682. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74484-9_58"},{"issue":"2","key":"45_CR32","first-page":"220","volume":"26","author":"H Fu","year":"2020","unstructured":"Fu, H., Xu, Y., Chen, S., Liu, J.: Improving WalkSAT for random 3-SAT problems. J. Univ. Comput. Sci. 26(2), 220\u2013243 (2020)","journal-title":"J. Univ. Comput. Sci."},{"issue":"8","key":"45_CR33","doi-asserted-by":"publisher","first-page":"377","DOI":"10.3390\/axioms11080377","volume":"11","author":"J P\u00e9rez-Ortega","year":"2022","unstructured":"P\u00e9rez-Ortega, J., et al.: Hybrid fuzzy C-means clustering algorithm oriented to big data realms. Axioms 11(8), 377 (2022)","journal-title":"Axioms"},{"key":"45_CR34","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"J Rice","year":"1976","unstructured":"Rice, J.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"key":"45_CR35","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41(1), 1\u201325 (2009)","DOI":"10.1145\/1456650.1456656"},{"key":"45_CR36","doi-asserted-by":"crossref","unstructured":"Silverthorn, B., Miikkulainen, R.: Latent class models for algorithm portfolio methods. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, Georgia (2010)","DOI":"10.1609\/aaai.v24i1.7546"},{"key":"45_CR37","unstructured":"Xu, L., Hoos, H., Leyton-Brown, K.: Predicting Satisfiability at the Phase Transition. In AAAI (2012)"},{"key":"45_CR38","doi-asserted-by":"crossref","unstructured":"Burke, E., et al.: Hyper-heuristics: A survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695\u20131724 (2013)","DOI":"10.1057\/jors.2013.71"},{"key":"45_CR39","doi-asserted-by":"crossref","unstructured":"Li, B., Hoi, S.: Online portfolio selection: A survey. ACM Comp. Surveys (CSUR) 46(3), 35 (2014)","DOI":"10.1145\/2512962"},{"issue":"3","key":"45_CR40","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12293-015-0159-9","volume":"7","author":"SY Yuen","year":"2015","unstructured":"Yuen, S.Y., Zhang, X.: On composing an algorithm portfolio. Memet. Comput. 7(3), 203\u2013214 (2015). https:\/\/doi.org\/10.1007\/s12293-015-0159-9","journal-title":"Memet. Comput."},{"issue":"2","key":"45_CR41","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2021.04.032","volume":"296","author":"M Karimi-Mamaghan","year":"2022","unstructured":"Karimi-Mamaghan, M., Mohammadi, M., Meyer, P., Karimi-Mamaghan, A.M., Talbi, E.G.: Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art. Eur. J. Oper. Res. 296(2), 393\u2013422 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"45_CR42","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/B978-0-12-395608-8.50035-9","volume-title":"Interactive System for Experimental Applied Mathematics","author":"J Rice","year":"1968","unstructured":"Rice, J.: On the construction of poly-algorithms for automatic numerical analysis. In: Klerer, M., Reinfelds, J. (eds.) Interactive System for Experimental Applied Mathematics, pp. 301\u2013313. Academic Press, MA (1968)"},{"key":"45_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-24664-0_4","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"JC Beck","year":"2004","unstructured":"Beck, J.C., Freuder, E.C.: Simple rules for low-knowledge algorithm selection. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 50\u201364. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24664-0_4"},{"issue":"129","key":"45_CR44","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1090\/S0025-5718-1975-0373371-6","volume":"29","author":"D Knuth","year":"1975","unstructured":"Knuth, D.: Estimating the efficiency of backtrack programs. Math. Comput. 29(129), 122\u2013136 (1975)","journal-title":"Math. Comput."},{"issue":"4","key":"45_CR45","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1137\/0207038","volume":"7","author":"P Purdom","year":"1978","unstructured":"Purdom, P.: Tree size by partial backtracking. SIAM J. Comput. 7(4), 481\u2013491 (1978)","journal-title":"SIAM J. Comput."},{"key":"45_CR46","unstructured":"Sillito, J.: Improvements to and estimating the cost of backtracking algorithms for constraint satisfaction problems. M.Sc. thesis, Department of Computing Science, University of Alberta, Department of Computing Science, Edmonton, Alberta (2000)"},{"key":"45_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-61291-2_40","volume-title":"Advances in Artificial Intelligence","author":"JA Allen","year":"1996","unstructured":"Allen, J.A., Minton, S.: Selecting the right heuristic algorithm: Runtime performance predictors. In: McCalla, G. (ed.) AI 1996. LNCS, vol. 1081, pp. 41\u201353. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61291-2_40"},{"key":"45_CR48","unstructured":"Lobjois, L., Lema\u00eetre, M.: Branch and bound algorithm selection by performance prediction. In: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), Madison, Winsconsin, pp. 353\u2013358 (1998)"},{"key":"45_CR49","unstructured":"Lagoudakis, M., Littman, M.: Algorithm selection using reinforcement learning. In: Kaufmann, M. (ed.), International Conference on Machine Learning (ICML 2000), pp. 511\u2013518 (2000)"},{"issue":"2","key":"45_CR50","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0004-3702(87)90033-6","volume":"33","author":"B Huberman","year":"1987","unstructured":"Huberman, B., Hogg, T.: Phase transitions in artificial intelligence systems. Artif. Intell. 33(2), 155\u2013171 (1987)","journal-title":"Artif. Intell."},{"key":"45_CR51","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.artint.2016.05.004","volume":"244","author":"M Lindauer","year":"2017","unstructured":"Lindauer, M., Hoos, H., Leyton-Brown, K., Schaub, T.: Automatic construction of parallel portfolios via algorithm configuration. Artif. Intell. 244, 272\u2013290 (2017)","journal-title":"Artif. Intell."},{"issue":"2","key":"45_CR52","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TCYB.2020.2984546","volume":"52","author":"S Liu","year":"2020","unstructured":"Liu, S., Tang, K., Yao, X.: Generative adversarial construction of parallel portfolios. IEEE Trans. Cybernet. 52(2), 784\u2013795 (2020)","journal-title":"IEEE Trans. Cybernet."},{"key":"45_CR53","doi-asserted-by":"publisher","unstructured":"Kostovska, A., et al.: Per-run algorithm selection with warm-starting using trajectory-based features. In: Parallel Problem Solving from Nature\u2013PPSN XVII: 17th International Conference, Proceedings, Part I, 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"},{"issue":"3","key":"45_CR54","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1021713901879","volume":"50","author":"C Soares","year":"2003","unstructured":"Soares, C., Pinto, J.: Ranking learning algorithms: Using IBL and meta-learning on accuracy and time results. J. Mach. Learn. 50(3), 251\u2013277 (2003)","journal-title":"J. Mach. Learn."},{"key":"45_CR55","unstructured":"Horvitz, E, Ruan, Y.: A Bayesian approach to tackling hard computational problems. In: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, pp. 235\u2013244. Morgan Kaufmann Publishers Inc., San Francisco (2001)"},{"issue":"3","key":"45_CR56","doi-asserted-by":"publisher","first-page":"432","DOI":"10.3390\/math10030432","volume":"10","author":"U Skvorc","year":"2022","unstructured":"Skvorc, U., Eftimov, T., Koro\u0161ec, P.: Transfer learning analysis of multi-class classification for landscape-aware algorithm selection. Mathematics 10(3), 432 (2022)","journal-title":"Mathematics"},{"key":"45_CR57","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.neucom.2016.04.027","volume":"205","author":"J Kanda","year":"2016","unstructured":"Kanda, J., De Carvalho, A., Hruschka, E., Soares, C., Brazdil, P.: Meta-learning to select the best meta-heuristic for the traveling salesman problem: A comparison of meta-features. Neurocomputing 205, 393\u2013406 (2016)","journal-title":"Neurocomputing"},{"key":"45_CR58","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":"1","key":"45_CR59","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":"45_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-031-02462-7_14","volume-title":"Applications of Evolutionary Computation","author":"R Trajanov","year":"2022","unstructured":"Trajanov, R., Dimeski, S., Popovski, M., Koro\u0161ec, P., Eftimov, T.: Explainable landscape analysis in automated algorithm performance prediction. In: Jim\u00e9nez Laredo, J.L., Hidalgo, J.I., Babaagba, K.O. (eds.) EvoApplications 2022. LNCS, vol. 13224, pp. 207\u2013222. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-02462-7_14"},{"issue":"2","key":"45_CR61","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.ejor.2021.10.032","volume":"300","author":"Y Zhang","year":"2022","unstructured":"Zhang, Y., Bai, R., Qu, R., Tu, C., Jin, J.: A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties. Eur. J. Oper. Res. 300(2), 418\u2013427 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"45_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-30217-9_6","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"HH Hoos","year":"2004","unstructured":"Hoos, H.H., Smyth, K., St\u00fctzle, T.: Search space features underlying the performance of stochastic local search algorithms for MAX-SAT. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 51\u201360. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30217-9_6"},{"issue":"3","key":"45_CR63","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/TSMCB.2008.915539","volume":"38","author":"J Tavares","year":"2008","unstructured":"Tavares, J., Pereira, F., Costa, E.: Multidimensional knapsack problem: A fitness landscape analysis. IEEE Trans. Syst. Man Cybern. B Cybern. 38(3), 604\u2013616 (2008)","journal-title":"IEEE Trans. Syst. Man Cybern. B Cybern."},{"key":"45_CR64","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s12293-009-0016-9","volume":"1","author":"M Le","year":"2009","unstructured":"Le, M., Ong, Y., Jin, Y.: Lamarckian memetic algorithms: local optimum and connectivity structure analysis. Memet. Comput. 1, 175\u2013190 (2009)","journal-title":"Memet. Comput."},{"key":"45_CR65","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.simpat.2011.12.006","volume":"22","author":"T Taghavi","year":"2011","unstructured":"Taghavi, T., Pimentel, A., Sabeghi, M.: VMODEX: A novel visualization tool for rapid analysis of heuristic-based multi-objective design space exploration of heterogeneous MPSoC arquitectures. Simul. Model. Pract. Theory 22, 166\u2013196 (2011)","journal-title":"Simul. Model. Pract. Theory"},{"key":"45_CR66","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-30867-3_46","volume-title":"7th International Conference on Knowledge Management in Organizations: Service and Cloud Computing, Advances in Intelligent Systems and Computing","author":"L Cruz","year":"2013","unstructured":"Cruz, L., G\u00f3mez, C., Castillo, N., Quiroz, M., Ort\u00edz, C., Hern\u00e1ndez, P.: A visualization tool for heuristic algorithms analysis. In: Uden, L., Herrera, F., Bajo, J., Corchado, J. (eds.) 7th International Conference on Knowledge Management in Organizations: Service and Cloud Computing, Advances in Intelligent Systems and Computing, vol. 172, pp. 515\u2013524. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-30867-3_46"},{"key":"45_CR67","doi-asserted-by":"crossref","unstructured":"Lopez, T.T., Schaefer, E., Domiguez-Diaz, D., Dominguez-Carrillo, G.: Structural effects in algorithm performance: A framework and a case study on graph coloring. In: Computing Conference, 2017, pp. 101\u2013112. IEEE (2017)","DOI":"10.1109\/SAI.2017.8252088"},{"key":"45_CR68","series-title":"Studies in Classification, Data Analysis, and Knowledge Organization","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-030-25147-5_7","volume-title":"Applications in Statistical Computing","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Trautmann, H.: Comprehensive feature-based landscape analysis of continuous and constrained optimization problems using the R-package flacco. In: Bauer, N., Ickstadt, K., L\u00fcbke, K., Szepannek, G., Trautmann, H., Vichi, M. (eds.) Applications in Statistical Computing. SCDAKO, pp. 93\u2013123. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25147-5_7"},{"key":"45_CR69","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1613\/jair.1576","volume":"24","author":"J Watson","year":"2005","unstructured":"Watson, J., Darrell, W., Adele, E.: Linking search space structure, run-time dynamics, and problem difficulty: A step toward demystifying Tabu search. J. Artif. Intell. Res. 24, 221\u2013261 (2005)","journal-title":"J. Artif. Intell. Res."},{"key":"45_CR70","unstructured":"P\u00e9rez, J., Cruz, L., Pazos, R., Landero, V., P\u00e9rez, V.: Application of causal models for the selection and redesign of heuristic algorithms for solving the bin-packing problem. Polish J. Environ. Stud. 17(4C, Hard) 25\u201330 (2008)"},{"key":"45_CR71","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-540-68123-6_64","volume-title":"Foundations of Intelligent Systems","author":"J P\u00e9rez","year":"2008","unstructured":"P\u00e9rez, J., et al.: A causal approach for explaining why a heuristic algorithm outperforms another in solving an instance set of the bin packing problem. In: An, A., Matwin, S., Ra\u015b, Z.W., \u015al\u0119zak, D. (eds.) ISMIS 2008. LNCS (LNAI), vol. 4994, pp. 591\u2013598. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68123-6_64"},{"key":"45_CR72","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.: Where the really hard problems are. In: The 12th IJCAI 91, pp. 331\u2013337 (1991)"},{"key":"45_CR73","doi-asserted-by":"crossref","unstructured":"Thiebaux, S., Slaney, J., Kilby, P.: Estimating the hardness of optimization. In: ECAI, Berlin, pp. 123\u2013130 (2000)","DOI":"10.1007\/978-1-4615-4485-2_8"},{"key":"45_CR74","doi-asserted-by":"crossref","unstructured":"Spirtes, P., Glymour, C.: Causation, prediction, and search. MIT Press (2001)","DOI":"10.7551\/mitpress\/1754.001.0001"},{"key":"45_CR75","unstructured":"Hoos, H.: A mixture-model for the behaviour of SLS algorithms for SAT. In: AAAI\/IAAI, pp. 661\u2013667 (2002)"},{"key":"45_CR76","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1613\/jair.1389","volume":"21","author":"W Zhang","year":"2004","unstructured":"Zhang, W.: Phase transitions and backbones of the asymmetric traveling salesman problem. J. Artif. Intell. Res. 21, 471\u2013497 (2004)","journal-title":"J. Artif. Intell. Res."},{"key":"45_CR77","doi-asserted-by":"publisher","unstructured":"Watson, J.: An introduction to fitness landscape analysis and cost models for local search. In: Gendreau, M., Potvin, J. (eds.) Handbook of Metaheuristics, International Series in Operations Research & Management Science, vol. 146, pp. 599\u2013623. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_20","DOI":"10.1007\/978-1-4419-1665-5_20"},{"issue":"1","key":"45_CR78","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1162\/evco_a_00274","volume":"29","author":"W Gao","year":"2021","unstructured":"Gao, W., Nallaperuma, S., Neumann, F.: Feature-based diversity optimization for problem instance classification. Evol. Comput. 29(1), 107\u2013128 (2021)","journal-title":"Evol. Comput."},{"issue":"1","key":"45_CR79","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(95)00044-5","volume":"81","author":"T Hogg","year":"1996","unstructured":"Hogg, T., Huberman, B., Williams, C.: Phase transitions and the search problem. Artif. Intell. 81(1), 1\u201315 (1996)","journal-title":"Artif. Intell."},{"key":"45_CR80","first-page":"459","volume":"92","author":"D Mitchell","year":"1992","unstructured":"Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. Proc. Conf. Artif. Intell. 92, 459\u2013465 (1992)","journal-title":"Proc. Conf. Artif. Intell."},{"key":"45_CR81","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-11169-3_7","volume-title":"Learning and Intelligent Optimization","author":"KA Smith-Miles","year":"2009","unstructured":"Smith-Miles, K.A., James, R.J.W., Giffin, J.W., Tu, Y.: A knowledge discovery approach to understanding relationships between scheduling problem structure and heuristic performance. In: St\u00fctzle, T. (ed.) LION 2009. LNCS, vol. 5851, pp. 89\u2013103. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-11169-3_7"},{"issue":"6","key":"45_CR82","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1109\/TEVC.2019.2940828","volume":"24","author":"A Liefooghe","year":"2019","unstructured":"Liefooghe, A., Daolio, F., Verel, S., Derbel, B., Aguirre, H., Tanaka, K.: Landscape-aware performance prediction for evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 24(6), 1063\u20131077 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"45_CR83","volume-title":"Bayesian Artificial Intelligence","author":"K Korb","year":"2004","unstructured":"Korb, K.: Bayesian Artificial Intelligence. Chapman and Hall, London (2004)"},{"key":"45_CR84","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-030-24289-3_13","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2019","author":"V Landero","year":"2019","unstructured":"Landero, V., P\u00e9rez, J., Cruz, L., Turrubiates, T., R\u00edos, D.: Effects in the algorithm performance from problem structure, searching behavior and temperature: A causal study case for threshold accepting and bin-packing. In: Misra, S., et al. (eds.) ICCSA 2019. LNCS, vol. 11619, pp. 152\u2013166. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24289-3_13"},{"key":"45_CR85","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-030-58799-4_11","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2020","author":"V Landero","year":"2020","unstructured":"Landero, V., R\u00edos, D., P\u00e9rez, J., Cruz, L., Collazos-Morales, C.: Characterizing and analyzing the relation between bin-packing problem and Tabu search algorithm. In: Gervasi, O., et al. (eds.) ICCSA 2020. LNCS, vol. 12249, pp. 149\u2013164. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58799-4_11"},{"key":"45_CR86","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-030-86653-2_43","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2021","author":"V Landero","year":"2021","unstructured":"Landero, V., R\u00edos, D., P\u00e9rez, O.J., Collazos-Morales, C.A.: A composite function for understanding bin-packing problem and Tabu search: Towards self-adaptive algorithms. In: Gervasi, O., et al. (eds.) ICCSA 2021. LNCS, vol. 12949, pp. 592\u2013608. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86653-2_43"},{"key":"45_CR87","unstructured":"Gent, I., Macintyre, E., Prosser, P., Walsh, T.: The scaling of search cost. In: AAAI\u201997, pp. 315\u2013320. Mit Press, Rhode Island (1997)"},{"key":"45_CR88","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-540-24838-5_31","volume-title":"Experimental and Efficient Algorithms","author":"J P\u00e9rez","year":"2004","unstructured":"P\u00e9rez, J., Pazos, R.A., Frausto, J., Rodr\u00edguez, G., Romero, D., Cruz, L.: A statistical approach for algorithm selection. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 417\u2013431. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24838-5_31"},{"key":"45_CR89","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-33021-6_29","volume-title":"Recent Advances on Hybrid Intelligent Systems, Studies in Computational Intelligence","author":"M Quiroz","year":"2013","unstructured":"Quiroz, M., Cruz, L., Torrez, J., G\u00f3mez, C.: Improving the performance of heuristic algorithms based on exploratory data analysis. In: Castillo, O., Melin, P., Kacprzyk, J. (eds.) Recent Advances on Hybrid Intelligent Systems, Studies in Computational Intelligence, vol. 452, pp. 361\u2013375. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-33021-6_29"},{"key":"45_CR90","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1007\/978-3-540-28633-2_137","volume-title":"PRICAI 2004: Trends in Artificial Intelligence","author":"L Cruz R.","year":"2004","unstructured":"Cruz R., L., P\u00e9rez, J., Landero N., V., del Angel, E.S., \u00c1lvarez, V.M., Per\u00e9z, V.: An ordered preprocessing scheme for data mining. In: Zhang, C., W. Guesgen, H., Yeap, W.-K. (eds.) PRICAI 2004. LNCS (LNAI), vol. 3157, pp. 1007\u20131008. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28633-2_137"},{"key":"45_CR91","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1016\/j.cam.2013.10.035","volume":"259","author":"S G\u00f3mez","year":"2014","unstructured":"G\u00f3mez, S., et al.: Ant colony system with characterization-based heuristics for a bottled-products distribution logistics system. J. Comput. Appl. Math. 259, 965\u2013977 (2014)","journal-title":"J. Comput. Appl. Math."},{"key":"45_CR92","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. J. Artif. Intell. Res. 32, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36805-9_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T23:08:16Z","timestamp":1688080096000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36805-9_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031368042","9783031368059"],"references-count":92,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36805-9_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"3 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Custom based on Cyberchair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"283","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":"67","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":"13","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":"24% - 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":"2.5","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":"8,5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"PHD Showcase Papers: 6(for main conf) \/ For ICCSA 2023 Workshops 876 subm sent, 350 full papers and 29 short papers accepted, additional PHD Showcase Papers: 2","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}