Threshold Accepting Heuristic for Fair Flow Optimization in Wireless Mesh Networks

Algorithm 3

Simulated annealing.

Require: Initial solution 𝑠₁

(1)   𝑠^∗←𝑠₁

(2)  for  𝑖=1  to  𝑁  do

(3)   for  𝑡=1  to  𝑁_const  do

(4)    𝑠₂←𝑝𝑒𝑟𝑡𝑢𝑟𝑏𝑎𝑡𝑒(𝑠₁)

(5)    𝛿←𝐶(𝑠₂)−𝐶(𝑠₁)

(6)    if  𝛿≤0 or 𝑒^{−𝛿/𝑘𝜏}>random(0,1)  then

(7)     𝑠₁←𝑠₂

(8)    end if

(9)    if  𝐶(𝑠₂)<𝐶(𝑠^∗)  then

(10)    𝑠^∗←𝑠₂

(11)   end if

(12)  end for

(13)  𝜏←𝜏∗𝛼

(14) end for

(15) return  𝑠^∗