source:
stable/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs
@
17975
Last change on this file since 17975 was 17181, checked in by swagner, 5 years ago | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
File size: 4.2 KB |
Rev | Line | |
---|---|---|
[5578] | 1 | #region License Information |
2 | /* HeuristicLab | |
[17181] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL) |
[5578] | 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 | ||
22 | using HeuristicLab.Common; | |
23 | using HeuristicLab.Core; | |
24 | using HeuristicLab.Data; | |
25 | using HeuristicLab.Parameters; | |
[17097] | 26 | using HEAL.Attic; |
[5578] | 27 | |
28 | namespace HeuristicLab.Optimization { | |
29 | [Item("Single-Objective Heuristic OptimizationProblem", "A base class for single-objective heuristic optimization problems.")] | |
[17097] | 30 | [StorableType("DFD5588E-6AB2-4712-9083-A405EF21226F")] |
[5578] | 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] | |
[17097] | 38 | protected SingleObjectiveHeuristicOptimizationProblem(StorableConstructorFlag _) : base(_) { } |
[5578] | 39 | protected SingleObjectiveHeuristicOptimizationProblem(SingleObjectiveHeuristicOptimizationProblem<T, U> original, Cloner cloner) : base(original, cloner) { } |
40 | protected SingleObjectiveHeuristicOptimizationProblem() | |
41 | : base() { | |
[5618] | 42 | Parameters.Add(new ValueParameter<BoolValue>(MaximizationParameterName, "Set to false if the problem should be minimized.", new BoolValue())); |
[7440] | 43 | Parameters.Add(new OptionalValueParameter<DoubleValue>(BestKnownQualityParameterName, "The quality of the best known solution of this problem.")); |
[5578] | 44 | } |
45 | ||
[5618] | 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())); | |
[7440] | 49 | Parameters.Add(new OptionalValueParameter<DoubleValue>(BestKnownQualityParameterName, "The quality of the best known solution of this problem.")); |
[5618] | 50 | } |
51 | ||
[5872] | 52 | [StorableHook(HookType.AfterDeserialization)] |
[5899] | 53 | private void AfterDeserialization() { |
[5872] | 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 | } | |
[5578] | 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; } | |
[7442] | 70 | set { MaximizationParameter.Value = value; } |
[5578] | 71 | } |
72 | ||
[5872] | 73 | public IValueParameter<DoubleValue> BestKnownQualityParameter { |
74 | get { return (IValueParameter<DoubleValue>)Parameters[BestKnownQualityParameterName]; } | |
[5578] | 75 | } |
76 | IParameter ISingleObjectiveHeuristicOptimizationProblem.BestKnownQualityParameter { | |
77 | get { return BestKnownQualityParameter; } | |
78 | } | |
79 | public DoubleValue BestKnownQuality { | |
80 | get { return BestKnownQualityParameter.Value; } | |
[7442] | 81 | set { BestKnownQualityParameter.Value = value; } |
[5578] | 82 | } |
83 | ||
84 | ISingleObjectiveEvaluator ISingleObjectiveHeuristicOptimizationProblem.Evaluator { | |
85 | get { return Evaluator; } | |
86 | } | |
87 | } | |
88 | } |
Note: See TracBrowser
for help on using the repository browser.