Free cookie consent management tool by TermsFeed Policy Generator

source: branches/ProblemRefactoring/HeuristicLab.Optimization/3.3/BasicProblems/SingleObjectiveProblem.cs @ 13437

Last change on this file since 13437 was 13437, checked in by mkommend, 9 years ago

#2521: Added encodings for schedules.

File size: 5.9 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 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.Collections.Generic;
23using System.Linq;
24using HeuristicLab.Common;
25using HeuristicLab.Core;
26using HeuristicLab.Data;
27using HeuristicLab.Parameters;
28using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
29
30namespace HeuristicLab.Optimization {
31  [StorableClass]
32  public abstract class SingleObjectiveProblem<TEncoding, TSolution> :
33    Problem<TEncoding, TSolution, SingleObjectiveEvaluator<TSolution>>,
34    ISingleObjectiveProblem<TEncoding, TSolution>,
35    ISingleObjectiveProblemDefinition<TEncoding, TSolution>
36    where TEncoding : class, IEncoding<TSolution>
37    where TSolution : class, ISolution {
38
39    protected IValueParameter<DoubleValue> BestKnownQualityParameter {
40      get { return (IValueParameter<DoubleValue>)Parameters["BestKnownQuality"]; }
41    }
42
43    protected IFixedValueParameter<BoolValue> MaximizationParameter {
44      get { return (IFixedValueParameter<BoolValue>)Parameters["Maximization"]; }
45    }
46
47    public double BestKnownQuality {
48      get {
49        if (BestKnownQualityParameter.Value == null) return double.NaN;
50        return BestKnownQualityParameter.Value.Value;
51      }
52      set {
53        if (double.IsNaN(value)) {
54          BestKnownQualityParameter.Value = null;
55          return;
56        }
57        if (BestKnownQualityParameter.Value == null) BestKnownQualityParameter.Value = new DoubleValue(value);
58        else BestKnownQualityParameter.Value.Value = value;
59      }
60    }
61
62    [StorableConstructor]
63    protected SingleObjectiveProblem(bool deserializing) : base(deserializing) { }
64
65    protected SingleObjectiveProblem(SingleObjectiveProblem<TEncoding, TSolution> original, Cloner cloner)
66      : base(original, cloner) {
67      ParameterizeOperators();
68    }
69
70    protected SingleObjectiveProblem()
71      : base() {
72      Parameters.Add(new FixedValueParameter<BoolValue>("Maximization", "Set to false if the problem should be minimized.", (BoolValue)new BoolValue(Maximization).AsReadOnly()) { Hidden = true });
73      Parameters.Add(new OptionalValueParameter<DoubleValue>("BestKnownQuality", "The quality of the best known solution of this problem."));
74
75      Operators.Add(Evaluator);
76      Operators.Add(new SingleObjectiveAnalyzer<TSolution>());
77      Operators.Add(new SingleObjectiveImprover<TSolution>());
78      Operators.Add(new SingleObjectiveMoveEvaluator<TSolution>());
79      Operators.Add(new SingleObjectiveMoveGenerator<TSolution>());
80      Operators.Add(new SingleObjectiveMoveMaker<TSolution>());
81
82      ParameterizeOperators();
83    }
84
85    protected SingleObjectiveProblem(TEncoding encoding)
86      : base(encoding) {
87      Parameters.Add(new FixedValueParameter<BoolValue>("Maximization", "Set to false if the problem should be minimized.", (BoolValue)new BoolValue(Maximization).AsReadOnly()) { Hidden = true });
88      Parameters.Add(new OptionalValueParameter<DoubleValue>("BestKnownQuality", "The quality of the best known solution of this problem."));
89
90      Operators.Add(Evaluator);
91      Operators.Add(new SingleObjectiveAnalyzer<TSolution>());
92      Operators.Add(new SingleObjectiveImprover<TSolution>());
93      Operators.Add(new SingleObjectiveMoveEvaluator<TSolution>());
94      Operators.Add(new SingleObjectiveMoveGenerator<TSolution>());
95      Operators.Add(new SingleObjectiveMoveMaker<TSolution>());
96
97      ParameterizeOperators();
98    }
99
100    [StorableHook(HookType.AfterDeserialization)]
101    private void AfterDeserialization() {
102      ParameterizeOperators();
103    }
104
105    public abstract bool Maximization { get; }
106    public abstract double Evaluate(TSolution solution, IRandom random);
107    public virtual void Analyze(TSolution[] solutions, double[] qualities, ResultCollection results, IRandom random) { }
108    public virtual IEnumerable<TSolution> GetNeighbors(TSolution solution, IRandom random) {
109      return Enumerable.Empty<TSolution>();
110    }
111
112    public virtual bool IsBetter(double quality, double bestQuality) {
113      return (Maximization && quality > bestQuality || !Maximization && quality < bestQuality);
114    }
115
116    protected override void OnEvaluatorChanged() {
117      base.OnEvaluatorChanged();
118      ParameterizeOperators();
119    }
120
121    private void ParameterizeOperators() {
122      foreach (var op in Operators.OfType<ISingleObjectiveEvaluationOperator<TSolution>>())
123        op.EvaluateFunc = Evaluate;
124      foreach (var op in Operators.OfType<ISingleObjectiveAnalysisOperator<TSolution>>())
125        op.AnalyzeAction = Analyze;
126      foreach (var op in Operators.OfType<INeighborBasedOperator<TSolution>>())
127        op.GetNeighborsFunc = GetNeighbors;
128    }
129
130    #region ISingleObjectiveHeuristicOptimizationProblem Members
131    IParameter ISingleObjectiveHeuristicOptimizationProblem.MaximizationParameter {
132      get { return Parameters["Maximization"]; }
133    }
134    IParameter ISingleObjectiveHeuristicOptimizationProblem.BestKnownQualityParameter {
135      get { return Parameters["BestKnownQuality"]; }
136    }
137    ISingleObjectiveEvaluator ISingleObjectiveHeuristicOptimizationProblem.Evaluator {
138      get { return Evaluator; }
139    }
140    #endregion
141  }
142}
Note: See TracBrowser for help on using the repository browser.