Free cookie consent management tool by TermsFeed Policy Generator

source: stable/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs @ 18151

Last change on this file since 18151 was 17181, checked in by swagner, 5 years ago

#2875: Merged r17180 from trunk to stable

  • Property svn:mergeinfo set to (toggle deleted branches)
    /branches/2839_HiveProjectManagement/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.csmergedeligible
    /trunk/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.csmergedeligible
    /branches/2520_PersistenceReintegration/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs16451-16564
    /branches/2892_LR-prediction-intervals/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs15743-16388
    /branches/2915-AbsoluteSymbol/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs15943-16355
    /branches/2965_CancelablePersistence/HeuristicLab.Optimization/3.3/Problems/SingleObjectiveHeuristicOptimizationProblem.cs16321-16439
    /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.cs12509-12511,​12524,​12578,​12626-12627,​12722,​12770,​12772,​12790-12792,​12796,​12798,​12801,​12811-12812,​12817,​12836-12837,​12907,​12971,​12975-12976,​13137,​13268,​13406,​13428-13430,​13434,​13450,​13474,​13501,​13503,​13511,​13513,​13534-13535,​13540,​13550,​13552,​13593,​13645,​13648,​13650-13652,​13654,​13657-13659,​13661-13662,​13666,​13669,​13682-13684,​13690-13693,​13708-13709,​13724,​13746,​14015-14016,​14107,​14135,​14142,​14160,​14226,​14228-14230,​14234-14236,​14244-14247,​14250,​14255-14258,​14260,​14267,​14271-14272,​14282,​14284-14292,​14296-14298,​14300,​14307,​14314-14316,​14319,​14322,​14332,​14343-14350,​14358,​14367-14368,​14378,​14381-14382,​14384,​14388,​14390-14391,​14393-14394,​14396,​14400,​14405,​14407-14408,​14418,​14422-14423,​14425,​14434,​14463-14464,​14468-14469,​14479,​14483,​14486,​14507,​14517,​14523,​14527,​14529,​14531-14533,​14553,​14623,​14630,​14781,​14789-14791,​14805,​14826-14827,​14829-14832,​14839-14840,​14843,​14845-14847,​14851-14854,​14857,​14864-14865,​14871,​14889-14890,​14899,​14904,​14918,​14938,​14940,​14943-14946,​14948-14951,​15002,​15013,​15015-15016,​15023-15024,​15026,​15046,​15052-15054,​15058,​15077,​15085,​15088,​15094,​15103-15106,​15111-15113,​15122-15124,​15129,​15139,​15160,​15163,​15165,​15184-15185,​15187,​15194,​15287
File size: 4.2 KB
RevLine 
[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
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Parameters;
[17097]26using HEAL.Attic;
[5578]27
28namespace 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.