Abstract
Point mutation has no effect on almost all linear programs. In two genetic programming (GP) computers (cyclic and bit flip) we calculate the fitness evaluations needed using steepest ascent and first ascent hill climbers and evolutionary search. We describe how the average fitness landscape scales with program length and give general bounds.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
[Banzhaf et al., 1998]_Wolfgang Banzhaf, Peter Nordin, Robert E. Keller, and Frank D. Francone. Genetic Programming — An Introduction. Morgan Kaufmann.
[Clergue et al., 2002]_Fitness distance correlation and problem difficulty for genetic programming. In GECCO 2002, pp 724–732, New York, 9–13 July 2002.
[Daida et al., 2001]_Jason M. Daida, et al.. What makes a problem GP-hard? Genetic Programming and Evolvable Machines, 2(2):165–191, June 2001.
A comparative analysis of selection schemes used in genetic algorithms. In G. J. E. Rawlins, editor, FOGA, pp 69–93. Morgan Kaufmann.
Terry Jones. One operator, one landscape. Technical Report SFI TR 95-02-025, Santa Fe Institute, January 1995.
Kenneth E. Kinnear, Jr. Fitness landscapes and difficulty in genetic programming. In WCCI, pp 142–147, Orlando, 27–29 June 1994. IEEE Press.
W. B. Langdon and Riccardo Poli. Foundations of Genetic Programming. Springer-Verlag, 2002.
Convergence rates for the distribution of program outputs. In GECCO 2002, pp 812–819, New York, 9–13 July 2002. Morgan Kaufmann.
W. B. Langdon. How many good programs are there? How long are they? In Jonathan Rowe, et al. editors, FOGA VII. Morgan Kaufmann.
W. B. Langdon. The distribution of reversible functions is Normal. In Rick Riolo, editor, GP Theory and Practise. 2003. Forthcoming.
Predictive models for the breeder genetic algorithm. Evolutionary Computation, 1(1):25–49, 1993.
Concepts of inductive genetic programming. In W. Banzhaf, et al. editors, EuroGP, LNCS 1391, pp 49–60. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Langdon, W.B. (2003). Convergence of Program Fitness Landscapes. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_63
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive