A Tabu Search-Based Memetic Algorithm for Hardware/Software Partitioning

Algorithm 4

The tabu search procedure.

Require: An initial solution 𝑥⁰.

Ensure: The best solution 𝑥^best.

(1)    Set the parameters 𝑀𝑎𝑥𝑐𝑜𝑢𝑛𝑡 and 𝑇_𝑗,𝑗=1,…,𝑛. Initiate 𝑐𝑜𝑢𝑛𝑡=0, 𝑡_𝑖=0,𝑖=1,…,𝑛, and 𝑥^best=𝑥⁰.

(2)   while  𝑐𝑜𝑢𝑛𝑡<𝑀𝑎𝑥𝑐𝑜𝑢𝑛𝑡  do

(3)   Calculate the flip gain 𝑔𝑎𝑖𝑛(𝑖,𝑥⁰),𝑖=1,…,𝑛, using (11).

(4)   𝑗 = argmax{𝑔𝑎𝑖𝑛(𝑖,𝑥⁰)|𝑡_𝑖=0 or 𝐿(𝑥⁰)−𝑔𝑎𝑖𝑛(𝑖,𝑥⁰)<𝐿(𝑥^best),𝑖=1,…,𝑛}.

(5)   Let 𝑥⁰_𝑗=1−𝑥⁰_𝑗. Rename the solution corresponding to this change as 𝑥⁰ again. Calculate 𝑇_𝑗 by (12), let 𝑡_𝑗=𝑇_𝑗.

(6)   if  𝐿(𝑥⁰)<𝐿(𝑥^best)  then

(7)    Let 𝑥^best=𝑥⁰.

(8)   end if

(9)   𝑐𝑜𝑢𝑛𝑡=𝑐𝑜𝑢𝑛𝑡+1.

(10) for  𝑖={1,…,𝑛}  do

(11)   if  𝑡_𝑖>0  then

(12)     Let 𝑡_𝑖=𝑡_𝑖−1.

(13)   end if

(14) end for

(15) if  𝑐𝑜𝑢𝑛𝑡>𝑀𝑎𝑥𝑐𝑜𝑢𝑛𝑡  then

(16)  Break.

(17) end if

(18) end while

(19) return  𝑥^best.