Diversity Controlling Genetic Algorithm for Order Acceptance and Scheduling Problem

Algorithm 1

Diversity controlling genetic algorithm.

Algorithm DCGA

Initialize parent population 𝐺_𝐹 (𝑁 individuals) and subpopulation 𝐺_𝑆 = NULL

While number of iterations < It_max and number of iterations without improvement <It_𝑛𝑖

  Add the 𝑛𝑒 fittest individuals in 𝐺_𝐹 into 𝐺_𝑆

  While the number of individuals in 𝐺_𝑆<𝑀

    Select a subgroup 𝐺_𝑚 (𝜆 individuals) without replacement through tournament selection

    Set the fittest individual in 𝐺_𝑚 as a parent 𝑃₁ and the most different individual from 𝑃₁ as parent 𝑃₂

    Generate offspring from 𝑃₁ and 𝑃₂ (crossover, mutation)

    Add the generated offspring into 𝐺_𝑆

   Select 𝑁 survivors from 𝐺_𝑆 and replace all the individuals in 𝐺_𝐹 with them

   Set 𝐺_𝑆 = NULL

  Perform local search on randomly selected 𝑛𝑙 individuals among the 30% fittest individuals in 𝐺_𝐹

Return the best feasible solution