Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net

Algorithm 2

Calculating for each mass.

while ((K_best[l] >= 0) && (number <= mass_num))

   {

 R = Math.Sqrt((Math.Pow((Loc_arr[0, k_best_T] −

 Loc_arr [0,𝑘]), 2) + Math.Pow((Loc_arr[1, k_best_T] −

 Loc_arr [1,𝑘]), 2)));

 F_arr [0,𝑘] = F_arr [0,𝑘] + ((rand_obj.Next(100)/100.0) _* G _*

 (Math.Abs((hiu_mass[k_best_T] − hiu_mass[k])) /

 (R + E))*Math.Abs(Loc_arr[0,k_best_T] − Loc_arr [0,𝑘]));

 }

 A_mass = F_arr [0,𝑘]/hiu_mass[k];

 V_arr [0,𝑘] = ((rand_obj.Next(100)/100.0)*V_arr [0,𝑘]) + A_mass;

 x_temp = (Loc_arr [0,𝑘] + Math.Round(V_arr [0,𝑘]));