{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T13:07:01Z","timestamp":1749042421232,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319190839"},{"type":"electronic","value":"9783319190846"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-19084-6_6","type":"book-chapter","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T14:43:01Z","timestamp":1432824181000},"page":"59-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["OSCAR: Online Selection of Algorithm Portfolios with Case Study on Memetic Algorithms"],"prefix":"10.1007","author":[{"given":"Mustafa","family":"M\u0131s\u0131r","sequence":"first","affiliation":[]},{"given":"Stephanus Daniel","family":"Handoko","sequence":"additional","affiliation":[]},{"given":"Hoong Chuin","family":"Lau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,29]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","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":"6_CR2","unstructured":"Gomes, C., Selman, B.: Algorithm portfolio design: theory vs. practice. In: Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence (UAI 1997), Providence\/Rhode Island, USA, pp. 190\u2013197 (1997)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"275","author":"B Huberman","year":"1997","unstructured":"Huberman, B., Lukose, R., Hogg, T.: An economics approach to hard computational problems. Science 275, 51 (1997)","journal-title":"Science"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Da Costa, L., Fialho, A., Schoenauer, M., Sebag, M., et al.: Adaptive operator selection with dynamic multi-armed bandits. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2008), Atlanta, Georgia, USA, pp. 913\u2013920 (2008)","DOI":"10.1145\/1389095.1389272"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"E Burke","year":"2013","unstructured":"Burke, E., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Qu, R.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64, 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-39930-8_3","volume-title":"New Optimization Techniques in Engineering","author":"P Moscato","year":"2004","unstructured":"Moscato, P., Cotta, C., Mendes, A.: Memetic algorithms. In: Moscato, P., Cotta, C., Mendes, A. (eds.) New Optimization Techniques in Engineering, pp. 53\u201385. Springer, Heidelberg (2004)"},{"key":"6_CR7","unstructured":"Krasnogor, N., Smith, J.: A memetic algorithm with self-adaptive local search: TSP as a case study. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2000), Las Vegas\/Nevada, USA, pp. 987\u2013994 (2000)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-09584-4_7","volume-title":"Learning and Intelligent Optimization","author":"Z Yuan","year":"2014","unstructured":"Yuan, Z., Handoko, S.D., Nguyen, D.T., Lau, H.C.: An empirical study of off-line configuration and on-line adaptation in operator selection. In: Pardalos, P.M., Resende, M.G.C., Vogiatzis, C., Walteros, J.L. (eds.) LION 2014. LNCS, vol. 8426, pp. 62\u201376. Springer International Publishing, Switzerland (2014)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/4235.873238","volume":"4","author":"TP Runarsson","year":"2000","unstructured":"Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Trans. Evol. Comput. 4, 284\u2013294 (2000)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1109\/TEVC.2009.2039141","volume":"14","author":"SD Handoko","year":"2010","unstructured":"Handoko, S.D., Kwoh, C.K., Ong, Y.S.: Feasibility structure modeling: an effective chaperone for constrained memetic algorithms. IEEE Trans. Evol. Comput. 14, 740\u2013758 (2010)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"6_CR11","doi-asserted-by":"crossref","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."},{"key":"6_CR12","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)"},{"key":"6_CR13","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 2013), pp. 608\u2013614 (2013)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Stern, D., Herbrich, R., Graepel, T., Samulowitz, H., Pulina, L., Tacchella, A.: Collaborative expert portfolio management. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI 2010), Atlanta\/Georgia, USA, pp. 179\u2013184 (2010)","DOI":"10.1609\/aaai.v24i1.7561"},{"key":"6_CR15","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 2010), pp. 210\u2013216 (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36, 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"6_CR17","unstructured":"KhudaBukhsh, A.R., Xu, L., Hoos, H.H., Leyton-Brown, K.: Satenstein: automatically building local search sat solvers from components. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), vol. 9, pp. 517\u2013524 (2009)"},{"key":"6_CR18","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":"6_CR19","doi-asserted-by":"crossref","unstructured":"Thierens, D.: An adaptive pursuit strategy for allocating operator probabilities. In: Proceedings of the 7th Annual Conference on Genetic and Evolutionary Computation (GECCO 2005), pp. 1539\u20131546. ACM (2005)","DOI":"10.1145\/1068009.1068251"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-1-4757-4137-7_25","volume-title":"Metaheuristics: Computer Decision-Making","author":"A Nareyek","year":"2003","unstructured":"Nareyek, A.: Choosing search heuristics by non-stationary reinforcement learning. In: Resende, M., de Sousa, J. (eds.) Metaheuristics: Computer Decision-Making, pp. 523\u2013544. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"6_CR21","unstructured":"M\u0131s\u0131r, M.: Intelligent hyper-heuristics: a tool for solving generic optimisation problems. Ph.D. thesis, Department of Computer Science, KU Leuven (2012)"},{"key":"6_CR22","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3, 1157\u20131182 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"6_CR23","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, 5\u201332 (2001)","journal-title":"Mach. Learn."},{"key":"6_CR24","volume-title":"C4.5. Programs for Machine Learning","author":"JR Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5. Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"E Lawler","year":"1963","unstructured":"Lawler, E.: The quadratic assignment problem. Manag. Sci. 9, 586\u2013599 (1963)","journal-title":"Manag. Sci."},{"key":"6_CR26","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. Global Optim. 10, 391\u2013403 (1997)","journal-title":"J. Global Optim."},{"key":"6_CR27","volume-title":"Modern Multidimensional Scaling: Theory and Applications","author":"I Borg","year":"2005","unstructured":"Borg, I., Groenen, P.J.: Modern Multidimensional Scaling: Theory and Applications. Springer, New York (2005)"},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., Rudolph, G.: Exploratory landscape analysis. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, pp. 829\u2013836. ACM (2011)","DOI":"10.1145\/2001576.2001690"}],"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-319-19084-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:17:14Z","timestamp":1676942234000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19084-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319190839","9783319190846"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19084-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"29 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}