2.2)
Rr2>\(\varnothing\)
\(\text{Delta}_{i,j}=\)alpha*\(\text{Delta}_{i,j}\)+\(Q_{2}\)*(\({x_{j}}_{\text{GB}}-x_{i,j}\))
(12)
The equation 11 and 12are definedin order to scape of local minimum and
provide the deviation ofthe current position.
Totally, two mentioned abovecreation with three status of new positon
are indicated in Fig 2,3 and 4.In figure \(x_{1}\),\(x_{2}\) are the
positon of agents in two dimensional of problem. General formula for our
model (what you have) is defined in the equation 13. The algorithm HPO
is presented in the Fig 5.
\(x_{\text{new}\ i,j}\)=\(x_{\text{old}\ i,j}\)+\(\text{Delta}_{i,j}\)(13)
Totally, this method is specified type of PSO algorithm. Where, by
inspired of happiness model the searching space is divided to three
spaces, which is more suitable for balancing searching and more power in
the get rid of local minimum.