Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.DatasetRefactor/sources/HeuristicLab.Algorithms.ScatterSearch/3.3/ScatterSearch.cs @ 12105

Last change on this file since 12105 was 12105, checked in by bburlacu, 9 years ago

#2276: Merged trunk changes.

File size: 23.1 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
4 *
5 * This file is part of HeuristicLab.
6 *
7 * HeuristicLab is free software: you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation, either version 3 of the License, or
10 * (at your option) any later version.
11 *
12 * HeuristicLab is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
19 */
20#endregion
21
22using System;
23using System.Linq;
24using HeuristicLab.Analysis;
25using HeuristicLab.Common;
26using HeuristicLab.Core;
27using HeuristicLab.Data;
28using HeuristicLab.Operators;
29using HeuristicLab.Optimization;
30using HeuristicLab.Optimization.Operators;
31using HeuristicLab.Parameters;
32using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
33using HeuristicLab.Random;
34using HeuristicLab.Selection;
35
36namespace HeuristicLab.Algorithms.ScatterSearch {
37  /// <summary>
38  /// A scatter search algorithm.
39  /// </summary>
40  [Item("Scatter Search", "A scatter search algorithm.")]
41  [Creatable("Algorithms")]
42  [StorableClass]
43  public sealed class ScatterSearch : HeuristicOptimizationEngineAlgorithm, IStorableContent {
44    public string Filename { get; set; }
45
46    #region Problem Properties
47    public override Type ProblemType {
48      get { return typeof(ISingleObjectiveHeuristicOptimizationProblem); }
49    }
50    public new ISingleObjectiveHeuristicOptimizationProblem Problem {
51      get { return (ISingleObjectiveHeuristicOptimizationProblem)base.Problem; }
52      set { base.Problem = value; }
53    }
54    #endregion
55
56    #region Parameter Properties
57    public IValueParameter<MultiAnalyzer> AnalyzerParameter {
58      get { return (IValueParameter<MultiAnalyzer>)Parameters["Analyzer"]; }
59    }
60    public IConstrainedValueParameter<ICrossover> CrossoverParameter {
61      get { return (IConstrainedValueParameter<ICrossover>)Parameters["Crossover"]; }
62    }
63    public IValueParameter<BoolValue> ExecutePathRelinkingParameter {
64      get { return (IValueParameter<BoolValue>)Parameters["ExecutePathRelinking"]; }
65    }
66    public IConstrainedValueParameter<IImprovementOperator> ImproverParameter {
67      get { return (IConstrainedValueParameter<IImprovementOperator>)Parameters["Improver"]; }
68    }
69    public IValueParameter<IntValue> MaximumIterationsParameter {
70      get { return (IValueParameter<IntValue>)Parameters["MaximumIterations"]; }
71    }
72    public IValueParameter<IntValue> NumberOfHighQualitySolutionsParameter {
73      get { return (IValueParameter<IntValue>)Parameters["NumberOfHighQualitySolutions"]; }
74    }
75    public IConstrainedValueParameter<IPathRelinker> PathRelinkerParameter {
76      get { return (IConstrainedValueParameter<IPathRelinker>)Parameters["PathRelinker"]; }
77    }
78    public IValueParameter<IntValue> PopulationSizeParameter {
79      get { return (IValueParameter<IntValue>)Parameters["PopulationSize"]; }
80    }
81    public IValueParameter<IntValue> ReferenceSetSizeParameter {
82      get { return (IValueParameter<IntValue>)Parameters["ReferenceSetSize"]; }
83    }
84    public IValueParameter<IntValue> SeedParameter {
85      get { return (IValueParameter<IntValue>)Parameters["Seed"]; }
86    }
87    public IValueParameter<BoolValue> SetSeedRandomlyParameter {
88      get { return (IValueParameter<BoolValue>)Parameters["SetSeedRandomly"]; }
89    }
90    public IConstrainedValueParameter<ISolutionSimilarityCalculator> SimilarityCalculatorParameter {
91      get { return (IConstrainedValueParameter<ISolutionSimilarityCalculator>)Parameters["SimilarityCalculator"]; }
92    }
93    #endregion
94
95    #region Properties
96    public MultiAnalyzer Analyzer {
97      get { return AnalyzerParameter.Value; }
98      set { AnalyzerParameter.Value = value; }
99    }
100    public ICrossover Crossover {
101      get { return CrossoverParameter.Value; }
102      set { CrossoverParameter.Value = value; }
103    }
104    public BoolValue ExecutePathRelinking {
105      get { return ExecutePathRelinkingParameter.Value; }
106      set { ExecutePathRelinkingParameter.Value = value; }
107    }
108    public IImprovementOperator Improver {
109      get { return ImproverParameter.Value; }
110      set { ImproverParameter.Value = value; }
111    }
112    public IntValue MaximumIterations {
113      get { return MaximumIterationsParameter.Value; }
114      set { MaximumIterationsParameter.Value = value; }
115    }
116    public IntValue NumberOfHighQualitySolutions {
117      get { return NumberOfHighQualitySolutionsParameter.Value; }
118      set { NumberOfHighQualitySolutionsParameter.Value = value; }
119    }
120    public IPathRelinker PathRelinker {
121      get { return PathRelinkerParameter.Value; }
122      set { PathRelinkerParameter.Value = value; }
123    }
124    public IntValue PopulationSize {
125      get { return PopulationSizeParameter.Value; }
126      set { PopulationSizeParameter.Value = value; }
127    }
128    public IntValue ReferenceSetSize {
129      get { return ReferenceSetSizeParameter.Value; }
130      set { ReferenceSetSizeParameter.Value = value; }
131    }
132    public IntValue Seed {
133      get { return SeedParameter.Value; }
134      set { SeedParameter.Value = value; }
135    }
136    public BoolValue SetSeedRandomly {
137      get { return SetSeedRandomlyParameter.Value; }
138      set { SetSeedRandomlyParameter.Value = value; }
139    }
140    public ISolutionSimilarityCalculator SimilarityCalculator {
141      get { return SimilarityCalculatorParameter.Value; }
142      set { SimilarityCalculatorParameter.Value = value; }
143    }
144    private RandomCreator RandomCreator {
145      get { return (RandomCreator)OperatorGraph.InitialOperator; }
146    }
147    private SolutionsCreator SolutionsCreator {
148      get { return (SolutionsCreator)RandomCreator.Successor; }
149    }
150    private ScatterSearchMainLoop MainLoop {
151      get { return FindMainLoop(SolutionsCreator.Successor); }
152    }
153
154    [Storable]
155    private BestAverageWorstQualityAnalyzer qualityAnalyzer;
156    #endregion
157
158    [StorableConstructor]
159    private ScatterSearch(bool deserializing) : base(deserializing) { }
160    [StorableHook(HookType.AfterDeserialization)]
161    private void AfterDeserialization() {
162      // BackwardsCompatibility3.3
163      #region Backwards compatible code, remove with 3.4
164      if (Parameters.ContainsKey("SimilarityCalculator")) {
165        var oldParameter = (IConstrainedValueParameter<ISingleObjectiveSolutionSimilarityCalculator>)Parameters["SimilarityCalculator"];
166        Parameters.Remove(oldParameter);
167        var newParameter = new ConstrainedValueParameter<ISolutionSimilarityCalculator>("SimilarityCalculator", "The operator used to calculate the similarity between two solutions.", new ItemSet<ISolutionSimilarityCalculator>(oldParameter.ValidValues));
168        var selectedSimilarityCalculator = newParameter.ValidValues.SingleOrDefault(x => x.GetType() == oldParameter.Value.GetType());
169        newParameter.Value = selectedSimilarityCalculator;
170        Parameters.Add(newParameter);
171      }
172      #endregion
173      Initialize();
174    }
175    private ScatterSearch(ScatterSearch original, Cloner cloner)
176      : base(original, cloner) {
177      qualityAnalyzer = cloner.Clone(original.qualityAnalyzer);
178      Initialize();
179    }
180    public override IDeepCloneable Clone(Cloner cloner) {
181      return new ScatterSearch(this, cloner);
182    }
183    public ScatterSearch()
184      : base() {
185      #region Create parameters
186      Parameters.Add(new ValueParameter<MultiAnalyzer>("Analyzer", "The analyzer used to analyze each iteration.", new MultiAnalyzer()));
187      Parameters.Add(new ConstrainedValueParameter<ICrossover>("Crossover", "The operator used to cross solutions."));
188      Parameters.Add(new ValueParameter<BoolValue>("ExecutePathRelinking", "True if path relinking should be executed instead of crossover, otherwise false.", new BoolValue(false)));
189      Parameters.Add(new ConstrainedValueParameter<IImprovementOperator>("Improver", "The operator used to improve solutions."));
190      Parameters.Add(new ValueParameter<IntValue>("MaximumIterations", "The maximum number of iterations which should be processed.", new IntValue(100)));
191      Parameters.Add(new ValueParameter<IntValue>("NumberOfHighQualitySolutions", "The number of high quality solutions in the reference set.", new IntValue(5)));
192      Parameters.Add(new ConstrainedValueParameter<IPathRelinker>("PathRelinker", "The operator used to execute path relinking."));
193      Parameters.Add(new ValueParameter<IntValue>("PopulationSize", "The size of the population of solutions.", new IntValue(50)));
194      Parameters.Add(new ValueParameter<IntValue>("ReferenceSetSize", "The size of the reference set.", new IntValue(20)));
195      Parameters.Add(new ValueParameter<IntValue>("Seed", "The random seed used to initialize the new pseudo random number generator.", new IntValue(0)));
196      Parameters.Add(new ValueParameter<BoolValue>("SetSeedRandomly", "True if the random seed should be set to a random value, otherwise false.", new BoolValue(true)));
197      Parameters.Add(new ConstrainedValueParameter<ISolutionSimilarityCalculator>("SimilarityCalculator", "The operator used to calculate the similarity between two solutions."));
198      #endregion
199
200      #region Create operators
201      RandomCreator randomCreator = new RandomCreator();
202      SolutionsCreator solutionsCreator = new SolutionsCreator();
203      UniformSubScopesProcessor uniformSubScopesProcessor = new UniformSubScopesProcessor();
204      Placeholder solutionEvaluator = new Placeholder();
205      Placeholder solutionImprover = new Placeholder();
206      VariableCreator variableCreator = new VariableCreator();
207      DataReducer dataReducer = new DataReducer();
208      ResultsCollector resultsCollector = new ResultsCollector();
209      BestSelector bestSelector = new BestSelector();
210      ScatterSearchMainLoop mainLoop = new ScatterSearchMainLoop();
211      #endregion
212
213      #region Create operator graph
214      OperatorGraph.InitialOperator = randomCreator;
215      randomCreator.RandomParameter.ActualName = "Random";
216      randomCreator.SeedParameter.ActualName = SeedParameter.Name;
217      randomCreator.SeedParameter.Value = null;
218      randomCreator.SetSeedRandomlyParameter.ActualName = SetSeedRandomlyParameter.Name;
219      randomCreator.SetSeedRandomlyParameter.Value = null;
220      randomCreator.Successor = solutionsCreator;
221
222      solutionsCreator.Name = "DiversificationGenerationMethod";
223      solutionsCreator.NumberOfSolutionsParameter.ActualName = "PopulationSize";
224      solutionsCreator.Successor = uniformSubScopesProcessor;
225
226      uniformSubScopesProcessor.Operator = solutionImprover;
227      uniformSubScopesProcessor.ParallelParameter.Value = new BoolValue(true);
228      uniformSubScopesProcessor.Successor = variableCreator;
229
230      solutionImprover.Name = "SolutionImprover";
231      solutionImprover.OperatorParameter.ActualName = "Improver";
232      solutionImprover.Successor = solutionEvaluator;
233
234      solutionEvaluator.Name = "SolutionEvaluator";
235      solutionEvaluator.OperatorParameter.ActualName = "Evaluator";
236      solutionEvaluator.Successor = null;
237
238      variableCreator.Name = "Initialize EvaluatedSolutions";
239      variableCreator.CollectedValues.Add(new ValueParameter<IntValue>("EvaluatedSolutions", new IntValue()));
240      variableCreator.Successor = dataReducer;
241
242      dataReducer.Name = "Increment EvaluatedSolutions";
243      dataReducer.ParameterToReduce.ActualName = "LocalEvaluatedSolutions";
244      dataReducer.TargetParameter.ActualName = "EvaluatedSolutions";
245      dataReducer.ReductionOperation.Value = new ReductionOperation(ReductionOperations.Sum);
246      dataReducer.TargetOperation.Value = new ReductionOperation(ReductionOperations.Sum);
247      dataReducer.Successor = resultsCollector;
248
249      resultsCollector.Name = "ResultsCollector";
250      resultsCollector.CollectedValues.Add(new LookupParameter<IntValue>("EvaluatedSolutions", null, "EvaluatedSolutions"));
251      resultsCollector.Successor = bestSelector;
252
253      bestSelector.NumberOfSelectedSubScopesParameter.ActualName = NumberOfHighQualitySolutionsParameter.Name;
254      bestSelector.CopySelected = new BoolValue(false);
255      bestSelector.Successor = mainLoop;
256
257      mainLoop.MaximumIterationsParameter.ActualName = MaximumIterationsParameter.Name;
258      mainLoop.RandomParameter.ActualName = randomCreator.RandomParameter.ActualName;
259      mainLoop.ResultsParameter.ActualName = "Results";
260      mainLoop.AnalyzerParameter.ActualName = AnalyzerParameter.Name;
261      mainLoop.IterationsParameter.ActualName = "Iterations";
262      mainLoop.EvaluatedSolutionsParameter.ActualName = "EvaluatedSolutions";
263      mainLoop.CrossoverParameter.ActualName = CrossoverParameter.Name;
264      mainLoop.PopulationSizeParameter.ActualName = PopulationSizeParameter.Name;
265      mainLoop.NumberOfHighQualitySolutionsParameter.ActualName = NumberOfHighQualitySolutionsParameter.Name;
266      mainLoop.Successor = null;
267      #endregion
268
269      qualityAnalyzer = new BestAverageWorstQualityAnalyzer();
270      ParameterizeAnalyzers();
271      UpdateAnalyzers();
272
273      Initialize();
274    }
275
276    public override void Prepare() {
277      if (Problem != null && Improver != null && (PathRelinker != null || ExecutePathRelinking.Value == false) && SimilarityCalculator != null)
278        base.Prepare();
279    }
280
281    #region Events
282    protected override void OnProblemChanged() {
283      ParameterizeStochasticOperator(Problem.SolutionCreator);
284      ParameterizeStochasticOperator(Problem.Evaluator);
285      foreach (IOperator op in Problem.Operators.OfType<IOperator>()) ParameterizeStochasticOperator(op);
286      ParameterizeAnalyzers();
287      ParameterizeSolutionsCreator();
288      ParameterizeBestSelector();
289      UpdateAnalyzers();
290      UpdateCrossovers();
291      UpdateImprovers();
292      UpdatePathRelinkers();
293      UpdateSimilarityCalculators();
294      ParameterizeMainLoop();
295      Problem.Evaluator.QualityParameter.ActualNameChanged += new EventHandler(Evaluator_QualityParameter_ActualNameChanged);
296      base.OnProblemChanged();
297    }
298    protected override void Problem_SolutionCreatorChanged(object sender, EventArgs e) {
299      ParameterizeStochasticOperator(Problem.SolutionCreator);
300      ParameterizeSolutionsCreator();
301      base.Problem_SolutionCreatorChanged(sender, e);
302    }
303    protected override void Problem_EvaluatorChanged(object sender, EventArgs e) {
304      ParameterizeStochasticOperator(Problem.Evaluator);
305      ParameterizeSolutionsCreator();
306      ParameterizeMainLoop();
307      ParameterizeAnalyzers();
308      Problem.Evaluator.QualityParameter.ActualNameChanged += new EventHandler(Evaluator_QualityParameter_ActualNameChanged);
309      base.Problem_EvaluatorChanged(sender, e);
310    }
311    protected override void Problem_OperatorsChanged(object sender, EventArgs e) {
312      foreach (IOperator op in Problem.Operators.OfType<IOperator>()) ParameterizeStochasticOperator(op);
313      UpdateAnalyzers();
314      UpdateCrossovers();
315      UpdatePathRelinkers();
316      UpdateSimilarityCalculators();
317      UpdateImprovers();
318      ParameterizeMainLoop();
319      ParameterizeAnalyzers();
320      base.Problem_OperatorsChanged(sender, e);
321    }
322    private void PathRelinkerParameter_ValueChanged(object sender, EventArgs e) {
323      ExecutePathRelinking.Value = PathRelinkerParameter.Value != null;
324    }
325    private void SimilarityCalculatorParameter_ValueChanged(object sender, EventArgs e) {
326      ParameterizeMainLoop();
327    }
328    private void Evaluator_QualityParameter_ActualNameChanged(object sender, EventArgs e) {
329      ParameterizeMainLoop();
330      ParameterizeAnalyzers();
331      ParameterizeBestSelector();
332      ParameterizeSimilarityCalculators();
333    }
334    #endregion
335
336    #region Helpers
337    private void Initialize() {
338      PathRelinkerParameter.ValueChanged += new EventHandler(PathRelinkerParameter_ValueChanged);
339      SimilarityCalculatorParameter.ValueChanged += new EventHandler(SimilarityCalculatorParameter_ValueChanged);
340      if (Problem != null)
341        Problem.Evaluator.QualityParameter.ActualNameChanged += new EventHandler(Evaluator_QualityParameter_ActualNameChanged);
342    }
343    private void UpdateAnalyzers() {
344      Analyzer.Operators.Clear();
345      if (Problem != null) {
346        foreach (IAnalyzer analyzer in Problem.Operators.OfType<IAnalyzer>()) {
347          foreach (IScopeTreeLookupParameter param in analyzer.Parameters.OfType<IScopeTreeLookupParameter>())
348            param.Depth = 1;
349          Analyzer.Operators.Add(analyzer, analyzer.EnabledByDefault);
350        }
351      }
352      Analyzer.Operators.Add(qualityAnalyzer, qualityAnalyzer.EnabledByDefault);
353    }
354    private void UpdateCrossovers() {
355      ICrossover oldCrossover = CrossoverParameter.Value;
356      CrossoverParameter.ValidValues.Clear();
357      ICrossover defaultCrossover = Problem.Operators.OfType<ICrossover>().FirstOrDefault();
358
359      foreach (ICrossover crossover in Problem.Operators.OfType<ICrossover>().OrderBy(x => x.Name))
360        CrossoverParameter.ValidValues.Add(crossover);
361
362      if (oldCrossover != null) {
363        ICrossover crossover = CrossoverParameter.ValidValues.FirstOrDefault(x => x.GetType() == oldCrossover.GetType());
364        if (crossover != null) CrossoverParameter.Value = crossover;
365        else oldCrossover = null;
366      }
367      if (oldCrossover == null && defaultCrossover != null)
368        CrossoverParameter.Value = defaultCrossover;
369    }
370    private void UpdateImprovers() {
371      IImprovementOperator oldImprover = ImproverParameter.Value;
372      ImproverParameter.ValidValues.Clear();
373      IImprovementOperator defaultImprover = Problem.Operators.OfType<IImprovementOperator>().FirstOrDefault();
374
375      foreach (IImprovementOperator improver in Problem.Operators.OfType<IImprovementOperator>().OrderBy(x => x.Name))
376        ImproverParameter.ValidValues.Add(improver);
377
378      if (oldImprover != null) {
379        IImprovementOperator improver = ImproverParameter.ValidValues.FirstOrDefault(x => x.GetType() == oldImprover.GetType());
380        if (improver != null) ImproverParameter.Value = improver;
381        else oldImprover = null;
382      }
383      if (oldImprover == null && defaultImprover != null)
384        ImproverParameter.Value = defaultImprover;
385    }
386    private void UpdatePathRelinkers() {
387      IPathRelinker oldPathRelinker = PathRelinkerParameter.Value;
388      PathRelinkerParameter.ValidValues.Clear();
389      IPathRelinker defaultPathRelinker = Problem.Operators.OfType<IPathRelinker>().FirstOrDefault();
390
391      foreach (IPathRelinker pathRelinker in Problem.Operators.OfType<IPathRelinker>().OrderBy(x => x.Name))
392        PathRelinkerParameter.ValidValues.Add(pathRelinker);
393
394      if (oldPathRelinker != null) {
395        IPathRelinker pathRelinker = PathRelinkerParameter.ValidValues.FirstOrDefault(x => x.GetType() == oldPathRelinker.GetType());
396        if (pathRelinker != null) PathRelinkerParameter.Value = pathRelinker;
397        else oldPathRelinker = null;
398      }
399      if (oldPathRelinker == null && defaultPathRelinker != null)
400        PathRelinkerParameter.Value = defaultPathRelinker;
401    }
402    private void UpdateSimilarityCalculators() {
403      ISolutionSimilarityCalculator oldSimilarityCalculator = SimilarityCalculatorParameter.Value;
404      SimilarityCalculatorParameter.ValidValues.Clear();
405      ISolutionSimilarityCalculator defaultSimilarityCalculator = Problem.Operators.OfType<ISolutionSimilarityCalculator>().FirstOrDefault();
406
407      foreach (ISolutionSimilarityCalculator similarityCalculator in Problem.Operators.OfType<ISolutionSimilarityCalculator>())
408        SimilarityCalculatorParameter.ValidValues.Add(similarityCalculator);
409
410      if (oldSimilarityCalculator != null) {
411        ISolutionSimilarityCalculator similarityCalculator = SimilarityCalculatorParameter.ValidValues.FirstOrDefault(x => x.GetType() == oldSimilarityCalculator.GetType());
412        if (similarityCalculator != null) SimilarityCalculatorParameter.Value = similarityCalculator;
413        else oldSimilarityCalculator = null;
414      }
415      if (oldSimilarityCalculator == null && defaultSimilarityCalculator != null)
416        SimilarityCalculatorParameter.Value = defaultSimilarityCalculator;
417    }
418    private void ParameterizeBestSelector() {
419      OperatorGraph.Operators.OfType<ISingleObjectiveSelector>()
420                             .First().QualityParameter.ActualName = Problem.Evaluator.QualityParameter.ActualName;
421    }
422    private void ParameterizeSolutionsCreator() {
423      SolutionsCreator.EvaluatorParameter.ActualName = Problem.EvaluatorParameter.Name;
424      SolutionsCreator.SolutionCreatorParameter.ActualName = Problem.SolutionCreatorParameter.Name;
425    }
426    private void ParameterizeMainLoop() {
427      if (Problem != null && Improver != null) {
428        MainLoop.BestKnownQualityParameter.ActualName = Problem.BestKnownQualityParameter.Name;
429        MainLoop.MaximizationParameter.ActualName = Problem.MaximizationParameter.Name;
430        MainLoop.QualityParameter.ActualName = Problem.Evaluator.QualityParameter.ActualName;
431        MainLoop.OperatorGraph.Operators.OfType<PopulationRebuildMethod>().Single().QualityParameter.ActualName = Problem.Evaluator.QualityParameter.ActualName;
432        MainLoop.OperatorGraph.Operators.OfType<SolutionPoolUpdateMethod>().Single().QualityParameter.ActualName = Problem.Evaluator.QualityParameter.ActualName;
433      }
434    }
435    private void ParameterizeStochasticOperator(IOperator op) {
436      if (op is IStochasticOperator) {
437        IStochasticOperator stOp = (IStochasticOperator)op;
438        stOp.RandomParameter.ActualName = RandomCreator.RandomParameter.ActualName;
439        stOp.RandomParameter.Hidden = true;
440      }
441    }
442    private void ParameterizeAnalyzers() {
443      qualityAnalyzer.ResultsParameter.ActualName = "Results";
444      qualityAnalyzer.ResultsParameter.Hidden = true;
445      if (Problem != null) {
446        qualityAnalyzer.MaximizationParameter.ActualName = Problem.MaximizationParameter.Name;
447        qualityAnalyzer.MaximizationParameter.Hidden = true;
448        qualityAnalyzer.QualityParameter.Hidden = false;
449        qualityAnalyzer.BestKnownQualityParameter.ActualName = Problem.BestKnownQualityParameter.Name;
450        qualityAnalyzer.BestKnownQualityParameter.Hidden = true;
451      } else {
452        qualityAnalyzer.MaximizationParameter.Hidden = false;
453        qualityAnalyzer.BestKnownQualityParameter.Hidden = false;
454      }
455    }
456    private void ParameterizeSimilarityCalculators() {
457      foreach (ISolutionSimilarityCalculator calc in SimilarityCalculatorParameter.ValidValues) {
458        calc.QualityVariableName = Problem.Evaluator.QualityParameter.ActualName;
459      }
460    }
461    private ScatterSearchMainLoop FindMainLoop(IOperator start) {
462      IOperator mainLoop = start;
463      while (mainLoop != null && !(mainLoop is ScatterSearchMainLoop))
464        mainLoop = ((SingleSuccessorOperator)mainLoop).Successor;
465      return mainLoop as ScatterSearchMainLoop;
466    }
467    #endregion
468  }
469}
Note: See TracBrowser for help on using the repository browser.