A Genetic Algorithm with Fuzzy Crossover Operator and Probability

Algorithm 1

Initial population (source: Chu and Beasley [27]).

Let: S is a bit string belong to {𝟎,𝟏}^𝐧.

Let: 𝐑_𝐢 = accumulated resources of constraint 𝐢 in S.

for 𝐤=𝟏 to 𝐍  do

  set 𝐱_𝐤𝐣←𝟎,∀𝐣∈𝐉;

  set 𝐓←𝐉 (T is a dummy set);

  randomly select a 𝐣∈𝐓 and set 𝐓←𝐓−𝐣;

  while 𝐑_𝐢+𝐰_𝐢𝐣≤𝐜_𝐢;∀𝐢∈𝐈 do

     set 𝐱_𝐤𝐣←𝟏;

     set 𝐑_𝐢←𝐑_𝐢+𝐰_𝐢𝐣,∀𝐢∈𝐈;

     randomly select a 𝐣∈𝐓 and set 𝐓←𝐓−𝐣;

  end while

end for