{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T14:21:30Z","timestamp":1782570090459,"version":"3.54.5"},"publisher-location":"Cham","reference-count":83,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030921200","type":"print"},{"value":"9783030921217","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92121-7_20","type":"book-chapter","created":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T17:13:15Z","timestamp":1638983595000},"page":"237-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Algorithm Selection on\u00a0Adaptive Operator Selection: A\u00a0Case Study on\u00a0Genetic Algorithms"],"prefix":"10.1007","author":[{"given":"Mustafa","family":"M\u0131s\u0131r","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,12,9]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1997","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"20_CR2","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":"20_CR3","doi-asserted-by":"crossref","unstructured":"Da Costa, L., Fialho, A., Schoenauer, M., Sebag, M.: Adaptive operator selection with dynamic multi-armed bandits. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO), Atlanta, GA, USA, pp. 913\u2013920 (2008)","DOI":"10.1145\/1389095.1389272"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Thierens, D.: An adaptive pursuit strategy for allocating operator probabilities. In: Proceedings of the 7th International Conference on Genetic and Evolutionary Computation (GECCO), pp. ACM. 1539\u20131546 (2005)","DOI":"10.1145\/1068009.1068251"},{"key":"20_CR5","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-030-72069-8_7","volume-title":"Automated Design of Machine Learning and Search Algorithms","author":"M M\u0131s\u0131r","year":"2021","unstructured":"M\u0131s\u0131r, M.: Hyper-heuristics: autonomous problem solvers. In: Pillay, N., Qu, R. (eds.) Automated Design of Machine Learning and Search Algorithms. NCS, pp. 109\u2013131. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72069-8_7"},{"key":"20_CR6","unstructured":"Davis, L.: Adapting operator probabilities in genetic algorithms. In: Proceedings of the 3rd International Conference on Genetic Algorithms (ICGA). pp. 61\u201369 (1989)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-29124-1_19","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"J He","year":"2012","unstructured":"He, J., He, F., Dong, H.: Pure strategy or mixed strategy? In: Hao, J.-K., Middendorf, M. (eds.) EvoCOP 2012. LNCS, vol. 7245, pp. 218\u2013229. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29124-1_19"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Grobler, J., Engelbrecht, A., Kendall, G., Yadavalli, S.: Alternative hyper-heuristic strategies for multi-method global optimization. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC), Barcelona, Spain, pp. 826\u2013833, 18\u201323 July 2010","DOI":"10.1109\/CEC.2010.5585980"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.artint.2016.12.001","volume":"244","author":"M M\u0131s\u0131r","year":"2017","unstructured":"M\u0131s\u0131r, M., Sebag, M.: ALORS: an algorithm recommender system. Artif. Intell. 244, 291\u2013314 (2017)","journal-title":"Artif. Intell."},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-69432-8_4","volume":"54","author":"D Thierens","year":"2007","unstructured":"Thierens, D.: Adaptive strategies for operator allocation. Paramet. Sett. Evol. Algor. 54, 77\u201390 (2007)","journal-title":"Paramet. Sett. Evol. Algor."},{"key":"20_CR11","unstructured":"M\u0131s\u0131r, M.: Intelligent hyper-heuristics: a tool for solving generic optimisation problems. PhD thesis, Department of Computer Science, KU Leuven (2012)"},{"issue":"12","key":"20_CR12","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., et al.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1613\/jair.301","volume":"4","author":"LP Kaelbling","year":"1996","unstructured":"Kaelbling, L.P., Littman, M.L., Moore, A.W.: Reinforcement learning: a survey. J. Artif. Intell. Res. 4, 237\u2013285 (1996)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"TL Lai","year":"1985","unstructured":"Lai, T.L., Robbins, H.: Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6(1), 4\u201322 (1985)","journal-title":"Adv. Appl. Math."},{"issue":"4","key":"20_CR15","first-page":"407","volume":"5","author":"D Goldberg","year":"1990","unstructured":"Goldberg, D.: Probability matching, the magnitude of reinforcement, and classifier system bidding. Mach. Learn. 5(4), 407\u2013425 (1990)","journal-title":"Mach. Learn."},{"key":"20_CR16","doi-asserted-by":"publisher","unstructured":"Thathachar, M., Sastry, P.: Networks of Learning Automata: Techniques for Online Stochastic Optimization. Kluwer Academic Publishers, Boston (2004). https:\/\/doi.org\/10.1007\/978-1-4419-9052-5","DOI":"10.1007\/978-1-4419-9052-5"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-642-34413-8_45","volume-title":"Learning and Intelligent Optimization","author":"M M\u0131s\u0131r","year":"2012","unstructured":"M\u0131s\u0131r, M., Verbeeck, K., De Causmaecker, P., Vanden Berghe, G.: An intelligent hyper-heuristic framework for CHeSC 2011. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, pp. 461\u2013466. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34413-8_45"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-87700-4_18","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN X","author":"\u00c1 Fialho","year":"2008","unstructured":"Fialho, \u00c1., Da Costa, L., Schoenauer, M., Sebag, M.: Extreme value based adaptive operator selection. In: Rudolph, G., Jansen, T., Beume, N., Lucas, S., Poloni, C. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 175\u2013184. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87700-4_18"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Hitomi, N., Selva, D.: A classification and comparison of credit assignment strategies in multiobjective adaptive operator selection. IEEE Trans. Evol. Comput. 21, 294\u2013314 (2016)","DOI":"10.1109\/TEVC.2016.2602348"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-319-54157-0_19","volume-title":"Evolutionary Multi-Criterion Optimization","author":"RA Gon\u00e7alves","year":"2017","unstructured":"Gon\u00e7alves, R.A., Pavelski, L.M., de Almeida, C.P., Kuk, J.N., Venske, S.M., Delgado, M.R.: Adaptive operator selection for many-objective optimization with NSGA-III. In: Trautmann, H., et al. (eds.) EMO 2017. LNCS, vol. 10173, pp. 267\u2013281. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-54157-0_19"},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.ins.2017.08.028","volume":"418","author":"KM Sallam","year":"2017","unstructured":"Sallam, K.M., Elsayed, S.M., Sarker, R.A., Essam, D.L.: Landscape-based adaptive operator selection mechanism for differential evolution. Inf. Sci. 418, 383\u2013404 (2017)","journal-title":"Inf. Sci."},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.asoc.2017.04.005","volume":"57","author":"WK Mashwani","year":"2017","unstructured":"Mashwani, W.K., Salhi, A., Yeniay, O., Jan, M.A., Khanum, R.A.: Hybrid adaptive evolutionary algorithm based on decomposition. Appl. Soft Comput. 57, 363\u2013378 (2017)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"20_CR23","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Soria Alcaraz, J.A., Ochoa, G., Carpio, M., Puga, H.: Evolvability metrics in adaptive operator selection. In: Proceedings of the Annual Conference on Genetic and Evolutionary Computation (GECCO), pp. 1327\u20131334. ACM (2014)","DOI":"10.1145\/2576768.2598220"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Soria-Alcaraz, J.A., Espinal, A., Sotelo-Figueroa, M.A.: Evolvability metric estimation by a parallel perceptron for on-line selection hyper-heuristics. IEEE Access 5, 7055\u20137063 (2017)","DOI":"10.1109\/ACCESS.2017.2699426"},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Teng, T.H., Handoko, S.D., Lau, H.C.: Self-organizing neural network for adaptive operator selection in evolutionary search. In: Proceedings of the 10th Learning and Intelligent OptimizatioN Conference (LION). LNCS, Naples, Italy (2016)","DOI":"10.1007\/978-3-319-50349-3_13"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Candan, C., Goeffon, A., Lardeux, F., Saubion, F.: A dynamic island model for adaptive operator selection. In: Proceedings of the 14th International Conference on Genetic and Evolutionary Computation Conference (GECCO), pp. 1253\u20131260. ACM (2012)","DOI":"10.1145\/2330163.2330337"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Candan, C., Go\u00ebffon, A., Lardeux, F., Saubion, F.: Non stationary operator selection with island models. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, pp. 1509\u20131516. ACM (2013)","DOI":"10.1145\/2463372.2463559"},{"key":"20_CR29","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.asoc.2015.09.024","volume":"38","author":"A Go\u00ebffon","year":"2016","unstructured":"Go\u00ebffon, A., Lardeux, F., Saubion, F.: Simulating non-stationary operators in search algorithms. Appl. Soft Comput. 38, 257\u2013268 (2016)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"20_CR30","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"issue":"1\/2","key":"20_CR31","doi-asserted-by":"publisher","first-page":"100","DOI":"10.2307\/2333009","volume":"41","author":"E Page","year":"1954","unstructured":"Page, E.: Continuous inspection schemes. Biometrika 41(1\/2), 100\u2013115 (1954)","journal-title":"Biometrika"},{"key":"20_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-11169-3_13","volume-title":"Learning and Intelligent Optimization","author":"\u00c1 Fialho","year":"2009","unstructured":"Fialho, \u00c1., Da Costa, L., Schoenauer, M., Sebag, M.: Dynamic multi-armed bandits and extreme value-based rewards for adaptive operator selection in evolutionary algorithms. In: St\u00fctzle, T. (ed.) LION 2009. LNCS, vol. 5851, pp. 176\u2013190. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-11169-3_13"},{"issue":"1","key":"20_CR33","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10472-010-9213-y","volume":"60","author":"\u00c1 Fialho","year":"2010","unstructured":"Fialho, \u00c1., Da Costa, L., Schoenauer, M., Sebag, M.: Analyzing bandit-based adaptive operator selection mechanisms. Ann. Math. Artif. Intell. 60(1), 25\u201364 (2010)","journal-title":"Ann. Math. Artif. Intell."},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"Fialho, \u00c1., Schoenauer, M., Sebag, M.: Toward comparison-based adaptive operator selection. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (GECCO), 767\u2013774. ACM (2010)","DOI":"10.1145\/1830483.1830619"},{"issue":"7","key":"20_CR35","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/S0031-3203(96)00142-2","volume":"30","author":"AP Bradley","year":"1997","unstructured":"Bradley, A.P.: The use of the area under the ROC curve in the evaluation of machine learning algorithms. Patt. Recogn. 30(7), 1145\u20131159 (1997)","journal-title":"Patt. Recogn."},{"issue":"1","key":"20_CR36","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1109\/TEVC.2013.2239648","volume":"18","author":"K Li","year":"2014","unstructured":"Li, K., Fialho, A., Kwong, S., Zhang, Q.: Adaptive operator selection with bandits for a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 18(1), 114\u2013130 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"20_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asoc.2017.01.056","volume":"56","author":"WK Mashwani","year":"2017","unstructured":"Mashwani, W.K., Salhi, A., Yeniay, O., Hussian, H., Jan, M.: Hybrid non-dominated sorting genetic algorithm with adaptive operators selection. Appl. Soft Comput. 56, 1\u201318 (2017)","journal-title":"Appl. Soft Comput."},{"key":"20_CR38","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Liu, W., Li, H.: The performance of a new version of moea\/d on cec09 unconstrained mop test instances. In: IEEE Congress on Evolutionary Computation (CEC), pp. 203\u2013208. IEEE (2009)","DOI":"10.1109\/CEC.2009.4982949"},{"key":"20_CR39","doi-asserted-by":"crossref","unstructured":"Ferreira, A.S., Gon\u00e7alves, R.A., Pozo, A.: A multi-armed bandit selection strategy for hyper-heuristics. In: IEEE Congress on Evolutionary Computation (CEC), pp. 525\u2013532. IEEE (2017)","DOI":"10.1109\/CEC.2017.7969356"},{"key":"20_CR40","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1016\/j.asoc.2016.07.059","volume":"49","author":"A Strickler","year":"2016","unstructured":"Strickler, A., Lima, J.A.P., Vergilio, S.R., Pozo, A.T.: Deriving products for variability test of feature models with a hyper-heuristic approach. Appl. Soft Comput. 49, 1232\u20131242 (2016)","journal-title":"Appl. Soft Comput."},{"key":"20_CR41","doi-asserted-by":"crossref","unstructured":"Harman, M., Mansouri, S.A., Zhang, Y.: Search-based software engineering: trends, techniques and applications. ACM Comput. Surv. (CSUR) 45(1), 11 (2012)","DOI":"10.1145\/2379776.2379787"},{"issue":"1","key":"20_CR42","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(1), 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"20_CR43","unstructured":"Xu, L., Hutter, F., Shen, J., Hoos, H., Leyton-Brown, K.: Satzilla 2012: Improved algorithm selection based on cost-sensitive classification models. In: Proceedings of SAT Challenge 2012: Solver and Benchmark Descriptions, pp. 57\u201358 (2012)"},{"key":"20_CR44","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm portfolios based on cost-sensitive hierarchical clustering. In: Proceedings of the 23rd International Joint Conference on Artifical Intelligence (IJCAI). pp. 608\u2013614 (2013)"},{"key":"20_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-02777-2_31","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"M Nikoli\u0107","year":"2009","unstructured":"Nikoli\u0107, M., Mari\u0107, F., Jani\u010di\u0107, P.: Instance-based selection of policies for SAT solvers. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 326\u2013340. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_31"},{"issue":"4","key":"20_CR46","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10462-011-9290-2","volume":"40","author":"M Nikoli\u0107","year":"2011","unstructured":"Nikoli\u0107, M., Mari\u0107, F., Jani\u010di\u0107, P.: Simple algorithm portfolio for SAT. Arti. Intell. Rev. 40(4), 457\u2013465 (2011). https:\/\/doi.org\/10.1007\/s10462-011-9290-2","journal-title":"Arti. Intell. Rev."},{"key":"20_CR47","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-642-40994-3_28","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M Collautti","year":"2013","unstructured":"Collautti, M., Malitsky, Y., Mehta, D., O\u2019Sullivan, B.: SNNAP: solver-based nearest neighbor for algorithm portfolios. In: Blockeel, H., Kersting, K., Nijssen, S., \u017delezn\u00fd, F. (eds.) ECML PKDD 2013. LNCS (LNAI), vol. 8190, pp. 435\u2013450. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40994-3_28"},{"key":"20_CR48","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1613\/jair.4726","volume":"53","author":"M Lindauer","year":"2015","unstructured":"Lindauer, M., Hoos, H.H., Hutter, F., Schaub, T.: AutoFolio: an automatically configured algorithm selector. J. Artif. Intell. Res. 53, 745\u2013778 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"20_CR49","unstructured":"Hutter, F., Hoos, H., Stutzle, T.: Automatic algorithm configuration based on local search. In: Proceedings of the National Conference on Artificial Intelligence, vol. 22, 1152p. Menlo Park, CA, AAAI Press; MIT Press; Cambridge, MA; London (2007)"},{"key":"20_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-642-23786-7_35","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"S Kadioglu","year":"2011","unstructured":"Kadioglu, S., Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm selection and scheduling. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 454\u2013469. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23786-7_35"},{"key":"20_CR51","unstructured":"O\u2019Mahony, E., Hebrard, E., Holland, A., Nugent, C., O\u2019Sullivan, B.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: Irish Conference on Artificial Intelligence and Cognitive Science (2008)"},{"key":"20_CR52","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1017\/S1471068414000179","volume":"14","author":"R Amadini","year":"2014","unstructured":"Amadini, R., Gabbrielli, M., Mauro, J.: Sunny: a lazy portfolio approach for constraint solving. Theory Pract. Logic Program. 14, 509\u2013524 (2014)","journal-title":"Theory Pract. Logic Program."},{"issue":"1","key":"20_CR53","first-page":"32","volume":"13","author":"V Kumar","year":"1992","unstructured":"Kumar, V.: Algorithms for constraint-satisfaction problems: a survey. AI Mag. 13(1), 32 (1992)","journal-title":"AI Mag."},{"key":"20_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-319-50349-3_20","volume-title":"Learning and Intelligent Optimization","author":"M Lindauer","year":"2016","unstructured":"Lindauer, M., Bergdoll, R.-D., Hutter, F.: An empirical study of per-instance algorithm scheduling. In: Festa, P., Sellmann, M., Vanschoren, J. (eds.) LION 2016. LNCS, vol. 10079, pp. 253\u2013259. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50349-3_20"},{"key":"20_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-642-33558-7_38","volume-title":"Principles and Practice of Constraint Programming","author":"Y Malitsky","year":"2012","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Parallel SAT solver selection and scheduling. In: Milano, M. (ed.) CP 2012. LNCS, pp. 512\u2013526. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_38"},{"key":"20_CR56","doi-asserted-by":"crossref","unstructured":"Hoos, H., Kaminski, R., Lindauer, M., Schaub, T.: aspeed: Solver scheduling via answer set programming. Theory Pract. Logic Program. 1\u201326 (2014)","DOI":"10.1017\/S1471068414000015"},{"issue":"1","key":"20_CR57","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"C Gomes","year":"2001","unstructured":"Gomes, C., Selman, B.: Algorithm portfolios. Artif. Intell. 126(1), 43\u201362 (2001)","journal-title":"Artif. Intell."},{"key":"20_CR58","unstructured":"Roussel, O.: Description of ppfolio 2012. In: Proceedings of SAT Challenge, 46 p (2012)"},{"key":"20_CR59","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC-instance-specific algorithm configuration. In: Proceedings of the 19th European Conference on Artificial Intelligence (ECAI\u201910), pp. 751\u2013756 (2010)"},{"key":"20_CR60","doi-asserted-by":"crossref","unstructured":"Malitsky, Y., Mehta, D., O\u2019Sullivan, B.: Evolving instance specific algorithm configuration. In: Proceedings of the 6th International Symposium on Combinatorial Search (SoCS) (2013)","DOI":"10.1007\/978-3-319-11230-5_9"},{"key":"20_CR61","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-11230-5_9","volume-title":"Instance-Specific Algorithm Configuration","author":"Y Malitsky","year":"2014","unstructured":"Malitsky, Y.: Evolving instance-specific algorithm configuration. In: Instance-Specific Algorithm Configuration, pp. 93\u2013105. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11230-5_9"},{"key":"20_CR62","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Malitsky, Y., Sellmann, M.: MaxSAT by improved instance-specific algorithm configuration. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI) (2014)","DOI":"10.1609\/aaai.v28i1.9128"},{"key":"20_CR63","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H., Leyton-Brown, K.: Hydra: Automatically configuring algorithms for portfolio-based selection. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI), pp. 210\u2013216 (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"20_CR64","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Hydra-MIP: automated algorithm configuration and selection for mixed integer programming. In: Proceedings of the 18th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (2011)"},{"key":"20_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-319-19084-6_6","volume-title":"Learning and Intelligent Optimization","author":"M M\u0131s\u0131r","year":"2015","unstructured":"M\u0131s\u0131r, M., Handoko, S.D., Lau, H.C.: OSCAR: online selection of algorithm portfolios with case study on memetic algorithms. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 59\u201373. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19084-6_6"},{"key":"20_CR66","doi-asserted-by":"crossref","unstructured":"Gunawan, A., Lau, H.C., M\u0131s\u0131r, M.: Designing a portfolio of parameter configurations for online algorithm selection. In: the 29th AAAI Conference on Artificial Intelligence: Workshop on Algorithm Configuration (AlgoConf), Austin\/Texas, USA (2015)","DOI":"10.1007\/978-3-319-50349-3_7"},{"key":"20_CR67","unstructured":"Montgomery, D.C.: Design and Analysis of Experiments, John Wiley & Sons, Hoboken (2017)"},{"key":"20_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-319-19084-6_3","volume-title":"Learning and Intelligent Optimization","author":"M M\u0131s\u0131r","year":"2015","unstructured":"M\u0131s\u0131r, M., Handoko, S.D., Lau, H.C.: ADVISER: a web-based algorithm portfolio deviser. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 23\u201328. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19084-6_3"},{"key":"20_CR69","unstructured":"Lau, H., M\u0131s\u0131r, M., Xiang, L., Lingxiao, J.: ADVISER$$^+$$: toward a usable web-based algorithm portfolio deviser. In: Proceedings of the 12th Metaheuristics International Conference (MIC), Barcelona, Spain, pp. 592\u2013599 (2017)"},{"issue":"8","key":"20_CR70","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30\u201337 (2009)","journal-title":"Computer"},{"key":"20_CR71","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-319-68759-9_16","volume-title":"Simulated Evolution and Learning","author":"M M\u0131s\u0131r","year":"2017","unstructured":"M\u0131s\u0131r, M.: Matrix factorization based benchmark set analysis: a case study on HyFlex. In: Shi, Y., et al. (eds.) SEAL 2017. LNCS, vol. 10593, pp. 184\u2013195. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68759-9_16"},{"key":"20_CR72","doi-asserted-by":"crossref","unstructured":"M\u0131s\u0131r, M.: Data sampling through collaborative filtering for algorithm selection. In: the 16th IEEE Congress on Evolutionary Computation (CEC), pp. 2494\u20132501. IEEE (2017)","DOI":"10.1109\/CEC.2017.7969608"},{"key":"20_CR73","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.artint.2016.04.003","volume":"237","author":"B Bischl","year":"2017","unstructured":"Bischl, B., et al.: ASlib: a benchmark library for algorithm selection. Artif. Intell. 237, 41\u201358 (2017)","journal-title":"Artif. Intell."},{"key":"20_CR74","unstructured":"M\u0131s\u0131r, M.: Algorithm selection across selection hyper-heuristics. In: the Data Science for Optimization (DSO) @ IJCAI 2020 workshop at the 29th International Joint Conference on Artificial Intelligence (IJCAI). (2021)"},{"issue":"5","key":"20_CR75","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/BF02163027","volume":"14","author":"GH Golub","year":"1970","unstructured":"Golub, G.H., Reinsch, C.: Singular value decomposition and least squares solutions. Numer. Math. 14(5), 403\u2013420 (1970)","journal-title":"Numer. Math."},{"issue":"1","key":"20_CR76","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."},{"issue":"4","key":"20_CR77","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"EL Lawler","year":"1963","unstructured":"Lawler, E.L.: The quadratic assignment problem. Manag. Sci. 9(4), 586\u2013599 (1963)","journal-title":"Manag. Sci."},{"key":"20_CR78","doi-asserted-by":"publisher","unstructured":"Burkard, R.E., Cela, E., Pardalos, P.M., Pitsoulis, L.S.: The quadratic assignment problem. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1713\u20131809. Springer, Boston (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_27","DOI":"10.1007\/978-1-4613-0303-9_27"},{"key":"20_CR79","doi-asserted-by":"crossref","unstructured":"Handoko, S.D., Nguyen, D.T., Yuan, Z., Lau, H.C.: Reinforcement learning for adaptive operator selection in memetic search applied to quadratic assignment problem. In: Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation, pp. 193\u2013194. ACM (2014)","DOI":"10.1145\/2598394.2598451"},{"issue":"4","key":"20_CR80","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"RE Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB-a quadratic assignment problem library. J. Glob. Optim. 10(4), 391\u2013403 (1997)","journal-title":"J. Glob. Optim."},{"key":"20_CR81","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-20364-0_18","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"G Francesca","year":"2011","unstructured":"Francesca, G., Pellegrini, P., St\u00fctzle, T., Birattari, M.: Off-line and on-line tuning: a study on operator selection for a memetic algorithm applied to the QAP. In: Merz, P., Hao, J.-K. (eds.) EvoCOP 2011. LNCS, vol. 6622, pp. 203\u2013214. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20364-0_18"},{"key":"20_CR82","unstructured":"M\u0131s\u0131r, M., Wauters, T., Verbeeck, K., Vanden Berghe, G.: A new learning hyper-heuristic for the traveling tournament problem. In: Proceedings of the 8th Metaheuristic International Conference (MIC) (2009)"},{"key":"20_CR83","doi-asserted-by":"crossref","unstructured":"M\u0131s\u0131r, M., Verbeeck, K., De Causmaecker, P., Vanden Berghe, G.: A new hyper-heuristic as a general problem solver: an implementation in HyFlex. J. Sched. 16(3), 291\u2013311 (2013)","DOI":"10.1007\/s10951-012-0295-8"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92121-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T17:48:44Z","timestamp":1673977724000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92121-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030921200","9783030921217"],"references-count":83,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92121-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion15.sba-research.org\/index.html","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","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":"30","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":"0","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":"86% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}