If we compare simple 1+1 evolutionary algorithm (e.g. Droste, Jansen, and Wegener, 2002)
1+1 evolutionary algorithm
- Set $p_m := 1/n$.
- Choose randomly an initial bit string $x \in \{0,1\}^n$.
- Repeat the following mutation step:
Compute $x'$ by flipping independently each bit $x_i$ with probability $p_m$.
Replace $x$ by $x'$ iff $f(x') \geq f(x)$.
Metropolis algorithm
- Set arbitrary $x_0$.
- Repeat the following steps:
Generate $x'$ from candidate distribution $q(x'|x_i)$.
Set $\alpha = f(x') / f(x_i)$.
Set $p = \max (\alpha, 1)$.
$x_{i+1} = \begin{cases} x' & \text{ with probability } & p \\ x_{i} & \text{ with probability } & 1-p \end{cases}$
they seem to be very similar. Metropolis is sometimes mentioned in introductory chapters of books on evolutionary algorithms (e.g. here for some Google example), however is not called as an evolutionary algorithm.
Can be Metropolis considered as an evolutionary algorithm? If not, why not?
Droste, S., Jansen, T., and Wegener, I. (2002). On the analysis of the (1 + 1) evolutionary algorithm. Theoretical Computer Science, 276, 51–81.