Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2839_HiveProjectManagement/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs @ 16117

Last change on this file since 16117 was 16057, checked in by jkarder, 6 years ago

#2839:

  • Property svn:mergeinfo set to (toggle deleted branches)
    /stable/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.csmergedeligible
    /branches/Async/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs13329-15286
    /branches/CloningRefactoring/HeuristicLab.Optimization/3.3/SingleObjectiveHeuristicOptimizationProblem.cs4656-4721
    /branches/DataAnalysis Refactoring/HeuristicLab.Optimization/3.3/SingleObjectiveHeuristicOptimizationProblem.cs5471-5577
    /branches/DataAnalysis/HeuristicLab.Optimization/3.3/SingleObjectiveHeuristicOptimizationProblem.cs4458-4459,​4462,​4464
    /branches/GP.Symbols (TimeLag, Diff, Integral)/HeuristicLab.Optimization/3.3/SingleObjectiveHeuristicOptimizationProblem.cs5060
    /branches/HeuristicLab.DatasetRefactor/sources/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs11570-12508
    /branches/HeuristicLab.Problems.Orienteering/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs11130-12721
    /branches/NET40/sources/HeuristicLab.Optimization/3.3/SingleObjectiveHeuristicOptimizationProblem.cs5138-5162
    /branches/ParallelEngine/HeuristicLab.Optimization/3.3/SingleObjectiveHeuristicOptimizationProblem.cs5175-5192
    /branches/QAP/HeuristicLab.Optimization/3.3/SingleObjectiveHeuristicOptimizationProblem.cs5810-5871
    /branches/QAPAlgorithms/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs6350-6627
    /branches/Restructure trunk solution/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs6828
    /branches/SuccessProgressAnalysis/HeuristicLab.Optimization/3.3/SingleObjectiveHeuristicOptimizationProblem.cs5370-5682
    /branches/TerminationCriteria/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs12526-12974
    /branches/TimeLimitRunOptimizer/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs9438-12626
    /branches/Trunk/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs6829-6865
    /branches/VNS/HeuristicLab.Optimization/3.3/SingleObjectiveHeuristicOptimizationProblem.cs5594-5752
    /branches/histogram/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs5959-6341
    /branches/symbreg-factors-2650/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs14232-14825
    /trunk/sources/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs15377-15681
File size: 4.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2018 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 HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Parameters;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Optimization {
29  [Item("Single-Objective Heuristic OptimizationProblem", "A base class for single-objective heuristic optimization problems.")]
30  [StorableClass]
31  public abstract class SingleObjectiveHeuristicOptimizationProblem<T, U> : HeuristicOptimizationProblem<T, U>, ISingleObjectiveHeuristicOptimizationProblem
32    where T : class, ISingleObjectiveEvaluator
33    where U : class, ISolutionCreator {
34    private const string MaximizationParameterName = "Maximization";
35    private const string BestKnownQualityParameterName = "BestKnownQuality";
36
37    [StorableConstructor]
38    protected SingleObjectiveHeuristicOptimizationProblem(bool deserializing) : base(deserializing) { }
39    protected SingleObjectiveHeuristicOptimizationProblem(SingleObjectiveHeuristicOptimizationProblem<T, U> original, Cloner cloner) : base(original, cloner) { }
40    protected SingleObjectiveHeuristicOptimizationProblem()
41      : base() {
42      Parameters.Add(new ValueParameter<BoolValue>(MaximizationParameterName, "Set to false if the problem should be minimized.", new BoolValue()));
43      Parameters.Add(new OptionalValueParameter<DoubleValue>(BestKnownQualityParameterName, "The quality of the best known solution of this problem."));
44    }
45
46    protected SingleObjectiveHeuristicOptimizationProblem(T evaluator, U solutionCreator)
47      : base(evaluator, solutionCreator) {
48      Parameters.Add(new ValueParameter<BoolValue>(MaximizationParameterName, "Set to false if the problem should be minimized.", new BoolValue()));
49      Parameters.Add(new OptionalValueParameter<DoubleValue>(BestKnownQualityParameterName, "The quality of the best known solution of this problem."));
50    }
51
52    [StorableHook(HookType.AfterDeserialization)]
53    private void AfterDeserialization() {
54      // BackwardsCompatibility3.3
55      #region Backwards compatible code (remove with 3.4)
56      if (BestKnownQualityParameter is ValueParameter<DoubleValue>) {
57        Parameters.Remove(BestKnownQualityParameterName);
58        Parameters.Add(new OptionalValueParameter<DoubleValue>(BestKnownQualityParameterName, "The quality of the best known solution of this problem."));
59      }
60      #endregion
61    }
62    public ValueParameter<BoolValue> MaximizationParameter {
63      get { return (ValueParameter<BoolValue>)Parameters[MaximizationParameterName]; }
64    }
65    IParameter ISingleObjectiveHeuristicOptimizationProblem.MaximizationParameter {
66      get { return MaximizationParameter; }
67    }
68    public BoolValue Maximization {
69      get { return MaximizationParameter.Value; }
70      set { MaximizationParameter.Value = value; }
71    }
72
73    public IValueParameter<DoubleValue> BestKnownQualityParameter {
74      get { return (IValueParameter<DoubleValue>)Parameters[BestKnownQualityParameterName]; }
75    }
76    IParameter ISingleObjectiveHeuristicOptimizationProblem.BestKnownQualityParameter {
77      get { return BestKnownQualityParameter; }
78    }
79    public DoubleValue BestKnownQuality {
80      get { return BestKnownQualityParameter.Value; }
81      set { BestKnownQualityParameter.Value = value; }
82    }
83
84    ISingleObjectiveEvaluator ISingleObjectiveHeuristicOptimizationProblem.Evaluator {
85      get { return Evaluator; }
86    }
87  }
88}
Note: See TracBrowser for help on using the repository browser.