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

Algorithm 6

Population updating procedure.

Require: Population 𝑃={𝑥¹,…,𝑥^𝑝}, the current best solution 𝑥^∗, and a solution 𝑥.

Ensure: Updated population 𝑃={𝑥¹,…,𝑥^𝑝}.

(1)    Calculate 𝑔(𝑥,𝑃) according to (13);

(2)   for  𝑘=1,…,𝑝  do

(3)   calculate 𝑔(𝑥^𝑘,(𝑃⧵{𝑥^𝑘})∪{𝑥}) according to (13).

(4)   end for

(5)   Let 𝑥^𝑙=argmin{𝑔(𝑥,𝑃),𝑔(𝑥^𝑘,(𝑃⧵{𝑥^𝑘})∪{𝑥}), 𝑘=1,…,𝑝}.

(6)   if  𝑥^𝑙≠𝑥  then

(7)   𝑥 is inserted into 𝑃, and 𝑥^𝑙 is deleted from 𝑃.

(8)   else

(9)   if  rand(0,1)<𝑝_𝑟  then

(10)    Let 𝑥^𝑠=argmin{𝑔(𝑥^𝑘,(𝑃⧵{𝑥^𝑘})∪{𝑥})| 𝑘=1,…,𝑝}.

(11)     𝑥 is inserted into 𝑃, and 𝑥^𝑠 is deleted from 𝑃.

(12) end if

(13) end if

(14) return  𝑃.