Dingo Optimizer: A Nature-Inspired Metaheuristic Approach for Engineering Problems

Algorithm 1

Dingo optimizer (DOX).

Input: The population of dingoes (n = 1, 2, …, n)
Output: The best dingo. (Here, the best values is minimum)
(1)	Generate initial search agents
(2)	Initialize the value of , and .
(3)	While Termination condition not reached do
(4)	Evaluate each dingo’s fitness and intensity cost.
(5)	= Dingo with the best search
(6)	= Dingo with the second best search
(7)	= Dingoes search results afterwords
(8)	Iteration1
(9)	repeat
(10)	for i = 1: do
(11)	Renew the latest search agent status.
(12)	endfor
(13) Estimate the fitness and intensity cost of dingoes.
(14) Record the value of , ,
(15) Record the value of , , and .
(16) Iteration = Iteration +1
(17) check if, Iteration Stopping criteria
(18) output
(19)	endwhile