{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:24:15Z","timestamp":1760646255937,"version":"3.40.5"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135625"},{"type":"electronic","value":"9783319135632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13563-2_31","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T10:36:25Z","timestamp":1415961385000},"page":"359-370","source":"Crossref","is-referenced-by-count":17,"title":["Dynamic Selection of Evolutionary Algorithm Operators Based on Online Learning and Fitness Landscape Metrics"],"prefix":"10.1007","author":[{"given":"Pietro A.","family":"Consoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leandro L.","family":"Minku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2-3","key":"31_CR1","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. Machine learning\u00a047(2-3), 235\u2013256 (2002)","journal-title":"Machine learning"},{"key":"31_CR2","unstructured":"Barbosa, H.J., S\u00e1, A.: On adaptive operator probabilities in real coded genetic algorithms. In: Workshop on Advances and Trends in Artificial Intelligence for Problem Solving, SCCC 2000 (2000)"},{"issue":"3","key":"31_CR3","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/S0377-2217(02)00334-X","volume":"147","author":"P. Beullens","year":"2003","unstructured":"Beullens, P., Muyldermans, L., Cattrysse, D., Van Oudheusden, D.: A guided local search heuristic for the capacitated arc routing problem. European Journal of Operational Research\u00a0147(3), 629\u2013643 (2003)","journal-title":"European Journal of Operational Research"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-662-44320-0_9","volume-title":"Evolutionary Computation in Combinatorial Optimisation","author":"P. Consoli","year":"2014","unstructured":"Consoli, P., Yao, X.: Diversity-driven selection of multiple crossover operators for the capacitated arc routing problem. In: Blum, C., Ochoa, G. (eds.) EvoCOP 2014. LNCS, vol.\u00a08600, pp. 97\u2013108. Springer, Heidelberg (2014)"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"DaCosta, L., Fialho, A., Schoenauer, M., Sebag, M.: Adaptive operator selection with dynamic multi-armed bandits. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, pp. 913\u2013920 (2008)","DOI":"10.1145\/1389095.1389272"},{"key":"31_CR6","unstructured":"Davis, L.: Adapting operator probabilities in genetic algorithms. In: International Conference on Genetic Algorithms 1989, pp. 61\u201369 (1989)"},{"issue":"3","key":"31_CR7","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0166-218X(92)00003-5","volume":"48","author":"R.W. Eglese","year":"1994","unstructured":"Eglese, R.W.: Routeing winter gritting vehicles. Discrete applied mathematics\u00a048(3), 231\u2013244 (1994)","journal-title":"Discrete applied mathematics"},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"A.E. Eiben","year":"1999","unstructured":"Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation\u00a03(2), 124\u2013141 (1999)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"31_CR9","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 3. LNCS, vol.\u00a05851, pp. 176\u2013190. Springer, Heidelberg (2009)"},{"issue":"4","key":"31_CR10","first-page":"407","volume":"5","author":"D.E. Goldberg","year":"1990","unstructured":"Goldberg, D.E.: Probability matching, the magnitude of reinforcement, and classifier system bidding. Machine Learning\u00a05(4), 407\u2013425 (1990)","journal-title":"Machine Learning"},{"issue":"3","key":"31_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/net.3230110308","volume":"11","author":"B.L. Golden","year":"1981","unstructured":"Golden, B.L., Wong, R.T.: Capacitated arc routing problems. Networks\u00a011(3), 305\u2013315 (1981)","journal-title":"Networks"},{"issue":"1","key":"31_CR12","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M. Hall","year":"2009","unstructured":"Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The weka data mining software: an update. ACM SIGKDD Explorations Newsletter\u00a011(1), 10\u201318 (2009)","journal-title":"ACM SIGKDD Explorations Newsletter"},{"issue":"3","key":"31_CR13","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1093\/biomet\/58.3.509","volume":"58","author":"D.V. Hinkley","year":"1971","unstructured":"Hinkley, D.V.: Inference about the change-point from cumulative sum tests. Biometrika\u00a058(3), 509\u2013523 (1971)","journal-title":"Biometrika"},{"key":"31_CR14","unstructured":"Julstrom, B.A.: What have you done for me lately? adapting operator probabilities in a steady-state genetic algorithm. In: Proceedings of the 6th International Conference on Genetic Algorithms, Pittsburgh, PA, USA, July 15-19 (1995)"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Kolter, J.Z., Maloof, M.: Dynamic weighted majority: A new ensemble method for tracking concept drift. In: Third IEEE International Conference on Data Mining, ICDM 2003, pp. 123\u2013130. IEEE (2003)","DOI":"10.1109\/ICDM.2003.1250911"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-20364-0_10","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"G. Lu","year":"2011","unstructured":"Lu, G., Li, J., Yao, X.: Fitness-probability cloud and a measure of problem hardness for evolutionary algorithms. In: Merz, P., Hao, J.-K. (eds.) EvoCOP 2011. LNCS, vol.\u00a06622, pp. 108\u2013117. Springer, Heidelberg (2011)"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Lunacek, M., Whitley, D.: The dispersion metric and the cma evolution strategy. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 477\u2013484. ACM (2006)","DOI":"10.1145\/1143997.1144085"},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-540-87700-4_26","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN X","author":"J. Maturana","year":"2008","unstructured":"Maturana, J., Saubion, F.: A compass to guide genetic algorithms. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol.\u00a05199, pp. 256\u2013265. Springer, Heidelberg (2008)"},{"issue":"3","key":"31_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1162\/1063656041774956","volume":"12","author":"P. Merz","year":"2004","unstructured":"Merz, P.: Advanced fitness landscape analysis and the performance of memetic algorithms. Evolutionary Computation\u00a012(3), 303\u2013325 (2004)","journal-title":"Evolutionary Computation"},{"issue":"5","key":"31_CR20","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1109\/TKDE.2009.156","volume":"22","author":"L.L. Minku","year":"2010","unstructured":"Minku, L.L., White, A.P., Yao, X.: The impact of diversity on online ensemble learning in the presence of concept drift. IEEE Transactions on Knowledge and Data Engineering\u00a022(5), 730\u2013742 (2010)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"31_CR21","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/4235.873238","volume":"4","author":"T.P. Runarsson","year":"2000","unstructured":"Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Transactions on Evolutionary Computation\u00a04(3), 284\u2013294 (2000)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"31_CR22","unstructured":"Schlimmer, J.C., Granger, R.H.: Beyond incremental processing: Tracking concept drift. In: AAAI, pp. 502\u2013507 (1986)"},{"issue":"5","key":"31_CR23","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1109\/TEVC.2009.2023449","volume":"13","author":"K. Tang","year":"2009","unstructured":"Tang, K., Mei, Y., Yao, X.: Memetic algorithm with extended neighborhood search for capacitated arc routing problems. IEEE Transactions on Evolutionary Computation\u00a013(5), 1151\u20131166 (2009)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"Thierens, D.: An adaptive pursuit strategy for allocating operator probabilities. In: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, pp. 1539\u20131546. ACM (2005)","DOI":"10.1145\/1068009.1068251"},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Vanneschi, L., Pirola, Y., Collard, P.: A quantitative study of neutrality in gp boolean landscapes. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 895\u2013902. ACM (2006)","DOI":"10.1145\/1143997.1144152"}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13563-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T17:55:18Z","timestamp":1747158918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13563-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135625","9783319135632"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13563-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}