References - Self-Adaptive Heuristics for Evolutionary Computation - page 153

90. Mercer, R.E., Sampson, J.R.: Adaptive search using a reproductive metaplan.
Kybernetes 7, 215-228 (1978)
91. Meyer-Nieberg, S., Beyer, H.-G.: Self-adaptation in evolutionary algorithms. In:
Lobo, F.G., Lima, C.F., Michalewicz, Z. (eds.) Parameter Setting in Evolutionary
Algorithms. Springer, Berlin (2007)
92. Mezura-Montes, E., Velazquez-Reyes, J., Coello Coello, C.A.: Modified differential
evolution for constrained optimization. In: Yen, G.G., Lucas, S.M., Fogel, G.,
Kendall, G., Salomon, R., Zhang, B.-T., Coello Coello, C.A., Runarsson, T.P.
(eds.) Proceedings of the 2006 IEEE Congress on Evolutionary Computation,
Vancouver, July 2006, pp. 25-32. IEEE Press, Los Alamitos (2006)
93. Muhlenbein, H.: How genetic algorithms really work: Mutation and hillclimbing.
In: Proceedings of the 2th Conference on Parallel Problem Solving from Nature -
PPSN II, pp. 15-26 (1992)
94. Michalewicz, Fogel, D.B.: How to Solve It: Modern Heuristics. Springer, Berlin
(2000)
95. Mitchell, M., Holland, J.H., Forrest, S.: When will a genetic algorithm outperform
hill climbing. In: Cowan, J.D., Tesauro, G., Alspector, J. (eds.) Advances in Neural
Information Processing Systems, vol. 6, pp. 51-58. Morgan Kaufmann Publishers,
Inc., San Francisco (1994)
96. Montes, E.M., Coello Coello, C.A.: A simple multi-membered evolution strategy
to solve constrained optimization problems. IEEE Transactions on Evolutionary
Computation 9(1), 1-17 (2005)
97. Nannen, V., Eiben, A.: A method for parameter calibration and relevance estima-
tion in evolutionary algorithms. In: Proceedings of the 8th conference on Genetic
and evolutionary computation - GECCO, pp. 183-190. ACM Press, New York
(2006)
98. Nannen, V., Eiben, A.: Relevance estimation and value calibration of evolutionary
algorithm parameters. In: IJCAI, pp. 975-980 (2007)
99. Nelder, J., Mead, R.: A simplex method for function minimization. The Computer
Journal 7, 308-313 (1964)
100. Ocenasek, J., Kern, S., Hansen, N., Koumoutsakos, P.: A mixed bayesian opti-
mization algorithm with variance adaptation. In: Yao, X., Burke, E.K., Lozano,
J.A.,Smith,J.,Merelo-Guervos, J.J., Bullinaria, J.A., Rowe, J.E., Tino, P.,
Kaban, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 352-361.
Springer, Heidelberg (2004)
101. Ostermeier, A., Gawelczyk, A., Hansen, N.: A derandomized approach to self
adaptation of evolution strategies. Evolutionary Computation 2(4), 369-380
(1994)
102. Ostermeier, A., Gawelczyk, A., Hansen, N.: A derandomized approach to self
adaptation of evolution strategies. Evolutionary Computation 2(4), 369-380
(1995)
103. Paredis, J.: Co-evolutionary constraint satisfaction. In: Davidor, Y., Manner, R.,
Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 46-55. Springer, Heidelberg
(1994)
104. Parmee, I.C., Purchase, G.: The development of a directed genetic search tech-
nique for heavily constrained design spaces. In: Parmee, I.C. (ed.) Proceedings of
the Conference on Adaptive Computing in Engineering Design and Control 1994,
pp. 97-102. University of Plymouth, Plymouth (1994)
105. Pelikan, M., Goldberg, D.E., Tsutsui, S.: Getting the best of both worlds: discrete
and continuous genetic and evolutionary algorithms in concert. Inf. Sci. 156(3-4),
147-171 (2003)