Skip to main content
  • 232 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Holland J H, ‘Adaption in Natural and Artificial Systems’, University of Michigan Press, 1975.

    Google Scholar 

  2. 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 

  3. Giles P A, ‘Iterated Function Systems and Shape Representation’, PhD Thesis, University of Durham, 1990.

    Google Scholar 

  4. 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 

  5. 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 

  6. Barnsley M F, Ervin V, Hardin D and Lancaster J, ‘Solution of an Inverse Problem for Fractals and other Sets’, Proc. Nat. Acad. Science USA, vol 83, pp 1975–1977, Apr. 1986.

    Article  MathSciNet  MATH  Google Scholar 

  7. Barnsley M F, ‘Fractals Everywhere’, Academic Press, 1988.

    Google Scholar 

  8. Booker L, ‘Improving Search in Genetic Algorithms’, in Genetic Algorithms and Simulated Annealing, ed Davis L., Pitman 1987.

    Google Scholar 

  9. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag/Wien

About this paper

Cite this paper

Garigliano, R., Purvis, A., Giles, P.A., Nettleton, D.J. (1993). An Adaptive Plan. In: Albrecht, R.F., Reeves, C.R., Steele, N.C. (eds) Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7533-0_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-7533-0_49

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82459-7

  • Online ISBN: 978-3-7091-7533-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics