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

141. Skinner, C., Riddle, P.J., Triggs, C.: Mathematics prevents bloat. In: Proceedings
of the IEEE Congress on Evolutionary Computation - CEC, pp. 390-395 (2005)
142. Smith, J.: Modelling gas with self adaptive mutation rates. In: Proceedings of the
Genetic and Evolutionary Computation Conference, pp. 599-606 (2001)
143. Smith, J., Fogarty, T.C.: Recombination strategy adaptation via evolution of gene
linkage. In: Proceedings of the IEEE Congress on Evolutionary Computation -
CEC, pp. 826-831 (1996)
144. Smith, J., Fogarty, T.C.: Self adaptation of mutation rates in a steady state ge-
netic algorithm. In: Proceedings of the International Conference on Evolutionary
Computation, pp. 318-323 (1996)
145. Smith, R.E.: Adaptively resizing populations: An algorithm and analysis. In: Pro-
ceedings of the 5th International Conference on Genetic Algorithms, p. 653. Mor-
gan Kaufmann Publishers Inc., San Francisco (1993)
146. Snyder, L., Daskin, M.: A random-key genetic algorithm for the generalized trav-
eling salesman problem. Technical report, Department of Industrial Engineering
and Management Sciences, Northwestern University (2001)
147. Spears, W.M.: Adapting crossover in evolutionary algorithms. In: McDonnell,
J.R., Reynolds, R.G., Fogel, D.B. (eds.) Proceedings of the Fourth Annual Confer-
ence on Evolutionary Programming, pp. 367-384. MIT Press, Cambridge (1995)
148. Stone, C., Smith, J.: Strategy parameter variety in self-adaptation of mutation
rates. In: Proceedings of the Genetic and Evolutionary Computation Conference -
GECCO, pp. 586-593. Morgan Kaufmann Publishers Inc., San Francisco (2002)
149. Suganthan, P.N., Hansen, N., Liang, J.J., Deb, K., Chen, Y.P., Auger, A., Tiwari,
S.: Problem definitions and evaluation criteria for the CEC 2005 special session on
real-parameter optimization. Technical report, Nanyang Technological University
(May 2005)
150. Surry, P.D., Radcliffe, N.J., Boyd, I.D.: A multi-objective approach to constrained
optimisation of gas supply networks: The COMOGA Method. In: Fogarty, T.C.
(ed.) Evolutionary Computing. AISB Workshop. Selected Papers. LNCS, pp. 166-
180. Springer, Berlin (1995)
151. Syswerda, G.: Simulated crossover in genetic algorithms. In: Proceedings of the
FOGA, pp. 239-255 (1992)
152. Takahama, T., Sakai, S.: Constrained optimization by the epsilon constrained
differential evolution with gradient-based mutation and feasible elites. 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, pp. 1-8. IEEE Press, Los Alamitos (2006)
153. Ting, C.-K.: An analysis of the effectiveness of multi-parent crossover. 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. 130-139. Springer, Berlin (2004)
154. Tomassini, M. (ed.): Spatially Structured Evolutionary Algorithms: Artificial Evo-
lution in Space and Time. Springer, Heidelberg (2005)
155. Vose, M.: The simple genetic algorithm. MIT Press, Cambridge (1999)
156. Weaver, R.F.: Molecular Biology. McGraw-Hill Higher Education, New York
(2005)
157. Weinberg, R.: Computer simulation of a living cell. PhD thesis, University of
Michigan (1970)