Algorithm 1. Pseudocode of CMBO
Start CMBO.
	Input problem information: variables, objective function, and constraints.
	Set number of search agents (N) and iterations (T).
	Generate an initial population matrix at random.
	Evaluate the objective function.
		For t = 1:T
			Sort population matrix based on objective function value using Equations (3) and (4).
			Select population of mice $M$ using Equation (5).
			Select population of cats $C$ using Equation (6).
			Phase 1: update status of cats.
				For j = 1:Nc
				Update status of the jth cat using Equations (7)–(9).
				end
			Phase 2: update status of mice.
				For i = 1:Nm
				Create haven for the ith mouse using Equation (10).
				Update status of the ith mouse using Equations (11) and (12).
				end
		End
	Output best quasi-optimal solution obtained with the CMBO.
End CMBO