Skip to main content

Dynamic Control of Adaptive Parameters in Evolutionary Programming

  • Conference paper
  • First Online:
Book cover Simulated Evolution and Learning (SEAL 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1585))

Included in the following conference series:

Abstract

Evolutionary programming (EP) has been widely used in numerical optimization in recent years. The adaptive parameters, also named step size control, in EP play a significant role which controls the step size of the objective variables in the evolutionary process. However, the step size control may not work in some cases. They are frequently lost and then make the search stagnate early. Applying the lower bound can maintain the step size in a work range, but it also constrains the objective variables from being further explored. In this paper, an adaptively adjusted lower bound is proposed which supports better fine-tune searches and spreads out exploration as well.

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. D.B. Fogel. A comparison of evolutionary programming and genetic algorithms on selected constrained optimization problems. Simulation, 64(6):397–404, 1995.

    Article  Google Scholar 

  2. D.B. Fogel. Applying evolutionary programming to selected control problems. Computers & Mathematics with Applications, 27(11):89–104, 1994.

    Article  MATH  Google Scholar 

  3. X. Yao and Y Liu. Fast evolutionary programming. In L.J. Fogel, P.J. Angeline, and T. Bäck, editors, Evolutionary Programming V: Proc. of the Fifth Annual Conference on Evolutionary Programming, pages 451–460, Cambridge, MA, 1996. MIT Press.

    Google Scholar 

  4. K.-H. Liang, X. Yao, C. Newton, and D. Hoffman. Solving cutting stock problems by evolutionary programming. In V.W. Porto, N. Saravanan, D. Waagen, and A.E. Eiben, editors, Evolutionary Programming VII: Proc. of the Seventh Annual Conference on Evolutionary Programming, volume 1447 of Lecture Notes in Computer Science, pages 755–764, New York, 1998. Springer.

    Google Scholar 

  5. T. Bäck and H.-P. Schwefel. An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation, 1(1):1–23, 1993.

    Article  Google Scholar 

  6. T. Bäck. Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University, New York, 1996.

    MATH  Google Scholar 

  7. P.J. Angeline. Adaptive and self-adaptive evolutionary computation. In Y. Palaniswami, R. Attikiouzel, R. Marks, D. Fogel, and T. Fukuda, editors, Computation Intelligence: A Dymanic System Perspective, pages 152–163, Piscataway, NJ, 1995. IEEE Press.

    Google Scholar 

  8. K.-H. Liang, X. Yao, Y. Liu, C. Newton, and D. Hoffman. An experimental investigation of self-adaptation in evolutionary programming. In V.W. Porto, N. Saravanan, D. Waagen, and A.E. Eiben, editors, Evolutionary Programming VII: Proc. of the Seventh Annual Conference on Evolutionary Programming, volume 1447 of Lecture Notes in Computer Science, pages 291–300, New York, 1998. Springer.

    Google Scholar 

  9. H.-P. Schwefel. Evolution and Optimum Seeking. Wiley, New York, 1995.

    Google Scholar 

  10. D.B. Fogel, L.J. Fogel, and J.W. Atmar. Meta-evolutionary programming. In R.R. Chen, editor, Proc. of the 25th Asilomar Conference on Signals, Systems and Computers, pages 540–545, San Jose, CA, 1991. Maple Press.

    Google Scholar 

  11. H.-G. Beyer. Toward a theory of evolution strategies: Self-adaptation. Evolutionary Computation, 3(3):311–348, 1995.

    Article  Google Scholar 

  12. H.J. Larson. Introduction to Probability Theory and statistical Inference. Wiley, New York, third edition, 1982.

    MATH  Google Scholar 

  13. W. Feller. An Introduction to Probability Theory and Its Applications, volume 1. Wiley, New York, third edition, 1968.

    MATH  Google Scholar 

  14. X. Yao, G. Lin, and Y Liu. An analysis of evolutionary algorithms based on neighbourhood and step sizes. In P.J. Angeline, R.G. Reynolds, J.R. McDonnell, and R Eberhart, editors, Evolutionary Programming VI: Proc. of the Sixth Annual Conference on Evolutionary Programming, volume 1213 of Lecture Notes in Computer Science, pages 297–307, New York, 1997. Springer.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liang, KH., Yao, X., Newton, C. (1999). Dynamic Control of Adaptive Parameters in Evolutionary Programming. In: McKay, B., Yao, X., Newton, C.S., Kim, JH., Furuhashi, T. (eds) Simulated Evolution and Learning. SEAL 1998. Lecture Notes in Computer Science(), vol 1585. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48873-1_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-48873-1_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65907-5

  • Online ISBN: 978-3-540-48873-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics