Use of Genetic Algorithm for Cohesive Summary Extraction to Assist Reading Difficulties

Algorithm 2

Modified Crossover.

(1)  procedure  CROSSOVER  𝜉^𝑡_𝐴,𝜉^𝑡_𝐵 ⊳ The crossover of chromosome A and B

(2)  Input: 𝜉^𝑡_𝐴,𝜉^𝑡_𝐵         ⊳ Chromosomes before crossover

(3)  Output: 𝜉^𝑡_𝑎,𝜉^𝑡_𝑏         ⊳ Chromosomes after crossover

(4)  while   𝑖=1   do       ⊳ for the entire size of chromosome

(5)   if  (𝜉_𝐴[𝑖]==𝜉_𝐵[𝑖])  then ⊳ check the bit positions of chromosomes

(6)      𝑚𝑎𝑡𝑐ℎ𝑙𝑖𝑠𝑡←𝑖        ⊳ store the values in a list

(7)   else

(8)    𝑖←𝑖+1

(9)   end if

(10)  end while

(11)  𝑠←𝑅𝑎𝑛𝑑𝑜𝑚(𝑚𝑎𝑡𝑐ℎ𝑙𝑖𝑠𝑡)   ⊳ Select a random bit position from list

(12)  for  𝑖←1,𝑠  do

(13)    𝜉_𝑎^𝑡+1[𝑖]=𝜉^𝑡_𝐴[𝑖]   ⊳ Copy partial values of parent(A) to child(a)

(14)    𝜉_𝑏^𝑡+1[𝑖]=𝜉^𝑡_𝐵[𝑖]   ⊳ Copy partial values of parent(B) to child(b)

(15)  end for

(16)   for  𝑖←𝑠,𝑁   do

(17)   𝜉_𝑎^𝑡+1[𝑖]=𝜉^𝑡_𝐵[𝑖]   ⊳ Copy remaining values of parent(B) to child(a)

(18)    𝜉_𝑏^𝑡+1[𝑖]=𝜉^𝑡_𝐴[𝑖]   ⊳ Copy remaining values of parent(A) to child(b)

(19)  end for

(20)  return  𝜉_𝑎^𝑡+1,𝜉_𝑏^𝑡+1           ⊳ Chromosome after crossover

(21)  end procedure