Changeset 11194 for branches/HeuristicLab.Problems.Orienteering/HeuristicLab.Problems.Orienteering/3.3/Improvers/OrienteeringLocalImprovementOperator.cs

Timestamp:

07/16/14 14:39:28 (10 years ago)

Author:

pfleck

Message:

#2208

• Added OrienteeringLocalImprovementOperator parameterization
• Renamed some stuff

File:

• branches/HeuristicLab.Problems.Orienteering/HeuristicLab.Problems.Orienteering/3.3/Improvers/OrienteeringLocalImprovementOperator.cs (modified) (8 diffs)

branches/HeuristicLab.Problems.Orienteering/HeuristicLab.Problems.Orienteering/3.3/Improvers/OrienteeringLocalImprovementOperator.cs

@@ -37 +37 @@
 minimize the cost of the tour. As shortening operator a 2-opt is applied. (Schilde et. al. 2009)")]
   [StorableClass]
-  public class OrienteeringLocalImprovementOperator : SingleSuccessorOperator, ILocalImprovementOperator, IStochasticOperator {
+  public class OrienteeringLocalImprovementOperator : SingleSuccessorOperator, ILocalImprovementOperator {
     #region IGenericLocalImprovementOperator Properties
     public Type ProblemType { get { return typeof(OrienteeringProblem); } }
@@ -81 +81 @@
       get { return (ILookupParameter<DoubleValue>)Parameters["FixedPenalty"]; }
     }
-    public ILookupParameter<IRandom> RandomParameter {
-      get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
-    }
     #region ILocalImprovementOperator Parameters
     public IValueLookupParameter<IntValue> MaximumIterationsParameter {
@@ -106 +103 @@
     public OrienteeringLocalImprovementOperator()
       : base() {
+      Parameters.Add(new LookupParameter<IntegerVector>("IntegerVector", "The Orienteering Solution given in path representation."));
       Parameters.Add(new LookupParameter<DistanceMatrix>("DistanceMatrix", "The matrix which contains the distances between the points."));
       Parameters.Add(new LookupParameter<DoubleArray>("Scores", "The scores of the points."));
@@ -112 +110 @@
       Parameters.Add(new LookupParameter<IntValue>("TerminusPoint", "Index of the ending point."));
       Parameters.Add(new LookupParameter<DoubleValue>("FixedPenalty", "The penalty for each visited vertex."));
-      Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator to use."));
       Parameters.Add(new ValueLookupParameter<IntValue>("MaximumIterations", "The maximum number of generations which should be processed.", new IntValue(150)));
       Parameters.Add(new LookupParameter<IntValue>("EvaluatedSolutions", "The number of evaluated moves."));
@@ -130 +127 @@
 
     public override IOperation Apply() {
+      // TODO Use LocalImprovementorOperator Parameters
+
       int numPoints = ScoresParameter.ActualValue.Length;
       var distances = DistanceMatrixParameter.ActualValue;
@@ -136 +135 @@
 
       bool optimizationDone = true;
-      bool isFeasible = true;
 
       // Find the maximum distance restriction
@@ -227 +225 @@
           if (optimizationDone) break;
 
-          double detour = distances.CalculateInsertionCost(tour, tourPosition, visitablePoints[i], fixedPenalty);
+          double detour = distances.CalculateInsertionCosts(tour, tourPosition, visitablePoints[i], fixedPenalty);
 
           // Determine if including the point does not violate any constraint
@@ -255 +253 @@
           if (optimizationDone) break;
 
-          double detour = distances.CalculateReplacementCost(tour, tourPosition, visitablePoints[i]);
+          double detour = distances.CalculateReplacementCosts(tour, tourPosition, visitablePoints[i]);
 
           double oldPointScore = scores[tour[tourPosition]];