A Schema Theorem-Type Result for Multidimensional Crossover
Most of the genetic algorithms (GAs) used in practice work on linear chromosomes (e.g. binary strings or sequences of some other types of symbols). However some results have been published revealing that for certain problems multidimensional encoding and crossover may give better results than the one dimensional (linear) ones [1, 2, 3]. While some theoretical results have been obtained, no clear criteria are known for deciding the suitable dimensionality of the encoding to be used for a given problem.
In this paper we consider a class of problems for which we define a multidimensional encoding and a corresponding genetic operator. We show that for a genetic algorithm (GA) using this encoding and operator we can obtain theoretical results similar to (under certain conditions even better than) those known for linear encoding. We demonstrate these theoretical results using a set of test examples.
KeywordsGenetic Algorithm Crossover Operator Crossover Point Linear Chromosome Disruption Probability
Unable to display preview. Download preview PDF.
- C.A. Anderson, K.F. Jones, and J. Ryan. A two-dimensional genetic algorithm for the ising problem. Complex Systems, 1991.Google Scholar
- M. E. Balázs. Genetic Algorithms Theory and Applications. PhD thesis, Babeş-Bolyai University, Romania, 1994.Google Scholar
- T.N. Bui and B.R. Moon. On multi-dimensional encoding/crossover. In Proceedings of the Sixth International Conference on Genetic Algorithms, 1995.Google Scholar
- L. Davis, editor. Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991.Google Scholar
- D.A. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.Google Scholar
- J.H. Holland. Adaptation in the Natural and Artificial Systems. Ann Arbor: University of Michigan Press, 1975.Google Scholar
- A.B. Khang and B.R. Moon. Toward more powerful recombinations. In Proceedings of the Sixth International Conference on Genetic Algorithms, 1995.Google Scholar