*3.2. Step More toward the Location of the Best Solution*

The search agents are moved in the direction of the finest neighbors after successfully preventing a conflict with the neighbors:

$$
\stackrel{\rightarrow}{PD} = \left| \stackrel{\rightarrow}{\text{FS}} - rand \times \stackrel{\rightarrow}{P}\_p(\mathfrak{x}) \right| \tag{8}
$$

where → *PD* is the total distance between the search agent and food source, *rand* is the random number in the range [0,1], *x* indicates the current iteration, → *FS* indicates the position of the food source, and → *Pp*(*x*) is the position of the tunicates.
