Free cookie consent management tool by TermsFeed Policy Generator

source: branches/Scheduling/HeuristicLab.Problems.Scheduling/3.3/Analyzers/SchedulingAnalyzer.cs @ 6406

Last change on this file since 6406 was 6406, checked in by jhelm, 13 years ago

#1329: Applied suggestions from codereview. Added unit-tests. Renamed encoding-project.

File size: 3.7 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2011 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.Encodings.ScheduleEncoding;
26using HeuristicLab.Operators;
27using HeuristicLab.Optimization;
28using HeuristicLab.Parameters;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30
31namespace HeuristicLab.Problems.Scheduling {
32  [Item("SchedulingAnalyzer", "Represents the generalized form of Analyzers for Scheduling Problems.")]
33  [StorableClass]
34  public abstract class SchedulingAnalyzer : SingleSuccessorOperator, IAnalyzer {
35    [StorableConstructor]
36    protected SchedulingAnalyzer(bool deserializing) : base(deserializing) { }
37    protected SchedulingAnalyzer(SchedulingAnalyzer original, Cloner cloner)
38      : base(original, cloner) {
39    }
40
41    #region Parameter Properties
42    public LookupParameter<BoolValue> MaximizationParameter {
43      get { return (LookupParameter<BoolValue>)Parameters["Maximization"]; }
44    }
45    public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
46      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
47    }
48    public LookupParameter<Schedule> BestSolutionParameter {
49      get { return (LookupParameter<Schedule>)Parameters["BestSolution"]; }
50    }
51    public ValueLookupParameter<ResultCollection> ResultsParameter {
52      get { return (ValueLookupParameter<ResultCollection>)Parameters["Results"]; }
53    }
54    public LookupParameter<DoubleValue> BestKnownQualityParameter {
55      get { return (LookupParameter<DoubleValue>)Parameters["BestKnownQuality"]; }
56    }
57    public LookupParameter<Schedule> BestKnownSolutionParameter {
58      get { return (LookupParameter<Schedule>)Parameters["BestKnownSolution"]; }
59    }
60    public ScopeTreeLookupParameter<Schedule> ScheduleParameter {
61      get { return (ScopeTreeLookupParameter<Schedule>)Parameters["Schedule"]; }
62    }
63    #endregion
64
65    public SchedulingAnalyzer()
66      : base() {
67      Parameters.Add(new LookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem."));
68      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the JSSP solutions which should be analyzed."));
69      Parameters.Add(new ScopeTreeLookupParameter<Schedule>("Schedule", "The solutions from which the best solution has to be chosen from."));
70      Parameters.Add(new LookupParameter<Schedule>("BestSolution", "The best JSSP solution."));
71      Parameters.Add(new ValueLookupParameter<ResultCollection>("Results", "The result collection where the best JSSP solution should be stored."));
72      Parameters.Add(new LookupParameter<DoubleValue>("BestKnownQuality", "The quality of the best known solution of this JSSP instance."));
73      Parameters.Add(new LookupParameter<Schedule>("BestKnownSolution", "The best known solution of this JSSP instance."));
74    }
75  }
76}
Note: See TracBrowser for help on using the repository browser.