1. Boomsma, W.: Using adaptive operator scheduling on problem domains with an operator manifold: Applications to the travelling salesman problem. In: Proceedings of the 2003 Congress on Evolutionary Computation (CEC 2003), vol. 2, pp. 1274–1279 (2003)
2. Angeline, P.J.: Adaptive and self-adaptive evolutionary computations. In: Palaniswami, M., Attikiouzel, Y. (eds.) Computational Intelligence: A Dynamic Systems Perspective, pp. 152–163. IEEE Press, Los Alamitos (1995)
3. Davis, L.: Adapting operator probabilities in genetic algorithms. In: Schaffer, J.D. (ed.) Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, CA, Morgan Kaufman, San Francisco (1989)
4. Julstrom, B.A.: What have you done for me lately? Adapting operator probabilities in a steady-state genetic algorithm. In: Eshelman, L. (ed.) Proceedings of the Sixth International Conference on Genetic Algorithms, San Francisco, CA, pp. 81–87. Morgan Kaufmann, San Francisco (1995)
5. Schlierkamp-Voosen, D., Mühlenbein, H.: Strategy adaptation by competing subpopulations. In: Davidor, Y., Schwefel, H.P., Männer, R. (eds.) Parallel Problem Solving from Nature – PPSN III, Berlin, pp. 199–208. Springer, Heidelberg (1994)