{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T09:03:09Z","timestamp":1725872589503},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319503486"},{"type":"electronic","value":"9783319503493"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50349-3_7","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T07:12:11Z","timestamp":1480489931000},"page":"91-106","source":"Crossref","is-referenced-by-count":7,"title":["Designing and Comparing Multiple Portfolios of Parameter Configurations for Online Algorithm Selection"],"prefix":"10.1007","author":[{"given":"Aldy","family":"Gunawan","sequence":"first","affiliation":[]},{"given":"Hoong Chuin","family":"Lau","sequence":"additional","affiliation":[]},{"given":"Mustafa","family":"M\u0131s\u0131r","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,1]]},"reference":[{"key":"7_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."},{"issue":"1","key":"7_CR2","first-page":"43","volume":"126","author":"C Gomes","year":"2001","unstructured":"Gomes, C., Selman, B.: Algorithm portfolios. AI 126(1), 43\u201362 (2001)","journal-title":"AI"},{"issue":"5296","key":"7_CR3","doi-asserted-by":"crossref","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(5296), 51 (1997)","journal-title":"Science"},{"issue":"1","key":"7_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1456650.1456656","volume":"41","author":"K Smith-Miles","year":"2008","unstructured":"Smith-Miles, K.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41(1), 1\u201325 (2008)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"7_CR5","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. JAIR 36(1), 267\u2013306 (2009)","journal-title":"JAIR"},{"key":"7_CR6","first-page":"281","volume":"13","author":"J Bergstra","year":"2012","unstructured":"Bergstra, J., Bengio, Y.: Random search for hyper-parameter optimization. JMLR 13, 281\u2013305 (2012)","journal-title":"JMLR"},{"key":"7_CR7","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-69432-8_2","volume-title":"Parameter Setting in Evolutionary Algorithms","author":"A Eiben","year":"2007","unstructured":"Eiben, A., Michalewicz, Z., Schoenauer, M., Smith, J.: Parameter control in evolutionary algorithms. In: Lobo, F.G., Lima, C.F., Michalewicz, Z. (eds.) Parameter Setting in Evolutionary Algorithms. SCI, vol. 54, pp. 19\u201346. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-69432-8_2"},{"issue":"1","key":"7_CR8","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.H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. JAIR 32(1), 565\u2013606 (2008)","journal-title":"JAIR"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H.H., Leyton-Brown, K.: Hydra: automatically configuring algorithms for portfolio-based selection. In: AAAI 2010, pp. 210\u2013216 (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"issue":"1","key":"7_CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/opre.1050.0243","volume":"54","author":"B Adenso-Diaz","year":"2006","unstructured":"Adenso-Diaz, B., Laguna, M.: Fine-tuning of algorithms using fractional experimental designs and local search. OR 54(1), 99\u2013114 (2006)","journal-title":"OR"},{"key":"7_CR11","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: GECCO 2002, pp. 11\u201318 (2002)"},{"key":"7_CR12","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC\u2013instance-specific algorithm configuration. In: ECAI 2010, pp. 751\u2013756 (2010)"},{"key":"7_CR13","unstructured":"Lau, H.C., Xiao, F., Halim, S.: A framework for automated parameter tuning in heuristic design. In: MIC 2009, Hamburg, Germany, 13\u201316 June 2009"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Seipp, J., Braun, M., Garimort, J., Helmert, M.: Learning portfolios of automatically tuned planners. In: ICAPS 2012, Atibaia\/Sao Paulo, Brazil (2012)","DOI":"10.1609\/icaps.v22i1.13538"},{"key":"7_CR15","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). doi: 10.1007\/978-3-642-25566-3_40"},{"key":"7_CR16","doi-asserted-by":"crossref","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":"7_CR17","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, Heidelberg (2015). doi: 10.1007\/978-3-319-19084-6_3"},{"key":"7_CR18","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). doi: 10.1007\/978-3-642-23786-7_35"},{"key":"7_CR19","unstructured":"Hutter, F., Hoos, H.H., Stutzle, T.: Automatic algorithm configuration based on local search. In: AAAI 2007, vol. 22, p. 1152 (2007)"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-04244-7_14","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Sellmann, M., Tierney, K.: A gender-based genetic algorithm for the automatic configuration of algorithms. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 142\u2013157. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04244-7_14"},{"key":"7_CR21","unstructured":"KhudaBukhsh, A.R., Xu, L., Hoos, H.H., Leyton-Brown, K.: SATenstein: automatically building local search sat solvers from components. In: IJCAI 2009, pp. 517\u2013524 (2009)"},{"key":"7_CR22","volume-title":"Design and Analysis of Expeirments","author":"D Montgomery","year":"2005","unstructured":"Montgomery, D.: Design and Analysis of Expeirments, 6th edn. Wiley, Hoboken (2005)","edition":"6"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-25566-3","volume-title":"Learning and Intelligent Optimization","author":"A Gunawan","year":"2011","unstructured":"Gunawan, A., Lau, H.C., Lindawati, : Fine-tuning algorithm parameters using the design of experiments approach. In: Coello Coello, A. (ed.) LION 2011. LNCS, vol. 6683, pp. 278\u2013292. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25566-3"},{"issue":"7","key":"7_CR24","doi-asserted-by":"crossref","first-page":"3335","DOI":"10.1016\/j.asoc.2013.02.006","volume":"13","author":"M M\u0131s\u0131r","year":"2013","unstructured":"M\u0131s\u0131r, M., Verbeeck, K., De Causmaecker, P., Vanden Berghe, G.: An investigation on the generality level of selection hyper-heuristics under different empirical conditions. Appl. Soft Comput. 13(7), 3335\u20133353 (2013)","journal-title":"Appl. Soft Comput."},{"key":"7_CR25","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53\u201365 (1987)","journal-title":"J. Comput. Appl. Math."},{"key":"7_CR26","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, Heidelberg (2015). doi: 10.1007\/978-3-319-19084-6_6"},{"key":"7_CR27","unstructured":"Pfahringer, B., Bensusan, H., Giraud-Carrier, C.: Tell me who can learn you and I can tell you who you are: landmarking various learning algorithms. In: Proceedings of the 17th International Conference on Machine Learning, pp. 743\u2013750 (2000)"},{"key":"7_CR28","doi-asserted-by":"crossref","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."},{"key":"7_CR29","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). doi: 10.1007\/978-3-642-29124-1_19"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., \u00d6zcan, E.: A runtime analysis of simple hyper-heuristics: to mix or not to mix operators. In: FOGA 2013, Adelaide, Australia (2013)","DOI":"10.1145\/2460239.2460249"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"Practice and Theory of Automated Timetabling III","author":"P Cowling","year":"2001","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 176\u2013190. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44629-X_11"},{"key":"7_CR32","volume-title":"Metaheuristics: Intelligent Problem Solving - MIC 2009","author":"M M\u0131s\u0131r","year":"2010","unstructured":"M\u0131s\u0131r, M., Wauters, T., Verbeeck, K., Vanden Berghe, G.: A new learning hyper-heuristic for the traveling tournament problem. In: Caserta, M., Vo\u00df, S. (eds.) Metaheuristics: Intelligent Problem Solving - MIC 2009. Springer, Heidelberg (2010)"},{"key":"7_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9052-5","volume-title":"Networks of Learning Automata: Techniques for Online Stochastic Optimization","author":"M Thathachar","year":"2004","unstructured":"Thathachar, M., Sastry, P.: Networks of Learning Automata: Techniques for Online Stochastic Optimization. Kluwer Academic Publishers, Dordrecht (2004)"},{"key":"7_CR34","unstructured":"Ng, K.M., Gunawan, A., Poh, K.L.: A hybrid algorithm for the quadratic assignment problem. In: CSC 2008, Nevada, USA, 14\u201317 July 2008"},{"issue":"4","key":"7_CR35","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R Burkard","year":"1997","unstructured":"Burkard, R., Karisch, S., Rendl, F.: Qaplib-a quadratic assignment problem library. J. Global Optim. 10(4), 391\u2013403 (1997)","journal-title":"J. Global Optim."},{"key":"7_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-74970-7_25","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"S Halim","year":"2007","unstructured":"Halim, S., Yap, R.H.C., Lau, H.C.: An integrated white+black box approach for designing and tuning stochastic local search. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 332\u2013347. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-74970-7_25"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50349-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T03:38:33Z","timestamp":1692589113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50349-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319503486","9783319503493"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50349-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}