
194 Grasshopper Optimization Algorithm
in Section 15.5. Finally in Section 15.6 some final comments on the algorithm’s
properties are being provided.
15.2 Description of the Grasshopper Optimization
Algorithm
This chapter, as others in this monograph, deals with continuous optimization,
i.e. the task of finding a value of x – within the feasible search space S ⊂ R
D
– denoted as x
∗
such as x
∗
= argmin
x∈S
f(x), assuming that the goal is to
minimize cost function f. GOA represents a typical population based meta-
heuristics [10]. It means that the aforementioned problem is tackled with the
population consisting of P agents of the same type. Each agent is represented ...