{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T02:28:18Z","timestamp":1785810498668,"version":"3.56.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T00:00:00Z","timestamp":1284508800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s10472-010-9213-y","type":"journal-article","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T04:41:28Z","timestamp":1284439288000},"page":"25-64","source":"Crossref","is-referenced-by-count":133,"title":["Analyzing bandit-based adaptive operator selection mechanisms"],"prefix":"10.1007","volume":"60","author":[{"given":"\u00c1lvaro","family":"Fialho","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luis","family":"Da Costa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Schoenauer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mich\u00e8le","family":"Sebag","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,9,15]]},"reference":[{"issue":"2\u20133","key":"9213_CR1","doi-asserted-by":"crossref","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 multi-armed bandit problem. Mach. Learn. 47(2\u20133), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"9213_CR2","unstructured":"Barbosa, H.J.C., S\u00e1, A.M.: On adaptive operator probabilities in real coded genetic algorithms. In: XX Intl. Conference of the Chilean Computer Science Society (2000)"},{"key":"9213_CR3","doi-asserted-by":"crossref","unstructured":"Bartz-Beielstein, T., Lasarczyk, C., Preuss, M.: Sequential parameter optimization. In: McKay, B. (ed.) Proc. Congress on Evolutionary Computation, pp.\u00a0773\u2013780. IEEE (2005)","DOI":"10.1109\/CEC.2005.1554761"},{"key":"9213_CR4","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Langdon, W.B., et al. (eds.) Proc. Genetic and Evolutionary Computation Conference, pp.\u00a011\u201318. Morgan Kaufmann (2002)"},{"key":"9213_CR5","doi-asserted-by":"crossref","unstructured":"Collet, P., Schoenauer, M.: GUIDE: unifying evolutionary engines through a graphical user interface. In: Liardet, P., et al. (eds.) Proc. Intl. Conference on Artificial Evolution. LNCS, vol. 2936, pp. 203\u2013215. Springer (2003)","DOI":"10.1007\/978-3-540-24621-3_17"},{"key":"9213_CR6","unstructured":"Conover, W.J.: Practical Nonparametric Statistics. Wiley (1999)"},{"key":"9213_CR7","doi-asserted-by":"crossref","unstructured":"Da Costa, L., Fialho, A., Schoenauer, M., Sebag, M.: Adaptive operator selection with dynamic multi-armed bandits. In: Keijzer, M., et al. (eds.) Proc. Genetic and Evolutionary Computation Conference, pp.\u00a0913\u2013920. ACM (2008)","DOI":"10.1145\/1389095.1389272"},{"key":"9213_CR8","unstructured":"Davis, L.: Adapting operator probabilities in genetic algorithms. In: Schaffer, J.D. (ed.) Proc. Intl. Conference on Genetic Algorithms, pp. 61\u201369. Morgan Kaufmann (1989)"},{"key":"9213_CR9","doi-asserted-by":"crossref","unstructured":"DeJong, K.: Evolutionary Computation. A unified Approach. MIT (2006)","DOI":"10.1145\/1274000.1274109"},{"key":"9213_CR10","doi-asserted-by":"crossref","unstructured":"DeJong, K.: Parameter setting in EAs: a 30 year perspective. In: Lobo, F., Lima, C., Michalewicz, Z. (eds.): Parameter Setting in Evolutionary Algorithms. Studies in Computational Intelligence, vol.\u00a054, pp. 1\u201318. Springer (2007)","DOI":"10.1007\/978-3-540-69432-8_1"},{"issue":"2","key":"9213_CR11","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"AE Eiben","year":"1999","unstructured":"Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in Evolutionary Algorithms. IEEE Trans. Evol. Comput. 3(2), 124\u2013141 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9213_CR12","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., Michalewicz, Z., Schoenauer, M., Smith, J.E.: Parameter control in evolutionary algorithms. In: Lobo, F., Lima, C., Michalewicz, Z. (eds.): Parameter Setting in Evolutionary Algorithms. Studies in Computational Intelligence, vol.\u00a054, pp. 19\u201346. Springer (2007)","DOI":"10.1007\/978-3-540-69432-8_2"},{"key":"9213_CR13","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer (2003)","DOI":"10.1007\/978-3-662-05094-1"},{"key":"9213_CR14","doi-asserted-by":"crossref","unstructured":"Fialho, A., Da Costa, L., Schoenauer, M., Sebag, M.: Extreme value based adaptive operator selection. In: Rudolph, G., et al. (eds.) Proc. Intl. Conference on Parallel Solving from Nature. LNCS, vol. 5199, pp. 175\u2013184. Springer (2008)","DOI":"10.1007\/978-3-540-87700-4_18"},{"key":"9213_CR15","doi-asserted-by":"crossref","unstructured":"Fialho, A., 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.) Proc. 3rd Intl. Conference on Learning and Intelligent Optimization. LNCS, vol. 5851, pp. 176\u2013190. Springer (2009)","DOI":"10.1007\/978-3-642-11169-3_13"},{"key":"9213_CR16","doi-asserted-by":"crossref","unstructured":"Fialho, A., Schoenauer, M., Sebag, M.: Analysis of adaptive operator selection techniques on the royal road and long k-path problems. In: Raidl, G., et al. (eds.) Proc. Genetic and Evolutionary Computation Conference, pp. 779\u2013786. ACM (2009)","DOI":"10.1145\/1569901.1570009"},{"key":"9213_CR17","unstructured":"Fogel, D.B.: Phenotypes, genotypes and operators in evolutionary computation. In: Proc. Intl. Conference on Evolutionary Computation. IEEE (1995)"},{"key":"9213_CR18","unstructured":"Gagliolo, M., Schmidhuber, J.: Algorithm Selection as a Bandit Problem with Unbounded Losses. Tech. Rep. IDSIA-07-08, IDSIA (2008)"},{"issue":"4","key":"9213_CR19","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\u2013426 (1990)","journal-title":"Mach. Learn."},{"issue":"2","key":"9213_CR20","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1017\/S0094837300005224","volume":"3","author":"S Gould","year":"1977","unstructured":"Gould, S., Eldredge, N.: Punctuated equilibria: the tempo and mode of evolution reconsidered. Paleobiology 3(2), 115\u2013151 (1977)","journal-title":"Paleobiology"},{"key":"9213_CR21","unstructured":"Hartland, C., Baskiotis, N., Gelly, S., Teytaud, O., Sebag, M.: Change point detection and meta-bandits for online learning in dynamic environments. In: Proc. Conf\u00e9rence Francophone sur l\u2019Apprentissage Automatique (2007)"},{"key":"9213_CR22","unstructured":"Hartland, C., Gelly, S., Baskiotis, N., Teytaud, O., Sebag, M.: Multi-armed bandit, dynamic environments and meta-bandits. In: Online Trading of Exploration and Exploitation Workshop, NIPS (2006)"},{"issue":"3","key":"9213_CR23","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1093\/biomet\/58.3.509","volume":"58","author":"D Hinkley","year":"1970","unstructured":"Hinkley, D.: Inference about the change point from cumulative sum-tests. Biometrika 58(3), 509\u2013523 (1970)","journal-title":"Biometrika"},{"key":"9213_CR24","unstructured":"Holland, J.H.: Royal road functions. In: Internet Genetic Algorithms Digest, vol. 7, p. 22. Massachusetts Institute of Technology (1993)"},{"issue":"4","key":"9213_CR25","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1162\/evco.1994.2.4.409","volume":"2","author":"T Jones","year":"1994","unstructured":"Jones, T.: A description of Holland\u2019s Royal Road. Evol. Comput. 2(4), 409\u2013415 (1994)","journal-title":"Evol. Comput."},{"key":"9213_CR26","unstructured":"Julstrom, B.: What have you done for me lately? Adapting operator probabilities in a steady-state genetic algorithm. In: Eshelman, L.J., et al. (eds.) Proc. Intl. Conference on Genetic Algorithms, pp. 81\u201387. Morgan Kaufmann (1995)"},{"key":"9213_CR27","unstructured":"Kallel, L., Schoenauer, M.: Fitness Distance Correlation for Variable Length Representations. Tech. Rep. 363, CMAP, Ecole Polytechnique (1996)"},{"issue":"1","key":"9213_CR28","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"T Lai","year":"1985","unstructured":"Lai, T., Robbins, H.: Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6(1), 4\u201322 (1985)","journal-title":"Adv. Appl. Math."},{"key":"9213_CR29","doi-asserted-by":"crossref","unstructured":"Lobo, F., Goldberg, D.: Decision making in a hybrid genetic algorithm. In: Porto, B. (ed.) Proc. Intl. Conference on Evolutionary Computation, pp. 121\u2013125. IEEE (1997)","DOI":"10.1109\/ICEC.1997.592281"},{"key":"9213_CR30","doi-asserted-by":"crossref","unstructured":"Lobo, F., Lima, C., Michalewicz, Z. (eds.): Parameter Setting in Evolutionary Algorithms. Studies in Computational Intelligence, vol.\u00a054. Springer (2007)","DOI":"10.1007\/978-3-540-69432-8"},{"key":"9213_CR31","doi-asserted-by":"crossref","unstructured":"Maturana, J., Fialho, A., Saubion, F., Schoenauer, M., Sebag, M.: Extreme compass and dynamic multi-armed bandits for adaptive operator selection. In: Proc. Congress on Evolutionary Computation, pp. 365\u2013372. IEEE (2009)","DOI":"10.1109\/CEC.2009.4982970"},{"key":"9213_CR32","author":"J Maturana","year":"2010","unstructured":"Maturana, J., Lardeux, F., Saubion, F.: Autonomous operator management for evolutionary algorithms. Journal of Heuristics (2010). doi: 10.1007\/s10732-010-9125-3","journal-title":"Journal of Heuristics"},{"key":"9213_CR33","doi-asserted-by":"crossref","unstructured":"Maturana, J., Saubion, F.: A compass to guide genetic algorithms. In: Rudolph, G., et al. (eds.) Proc. Intl. Conference on Parallel Solving from Nature. LNCS, vol. 5199, pp. 256\u2013265. Springer (2008)","DOI":"10.1007\/978-3-540-87700-4_26"},{"key":"9213_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, New York (1996)","edition":"3"},{"key":"9213_CR35","unstructured":"Mitchell, M., Forrest, S., Holland, J.H.: The royal road for genetic algorithms: fitness landscapes and GA performance. In: Proc. European Conference on Artificial Life, pp. 245\u2013254 (1992)"},{"key":"9213_CR36","doi-asserted-by":"crossref","unstructured":"Nannen, V., Eiben, A.E.: Relevance estimation and value calibration of evolutionary algorithm parameters. In: Veloso, M. (ed.) Proc. Intl. Joint Conference on Artificial Intelligence, pp. 975\u2013980 (2007)","DOI":"10.1109\/CEC.2007.4424460"},{"key":"9213_CR37","doi-asserted-by":"crossref","unstructured":"Quick, R.J., Rayward-Smith, V.J., Smith, G.D.: The royal road functions: description, intent and experimentation. In: Selected Papers from AISB Workshop on Evolutionary Computing. LNCS, vol. 1143, pp. 223\u2013235. Springer (1996)","DOI":"10.1007\/BFb0032786"},{"key":"9213_CR38","doi-asserted-by":"crossref","unstructured":"Spears, W.: Adapting crossover in evolutionary algorithms. In: McDonnell, J.R., et al. (eds.) Proc. Conference on Evolutionary Programming, pp. 367\u2013384. MIT (1995)","DOI":"10.7551\/mitpress\/2887.003.0035"},{"key":"9213_CR39","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T. (ed.): Proc. 3rd Intl. Conference on Learning and Intelligent Optimization. LNCS, vol. 5851. Springer (2009)","DOI":"10.1007\/978-3-642-11169-3"},{"key":"9213_CR40","doi-asserted-by":"crossref","unstructured":"Thierens, D.: An adaptive pursuit strategy for allocating operator probabilities. In: Beyer, H.G. (eds.) Proc. Genetic and Evolutionary Computation Conference, pp. 1539\u20131546. ACM (2005)","DOI":"10.1145\/1068009.1068251"},{"key":"9213_CR41","doi-asserted-by":"crossref","unstructured":"Thierens, D.: Adaptive strategies for operator allocation. In: Lobo, F., Lima, C., Michalewicz, Z. (eds.): Parameter Setting in Evolutionary Algorithms. Studies in Computational Intelligence, vol.\u00a054, pp. 77\u201390. Springer (2007)","DOI":"10.1007\/978-3-540-69432-8_4"},{"issue":"2","key":"9213_CR42","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1162\/evco.1998.6.2.161","volume":"6","author":"A Tuson","year":"1998","unstructured":"Tuson, A., Ross, P.: Adapting operator settings in genetic algorithms. Evol. Comput. 6(2), 161\u2013184 (1998)","journal-title":"Evol. Comput."},{"key":"9213_CR43","doi-asserted-by":"crossref","unstructured":"Whitacre, J., Pham, T., Sarker, R.: Use of statistical outlier detection method in adaptive evolutionary algorithms. In: Keijzer, M. (ed.) Proc. Genetic and Evolutionary Computation Conference, pp. 1345\u20131352. ACM (2006)","DOI":"10.1145\/1143997.1144205"},{"key":"9213_CR44","doi-asserted-by":"crossref","unstructured":"Yu, T., Davis, D., Baydar, C., Roy, R. (eds.): Evolutionary Computation in Practice. Studies in Computational Intelligence, vol.\u00a088. Springer (2008)","DOI":"10.1007\/978-3-540-75771-9"},{"key":"9213_CR45","doi-asserted-by":"crossref","unstructured":"Yuan, B., Gallagher, M.: Statistical racing techniques for improved empirical evaluation of evolutionary algorithms. In: Yao, X., et al. (eds.) Proc. Intl. Conference on Parallel Solving from Nature. LNCS, vol. 3242, pp. 172\u2013181. Springer (2004)","DOI":"10.1007\/978-3-540-30217-9_18"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-010-9213-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-010-9213-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-010-9213-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T19:47:08Z","timestamp":1740512828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-010-9213-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,15]]},"references-count":45,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["9213"],"URL":"https:\/\/doi.org\/10.1007\/s10472-010-9213-y","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,15]]}}}