A Hybrid Multiobjective Genetic Algorithm for Robust Resource-Constrained Project Scheduling with Stochastic Durations

Algorithm 2

Pseudocode of the local search procedure.

𝑖=1,𝑝=0,𝑚=0

while   𝑖≤populationsize  do

 𝑝= randomly generated value between the interval [0,1]

 if   𝑝≤𝑝_𝑙𝑠  then

  𝑚= randomly generated value between the interval [1,n].

  Copy the [1,𝑚] part of the individual Ind_𝑖 to the individual Ind^new_𝑖.

  Generate the [𝑚+1,𝑛] part of the individual Ind^new_𝑖 by the operator

  𝑀𝐼𝐺.

  Evaluate the individual Ind^new_𝑖.

  if  Ind^new_𝑖 dominates Ind_𝑖 then

   Replace Ind_𝑖 with Ind^new_𝑖.

  end if

 end if

 𝑖=𝑖+1

end while