IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-032-00385-0_35.html
   My bibliography  Save this book chapter

Time Complexity Analysis of Stochastic Search Algorithms

In: Handbook of Heuristics

Author

Listed:
  • Pietro S. Oliveto

    (Southern University of Science and Technology, Department of Computer Science and Engineering)

Abstract

Theoretical analyses of stochastic search algorithms, albeit few, have always existed since these algorithms became popular. Starting in the 1990s, a systematic approach to analyze the performance of stochastic search heuristics has been put in place. This quickly increasing basis of results allows, nowadays, the analysis of sophisticated algorithms such as population-based evolutionary algorithms, ant colony optimization and artificial immune systems. Results are available concerning problems from various domains including classical combinatorial and continuous optimization, single- and multi-objective optimization, and noisy and dynamic optimization as well as more advanced applications in emerging technologies such as automated algorithm configuration, automated algorithm design, and genetic programming. This chapter introduces the mathematical techniques that are most commonly used in the runtime analysis of stochastic search heuristics in discrete search spaces. Careful attention is given to the very popular artificial fitness levels and drift analysis techniques for which several variants are presented. To aid the reader’s comprehension of the presented mathematical methods, these are applied to the analysis of simple evolutionary algorithms for artificial example functions. The chapter is concluded by providing references to more complex applications and further extensions of the techniques for the obtainment of advanced results.

Suggested Citation

  • Pietro S. Oliveto, 2025. "Time Complexity Analysis of Stochastic Search Algorithms," Springer Books, in: Rafael Martí & Panos M. Pardalos & Mauricio G.C. Resende (ed.), Handbook of Heuristics, edition 0, chapter 37, pages 1131-1172, Springer.
    • Handle: RePEc:spr:sprchp:978-3-032-00385-0_35
    DOI: 10.1007/978-3-032-00385-0_35
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-032-00385-0_35. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.