Skip to main content
SpringerLink
Log in

On Confidence Intervals for the Number of Local Optima

  • Conference paper
  • First Online:
Book cover Applications of Evolutionary Computing (EvoWorkshops 2003)

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

Included in the following conference series:

Abstract

The number of local optima is an important indicator of optimization problem difficulty for local search algorithms. Here we will discuss some methods of finding the confidence intervals for this parameter in problems where the large cardinality of the search space does not allow exhaustive investigation of solutions. First results are reported that were obtained by using these methods for NK landscapes, and for the low autocorrelation binary sequence and vertex cover problems.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Tovey, C.A.: Local Improvement on Discrete Structures. In: Aarts, E., Lenstra, J. K. (eds.): Local Search in Combinatorial Optimization. John Wiley éamp; Sons (1997) 57–90

    Google Scholar 

  2. Reeves, C.R.: The Crossover Landscape and the Hamming Landscape for Binary Search Spaces. To appear in Proc. of Foundations of Genetic Algorithms-VII. (2003)

    Google Scholar 

  3. Reeves C.R.: Fitness Landscapes and Evolutionary Algorithms. In: Fonlupt, C., Hao, J-K., Lutton, E., Ronald, E. and Schoenauer, M. (eds.): Artificial Evolution: 4th European Conference. Lecture Notes in Computer Science, Vol. 1829. Springer-Verlag, Berlin (2000) 3–20

    Google Scholar 

  4. Stadler, P.F.: Towards a Theory of Landscapes. In: Lopéz-Peña, R., Capovilla, R., García-Pelayo, R., Waelbroeck, H. and Zertuche, F. (eds.): Complex Systems and Binary Networks. Springer-Verlag, Berlin (1995) 77–163

    Google Scholar 

  5. Reeves, C.R.: Landscapes, Operators and Heuristic Search. Annals of Operations Research. 86 (1999) 473–490

    Article  MATH  MathSciNet  Google Scholar 

  6. Boese, K.D., Kahng, A.B., Muddu S.: A New Adaptive Multi-Start Technique for Combinatorial Global Optimizations. Operations Research Letters. 16 (1994) 101–113

    Article  MATH  MathSciNet  Google Scholar 

  7. Reeves, C.R.: Estimating the Number of Optima in a Landscape, Part I: Statistical Principles. Coventry University Technical Report SOR#01-03 (2001)

    Google Scholar 

  8. Garnier, J., Kallel, L.: How to Detect All Maxima of a Function? In: Proceedings of the Second EVONET Summer School on Theoretical Aspects of Evolutionary Computing (Anvers, 1999). Springer, Berlin (2001) 343–370

    Google Scholar 

  9. Reeves, C.R.: Estimating the Number of Optima in a Landscape, Part II: Experimental Investigations. Coventry University Technical Report SOR#01-04 (2001)

    Google Scholar 

  10. Eremeev, A.V., Reeves C.R.: Non-Parametric Estimation of Properties of Combinatorial Landscapes. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M. and Raidl, G. (eds.): Applications of Evolutionary Computing: Proceedings of EvoWorkshops 2002. Lecture Notes in Computer Science, Vol. 2279. Springer-Verlag, Berlin Heidelberg (2002) 31–40

    Google Scholar 

  11. Seber G.A.F.: The Estimation of Animal Abundance. Charles Griffin, London (1982)

    Google Scholar 

  12. Mood, A. M., Graybill, F.A., Boes, D.C.: Introduction to the Theory of Statistics. 3rd edn. McGraw-Hill, New York (1973)

    Google Scholar 

  13. Johnson, N.L., Kotz, S.: Discrete Distributions. Wiley, New York (1969)

    MATH  Google Scholar 

  14. Liu, C.L.: Introduction to Combinatorial Mathematics. McGraw-Hill, New York (1968)

    MATH  Google Scholar 

  15. Kauffman, S.A.: Adaptation on Rugged Fitness Landscapes. In: Lectures in the Sciences of Complexity, Vol. I of SFI studies, Addison-Wesley (1989) 619–712

    Google Scholar 

  16. Golay, M.J. E.: Series for Low-Autocorrelation Binary Sequences. IEEE Trans. Inform. Theory. 23 (1977) 43–51

    Article  MATH  Google Scholar 

  17. Johnson, D.S., Trick, M.A.: Introduction to the Second DIMACS Challenge: Cliques, Coloring, and Satisfiability. In: Johnson, D.S., Trick, M.A. (eds.): Cliques, Coloring, and Satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26. AMS (1996) 1–10

    Google Scholar 

  18. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of N P-Completeness. W.H. Freeman and Company, San Francisco (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Omsk Branch of Sobolev Institute of Mathematics, 13 Pevtsov str, 644099, Omsk, Russia

    Anton V. Eremeev

  2. School of Mathematicalé amp; Information Sciences, Coventry University, Priory Street, CV1 5FB, Coventry, UK

    Colin R. Reeves

Authors
  1. Anton V. Eremeev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Colin R. Reeves
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Engineering, University of Parma, Parco Area delle Scienze 181/a, 43100, Parma, Italy

    Stefano Cagnoni

  2. Computing Laboratory, University of Kent, Canterbury, Kent, CT2 7NF, UK

    Colin G. Johnson

  3. Dept. of Information and Communications Technologies Faculty of Computer Science, University of A Coruña, A Coruña, CP 15071, Spain

    Juan J. Romero Cardalda

  4. Dept. of Mathematics and Computer Science, Free University of Amsterdam, de Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Elena Marchiori

  5. Schol of Systems Engineering, University of Reading, PO Box 225, Whiteknights, Reading, RG6 6AY, UK

    David W. Corne

  6. AnimatLab, 8 rue du capitaine Scott, 75015, Paris, France

    Jean-Arcady Meyer  & Agnès Guillot  & 

  7. SAP AG, Neurottstrasse 16, 69190, Walldorf, Germany

    Jens Gottlieb

  8. Parallel Computing and Complex Systems Group, University of Leipzig, Augustusplatz 10/11, 04109, Leipzig, Germany

    Martin Middendorf

  9. Algorithms and Data Structures Group Institute of Computer Graphics, Vienna University of Technology, Favoritenstrasse 9-11/186, 1040, Vienna, Austria

    GĂĽnther R. Raidl

  10. School of Computing, Napier University, 219 Colinton Road, Edinburgh, EH14 1DJ, UK

    Emma Hart

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eremeev, A.V., Reeves, C.R. (2003). On Confidence Intervals for the Number of Local Optima. In: Cagnoni, S., et al. Applications of Evolutionary Computing. EvoWorkshops 2003. Lecture Notes in Computer Science, vol 2611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36605-9_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-36605-9_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00976-4

  • Online ISBN: 978-3-540-36605-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation