Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2521_ProblemRefactoring/HeuristicLab.Optimization/3.3/Problems/HeuristicOptimizationProblem.cs @ 18086

Last change on this file since 18086 was 17695, checked in by abeham, 4 years ago

#2521:

  • Moving solution creator parameter from problems to algorithms (breaking wiring in some HeuristicOptimizationProblems)
  • Disallowing evaluator or encoding changes in encoding-specific base problems (to avoid confusion in derived problems whether this needs to be handled or not)
  • Added private set to ReferenceParameter property (serialization)
File size: 3.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 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 HEAL.Attic;
24using HeuristicLab.Common;
25using HeuristicLab.Core;
26using HeuristicLab.Parameters;
27
28namespace HeuristicLab.Optimization {
29  [Item("Heuristic Optimization Problem", "Represents the base class for a heuristic optimization problem.")]
30  [StorableType("DE0478BA-3797-4AC3-9A89-3734D2643823")]
31  public abstract class HeuristicOptimizationProblem<T> : EncodedProblem, IHeuristicOptimizationProblem
32    where T : class, IEvaluator {
33    private const string EvaluatorParameterName = "Evaluator";
34
35    [StorableConstructor]
36    protected HeuristicOptimizationProblem(StorableConstructorFlag _) : base(_) { }
37    protected HeuristicOptimizationProblem(HeuristicOptimizationProblem<T> original, Cloner cloner)
38      : base(original, cloner) {
39      RegisterEventHandlers();
40    }
41
42    protected HeuristicOptimizationProblem()
43      : base() {
44      Parameters.Add(new ValueParameter<T>(EvaluatorParameterName, "The operator used to evaluate a solution."));
45      RegisterEventHandlers();
46    }
47
48    protected HeuristicOptimizationProblem(T evaluator)
49      : base() {
50      Parameters.Add(new ValueParameter<T>(EvaluatorParameterName, "The operator used to evaluate a solution.", evaluator));
51      RegisterEventHandlers();
52    }
53
54    [StorableHook(HookType.AfterDeserialization)]
55    private void AfterDeserialization() {
56      RegisterEventHandlers();
57    }
58
59    private void RegisterEventHandlers() {
60      EvaluatorParameter.ValueChanged += new EventHandler(EvaluatorParameter_ValueChanged);
61    }
62
63    #region properties
64    public T Evaluator {
65      get { return EvaluatorParameter.Value; }
66      protected set { EvaluatorParameter.Value = value; }
67    }
68    public ValueParameter<T> EvaluatorParameter {
69      get { return (ValueParameter<T>)Parameters[EvaluatorParameterName]; }
70    }
71    IEvaluator IHeuristicOptimizationProblem.Evaluator { get { return Evaluator; } }
72    IParameter IHeuristicOptimizationProblem.EvaluatorParameter { get { return EvaluatorParameter; } }
73    #endregion
74
75    #region events
76    private void EvaluatorParameter_ValueChanged(object sender, EventArgs e) {
77      OnEvaluatorChanged();
78    }
79    public event EventHandler EvaluatorChanged;
80    protected virtual void OnEvaluatorChanged() {
81      EventHandler handler = EvaluatorChanged;
82      if (handler != null)
83        handler(this, EventArgs.Empty);
84    }
85    #endregion
86  }
87}
Note: See TracBrowser for help on using the repository browser.