Diversity Controlling Genetic Algorithm for Order Acceptance and Scheduling Problem

Algorithm 2

Survival selection.

Algorithm Survival Selection

Sort individuals in 𝐺_𝑠 by fitness descending;

Set 𝐺_𝐹=NULL

Initialize a Boolean array needRemove[𝑖] = false, 𝑖=1,…,𝑀;

For 𝑖=1 to 𝑀

  If needRemove[𝑖] continue;

  For 𝑗=𝑖+1 to 𝑀

    If needRemove[𝑗] continue;

    If fitness of individual 𝑖 > fitness of individual 𝑗 continue;

    If diff(indiv𝑖,indiv𝑗)<𝜀

     needRemove[𝑗] = true;

      𝑀=𝑀−1;

  If (number of individuals in 𝐺_𝐹<𝑁 and needRemove[𝑖] = false)

    Add individual 𝑖 to 𝐺_𝐹

While (number of individuals in 𝐺_𝐹<𝑁)

  Randomly generate a new individual and add it to 𝐺_𝐹