Skip to main content

Stochastic Search Algorithms

  • Chapter
  • 1532 Accesses

Part of the Natural Computing Series book series (NCS)

Abstract

We want to analyze bio-inspired computation methods in a rigorous way with respect to their runtime behavior. As these algorithms make use of many random decisions, we treat them as randomized algorithms to study their behavior in a rigorous manner. The term stochastic search algorithms stresses this point of view and will be used in the following to point out that bio-inspired computation methods can be treated as algorithms which are based on random decisions. Mainly we will consider stochastic search algorithms belonging to the field of evolutionary computation throughout this book. These algorithms are inspired by the evolution process in nature and follow Darwin’s principle of the survival of the fittest. We take a closer look at the different approaches developed in this field in Section 3.1. Another kind of bio-inspired stochastic search algorithm is ant colony optimization, which will be introduced in Section 3.2. Here, solutions for a given problem are constructed by walks of ants on a so-called construction graph. To give a more complete picture, we describe other popular variants in Section 3.3.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-16544-3_3
  • Chapter length: 12 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   54.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-16544-3
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   69.99
Price excludes VAT (USA)
Hardcover Book
USD   99.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Carsten Witt .

Rights and permissions

Reprints and Permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Neumann, F., Witt, C. (2010). Stochastic Search Algorithms. In: Bioinspired Computation in Combinatorial Optimization. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16544-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16544-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16543-6

  • Online ISBN: 978-3-642-16544-3

  • eBook Packages: Computer ScienceComputer Science (R0)