Changeset 17710 for branches/2521_ProblemRefactoring/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/ConstraintRelaxation

Timestamp:

08/03/20 15:50:59 (4 years ago)

Author:

abeham

Message:

#2521: working on VRP

Location:

branches/2521_ProblemRefactoring/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/ConstraintRelaxation

Files:

• Capacitated/CapacityRelaxationVRPAnalyzer.cs (modified) (7 diffs)
• PickupAndDelivery/PickupViolationsRelaxationVRPAnalyzer.cs (modified) (7 diffs)
• TimeWindowed/TimeWindowRelaxationVRPAnalyzer.cs (modified) (7 diffs)

branches/2521_ProblemRefactoring/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/ConstraintRelaxation/Capacitated/CapacityRelaxationVRPAnalyzer.cs

@@ -20 +20 @@
 #endregion
 
+using HEAL.Attic;
 using HeuristicLab.Common;
 using HeuristicLab.Core;
@@ -26 +27 @@
 using HeuristicLab.Optimization;
 using HeuristicLab.Parameters;
-using HEAL.Attic;
 using HeuristicLab.Problems.VehicleRouting.Interfaces;
+using HeuristicLab.Problems.VehicleRouting.ProblemInstances;
 using HeuristicLab.Problems.VehicleRouting.Variants;
 
@@ -43 +44 @@
       get { return (ScopeTreeLookupParameter<IVRPEncodedSolution>)Parameters["VRPTours"]; }
     }
