Lightweight APIT with Bat Optimization with Simulated Annealing Localization for Resource-Constrained Sensor Networks

Pseudocode 2

Simulated annealing algorithm.

S1 = an initial solution is set

T = an initial temperature is set

REPEAT

REPEAT

S2 = neighbour of the node S1 is identified

UNTIL a criteria is established by the node S2

ΔE = obj( S2 ) – obj( S1)

IF ( ΔE>0 ) THEN // Noe S2 is chosen as better than node S1

S1 = S2

ELSE with probability EXP( ΔE/ T )

S1 = S2

END IF

Decrease T

UNTIL the stop criteria

End