Algorithm 1: Proposed IDOX
Input: Hidden neuron count in BiLSTM is given as $H{d}_i^{Bilstm}$. Output: Optimal range of hidden neuron count.
Generating algorithm Begin Initialize dingo population and parameters
Initialize the current best solution based on a fitness function
For all solution
Assign fitness for entire individuals
Allocate constraints to the solutions
	Update group attack by Equation (5)
	Update persecution by Equation (6)
	Update scavenger by Equation (7)
	Update survival rate by Equation (8)
	Final updating takes place by Equation (4)
	Find the accurate solution
End