-    public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
-      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
-    }
-
-    public ScopeTreeLookupParameter<DoubleValue> OverloadParameter {
-      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Overload"]; }
+    public ScopeTreeLookupParameter<CVRPEvaluation> EvaluationParameter {
+      get { return (ScopeTreeLookupParameter<CVRPEvaluation>)Parameters["EvaluationResult"]; }
     }
 
@@ -79 +76 @@
       Parameters.Add(new LookupParameter<IVRPProblemInstance>("ProblemInstance", "The problem instance."));
       Parameters.Add(new ScopeTreeLookupParameter<IVRPEncodedSolution>("VRPTours", "The VRP tours which should be evaluated."));
-      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the VRP solutions which should be analyzed."));
-
-      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Overload", "The overloads of the VRP solutions which should be analyzed."));
+      Parameters.Add(new ScopeTreeLookupParameter<CVRPEvaluation>("EvaluationResult", "The evaluations of the VRP solutions which should be analyzed."));
 
       Parameters.Add(new ValueParameter<DoubleValue>("Sigma", "The sigma applied to the penalty factor.", new DoubleValue(0.5)));
@@ -113 +108 @@
       ResultCollection results = ResultsParameter.ActualValue;
 
-      ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
-      ItemArray<DoubleValue> overloads = OverloadParameter.ActualValue;
+      ItemArray<CVRPEvaluation> evaluations = EvaluationParameter.ActualValue;
 
       double sigma = SigmaParameter.Value.Value;
@@ -121 +115 @@
       double maxPenalty = MaxPenaltyFactorParameter.Value.Value;
 
-      for (int j = 0; j < qualities.Length; j++) {
-        qualities[j].Value -= overloads[j].Value * cvrp.OverloadPenalty.Value;
+      for (int j = 0; j < evaluations.Length; j++) {
+        evaluations[j].Quality -= evaluations[j].Overload * cvrp.OverloadPenalty.Value;
       }
 
       int validCount = 0;
-      for (int j = 0; j < qualities.Length; j++) {
-        if (overloads[j].Value == 0)
+      for (int j = 0; j < evaluations.Length; j++) {
+        if (evaluations[j].Overload == 0)
           validCount++;
       }
 
-      double factor = 1.0 - ((double)validCount / (double)qualities.Length);
+      double factor = 1.0 - ((double)validCount / (double)evaluations.Length);
 
       double min = cvrp.OverloadPenalty.Value / (1 + sigma);
@@ -142 +136 @@
         cvrp.CurrentOverloadPenalty.Value = maxPenalty;
 
-      for (int j = 0; j < qualities.Length; j++) {
-        qualities[j].Value += overloads[j].Value * cvrp.CurrentOverloadPenalty.Value;
+      for (int j = 0; j < evaluations.Length; j++) {
+        evaluations[j].Quality += evaluations[j].Overload * cvrp.CurrentOverloadPenalty.Value;
       }
 
-      if (!results.ContainsKey("Current Overload Penalty")) {
-        results.Add(new Result("Current Overload Penalty", new DoubleValue(cvrp.CurrentOverloadPenalty.Value)));
+      if (!results.TryGetValue("Current Overload Penalty", out IResult res) || !(res.Value is DoubleValue)) {
+        results.AddOrUpdateResult("Current Overload Penalty", new DoubleValue(cvrp.CurrentOverloadPenalty.Value));
       } else {
-        (results["Current Overload Penalty"].Value as DoubleValue).Value = cvrp.CurrentOverloadPenalty.Value;
+        (res.Value as DoubleValue).Value = cvrp.CurrentOverloadPenalty.Value;
       }
 

branches/2521_ProblemRefactoring/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/ConstraintRelaxation/PickupAndDelivery/PickupViolationsRelaxationVRPAnalyzer.cs

@@ -20 +20 @@
 #endregion
 
+using HEAL.Attic;
 using HeuristicLab.Common;
 using HeuristicLab.Core;
@@ -26 +27 @@
 using HeuristicLab.Optimization;
 using HeuristicLab.Parameters;
-using HEAL.Attic;
 using HeuristicLab.Problems.VehicleRouting.Interfaces;
+using HeuristicLab.Problems.VehicleRouting.ProblemInstances;
 using HeuristicLab.Problems.VehicleRouting.Variants;
 
@@ -43 +44 @@
       get { return (ScopeTreeLookupParameter<IVRPEncodedSolution>)Parameters["VRPTours"]; }
     }
-    public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
-      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
-    }
-
-    public ScopeTreeLookupParameter<IntValue> PickupViolationsParameter {
-      get { return (ScopeTreeLookupParameter<IntValue>)Parameters["PickupViolations"]; }
+    public ScopeTreeLookupParameter<CVRPPDTWEvaluation> EvaluationParameter {
+      get { return (ScopeTreeLookupParameter<CVRPPDTWEvaluation>)Parameters["EvaluationResult"]; }
     }
 
@@ -79 +76 @@
       Parameters.Add(new LookupParameter<IVRPProblemInstance>("ProblemInstance", "The problem instance."));
       Parameters.Add(new ScopeTreeLookupParameter<IVRPEncodedSolution>("VRPTours", "The VRP tours which should be evaluated."));
-      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the VRP solutions which should be analyzed."));
-
-      Parameters.Add(new ScopeTreeLookupParameter<IntValue>("PickupViolations", "The pickup violation of the VRP solutions which should be analyzed."));
+      Parameters.Add(new ScopeTreeLookupParameter<CVRPPDTWEvaluation>("EvaluationResult", "The evaluations of the VRP solutions which should be analyzed."));
 
       Parameters.Add(new ValueParameter<DoubleValue>("Sigma", "The sigma applied to the penalty factor.", new DoubleValue(0.5)));
@@ -113 +108 @@
       ResultCollection results = ResultsParameter.ActualValue;
 
-      ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
-      ItemArray<IntValue> pickupViolations = PickupViolationsParameter.ActualValue;
+      ItemArray<CVRPPDTWEvaluation> evaluations = EvaluationParameter.ActualValue;
 
       double sigma = SigmaParameter.Value.Value;
@@ -121 +115 @@
       double maxPenalty = MaxPenaltyFactorParameter.Value.Value;
 
-      for (int j = 0; j < qualities.Length; j++) {
-        qualities[j].Value -= pickupViolations[j].Value * pdp.PickupViolationPenalty.Value;
+      for (int j = 0; j < evaluations.Length; j++) {
+        evaluations[j].Quality -= evaluations[j].PickupViolations * pdp.PickupViolationPenalty.Value;
       }
 
       int validCount = 0;
-      for (int j = 0; j < qualities.Length; j++) {
-        if (pickupViolations[j].Value == 0)
+      for (int j = 0; j < evaluations.Length; j++) {
+        if (evaluations[j].PickupViolations == 0)
           validCount++;
       }
 
-      double factor = 1.0 - ((double)validCount / (double)qualities.Length);
+      double factor = 1.0 - ((double)validCount / (double)evaluations.Length);
 
       double min = pdp.PickupViolationPenalty.Value / (1 + sigma);
@@ -142 +136 @@
         pdp.CurrentPickupViolationPenalty.Value = maxPenalty;
 
-      for (int j = 0; j < qualities.Length; j++) {
-        qualities[j].Value += pickupViolations[j].Value * pdp.CurrentPickupViolationPenalty.Value;
+      for (int j = 0; j < evaluations.Length; j++) {
+        evaluations[j].Quality += evaluations[j].PickupViolations * pdp.CurrentPickupViolationPenalty.Value;
       }
 
-      if (!results.ContainsKey("Current Pickup Violation Penalty")) {
-        results.Add(new Result("Current Pickup Violation Penalty", new DoubleValue(pdp.CurrentPickupViolationPenalty.Value)));
+      if (!results.TryGetValue("Current Pickup Violation Penalty", out IResult res) || !(res.Value is DoubleValue)) {
+        results.AddOrUpdateResult("Current Pickup Violation Penalty", new DoubleValue(pdp.CurrentPickupViolationPenalty.Value));
       } else {
-        (results["Current Pickup Violation Penalty"].Value as DoubleValue).Value = pdp.CurrentPickupViolationPenalty.Value;
+        (res.Value as DoubleValue).Value = pdp.CurrentPickupViolationPenalty.Value;
       }
 

branches/2521_ProblemRefactoring/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/ConstraintRelaxation/TimeWindowed/TimeWindowRelaxationVRPAnalyzer.cs

@@ -20 +20 @@
 #endregion
 
+using HEAL.Attic;
 using HeuristicLab.Common;
 using HeuristicLab.Core;
@@ -26 +27 @@
 using HeuristicLab.Optimization;
 using HeuristicLab.Parameters;
-using HEAL.Attic;
 using HeuristicLab.Problems.VehicleRouting.Interfaces;
+using HeuristicLab.Problems.VehicleRouting.ProblemInstances;
 using HeuristicLab.Problems.VehicleRouting.Variants;
 
@@ -43 +44 @@
       get { return (ScopeTreeLookupParameter<IVRPEncodedSolution>)Parameters["VRPTours"]; }
     }
-    public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
-      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
-    }
-
-    public ScopeTreeLookupParameter<DoubleValue> TardinessParameter {
-      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Tardiness"]; }
+    public ScopeTreeLookupParameter<CVRPTWEvaluation> EvaluationParameter {
+      get { return (ScopeTreeLookupParameter<CVRPTWEvaluation>)Parameters["EvaluationResult"]; }
     }
 
@@ -79 +76 @@
       Parameters.Add(new LookupParameter<IVRPProblemInstance>("ProblemInstance", "The problem instance."));
       Parameters.Add(new ScopeTreeLookupParameter<IVRPEncodedSolution>("VRPTours", "The VRP tours which should be evaluated."));
-      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the VRP solutions which should be analyzed."));
-
-      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Tardiness", "The tardiness of the VRP solutions which should be analyzed."));
+      Parameters.Add(new ScopeTreeLookupParameter<CVRPTWEvaluation>("EvaluationResult", "The evaluations of the VRP solutions which should be analyzed."));
 
       Parameters.Add(new ValueParameter<DoubleValue>("Sigma", "The sigma applied to the penalty factor.", new DoubleValue(0.5)));
@@ -113 +108 @@
       ResultCollection results = ResultsParameter.ActualValue;
 
-      ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
-      ItemArray<DoubleValue> tardiness = TardinessParameter.ActualValue;
+      ItemArray<CVRPTWEvaluation> evaluations = EvaluationParameter.ActualValue;
 
       double sigma = SigmaParameter.Value.Value;
@@ -121 +115 @@
       double maxPenalty = MaxPenaltyFactorParameter.Value.Value;
 
-      for (int j = 0; j < qualities.Length; j++) {
-        qualities[j].Value -= tardiness[j].Value * vrptw.TardinessPenalty.Value;
+      for (int j = 0; j < evaluations.Length; j++) {
+        evaluations[j].Quality -= evaluations[j].Tardiness * vrptw.TardinessPenalty.Value;
       }
 
       int validCount = 0;
-      for (int j = 0; j < qualities.Length; j++) {
-        if (tardiness[j].Value == 0)
+      for (int j = 0; j < evaluations.Length; j++) {
+        if (evaluations[j].Tardiness == 0)
           validCount++;
       }
 
-      double factor = 1.0 - ((double)validCount / (double)qualities.Length);
+      double factor = 1.0 - ((double)validCount / (double)evaluations.Length);
 
       double min = vrptw.TardinessPenalty.Value / (1 + sigma);
@@ -142 +136 @@
         vrptw.CurrentTardinessPenalty.Value = maxPenalty;
 
-      for (int j = 0; j < qualities.Length; j++) {
-        qualities[j].Value += tardiness[j].Value * vrptw.CurrentTardinessPenalty.Value;
+      for (int j = 0; j < evaluations.Length; j++) {
+        evaluations[j].Quality += evaluations[j].Tardiness * vrptw.CurrentTardinessPenalty.Value;
       }
 
-      if (!results.ContainsKey("Current Tardiness Penalty")) {
-        results.Add(new Result("Current Tardiness Penalty", new DoubleValue(vrptw.CurrentTardinessPenalty.Value)));
+      if (!results.TryGetValue("Current Tardiness Penalty", out IResult res) || !(res.Value is DoubleValue)) {
+        results.AddOrUpdateResult("Current Tardiness Penalty", new DoubleValue(vrptw.CurrentTardinessPenalty.Value));
       } else {
-        (results["Current Tardiness Penalty"].Value as DoubleValue).Value = vrptw.CurrentTardinessPenalty.Value;
+        (res.Value as DoubleValue).Value = vrptw.CurrentTardinessPenalty.Value;
       }