A New Optimization Algorithm Based on Search and Rescue Operations

Algorithm 1

Pseudocode of the search and rescue optimization algorithm (SAR).

(1)	Begin:
(2)	Randomly initialize a population of 2N solutions uniformly distributed in the range [], j = 1, …, D
(3)	Sort the solutions in the decreasing order and find the best position (Xbest)
(4)	Use the first half of the sorted solutions for human position matrix (X) and the others for memory matrix (M)
(5)	Define the algorithm parameters (SE, MU) and set USNi = 0 where i = 1, …, N
(6)	While stop criterion is not satisfied do
(7)	For i = 1 to N do
	Social phase
(8)
(9)
(10)
(11)
(12)	For j = 1 to D do
(13)
(14)
(15)	End For
(16)
(17)
(18)
	Individual phase
(19)
(20)
(21)	For j = 1 to D do
(22)
(23)	End For
(24)
(25)
(26)
(27)	If do
(28)	For j = 1 to D do
(29)
(30)	End for
(31)
(32)	End If
(33)	End for
(34)	Find the current best position and update Xbest
(35)	End while
(36)	Return Xbest
(37)	End