Threshold Accepting Heuristic for Fair Flow Optimization in Wireless Mesh Networks

Algorithm 1

Creating the list of threshold values.

Require: Initial solution 𝑠₁, list size 𝑆, set of move operators 𝑚∈𝑀

(1)   𝑖←0

(2)  while  𝑖<𝑁  do

(3)   𝑚← random(𝑀)

(4)   𝑠₂←𝑚(𝑠₁)

(5)   if  𝐶(𝑠₁)≤𝐶(𝑠₂)  then

(6)    Δ←(𝐶(𝑠₂)−𝐶(𝑠₁))/𝐶(𝑠₁)

(7)    list←list∪{Δ}

(8)    𝑖←𝑖+1

(9)   else

(10)   𝑠₁←𝑠₂

(11)  end if

(12) end while

(13) return  list