Changeset 15493 for branches/CFSAP/HeuristicLab.Problems.Scheduling.CFSAP/3.3/CFSAP.cs

Timestamp:

12/05/17 13:35:20 (6 years ago)

Author:

abeham

Message:

#2747: Implemeted hard-coded genetic algorithm for faster evaluation

File:

• branches/CFSAP/HeuristicLab.Problems.Scheduling.CFSAP/3.3/CFSAP.cs (modified) (2 diffs)

branches/CFSAP/HeuristicLab.Problems.Scheduling.CFSAP/3.3/CFSAP.cs

@@ -108 +108 @@
       var order = individual.Permutation("sequence");
       var assignment = individual.BinaryVector("assignment");
-      int T = EvaluateAssignement(order, assignment.Select(x => x ? 1 : 0).ToArray(),
-        ProcessingTimesParameter.Value, SetupTimesParameter.Value);
-      return T;
+      return Evaluate(order, assignment);
+    }
+
+    public int Evaluate(Permutation order, BinaryVector assignment) {
+      return EvaluateAssignement(order, assignment, ProcessingTimes, SetupTimes);
     }
 
@@ -130 +132 @@
           int operation = order[i];
           if (assignment[operation] == machine) {
+            if (first == -1)
+              first = operation;
+            else
+              T += setupTimes[machine][last, operation];
+            last = operation;
+          }
+        }
+        if (last != -1 && first != -1)
+          T += setupTimes[machine][last, first];
+      }
+
+      return T;
+    }
+
+    //Function to evaluate individual with the specified assignment
+    public static int EvaluateAssignement(Permutation order, BinaryVector assignment, IntMatrix processingTimes, ItemList<IntMatrix> setupTimes) {
+      if (processingTimes.Rows != 2) throw new ArgumentException("Method can only be used when there are two machines.", "assignment");
+      var N = order.Length;
+      int T = 0;
+
+      for (int i = 0; i < N; i++) {
+        int operation = order[i];
+        int machine = assignment[operation] ? 1 : 0;
+        T += processingTimes[machine, operation];
+      }
+
+      for (int machine = 0; machine < 2; machine++) {
+        int first = -1;
+        int last = -1;
+        for (int i = 0; i < N; i++) {
+          int operation = order[i];
+          if ((assignment[operation] ? 1 : 0) == machine) {
             if (first == -1)
               first = operation;