An Adaptive Plan
This paper introduces a novel form of adaptive plan that is significantly different from current ones. The plan presented does not rely on the generation of expected numbers of solutions and as such can use a new means of sampling the solutions which are used as parents in the crossover process.
A mathematical analysis of some parts of the adaptive plan is presented followed by a discussion of some of the plan’s main advantages. Finally, the successful use of the adaptive plan in a genetic algorithm applied to a problem in shape representation is discussed.
KeywordsGenetic Algorithm Crossover Operator Binary String Premature Convergence Iterate Function System
Unable to display preview. Download preview PDF.
- Holland J H, ‘Adaption in Natural and Artificial Systems’, University of Michigan Press, 1975.Google Scholar
- Baker J E, ‘Reducing Bias and Inefficiency in the Selection Algorithm’, Genetic Algorithms and their Applications: Proc. Second Int. Conf. Genetic Algorithms, ed J.J. Grefenstette, Lawrence Erlbaum Associates, 14-21, 1987.Google Scholar
- Giles P A, ‘Iterated Function Systems and Shape Representation’, PhD Thesis, University of Durham, 1990.Google Scholar
- Garigliano R, Purvis A, Giles P A and Nettleton D J, ‘Genetic Algorithms and Shape Representation’, Proc. Second Ann. Conf. Evolutionary Programming, San Diego, USA, February 1993.Google Scholar
- Barnsley M F and Demko S, ‘Iterated Function Systems and the Global Construction of Fractals’, Proc. Royal Society London A399, pp 243-275, 1985.Google Scholar
- Barnsley M F, ‘Fractals Everywhere’, Academic Press, 1988.Google Scholar
- Booker L, ‘Improving Search in Genetic Algorithms’, in Genetic Algorithms and Simulated Annealing, ed Davis L., Pitman 1987.Google Scholar
- Davis L and Steenstrup M, ‘Genetic Algorithms and Simulated Annealing: An Overview’, in Genetic Algorithms and Simulated Annealing, ed Davis L., Pitman, 1987.Google Scholar