Skip to main content
SpringerLink
Log in

Investigation of One-Go Evolution Strategy/Quasi-Newton Hybridizations

  • Conference paper
Hybrid Metaheuristics (HM 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4030))

Included in the following conference series:

  • 763 Accesses

Abstract

It is general knowledge that hybrid approaches can improve the performance of search heurististics. The first phase, exploration, should detect regions of good solutions, whereas the second phase, exploitation, shall tune these solutions locally. Therefore a combination (hybridization) of global and local optimization techniques is recommended. Although plausible at the first sight, it remains unclear how to implement the hybridization, e.g., to distribute the resources, i.e., number of function evaluations or CPU time, to the global and local search optimization algorithm. This budget allocation becomes important if the available resources are very limited. We present an approach to analyze hybridization in this case. An evolution strategy and a quasi-Newton method are combined and tested on standard test functions.

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

Access this chapter

Log in via an institution
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. Bäck, T.: Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York (1996)

    MATH  Google Scholar 

  2. Bartz-Beielstein, T.: Experimental analysis of evolution strategies—overview and comprehensive introduction. Interner Bericht des Sonderforschungsbereichs 531 Computational Intelligence CI–157/03, Universität Dortmund, Germany (November 2003)

    Google Scholar 

  3. Bartz-Beielstein, T.: Experimental Research in Evolutionary Computation—The New Experimentalism. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  4. Beyer, H.-G., Schwefel, H.-P.: Evolution strategies—A comprehensive introduction. Natural Computing 1, 3–52 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Broyden, C.G.: The convergence of a class of double-rank minimization algorithms. Journal of the Institute of Mathematics and Its Applications 6, 76–90 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cohen, P.R.: Empirical Methods for Artificial Intelligence. MIT Press, Cambridge (1995)

    MATH  Google Scholar 

  7. Fletcher, R.: A new approach to variable metric algorithms. Computer Journal 13, 317–322 (1970)

    Article  MATH  Google Scholar 

  8. Goldfarb, D.: A family of variable metric updates derived by variational means. Mathematics of Computing 24, 23–26 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  9. Jones, D.R., Schonlau, M., Welch, W.J.: Efficient global optimization of expensive black-box functions. Journal of Global Optimization 13, 455–492 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Krasnogor, N., Smith, J.E.: A Tutorial for Competent Memetic Algorithms: Model, Taxonomy and Design Issues. IEEE Transactions on Evolutionary Computation 5(9), 474–488 (2005)

    Article  Google Scholar 

  11. Lophaven, S.N., Nielsen, H.B., Søndergaard, J.: DACE—A Matlab Kriging Toolbox. Technical Report IMM-REP-2002-12, Informatics and Mathematical Modelling, Technical University of Denmark, Copenhagen, Denmark (2002)

    Google Scholar 

  12. More, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Transactions on Mathematical Software 7(1), 17–41 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  13. Moscato, P.: On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Technical Report Caltech Concurrent Computation Program, Report. 826, California Institute of Technology, Pasadena, California, USA (1989)

    Google Scholar 

  14. Neumaier, A.: Results for moré/garbow/hillstrom test problems (2006) (Cited Mai 19, 2006), http://www.mat.univie.ac.at/~neum/glopt/results/more/moref.html .

  15. Rosenbrock, H.H.: An automatic method for finding the greatest or least value of a function. Computer Journal 3, 175–184 (1960)

    Article  MathSciNet  Google Scholar 

  16. Sacks, J., Welch, W.J., Mitchell, T.J., Wynn, H.P.: Design and analysis of computer experiments. Statistical Science 4(4), 409–435 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  17. Santner, T.J., Williams, B.J., Notz, W.I.: The Design and Analysis of Computer Experiments. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  18. Shanno, D.F.: Conditioning of quasi-Newton methods for function minimization. Mathematics of Computing 24, 647–656 (1970)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dortmund University, 44221, Dortmund, Germany

    Thomas Bartz-Beielstein, Mike Preuss & Günter Rudolph

Authors
  1. Thomas Bartz-Beielstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mike Preuss
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Günter Rudolph
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Statistics and Computer Science, La Laguna University Spain,  

    Francisco Almeida

  2. Universitat Politècnica de Catalunya, Omega Campus Nord, Jordi Girona 1-3, 08034, Barcelona, Spain

    María J. Blesa Aguilera

  3. ALBCOM, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Spain

    Christian Blum

  4. DEIOC, Universidad de La Laguna, Escuela Técnica Superior en Ingeniería Informática, Avda. Astrofísico Francisco Sánchez, s/n, 38271, La Laguna, Tenerife, Spain

    José Marcos Moreno Vega

  5. Escuela Técnica Superior en Ingeniería Informática, Universidad de La Laguna, Avda. Astrofísico Francisco Sánchez, s/n, 38271, La Laguna, Tenerife, Spain

    Melquíades Pérez Pérez

  6. DEIS, Campus of Cesena Alma Mater Studiorum, Università di Bologna, Cesena, Italy

    Andrea Roli

  7. Université Libre de Bruxelles, IRIDIA CP 194/6, Avenue Franklin D. Roosevelt 50, 1050, Bruxelles, Belgium

    Michael Sampels

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bartz-Beielstein, T., Preuss, M., Rudolph, G. (2006). Investigation of One-Go Evolution Strategy/Quasi-Newton Hybridizations. In: Almeida, F., et al. Hybrid Metaheuristics. HM 2006. Lecture Notes in Computer Science, vol 4030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11890584_14

Download citation

  • DOI: https://doi.org/10.1007/11890584_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46384-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation