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

Algorithm 3

Crossover operator.

Require: Two selected individuals 𝑥 and 𝑦;

Ensure: A new offspring 𝑧;

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

(2)   if  𝑥_𝑖=𝑦_𝑖  then

(3)    Let 𝑧_𝑖=𝑥_𝑖.

(4)   else

(5)    𝑧_𝑖 takes value 0 or 1 randomly.

(6)   end if

(7) end for

(8) return  𝑧 as a new offspring.