Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Analyzers/BinPackingAnalyzer.cs @ 13032

Last change on this file since 13032 was 13032, checked in by gkronber, 8 years ago

#1966:

  • removed unused using
  • added/updated license headers
File size: 4.1 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 Joseph Helm and 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.Operators;
26using HeuristicLab.Optimization;
27using HeuristicLab.Parameters;
28using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
29using HeuristicLab.Problems.BinPacking.Interfaces;
30using HeuristicLab.Encodings.PackingEncoding.PackingPlan;
31using HeuristicLab.Problems.BinPacking.Shapes;
32
33namespace HeuristicLab.Problems.BinPacking.Analyzers {
34  [Item("BinPackingAnalyzer", "Represents the generalized form of Analyzers for BinPacking Problems.")]
35  [StorableClass]
36  public abstract class BinPackingAnalyzer<D, B, I> : SingleSuccessorOperator, IAnalyzer
37    where D : class, IPackingDimensions
38    where B : PackingShape<D>, IPackingBin
39    where I : PackingShape<D>, IPackingItem {
40    public virtual bool EnabledByDefault {
41      get { return true; }
42    }
43
44    protected BinPackingAnalyzer(BinPackingAnalyzer<D,B,I> original, Cloner cloner)
45      : base(original, cloner) {
46    }
47
48    #region Parameter Properties
49    public LookupParameter<BoolValue> MaximizationParameter {
50      get { return (LookupParameter<BoolValue>)Parameters["Maximization"]; }
51    }
52    public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
53      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
54    }
55    public LookupParameter<PackingPlan<D, B, I>> BestSolutionParameter {
56      get { return (LookupParameter<PackingPlan<D, B, I>>)Parameters["BestSolution"]; }
57    }
58    public ValueLookupParameter<ResultCollection> ResultsParameter {
59      get { return (ValueLookupParameter<ResultCollection>)Parameters["Results"]; }
60    }
61    public LookupParameter<DoubleValue> BestKnownQualityParameter {
62      get { return (LookupParameter<DoubleValue>)Parameters["BestKnownQuality"]; }
63    }
64    public LookupParameter<PackingPlan<D, B, I>> BestKnownSolutionParameter {
65      get { return (LookupParameter<PackingPlan<D, B, I>>)Parameters["BestKnownSolution"]; }
66    }
67    public ScopeTreeLookupParameter<PackingPlan<D, B, I>> PackingPlanParameter {
68      get { return (ScopeTreeLookupParameter<PackingPlan<D,B,I>>)Parameters["PackingPlan"]; }
69    }
70    #endregion
71
72    public BinPackingAnalyzer()
73      : base() {
74      Parameters.Add(new LookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem."));
75      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the packing solutions which should be analyzed."));
76      Parameters.Add(new ScopeTreeLookupParameter<PackingPlan<D, B, I>>("PackingPlan", "The solutions from which the best solution has to be chosen from."));
77      Parameters.Add(new LookupParameter<PackingPlan<D, B, I>>("BestSolution", "The best performing packing plan."));
78      Parameters.Add(new ValueLookupParameter<ResultCollection>("Results", "The result collection where the best packing solution should be stored."));
79      Parameters.Add(new LookupParameter<DoubleValue>("BestKnownQuality", "The quality of the best known solution of this packing-problem instance."));
80      Parameters.Add(new LookupParameter<PackingPlan<D, B, I>>("BestKnownSolution", "The best known solution of this packing-problem instance."));
81    }
82  }
83}
Note: See TracBrowser for help on using the repository browser.