-
Notifications
You must be signed in to change notification settings - Fork 335
/
Copy pathc_stochastic.tex
41 lines (34 loc) · 2.46 KB
/
c_stochastic.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
% The Clever Algorithms Project: http://www.CleverAlgorithms.com
% (c) Copyright 2010 Jason Brownlee. Some Rights Reserved.
% This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 2.5 Australia License.
% This is a chapter
\renewcommand{\bibsection}{\subsection{\bibname}}
% \begin{bibunit}
\chapter{Stochastic Algorithms}
\label{ch:stochastic}
\index{Stochastic Algorithms}
\index{Stochastic Global Optimization}
%
% Overview
%
\section{Overview}
% high level
This chapter describes Stochastic Algorithms.
\subsection{Stochastic Optimization}
% differences
The majority of the algorithms to be described in this book are comprised of probabilistic and stochastic processes. What differentiates the `stochastic algorithms' in this chapter from the remaining algorithms is the specific lack of 1) an inspiring system, and 2) a metaphorical explanation. Both `inspiration' and `metaphor' refer to the descriptive elements in the standardized algorithm description.
% features
These described algorithms are predominately global optimization algorithms and metaheuristics that manage the application of an embedded neighborhood exploring (local) search procedure. As such, with the exception of `Stochastic Hill Climbing' and `Random Search' the algorithms may be considered extensions of the multi-start search (also known as multi-restart search). This set of algorithms provide various different strategies by which `better' and varied starting points can be generated and issued to a neighborhood searching technique for refinement, a process that is repeated with potentially improving or unexplored areas to search.
%
% Algorithms, one per section
%
\newpage\begin{bibunit}\input{a_stochastic/random_search}\putbib\end{bibunit}
\newpage\begin{bibunit}\input{a_stochastic/adaptive_random_search}\putbib\end{bibunit}
\newpage\begin{bibunit}\input{a_stochastic/hill_climbing_search}\putbib\end{bibunit}
\newpage\begin{bibunit}\input{a_stochastic/iterated_local_search}\putbib\end{bibunit}
\newpage\begin{bibunit}\input{a_stochastic/guided_local_search}\putbib\end{bibunit}
\newpage\begin{bibunit}\input{a_stochastic/variable_neighborhood_search}\putbib\end{bibunit}
\newpage\begin{bibunit}\input{a_stochastic/grasp}\putbib\end{bibunit}
\newpage\begin{bibunit}\input{a_stochastic/scatter_search}\putbib\end{bibunit}
\newpage\begin{bibunit}\input{a_stochastic/tabu_search}\putbib\end{bibunit}
\newpage\begin{bibunit}\input{a_stochastic/reactive_tabu_search}\putbib\end{bibunit}