{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T15:23:27Z","timestamp":1768317807247,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2016,4,5]],"date-time":"2016-04-05T00:00:00Z","timestamp":1459814400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00500-016-2126-x","type":"journal-article","created":{"date-parts":[[2016,4,5]],"date-time":"2016-04-05T07:22:24Z","timestamp":1459840944000},"page":"3889-3914","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Dynamic selection of evolutionary operators based on online learning and fitness landscape analysis"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7711-5795","authenticated-orcid":false,"given":"Pietro A.","family":"Consoli","sequence":"first","affiliation":[]},{"given":"Yi","family":"Mei","sequence":"additional","affiliation":[]},{"given":"Leandro L.","family":"Minku","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Yao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,5]]},"reference":[{"issue":"2\u20133","key":"2126_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 (2002) Finite-time analysis of the multiarmed bandit problem. Mach Learn 47(2\u20133):235\u2013256","journal-title":"Mach Learn"},{"key":"2126_CR2","unstructured":"Barbosa HJC, S\u00e1 AM (2000) On adaptive operator probabilities in real coded genetic algorithms. In: Workshop on advances and trends in artificial intelligence for problem solving \u2013 SCCC 2000 (2000)"},{"key":"2126_CR3","doi-asserted-by":"crossref","unstructured":"Belluz J, Gaudesi M, Squillero G, Tonda A (2015) Operator selection using improved dynamic multi-armed bandit. In: Proceedings of the 2015 on genetic and evolutionary computation conference. ACM, New York, pp 1311\u20131317","DOI":"10.1145\/2739480.2754712"},{"issue":"7","key":"2126_CR4","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1002\/net.3230220706","volume":"22","author":"E Benavent","year":"1992","unstructured":"Benavent E, Campos V, Corber\u00e1n A, Mota E (1992) The capacitated arc routing problem: lower bounds. Networks 22(7):669\u2013690","journal-title":"Networks"},{"issue":"3","key":"2126_CR5","doi-asserted-by":"crossref","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 (2003) A guided local search heuristic for the capacitated arc routing problem. Eur J Oper Res 147(3):629\u2013643","journal-title":"Eur J Oper Res"},{"issue":"4","key":"2126_CR6","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1016\/j.cor.2006.07.007","volume":"35","author":"J Brand\u00e3o","year":"2008","unstructured":"Brand\u00e3o J, Eglese R (2008) A deterministic tabu search algorithm for the capacitated arc routing problem. Comput Oper Res 35(4):1112\u20131126","journal-title":"Comput Oper Res"},{"key":"2126_CR7","unstructured":"Chen W, Wang Y, Yuan Y (2013) Combinatorial multi-armed bandit: general framework and applications. In: Proceedings of the 30th international conference on machine learning, pp 151\u2013159"},{"key":"2126_CR8","doi-asserted-by":"crossref","unstructured":"Consoli P, Yao X (2014) Diversity-driven selection of multiple crossover operators for the capacitated arc routing problem. In: Blum C, Ochoa G (eds) 14th European conference on evolutionary computation in combinatorial optimisation (EvoCOP\u201914), Granada. Revised selected papers, no. 12 in lecture notes in computer science. Springer, New York, pp 97\u2013108","DOI":"10.1007\/978-3-662-44320-0_9"},{"key":"2126_CR9","doi-asserted-by":"crossref","unstructured":"Consoli PA, Minku LL, Yao X (2014) Dynamic selection of evolutionary algorithm operators based on online learning and fitness landscape metrics. In: Simulated evolution and learning. Springer, New York, pp 359\u2013370","DOI":"10.1007\/978-3-319-13563-2_31"},{"key":"2126_CR10","doi-asserted-by":"crossref","unstructured":"DaCosta L, Fialho A, Schoenauer M, Sebag M (2008) Adaptive operator selection with dynamic multi-armed bandits. In: Proceedings of the 10th annual conference on genetic and evolutionary computation. ACM, New York, pp 913\u2013920","DOI":"10.1145\/1389095.1389272"},{"key":"2126_CR11","unstructured":"Davis L (1989) Adapting operator probabilities in genetic algorithms. In: International conference on genetic algorithms\u201989, pp 61\u201369"},{"issue":"3","key":"2126_CR12","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(92)00003-5","volume":"48","author":"RW Eglese","year":"1994","unstructured":"Eglese RW (1994) Routeing winter gritting vehicles. Discret Appl Math 48(3):231\u2013244","journal-title":"Discret Appl Math"},{"issue":"2","key":"2126_CR13","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"AE Eiben","year":"1999","unstructured":"Eiben AE, Hinterding R, Michalewicz Z (1999) Parameter control in evolutionary algorithms. IEEE Trans Evol Comput 3(2):124\u2013141","journal-title":"IEEE Trans Evol Comput"},{"key":"2126_CR14","doi-asserted-by":"crossref","unstructured":"Eiben A, Horvath M, Kowalczyk W, Schut MC (2007) Reinforcement learning for online control of evolutionary algorithms. In: Engineering self-organising systems. Springer, New York, pp 151\u2013160","DOI":"10.1007\/978-3-540-69868-5_10"},{"key":"2126_CR15","doi-asserted-by":"crossref","unstructured":"Fialho \u00c1, Da Costa L, Schoenauer M, Sebag M (2009) Dynamic multi-armed bandits and extreme value-based rewards for adaptive operator selection in evolutionary algorithms. In: Learning and intelligent optimization. Springer, New York, pp 176\u2013190","DOI":"10.1007\/978-3-642-11169-3_13"},{"issue":"4","key":"2126_CR16","first-page":"407","volume":"5","author":"DE Goldberg","year":"1990","unstructured":"Goldberg DE (1990) Probability matching, the magnitude of reinforcement, and classifier system bidding. Mach Learn 5(4):407\u2013425","journal-title":"Mach Learn"},{"issue":"3","key":"2126_CR17","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/net.3230110308","volume":"11","author":"BL Golden","year":"1981","unstructured":"Golden BL, Wong RT (1981) Capacitated arc routing problems. Networks 11(3):305\u2013315","journal-title":"Networks"},{"issue":"1","key":"2126_CR18","doi-asserted-by":"crossref","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 IH (2009) The weka data mining software: an update. ACM SIGKDD Explor Newsl 11(1):10\u201318","journal-title":"ACM SIGKDD Explor Newsl"},{"issue":"3","key":"2126_CR19","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1093\/biomet\/58.3.509","volume":"58","author":"DV Hinkley","year":"1971","unstructured":"Hinkley DV (1971) Inference about the change-point from cumulative sum tests. Biometrika 58(3):509\u2013523","journal-title":"Biometrika"},{"key":"2126_CR20","unstructured":"Julstrom BA (1995) 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"},{"key":"2126_CR21","doi-asserted-by":"crossref","unstructured":"Karafotias G, Hoogendoorn M, Eiben A (2015) Evaluating reward definitions for parameter control. In: Applications of evolutionary computation. Springer, New York, pp 667\u2013680","DOI":"10.1007\/978-3-319-16549-3_54"},{"key":"2126_CR22","doi-asserted-by":"crossref","unstructured":"Kim M, McKay RIB, Kim DK, Nguyen XH (2012) Evolutionary operator self-adaptation with diverse operators. In: Genetic programming. Springer, New York, pp 230\u2013241","DOI":"10.1007\/978-3-642-29139-5_20"},{"key":"2126_CR23","doi-asserted-by":"crossref","unstructured":"Kolter JZ, Maloof M (2003) Dynamic weighted majority: a new ensemble method for tracking concept drift. In: Third IEEE international conference on data mining (ICDM\u201903). IEEE, pp 123\u2013130","DOI":"10.1109\/ICDM.2003.1250911"},{"issue":"2","key":"2126_CR24","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1162\/evco.2006.14.2.223","volume":"14","author":"F Lardeux","year":"2006","unstructured":"Lardeux F, Saubion F, Hao JK (2006) Gasat: a genetic local search algorithm for the satisfiability problem. Evol Comput 14(2):223\u2013253","journal-title":"Evol Comput"},{"key":"2126_CR25","doi-asserted-by":"crossref","unstructured":"Lu G, Li J, Yao X (2011) Fitness-probability cloud and a measure of problem hardness for evolutionary algorithms. In: Evolutionary computation in combinatorial optimization. Springer, New York, pp 108\u2013117","DOI":"10.1007\/978-3-642-20364-0_10"},{"key":"2126_CR26","doi-asserted-by":"crossref","unstructured":"Lunacek M, Whitley D (2006) The dispersion metric and the CMA evolution strategy. In: Proceedings of the 8th annual conference on genetic and evolutionary computation. ACM, New York, pp 477\u2013484","DOI":"10.1145\/1143997.1144085"},{"issue":"8","key":"2126_CR27","doi-asserted-by":"crossref","first-page":"2145","DOI":"10.1016\/j.cor.2013.02.013","volume":"40","author":"R Martinelli","year":"2013","unstructured":"Martinelli R, Poggi M, Subramanian A (2013) Improved bounds for large scale capacitated arc routing problem. Comput Oper Res 40(8):2145\u20132160","journal-title":"Comput Oper Res"},{"key":"2126_CR28","doi-asserted-by":"crossref","unstructured":"Maturana J, Saubion F (2008) A compass to guide genetic algorithms. In: Parallel problem solving from nature-PPSN X. Springer, New York, pp 256\u2013265","DOI":"10.1007\/978-3-540-87700-4_26"},{"key":"2126_CR29","doi-asserted-by":"crossref","unstructured":"Mei Y, Li X, Yao X (2014a) Cooperative coevolution with route distance grouping for large-scale capacitated arc routing problems. IEEE Trans Evol Comput 18(3):435\u2013449","DOI":"10.1109\/TEVC.2013.2281503"},{"key":"2126_CR30","doi-asserted-by":"crossref","unstructured":"Mei Y, Li X, Yao X (2014b) Variable neighborhood decomposition for large scale capacitated arc routing problem. In: 2014 IEEE congress on evolutionary computation (CEC). IEEE, pp 1313\u20131320","DOI":"10.1109\/CEC.2014.6900305"},{"issue":"3","key":"2126_CR31","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1162\/1063656041774956","volume":"12","author":"P Merz","year":"2004","unstructured":"Merz P (2004) Advanced fitness landscape analysis and the performance of memetic algorithms. Evol Comput 12(3):303\u2013325","journal-title":"Evol Comput"},{"issue":"5","key":"2126_CR32","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1109\/TKDE.2009.156","volume":"22","author":"LL Minku","year":"2010","unstructured":"Minku LL, White AP, Yao X (2010) The impact of diversity on online ensemble learning in the presence of concept drift. IEEE Trans Knowl Data Eng 22(5):730\u2013742","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"2126_CR33","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/4235.873238","volume":"4","author":"TP Runarsson","year":"2000","unstructured":"Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4(3):284\u2013294","journal-title":"IEEE Trans Evol Comput"},{"key":"2126_CR34","doi-asserted-by":"crossref","unstructured":"Sakurai Y, Takada K, Kawabe T, Tsuruta S (2010) A method to control parameters of evolutionary algorithms by using reinforcement learning. In: 2010 sixth international conference on signal-image technology and internet-based systems (SITIS). IEEE, pp 74\u201379","DOI":"10.1109\/SITIS.2010.22"},{"key":"2126_CR35","unstructured":"Schlimmer JC, Granger RH (1986) Beyond incremental processing: tracking concept drift. In: AAAI, pp 502\u2013507"},{"key":"2126_CR36","doi-asserted-by":"crossref","unstructured":"Soria Alcaraz JA, Ochoa G, Carpio M, Puga H (2014) Evolvability metrics in adaptive operator selection. In: Proceedings of the 2014 conference on genetic and evolutionary computation. ACM, New York, pp 1327\u20131334","DOI":"10.1145\/2576768.2598220"},{"issue":"5","key":"2126_CR37","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1109\/TEVC.2009.2023449","volume":"13","author":"K Tang","year":"2009","unstructured":"Tang K, Mei Y, Yao X (2009) Memetic algorithm with extended neighborhood search for capacitated arc routing problems. IEEE Trans Evol Comput 13(5):1151\u20131166","journal-title":"IEEE Trans Evol Comput"},{"key":"2126_CR38","doi-asserted-by":"crossref","unstructured":"Thierens D (2005) An adaptive pursuit strategy for allocating operator probabilities. In: Proceedings of the 2005 conference on genetic and evolutionary computation. ACM, New York, pp 1539\u20131546","DOI":"10.1145\/1068009.1068251"},{"key":"2126_CR39","doi-asserted-by":"crossref","unstructured":"Vanneschi L, Pirola Y, Collard P (2006) A quantitative study of neutrality in GP boolean landscapes. In: Proceedings of the 8th annual conference on genetic and evolutionary computation. ACM, New York, pp 895\u2013902","DOI":"10.1145\/1143997.1144152"},{"issue":"12","key":"2126_CR40","doi-asserted-by":"crossref","first-page":"2089","DOI":"10.1016\/j.cor.2010.02.009","volume":"37","author":"EE Zachariadis","year":"2010","unstructured":"Zachariadis EE, Kiranoudis CT (2010) A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem. Comput Oper Res 37(12):2089\u20132105","journal-title":"Comput Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2126-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2126-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2126-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2126-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T15:16:05Z","timestamp":1553613365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2126-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,5]]},"references-count":40,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["2126"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2126-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,5]]}}}