[4323] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2010 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 |
|
---|
[4722] | 22 | using HeuristicLab.Common;
|
---|
[4323] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Parameters;
|
---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 27 |
|
---|
[4564] | 28 | namespace HeuristicLab.Optimization {
|
---|
[4596] | 29 | [Item("Single Objective Problem", "Represents the base class for a single objective problem.")]
|
---|
[4323] | 30 | [StorableClass]
|
---|
| 31 | public abstract class SingleObjectiveProblem<T, U> : Problem<T, U>, ISingleObjectiveProblem
|
---|
| 32 | where T : class, ISingleObjectiveEvaluator
|
---|
| 33 | where U : class, ISolutionCreator {
|
---|
| 34 | private const string MaximizationParameterName = "Maximization";
|
---|
| 35 | private const string BestKnownQualityParameterName = "BestKnownQuality";
|
---|
| 36 |
|
---|
[4722] | 37 | [StorableConstructor]
|
---|
| 38 | protected SingleObjectiveProblem(bool deserializing) : base(deserializing) { }
|
---|
| 39 | protected SingleObjectiveProblem(SingleObjectiveProblem<T, U> original, Cloner cloner)
|
---|
| 40 | : base(original, cloner) {
|
---|
| 41 | }
|
---|
| 42 |
|
---|
[4323] | 43 | protected SingleObjectiveProblem()
|
---|
| 44 | : base() {
|
---|
[4596] | 45 | Parameters.Add(new ValueParameter<BoolValue>(MaximizationParameterName, "Set to false if the problem should be minimized."));
|
---|
| 46 | Parameters.Add(new ValueParameter<DoubleValue>(BestKnownQualityParameterName, "The quality of the best known solution of this problem."));
|
---|
[4323] | 47 | }
|
---|
| 48 |
|
---|
[4722] | 49 |
|
---|
[4323] | 50 | #region properties
|
---|
| 51 | ISingleObjectiveEvaluator ISingleObjectiveProblem.Evaluator { get { return Evaluator; } }
|
---|
| 52 |
|
---|
| 53 | public BoolValue Maximization {
|
---|
| 54 | get { return MaximizationParameter.Value; }
|
---|
| 55 | protected set { MaximizationParameter.Value = value; }
|
---|
| 56 | }
|
---|
| 57 | public ValueParameter<BoolValue> MaximizationParameter {
|
---|
| 58 | get { return (ValueParameter<BoolValue>)Parameters[MaximizationParameterName]; }
|
---|
| 59 | }
|
---|
| 60 | IParameter ISingleObjectiveProblem.MaximizationParameter {
|
---|
| 61 | get { return MaximizationParameter; }
|
---|
| 62 | }
|
---|
| 63 |
|
---|
| 64 | public DoubleValue BestKnownQuality {
|
---|
| 65 | get { return BestKnownQualityParameter.Value; }
|
---|
| 66 | protected set { BestKnownQualityParameter.Value = value; }
|
---|
| 67 | }
|
---|
| 68 | public ValueParameter<DoubleValue> BestKnownQualityParameter {
|
---|
| 69 | get { return (ValueParameter<DoubleValue>)Parameters[BestKnownQualityParameterName]; }
|
---|
| 70 | }
|
---|
| 71 | IParameter ISingleObjectiveProblem.BestKnownQualityParameter {
|
---|
| 72 | get { return BestKnownQualityParameter; }
|
---|
| 73 | }
|
---|
| 74 | #endregion
|
---|
| 75 | }
|
---|
| 76 | }
|
---|