Changeset 13396 for branches/ProblemRefactoring/HeuristicLab.Problems.QuadraticAssignment/3.3/LocalImprovement
- Timestamp:
- 11/25/15 16:22:37 (9 years ago)
- Location:
- branches/ProblemRefactoring/HeuristicLab.Problems.QuadraticAssignment/3.3/LocalImprovement
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/ProblemRefactoring/HeuristicLab.Problems.QuadraticAssignment/3.3/LocalImprovement/QAPExhaustiveInsertionLocalImprovement.cs
r12012 r13396 34 34 [Item("QAPExhaustiveInsertionLocalImprovement", "Takes a solution and finds the local optimum with respect to the insertion neighborhood by decending along the steepest gradient.")] 35 35 [StorableClass] 36 public class QAPExhaustiveInsertionLocalImprovement : SingleSuccessorOperator, I LocalImprovementOperator, ISingleObjectiveOperator {36 public class QAPExhaustiveInsertionLocalImprovement : SingleSuccessorOperator, IQAPLocalImprovementOperator, ISingleObjectiveOperator { 37 37 38 38 public ILookupParameter<IntValue> LocalIterationsParameter { … … 52 52 } 53 53 54 public ILookupParameter<Permutation> AssignmentParameter {55 get { return (ILookupParameter<Permutation>)Parameters[" Assignment"]; }54 public ILookupParameter<Permutation> PermutationParameter { 55 get { return (ILookupParameter<Permutation>)Parameters["Permutation"]; } 56 56 } 57 57 … … 83 83 Parameters.Add(new LookupParameter<IntValue>("EvaluatedSolutions", "The amount of evaluated solutions (here a move is counted only as 4/n evaluated solutions with n being the length of the permutation).")); 84 84 Parameters.Add(new LookupParameter<ResultCollection>("Results", "The collection where to store results.")); 85 Parameters.Add(new LookupParameter<Permutation>(" Assignment", "The permutation that is to be locally optimized."));85 Parameters.Add(new LookupParameter<Permutation>("Permutation", "The permutation that is to be locally optimized.")); 86 86 Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The quality value of the assignment.")); 87 87 Parameters.Add(new LookupParameter<BoolValue>("Maximization", "True if the problem should be maximized or minimized.")); … … 122 122 public override IOperation Apply() { 123 123 var maxIterations = MaximumIterationsParameter.ActualValue.Value; 124 var assignment = AssignmentParameter.ActualValue;124 var assignment = PermutationParameter.ActualValue; 125 125 var maximization = MaximizationParameter.ActualValue.Value; 126 126 var weights = WeightsParameter.ActualValue; -
branches/ProblemRefactoring/HeuristicLab.Problems.QuadraticAssignment/3.3/LocalImprovement/QAPExhaustiveInversionLocalImprovement.cs
r12811 r13396 34 34 [Item("QAPExhaustiveInversionLocalImprovement", "Takes a solution and finds the local optimum with respect to the inversion neighborhood by decending along the steepest gradient.")] 35 35 [StorableClass] 36 public class QAPExhaustiveInversionLocalImprovement : SingleSuccessorOperator, I LocalImprovementOperator, ISingleObjectiveOperator {36 public class QAPExhaustiveInversionLocalImprovement : SingleSuccessorOperator, IQAPLocalImprovementOperator, ISingleObjectiveOperator { 37 37 38 38 public ILookupParameter<IntValue> LocalIterationsParameter { … … 52 52 } 53 53 54 public ILookupParameter<Permutation> AssignmentParameter {55 get { return (ILookupParameter<Permutation>)Parameters[" Assignment"]; }54 public ILookupParameter<Permutation> PermutationParameter { 55 get { return (ILookupParameter<Permutation>)Parameters["Permutation"]; } 56 56 } 57 57 … … 83 83 Parameters.Add(new LookupParameter<IntValue>("EvaluatedSolutions", "The amount of evaluated solutions (here a move is counted only as 4/n evaluated solutions with n being the length of the permutation).")); 84 84 Parameters.Add(new LookupParameter<ResultCollection>("Results", "The collection where to store results.")); 85 Parameters.Add(new LookupParameter<Permutation>(" Assignment", "The permutation that is to be locally optimized."));85 Parameters.Add(new LookupParameter<Permutation>("Permutation", "The permutation that is to be locally optimized.")); 86 86 Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The quality value of the assignment.")); 87 87 Parameters.Add(new LookupParameter<BoolValue>("Maximization", "True if the problem should be maximized or minimized.")); … … 119 119 public override IOperation Apply() { 120 120 var maxIterations = MaximumIterationsParameter.ActualValue.Value; 121 var assignment = AssignmentParameter.ActualValue;121 var assignment = PermutationParameter.ActualValue; 122 122 var maximization = MaximizationParameter.ActualValue.Value; 123 123 var weights = WeightsParameter.ActualValue; -
branches/ProblemRefactoring/HeuristicLab.Problems.QuadraticAssignment/3.3/LocalImprovement/QAPExhaustiveSwap2LocalImprovement.cs
r12012 r13396 34 34 [Item("QAPExhaustiveSwap2LocalImprovement", "Takes a solution and finds the local optimum with respect to the swap2 neighborhood by decending along the steepest gradient.")] 35 35 [StorableClass] 36 public class QAPExhaustiveSwap2LocalImprovement : SingleSuccessorOperator, I LocalImprovementOperator, ISingleObjectiveOperator {36 public class QAPExhaustiveSwap2LocalImprovement : SingleSuccessorOperator, IQAPLocalImprovementOperator, ISingleObjectiveOperator { 37 37 38 38 public ILookupParameter<IntValue> LocalIterationsParameter { … … 52 52 } 53 53 54 public ILookupParameter<Permutation> AssignmentParameter {55 get { return (ILookupParameter<Permutation>)Parameters[" Assignment"]; }54 public ILookupParameter<Permutation> PermutationParameter { 55 get { return (ILookupParameter<Permutation>)Parameters["Permutation"]; } 56 56 } 57 57 … … 87 87 Parameters.Add(new LookupParameter<IntValue>("EvaluatedSolutions", "The amount of evaluated solutions (here a move is counted only as 4/n evaluated solutions with n being the length of the permutation).")); 88 88 Parameters.Add(new LookupParameter<ResultCollection>("Results", "The collection where to store results.")); 89 Parameters.Add(new LookupParameter<Permutation>(" Assignment", "The permutation that is to be locally optimized."));89 Parameters.Add(new LookupParameter<Permutation>("Permutation", "The permutation that is to be locally optimized.")); 90 90 Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The quality value of the assignment.")); 91 91 Parameters.Add(new LookupParameter<BoolValue>("Maximization", "True if the problem should be maximized or minimized.")); … … 175 175 public override IOperation Apply() { 176 176 var maxIterations = MaximumIterationsParameter.ActualValue.Value; 177 var assignment = AssignmentParameter.ActualValue;177 var assignment = PermutationParameter.ActualValue; 178 178 var maximization = MaximizationParameter.ActualValue.Value; 179 179 var weights = WeightsParameter.ActualValue; -
branches/ProblemRefactoring/HeuristicLab.Problems.QuadraticAssignment/3.3/LocalImprovement/QAPStochasticScrambleLocalImprovement.cs
r12811 r13396 34 34 [Item("QAPStochasticScrambleLocalImprovement", "Takes a solution and finds the local optimum with respect to the scramble neighborhood by decending along the steepest gradient.")] 35 35 [StorableClass] 36 public class QAPStochasticScrambleLocalImprovement : SingleSuccessorOperator, I LocalImprovementOperator, IStochasticOperator, ISingleObjectiveOperator {36 public class QAPStochasticScrambleLocalImprovement : SingleSuccessorOperator, IQAPLocalImprovementOperator, IStochasticOperator, ISingleObjectiveOperator { 37 37 38 38 public ILookupParameter<IntValue> LocalIterationsParameter { … … 56 56 } 57 57 58 public ILookupParameter<Permutation> AssignmentParameter {59 get { return (ILookupParameter<Permutation>)Parameters[" Assignment"]; }58 public ILookupParameter<Permutation> PermutationParameter { 59 get { return (ILookupParameter<Permutation>)Parameters["Permutation"]; } 60 60 } 61 61 … … 92 92 Parameters.Add(new LookupParameter<IntValue>("EvaluatedSolutions", "The amount of evaluated solutions (here a move is counted only as 4/n evaluated solutions with n being the length of the permutation).")); 93 93 Parameters.Add(new LookupParameter<ResultCollection>("Results", "The collection where to store results.")); 94 Parameters.Add(new LookupParameter<Permutation>(" Assignment", "The permutation that is to be locally optimized."));94 Parameters.Add(new LookupParameter<Permutation>("Permutation", "The permutation that is to be locally optimized.")); 95 95 Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The quality value of the assignment.")); 96 96 Parameters.Add(new LookupParameter<BoolValue>("Maximization", "True if the problem should be maximized or minimized.")); … … 132 132 var maxIterations = MaximumIterationsParameter.ActualValue.Value; 133 133 var neighborhoodSize = NeighborhoodSizeParameter.ActualValue.Value; 134 var assignment = AssignmentParameter.ActualValue;134 var assignment = PermutationParameter.ActualValue; 135 135 var maximization = MaximizationParameter.ActualValue.Value; 136 136 var weights = WeightsParameter.ActualValue;
Note: See TracChangeset
for help on using the changeset viewer.