The algebra of genetic algorithms

J. Antonisse, A new interpretation of schema notation that overturns the binary coding constraint,Proc. 3rd Int. Conf. on Genetic Algorithms (Morgan Kaufmann, San Mateo, 1989).

A.D. Bethke, Genetic algorithms and function optimizers, Ph.D. Thesis, University of Michigan (1970).

C. Bridges and D.E. Goldberg, An analysis of reproduction and crossover in a binary-coded genetic algorithm,Proc. 2nd Int. Conf. on Genetic Algorithms (Lawrence Erlbaum Assoc., Hillsdale, New Jersey, 1987).

D.J. Cavicchio, Adaptive search using simulated evolution. Ph.D. Thesis, University of Michigan (1970).

L.J. Eshelman, R.A. Caruana and J.D. Schaffer, Biases in the crossover landscape,Proc. 3rd Int. Conf. on Genetic Algorithms (Morgan Kaufmann, San Mateo, 1989).

D.R. Franz, Non-linearities on genetic adaptive search, Ph.D. Thesis, University of Michigan (1972).

D.E. Goldberg and R. Lingle Jr., Alleles, loci and the traveling salesman problem,Proc. Int. Conf. on Genetic Algorithms (Lawrence Erlbaum Assoc., Hillsdale, 1985).

S. Good, Applying a genetic algorithm to a high frequency detector location problem, Technical Report (final year), Department of Computer Science, University of Edinburgh (1993).

J.H. Holland, Adaptation in natural and artificial systems (University of Michigan Press, Ann Arbor, 1975).

G.P. Jones, Parallel genetic algorithms for large travelling salesrep problems, Master's Thesis, University of Edinburgh (1992).

A. Nix and M.D. Vose, Modeling genetic algorithms with Markov chains, Ann. Math. and AI 5 (1991) 79?88.

N.J. Radcliffe and F.A.W. George, A study in set recombination, in:Genetic Algorithms: Proc. 5th Int. Conf. (GA-93), ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993).

N.J. Radcliffe, Genetic neural networks on MIMD computers, Ph.D. Thesis, University of Edinburgh (1990).

N.J. Radcliffe, Equivalence class analysis of genetic algorithms, Complex Syst. 5(2) (1991) 183?205.

N.J. Radcliffe, Forma analysis and random respectful recombination,Proc. 4th Int. Conf. on Genetic Algorithms (Morgan Kaufmann, San Mateo, 1991) pp. 222?229.

N.J. Radcliffe, Genetic set recombination, in:Foundations of Genetic Algorithms 2, ed. D. Whitley (Morgan Kaufmann, San Mateo, 1992).

N.J. Radcliffe, Genetic set recombination and its application to neural network topology optimisation, Neural Comput. Appl. 1(1) (1992).

N.J. Radcliffe, Non-linear genetic representations, in:Parallel Problem Solving from Nature 2, eds. R. Männer and B. Manderick (North-Holland, Amsterdam, 1992) pp. 259?268.

J. Shapcott, Genetic algorithms for investment portfolio selection, Technical Report EPCC-SS92-24, Edinburgh Parallel Computing Centre, University of Edinburgh (1992).

W.M. Spears and K.A. De Jong, On the virtues of parameterised uniform crossover,Proc. 4th Int. Conf. on Genetic Algorithms (Morgan Kaufmann, San Mateo, 1991) pp. 230?236.

G. Syswerda, Uniform crossover in genetic algorithms,Proc. 3rd Int. Conf. on Genetic Algorithms (Morgan Kaufmann, San Mateo, 1989).

M.D. Vose and G.E. Liepins, Punctuated equilibria in genetic search, Complex Syst. 5 (1991) 31?44.

M.D. Vose and G.E. Liepins, Schema disruption,Proc. 4th Int. Conf. on Genetic Algorithms (Morgan Kaufmann, San Mateo, 1991) pp. 237?243.

M.D. Vose, Generalizing the notion of schema in genetic algorithms, Artificial Intelligence (1991).

D. Whitley, An executable model of a simple genetic algorithm, in:Foundations of Genetic Algorithms 2, ed. D. Whitley (Morgan Kaufmann, San Mateo, 1992).