Research Article
Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net
Algorithm 3
Calculating and force.
l = 0; | while (k_Best[l] != −1) |
{
| if (k_Best[l] > 0) | k_Best_Temp = k_Best[l] − 1; | else | k_Best_Temp = 0; | R = (Math.Sqrt((Math.Pow((gls_Loc_Arr[k_Best_Temp] – | gls_Loc_Arr[k]),2) + | Math.Pow((gls_Loc_Arr[k_Best_Temp] − gls_Loc_Arr[k]), | 2)))); | f_Arr[k] = f_Arr[k] + ((rand_obj.Next(100)/100.0) * G * | (Math.Abs((gls_Hiu[k_Best_Temp] – gls_Hiu[k])) / | (R+E))*Math.Abs(gls_Loc_Arr[ k_Best_Temp] − | gls_Loc_Arr[k])); |
}
|
|