Algorithm 1 The RBMO
1:	Begin
2:	Initialize the relevant parameters (T, N, ε, etc.)
3:	while t < T
4:	Calculate the fitness of each search agent
5:	Update the best solution
6:	Exploration:
7:	if rand < ε
8:	Update the position of red-billed blue magpie by Equation (1)
9:	else
10:	Update the position of red-billed blue magpie by Equation (2)
11:	end if
12:	Exploitation:
13:	if rand < ε
14:	Update the position of red-billed blue magpie by Equation (4)
15:	Else
16:	Update the position of red-billed blue magpie by Equation (5)
17:	end if
18:	$\mathrm{Update} \mathrm{the} X^{\mathit{food}}\left(t\right)$ and accomplish food storage by Equation (6)
19:	end while
20:	return best solution
21:	end