Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Evaluators/Abstract/PackingPlanEvaluator.cs @ 9440

Last change on this file since 9440 was 9440, checked in by jhelm, 11 years ago

#1966: Implemented new encoding (MultiComponentVector/MCV); Implemented move-operators for MCV and GV encodings; Implemented new decoding-methods for PS, GV and MCV encodings (ExtremePoint-based packing);

File size: 3.1 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 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;
23using System.Collections.Generic;
24using System.Linq;
25using System.Text;
26using HeuristicLab.Core;
27using HeuristicLab.Problems.BinPacking.Interfaces;
28using HeuristicLab.Operators;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30using HeuristicLab.Common;
31using HeuristicLab.Parameters;
32using HeuristicLab.Data;
33using HeuristicLab.Encodings.PackingEncoding.PackingPlan;
34using HeuristicLab.Problems.BinPacking.Shapes;
35
36namespace HeuristicLab.Problems.BinPacking.Evaluators {
37  [Item("Packingplan Evaluator", "Represents a evaluator class for standard bin-packing problems.")]
38  [StorableClass]
39  public abstract class PackingPlanEvaluator<D,B,I> : SingleSuccessorOperator, IPackingPlanEvaluator
40    where D : class, IPackingDimensions
41    where B : PackingShape<D>, IPackingBin
42    where I : PackingShape<D>, IPackingItem {
43
44    #region Parameters
45    public ILookupParameter<IRandom> RandomParameter {
46      get { return (LookupParameter<IRandom>)Parameters["Random"]; }
47    }
48    public ILookupParameter<DoubleValue> QualityParameter {
49      get {
50        if (Parameters.ContainsKey("Quality"))
51          return (ILookupParameter<DoubleValue>)Parameters["Quality"];
52        else
53          return null;
54      }
55    }
56    public ILookupParameter<IPackingPlan> PackingPlanParameter {
57      get { return (ILookupParameter<IPackingPlan>)Parameters["PackingPlan"]; }
58    }
59    #endregion
60
61    [StorableConstructor]
62    protected PackingPlanEvaluator(bool deserializing) : base(deserializing) { }
63    protected PackingPlanEvaluator(PackingPlanEvaluator<D,B,I> original, Cloner cloner)
64      : base(original, cloner) {
65    }
66    public PackingPlanEvaluator()
67      : base() {
68      Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The quality value aka fitness value of the solution."));
69      Parameters.Add(new LookupParameter<IPackingPlan>("PackingPlan", "The decoded bin-packing solution represented as generalized packing-plan."));
70      Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator."));
71    }
72
73
74    protected abstract DoubleValue Evaluate();
75
76    public override IOperation Apply() {
77      QualityParameter.ActualValue = Evaluate();
78      return base.Apply();
79    }
80
81  }
82}
Note: See TracBrowser for help on using the repository browser.