Abstract
It has long been recognised that the choice of recombination and mutation operators and the rates at which they are applied to a Genetic Algorithm will have a significant effect on the outcome of the evolutionary search, with sub-optimal values often leading to poor performance. In this paper an evolutionary algorithm (APES) is presented within which both the units of heredity and the probability that those units will subject to mutation are learnt via self adaptation of the genetic material. Using Kaufmann's NK model, this algorithm is compared to a number of combinations of frequently used crossover operators with “standard” mutation rates. The results demonstrate competitive times to find maxima on simple problems, and (on the most complex problems) results which are significantly better than the majority of other algorithms tested. This algorithm represents a robust adaptive search method which is not dependant on expert knowledge of genetic algorithm theory or practice in order to perform effectively.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Schaffer, J.D. & Morishima, A. (1987) “An Adaptive Crossover Distribution Mechanism for Genetic Algorithms” p36–40 in Grefenstette, J. (ed). “Proceedings of the Second International Conference on Genetic Algorithms”. Lawrence Erlbaum.
Spears, W.M. (1995) “Adapting Crossover in Evolutionary Algorithms” in Proceedings of 4th Annual Conf. on Evolutionary Computing, ed Fogel, MIT Press.
Smith, J.E. & Fogarty, T.C. (1995) “An Adaptive Poly-Parental Recombination Strategy” in “Evolutionary Computing 2” ed. Fogarty,T.C. Springer Verlag.
Smith, J.E. & Fogarty, T.C. (1995) “Recombination Strategy Adaptation via Evolution of Gene Linkage”. pp 826–831 in “Proceedings of 1996 IEEE International Conference on Evolutionary Computing”.
Syswerda G. (1989) “Uniform Crossover in Genetic Algorithms”. pp2–9 in “Proc. 3rd Int'n'l Conf. on Genetic Algorithms” ed. Schaffer, J.D. Morgan Kaufmann.
Syswerda, G. (1992) “Simulated Crossover in Genetic Algorithms” pp 239–255 in “Foundations of Genetic Algorithms” ed.Whitley 1992 Morgan Kaufmann
Bäck, T. (1991) “Self Adaptation in Genetic Algorithms”, pp 263–271 in Varela, F. & Bourgine, P. (eds.) “Towards a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life” MIT Press 1992.
Rechenberg, I. (1973) “Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution” (Frommann-Holzboog Verlag, Stuttgart).
Schweffel, H-P. (1981) “Numerical Optimization of Computer Models” (Wiley, Chichester)
Smith, J.E. & Fogarty, T.C. (1995) “Self Adaptation of Mutation Rates in a Steady State Genetic Algorithm” pp 318–323 in “Proceedings of 1996 IEEE International Conference on Evolutionary Computing”.
Kauffman, S.A. (1993) “The Origins of Order”, Oxford University Press.
Eiben, A.E., van Kemenade, C.H.M. & Kok, J.N. (1995) “Orgy in the Computer: Multi Parent Recombination in Genetic Algorithms” pp 934–945 in “Advances in Artificial Life: Proceedings of Third European Conference on Artificial Life”, eds Moran, Moreno, Merelo & Chacon, Springer Verlag
Eiben, A.E., Raue, P.-E & Ruttkay, Zs “Genetic Algorithms with Multi-parent Recombination” pp78–87, “Parallel Problem Solving from Nature 3” eds. Davidor et al. Springer Verlag.
Bull L., & Fogarty T.C. 1994 “An Evolutionary Strategy & Genetic Algorithm Hybrid: An Initial Implementation & First Results” pp 95–102 in “Evolutionary Computing ed. T.C.Fogarty (Springer Verlag)
DeJong, K. (1975) “An Analysis of the behaviour of a class of genetic adaptive systems”. PhD. thesis, University of Michigan.
Grefenstette J.J. (1986). “Optimisation of control parameters for genetic algorithms”. pp 122–128, IEEE Transactions on Systems, Man & Cybernetics, SMC-16(1)
Schaffer J.D., Caruana R., Eshelman L.J., Das R. 1989 “A Study of Control Parameters Affecting On-line Performance of Genetic Algorithms for Function Optimisation”. in “Proceedings of 3rd International Conference on Genetic Algorithms”, ed Schaffer (Morgan Kaufmann).
Mühlenbein, H. (1992) “How Genetic Algorithms really work: 1 Mutation and hillclimbing” pp 15–25. “Parallel Problem Solving from Nature 2” Männer & Manderick (eds) 1992, Elsevier, Amsterdam
Wolpert, D.H. & Macready, W.G. (1995) “No Free Lunch Theorems for Search” Tech. Report. SFI-TR-95-02-010, Santa Fe Institute, Santa Fe, NM. 1995
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smith, J.E., Fogarty, T.C. (1996). Adaptively parameterised evolutionary systems: Self adaptive recombination and mutation in a genetic algorithm. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_1008
Download citation
DOI: https://doi.org/10.1007/3-540-61723-X_1008
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61723-5
Online ISBN: 978-3-540-70668-7
eBook Packages: Springer Book Archive