{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:17:05Z","timestamp":1742962625153,"version":"3.40.3"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030720681"},{"type":"electronic","value":"9783030720698"}],"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-72069-8_3","type":"book-chapter","created":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T18:02:55Z","timestamp":1627495375000},"page":"29-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A General Model for Automated Algorithm Design"],"prefix":"10.1007","author":[{"given":"Rong","family":"Qu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,29]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.cor.2017.01.021","volume":"83","author":"T Adamo","year":"2017","unstructured":"T. Adamo, G. Ghiani, A. Grieco, E. Guerriero, E. Manni, MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration. Comput. Oper. Res. 83, 106\u2013119 (2017)","journal-title":"Comput. Oper. Res."},{"key":"3_CR2","first-page":"123","volume":"4","author":"T Adamo","year":"2017","unstructured":"T. Adamo, G. Ghiani, E. Guerriero, E. Manni, Automatic instantiation of a variable neighborhood descent from a mixed integer programming model. Oper. Res. Perspect. 4, 123\u2013135 (2017)","journal-title":"Oper. Res. Perspect."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"B.\u00a0Adenso-D\u00edaz, M.\u00a0Laguna, Fine-tuning of algorithms using fractional experimental designs and local search. Oper. Res. 54(1), 99\u2013114 (2006)","DOI":"10.1287\/opre.1050.0243"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.procs.2017.01.120","volume":"103","author":"T Agasiev","year":"2017","unstructured":"T. Agasiev, A. Karpenko, The program system for automated parameter tuning of optimization algorithms. Procedia Comput. Sci. 103, 347\u2013354 (2017)","journal-title":"Procedia Comput. Sci."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.neucom.2017.03.061","volume":"247","author":"R Akay","year":"2017","unstructured":"R. Akay, A. Basturk, A. Kalinli, X. Yao, Parallel population-based algorithm portfolios: an empirical study. Neurocomputing 247, 115\u2013125 (2017)","journal-title":"Neurocomputing"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"C.\u00a0Ans\u00f3tegui, M.\u00a0Sellmann, K.\u00a0Tierney, Gga: a gender-based genetic algorithm for the automatic configuration of algorithms, in Proceedings of 2009 15th International Conference on Principles and Practice of Constraint Programming (Lisbon, Portugal, 2009), pp. 142\u2013157","DOI":"10.1007\/978-3-642-04244-7_14"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"P.\u00a0Balaprakash, M.\u00a0Birattari, T.\u00a0St\u00fctzle, Improvement strategies for the f-race algorithm: sampling design and iterative refinement, in HM 2007: Hybrid Metaheuristics (Dortmund, Germany, October 8-9, 2007), pp. 108\u2013122","DOI":"10.1007\/978-3-540-75514-2_9"},{"issue":"11","key":"3_CR8","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J Beasley","year":"1990","unstructured":"J. Beasley, OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"L.\u00a0Bezerra, M.\u00a0L\u00f2pez-Ib\u00e1\u00f1ez, T.\u00a0St\u00fctzle, Automatic design of evolutionary algorithms for multi-objective combinatorial optimization, in Proceedings of Parallel Problem Solving from Nature (Ljubljana, September 13\u201317, 2014), pp. 508\u2013517","DOI":"10.1007\/978-3-319-10762-2_50"},{"key":"3_CR10","volume-title":"The Problem of Tuning Metaheuristics As Seen From a Machine Learning Perspective","author":"M Birattari","year":"2005","unstructured":"M. Birattari, The Problem of Tuning Metaheuristics As Seen From a Machine Learning Perspective (IOS Press, US, 2005)"},{"key":"3_CR11","unstructured":"M.\u00a0Birattari, T.\u00a0St\u00fctzle, L.\u00a0Paquete, K.\u00a0Varrentrapp, A racing algorithm for configuring metaheuristics, in Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation (GECCO\u201902) (2002), pp. 11\u201318"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"M.\u00a0Birattari, Z.\u00a0Yuan, P.\u00a0Balaprakash, T.\u00a0St\u00fctzle, F-race and iterated F-race: an overview, in Experimental Methods for the Analysis of Optimization Algorithms (2010), pp. 311\u2013336","DOI":"10.1007\/978-3-642-02538-9_13"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"B.\u00a0Bischl, O.\u00a0Mersmann, H.\u00a0Trautmann, M.\u00a0Preuss, M.\u00a0Preu\u00df, Algorithm selection based on exploratory landscape analysis and cost-sensitive learning, in GECCO \u201912: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (Philly, 2012), pp. 313\u2013320","DOI":"10.1145\/2330163.2330209"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"E.K. Burke, M.\u00a0Gendreau, M.\u00a0Hyde, G.\u00a0Kendall, B.\u00a0McCollum, G.\u00a0Ochoa, A.J. Parkes, S.\u00a0Petrovic, The cross-domain heuristic search challenge - an international research competition, in Proceedings of Intelligent Conference Learning and Intelligent Optimization (Rome, January 17-21, 2011), pp. 631\u2013634","DOI":"10.1007\/978-3-642-25566-3_49"},{"issue":"12","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"E.K. Burke, M. Gendreau, M. Hyde, G. Kendall, G. Ochoa, E. \u00d6zcan, 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."},{"issue":"21","key":"3_CR16","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1111\/j.1467-8640.2005.00278.x","volume":"4","author":"T Carchrae","year":"2005","unstructured":"T. Carchrae, J.C. Beck, Applying machine learning to low-knowledge ccontrol of optimisztion algorithms. Comput. Intell. 4(21), 372\u2013387 (2005)","journal-title":"Comput. Intell."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"P.\u00a0Cowling, G.\u00a0Kendall, E.\u00a0Soubeiga, A hyperheuristic approach to scheduling a sales summit, in Proceedings of Practice and Theory of Automated Timetabling (Konstanz, August 16\u201318, 2000), pp. 176\u2013190","DOI":"10.1007\/3-540-44629-X_11"},{"issue":"7","key":"3_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1026569813391","volume":"1","author":"SP Coy","year":"2001","unstructured":"S.P. Coy, B.L. Golden, G.C. Runger, E.A. Wasil, Using experimental design to find effective parameter settings for heuristics. J. Heuristics 1(7), 77\u201397 (2001)","journal-title":"J. Heuristics"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"N.T.T. Dang, P.\u00a0De Causmaecker, Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm, in LION 2016: Learning and Intelligent Optimization. Lecture Notes in Computer Science 10079 (2016), pp. 234\u2013239","DOI":"10.1007\/978-3-319-50349-3_17"},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/4235.918434","volume":"5","author":"O Fran\u00e7ois","year":"2001","unstructured":"O. Fran\u00e7ois, C. Lavergne, Design of evolutionary algorithms - a statistical perspective. IEEE Trans. Evol. Comput. 5(2), 129\u2013148 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR21","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, New York, 1979)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"D.B. G\u00fcm\u00fcs, E.\u00a0\u00d6zcan, J.\u00a0Atkin, An analysis of the taguchi method for tuning a memetic algorithm with reduced computational time budget, in ISCIS 2016: Computer and Information Sciences (Poland, 2016), pp. 12\u201320","DOI":"10.1007\/978-3-319-47217-1_2"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.swevo.2018.07.001","volume":"44","author":"Y He","year":"2019","unstructured":"Y. He, S.Y. Yuen, Y. Lou, X. Zhang, A sequential algorithm portfolio approach for black box optimization. Swarm Evol. Comput. 44, 559\u2013570 (2019)","journal-title":"Swarm Evol. Comput."},{"issue":"5296","key":"3_CR24","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"275","author":"BA Huberman","year":"1997","unstructured":"B.A. Huberman, R.M. Lukose, T. Hogg, An economics approach to hard computational problems. Science 275(5296), 51\u201354 (1997)","journal-title":"Science"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"F.\u00a0Hutter, H.H. Hoos, K.\u00a0Leyton-Brown, Sequential model-based optimization for general algorithm configuration, in LION 2011: Learning and Intelligent Optimization (Rome, Italy, 2011), pp. 507\u2013523","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"F. Hutter, H.H. Hoos, K. Leyton-Brown, T. St\u00fctzle, ParamILS: An automatic algorithm configuration framework. Journal of Artificial Intelligence Research 36, 267\u2013306 (2009)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"3_CR27","unstructured":"S.\u00a0Kadioglu, Y.\u00a0Malitsky, M.\u00a0Sellmann, K.\u00a0Tierney, and K.\u00a0Tierney. Isac - instance-specific algorithm configuration. In Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence, pages 751\u2013756, Lisbon, Portugal, Aug, 2010"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"G.\u00a0Kendall, R.\u00a0Bai, J.\u00a0Blazewicz, P.\u00a0De Causmaecker, M.\u00a0Gendreau, R.\u00a0John, J.\u00a0Li, B.\u00a0McCollum, E.\u00a0Pesch, R.\u00a0Qu, N.\u00a0Sabar, G.\u00a0Vanden Berghe, and A.\u00a0Yee. Good laboratory practice for optimization research. Journal of Operational Research Society, 67(4):676\u2013689, Apr. 2016","DOI":"10.1057\/jors.2015.77"},{"issue":"1","key":"3_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/evco_a_00242","volume":"27","author":"P Kerschke","year":"2019","unstructured":"P. Kerschke, H.H. Hoos, F. Neumann, H. Trautmann, Is evolutionary computation evolving fast enough? Evolutionary Computation 27(1), 3\u201345 (2019)","journal-title":"Evolutionary Computation"},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/j.asoc.2014.11.006","volume":"27","author":"T Liao","year":"2015","unstructured":"T. Liao, D. Molina, T. St\u00fctzle, Performance evaluation of automatically tuned continuous optimizers on different benchmark sets. Applied Soft Computing 27, 490\u2013503 (2015)","journal-title":"Applied Soft Computing"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"A.\u00a0Liefooghe, B.\u00a0Derbel, S.\u00a0Verel, H.\u00a0Aguirre, K.\u00a0Tanaka, Towards landscape-aware automatic algorithm configuration: preliminary experiments on neutral and rugged landscapes, in EvoCOP 2017: Evolutionary Computation in Combinatorial Optimization (2017), pp. 215\u2013232","DOI":"10.1007\/978-3-319-55453-2_15"},{"key":"3_CR32","unstructured":"S. Liu, K. Tang, X. Yao, Automatic construction of parallel portfolios via explicit instance grouping, in Proceedings of AAAI Conference on Artificial Intelligence (New Orleans, 2018), pp. 2\u20137"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"M. L\u00f3pez-Ib\u00e1\u00f1ez, J. Dubois-Lacoste, L. P. C\u00e1ceres, T. St\u00fctzle, M. Birattari, The irace package: Iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"M.\u00a0L\u00f3pez-Ib\u00e1\u00f1ez, T.\u00a0St\u00fctzle, The automatic design of multi-objective ant colony optimization algorithms. IEEE Trans. Evol. Comput. 16(6), 861\u2013875 (2012)","DOI":"10.1109\/TEVC.2011.2182651"},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"J. MacLachlan, Y. Mei, J. Branke, M. Zhang, Genetic programming hyper-heuristics with vehicle collaboration for uncertain capacitated arc routing problems, in Evolutionary Computation\u00a028(4), 563\u2013593 (2020)","DOI":"10.1162\/evco_a_00267"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Malitsky, M.\u00a0Sellmann, Instance-specific algorithm configuration as a method for non-model-based portfolio generation (2012), pp. 244\u2013259","DOI":"10.1007\/978-3-642-29828-8_16"},{"issue":"3","key":"3_CR37","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.ejor.2013.08.021","volume":"233","author":"T Messelis","year":"2014","unstructured":"T. Messelis, P. De Causmaecker, An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem. Eur. J. Oper. Res. 233(3), 511\u2013528 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"3_CR38","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00143877","volume":"1\u20132","author":"S Minton","year":"1996","unstructured":"S. Minton, Automatically configuring constraint satisfaction programs: a case study. Constraints 1\u20132(1), 7\u201343 (1996)","journal-title":"Constraints"},{"issue":"7","key":"3_CR39","doi-asserted-by":"publisher","first-page":"3335","DOI":"10.1016\/j.asoc.2013.02.006","volume":"13","author":"M Misir","year":"2013","unstructured":"M. Misir, K. Verbeeck, P. De Causmaecker, G.V. Berghe, 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."},{"issue":"2","key":"3_CR40","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/TCYB.2014.2323936","volume":"45","author":"G Kendall","year":"2015","unstructured":"G. Kendall, R. Qu, N.R. Sabar, M. Ayob, A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems. IEEE Trans. Cybern. 45(2), 217\u2013228 (2015)","journal-title":"IEEE Trans. Cybern."},{"issue":"3","key":"3_CR41","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1162\/1063656054794815","volume":"13","author":"M Oltean","year":"2005","unstructured":"M. Oltean, Evolving evolutionary algorithms using linear genetic programming. Evol. Comput. 13(3), 387\u2013410 (2005)","journal-title":"Evol. Comput."},{"key":"3_CR42","unstructured":"C.\u00a0Papadimitriou, K.\u00a0Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Dover Publications Inc., 1982)"},{"issue":"3","key":"3_CR43","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0305-0548(97)00054-3","volume":"25","author":"M-W Park","year":"1998","unstructured":"M.-W. Park, Y.-D. Kim, A systematic procedure for setting parameters in simulated annealing algorithms. Comput. Oper. Res. 25(3), 207\u2013217 (1998)","journal-title":"Comput. Oper. Res."},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"J.\u00a0P\u00e9rez, R.A. Pazos, J.\u00a0Frausto, G.\u00a0Rodr\u00edguez, D.\u00a0Romero, L.\u00a0Cruz, A statistical approach for algorithm selection, in WEA 2004: Experimental and Efficient Algorithms (Angra dos Reis, Brazil, May, 2004), pp. 417\u2013431","DOI":"10.1007\/978-3-540-24838-5_31"},{"key":"3_CR45","doi-asserted-by":"crossref","unstructured":"J.\u00a0Pihera, N.\u00a0Musliu, Application of machine learning to algorithm selection for tsp, in 2014 IEEE 26th International Conference on Tools with Artificial Intelligence (Limassol, Cyprus, 2014), pp. 47\u201354","DOI":"10.1109\/ICTAI.2014.18"},{"key":"3_CR46","doi-asserted-by":"crossref","unstructured":"N.\u00a0Pillay, D.\u00a0Beckedahl, EvoHyp - a Java toolkit for evolutionary algorithm hyper-heuristics, in Proceedings of IEEE Congress on Evolutionary Computation (San Sebastian, June 5-8, 2017), pp. 2707\u20132713","DOI":"10.1109\/CEC.2017.7969636"},{"key":"3_CR47","doi-asserted-by":"crossref","unstructured":"N.\u00a0Pillay, R.\u00a0Qu, Hyper-Heuristics: Theory and Applications (Springer Nature, 2019)","DOI":"10.1007\/978-3-319-96514-7"},{"key":"3_CR48","doi-asserted-by":"crossref","unstructured":"N.\u00a0Pillay, R.\u00a0Qu, Assessing hyper-heuristic performance. J. Oper. Res. Soc. accepted (2020)","DOI":"10.1080\/01605682.2020.1796538"},{"key":"3_CR49","doi-asserted-by":"crossref","unstructured":"M.\u00a0Preuss, T.\u00a0Bartz-Beielstein, Sequential parameter optimization applied to self-adaptation for binary-coded evolutionary algorithms, in Parameter Setting in Evolutionary Algorithms (2007), pp. 91\u2013120","DOI":"10.1007\/978-3-540-69432-8_5"},{"key":"3_CR50","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1057\/jors.2008.102","volume":"60","author":"R Qu","year":"2009","unstructured":"R. Qu, E.K. Burke, Hybridisations withing a graph based hyper-heuristic framework for university timetabling problems. J. Oper. Res. Soc. 60, 1273\u20131285 (2009)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"3_CR51","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/MCI.2020.2976182","volume":"15","author":"R Qu","year":"2020","unstructured":"R. Qu, G. Kendall, N. Pillay, The general combinatorial optimisation problem - towards automated algorithm design. IEEE Comput. Intell. Mag. 15(2), 14\u201323 (2020)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"3_CR52","doi-asserted-by":"crossref","unstructured":"I.C.O. Ramos, M.C. Goldbarg, E.G. Goldbarg, A.D.D. Neto, Logistic regression for parameter tuning on an evolutionary algorithm, in 2005 IEEE Congress on Evolutionary Computation (Edinburgh, Scotland, 2-5 Sept. 2005)","DOI":"10.1109\/CEC.2005.1554808"},{"key":"3_CR53","doi-asserted-by":"crossref","unstructured":"M.-C. Riff, E.\u00a0Montero, A new algorithm for reducing metaheuristic design effort, in 2013 IEEE Congress on Evolutionary Computation (Mexico, 2013)","DOI":"10.1109\/CEC.2013.6557972"},{"key":"3_CR54","doi-asserted-by":"crossref","unstructured":"S.K. Smit, A.E. Eiben, Comparing parameter tuning methods for evolutionary algorithms, in 2009 IEEE Congress on Evolutionary Computation (Trondheim, Norway, 2009)","DOI":"10.1109\/CEC.2009.4982974"},{"key":"3_CR55","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ins.2014.03.105","volume":"279","author":"K Tang","year":"2014","unstructured":"K. Tang, F. Peng, G. Chen, X. Yao, Population-based algorithm portfolios with automated constituent algorithms selection. Inf. Sci. 279, 94\u2013104 (2014)","journal-title":"Inf. Sci."},{"key":"3_CR56","unstructured":"H.\u00a0Terashima-Mar\u00edn, P.\u00a0Ross, M.\u00a0Valenzuela-Rend\u00f3n, Evolution of constraint satisfaction strategies in examination timetabling, in GECCO\u201999: Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation (1999), pp. 635\u2013642"},{"key":"3_CR57","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.procs.2016.11.045","volume":"101","author":"AA Visheratin","year":"2016","unstructured":"A.A. Visheratin, M. Melnik, D. Nasonov, Automatic workflow scheduling tuning for distributed processing systems. Procedia Comput. Sci. 101, 388\u2013397 (2016)","journal-title":"Procedia Comput. Sci."},{"issue":"1","key":"3_CR58","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"D.H. Wolpert, W.G. McReady, No free lunch theorems for optimisation. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR59","doi-asserted-by":"crossref","unstructured":"L.\u00a0Xu, H.\u00a0Hoos, K.\u00a0Leyton-Brown, Hydra: automatically configuring algorithms for portfolio-based selection, in Proceedings of AAAI Conference on Artificial Intelligence (Atlanta, July 11\u201315, 2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"3_CR60","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"L. Xu, F. Hutter, H.H. Hoos, K. Leyton-Brown, Satzilla: portfolio-based algorithm selection for sat. J. Artif. Intell. Res. 32, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Natural Computing Series","Automated Design of Machine Learning and Search Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72069-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:52:54Z","timestamp":1725522774000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-72069-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030720681","9783030720698"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72069-8_3","relation":{},"ISSN":["1619-7127"],"issn-type":[{"type":"print","value":"1619-7127"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"29 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}