A New Design of Metaheuristic Search Called Improved Monkey Algorithm Based on Random Perturbation for Optimization Problems

Algorithm 1

A novel RP is constructed of the proposed algorithm.

	Step A–D: Inputs ⟶ Step E
	global_min = −1
	for i = 1 to M do
	for j = 1 to tolX do
	d ← ceil (rand x D)
	yi ← xid (1 + p1 randn)
	if lb < yi < ub then
	Continue
	end if
	if global_min > 0 then
	|if f (yi) > f (xij) then
	|xij ← yi
	|end if
	Else
	|if f (yi) < f (xij) then
	|xij ← yi
	|end if
	end if
	end for
	end for
	for i = 1 to M do
	for j = 1 to n do
	yi ← xij (·) (1 + p2 rand [1, D])
	if lb < yi < ub then
	Continue
	end if
	if global_min > 0 then
	|if f (yi) > f (xij) then
	|xij ← yi
	|end if
	Else
	|if f (yi) < f (xij) then
	|xij ← yi
	|end if
	end if
	end for
	end for
	Output