Kim, Min HyeokMcKay, Robert IanKim, Dong KyunNguyen, Xuan Hoai2026-01-012026-01-0197836422913880302-9743https://hdl.handle.net/1885/733799240Operator adaptation in evolutionary computation has previously been applied to either small numbers of operators, or larger numbers of fairly similar ones. This paper focuses on adaptation in algorithms offering a diverse range of operators. We compare a number of previously-developed adaptation strategies, together with two that have been specifically designed for this situation. Probability Matching and Adaptive Pursuit methods performed reasonably well in this scenario, but a strategy combining aspects of both performed better. Multi-Arm Bandit techniques performed well when parameter settings were suitably tailored to the problem, but this tailoring was difficult, and performance was very brittle when the parameter settings were varied.12enAdaptive operator selectionAdaptive pursuitEvolutionary algorithmMulti-armed banditProbability matching201210.1007/978-3-642-29139-5_2084859131335