Skip to main content

Recorded step directional mutation for faster convergence

  • Conference paper
  • First Online:
Evolutionary Programming VII (EP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1447))

Included in the following conference series:

  • 172 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. David B. Fogel; Larry J. Fogel; J. Wirt Atmar. Meta-evolutionary programming. In R. R. Chen, editor, Proceedings of the 25th Asilomar Conference on Signals, Systems and Computers, pages 542–545. Pacific Grove, CA, 1991.

    Google Scholar 

  2. H.J. Bremermann and M. Rogson. An evolution-type search method on convex sets. Technical Report ONR Technical Report, Contracts 222(85) AND 3656(58), ONR, 1964.

    Google Scholar 

  3. H.J. Bremermann and M. Rogson. Search by evolution. In M. Maxfield, A. Callahan, and L. Fogel, editors, Biophysics and Cybernetic Systems, pages 157–167. Spartan Books, Washington D.C., 1965.

    Google Scholar 

  4. G. S. Fishman and V. G. Kulkarni. Improving monte carlo efficiency by increasing variance. Management Science, 38(10):1432–1444, 1992.

    Google Scholar 

  5. David B. Fogel; Larry J. Fogel; J. Wirt Atmar; Gary B. Fogel. Hierarchic methods of evolutionary programming. In Proc. of the First Annual Conference on Evolutionary Programming, Evolutionary Programming Society, San Diego, CA, 1992.

    Google Scholar 

  6. David B. Fogel. Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, New York, NY, 1995.

    Google Scholar 

  7. David B. Fogel. A preliminary investigation into directed mutations in evolutionary algorithms. In H.-M. Voigt, W Ebeling, I. RechenBerg, and H.-P. Schwefel, editors, PPSN4, pages 329–335. Springer Verlag, Berlin, 97.

    Google Scholar 

  8. H.-P. Schwefel. Numerical Optimization of Computer Models. John Wiley, Chichester, UK, 1981.

    Google Scholar 

  9. A.V. Sebald. On exploiting the global information generated by evolutionary programs. In Proc. of the First Annual Conference on Evolutionary Programming, Evolutionary Programming Society, San Diego, CA, 1992.

    Google Scholar 

  10. H. H. Szu and R. L. Hartley. Nonconvex optimization by fast simulated annealing. Proceedings of the IEEE, 75:1538–1540, 1987.

    Google Scholar 

  11. Xin Yao. Simulated annealing with extended neighborhood. International Journal of Computer Mathematics, 40:169–189, 1991.

    Google Scholar 

  12. Xin Yao. A new simulated annealing algorithm. International Journal of Computer Mathematics, 56:161–168, 1995.

    Google Scholar 

  13. Xin Yao and Yong Liu. Fast evolutionary programming. In Evolutionary Programming, V. MIT Press, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

V. W. Porto N. Saravanan D. Waagen A. E. Eiben

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dunning, T. (1998). Recorded step directional mutation for faster convergence. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds) Evolutionary Programming VII. EP 1998. Lecture Notes in Computer Science, vol 1447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0040808

Download citation

  • DOI: https://doi.org/10.1007/BFb0040808

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64891-8

  • Online ISBN: 978-3-540-68515-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics