repeat
find
𝑥
o
p
t
from
𝑃
so that
𝑓
(
𝑥
o
p
t
)
<
𝑓
(
𝑥
)
, for
∀
𝑥
∈
𝑃
repeat
𝑦
←
ℎ
(
𝑃
)
, where
𝑦
is from the search space
until
𝑓
(
𝑦
)
>
𝑓
(
𝑥
o
p
t
)
𝑥
←
𝑦
until
termination condition
Algorithm 1:
Generate population
𝑃
=
𝑥
𝑛
, that is,
𝑁
random points from the search space
X
.