Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Evaluators/Abstract/BinUtilizationRegularIdenticalBinEvaluator.cs @ 9563

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

#1966: Implemented additional Operator-Wrappers for PackingSequence and GroupingVector; Implemented additional problem-class for Rosenbauer-Problemstatement; Added marker-interfaces for decoder-types;

File size: 4.6 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.Persistence.Default.CompositeSerializers.Storable;
28using HeuristicLab.Problems.BinPacking.Interfaces;
29using HeuristicLab.Problems.BinPacking.Shapes;
30using HeuristicLab.Data;
31using HeuristicLab.Common;
32using HeuristicLab.Encodings.PackingEncoding.PackingPlan;
33
34namespace HeuristicLab.Problems.BinPacking.Evaluators {
35  [Item("Bin-Utilization Regular Identical-Bin Evaluator", "<Description missing> Found in Lee:2010")]
36  [StorableClass]
37  public abstract class BinUtilizationRegularIdenticalBinEvaluator<D, B, I> : RegularSimpleRotationIdenticalBinPackingPlanEvaluator<D, B, I>
38    where D : class, IPackingDimensions
39    where B : PackingShape<D>, IPackingBin, IRegularPackingShape
40    where I : PackingShape<D>, IPackingItem, IRegularPackingShape {
41
42    [StorableConstructor]
43    protected BinUtilizationRegularIdenticalBinEvaluator(bool deserializing) : base(deserializing) { }
44    protected BinUtilizationRegularIdenticalBinEvaluator(BinUtilizationRegularIdenticalBinEvaluator<D, B, I> original, Cloner cloner)
45      : base(original, cloner) {
46    }
47    public BinUtilizationRegularIdenticalBinEvaluator() : base() { }
48
49    protected override DoubleValue Evaluate() {
50      DoubleValue quality = new DoubleValue(0);
51
52      IPackingPlan plan = PackingPlanParameter.ActualValue;
53      B binMeasure = PackingBinMeasuresParameter.ActualValue;
54      ItemList<I> itemMeasures = PackingItemMeasuresParameter.ActualValue;
55
56
57      //Check if data is valid
58      //if (plan.PackingItemPositions.Count != itemMeasures.Count)
59      //  throw new Exception("ERROR: ItemMeasures.count does not match packingPosition.count");
60
61
62      ////Check if any items are overlapping or not contained in their bins
63      //bool itemPositionsAreValid = !HasOverlappingOrNotContainedItems(plan.PackingItemPositions, binMeasure, itemMeasures, nrOfBins);
64
65
66
67      //if (itemPositionsAreValid)
68      return CalculateBinUtilization(plan as PackingPlan<D, B, I>);
69
70      //return quality;
71    }
72
73    public static DoubleValue CalculateBinUtilization(PackingPlan<D, B, I> plan) {
74      int nrOfBins = plan.NrOfBins;
75      double result = 0;
76
77      //for (int i = 0; i < nrOfBins; i++) {
78      //  double usableSpace = plan.GetPackingBinMeasuresForBinNr(i).MultipliedMeasures;
79      //  var indexes = plan.PackingItemPositions.Select((Value, Index) => new { Value, Index }).Where(s => s.Value.Value.AssignedBin == i).Select(s => s.Index);
80      //  var packedItemsInThisBin = plan.PackingItemMeasures.Select((Value, Index) => new { Value, Index }).Where(s => indexes.Contains(s.Index));
81      //  double usedSpaceInThisBin = packedItemsInThisBin.Select(s => s.Value.MultipliedMeasures).Sum();
82      //  result += (usedSpaceInThisBin / usableSpace);
83      //}
84
85      //result = result / nrOfBins;
86      //return new DoubleValue (result);
87
88      double totalUsedSpace = 0;
89      double totalUsableSpace = 0;
90
91      for (int i = 0; i < nrOfBins; i++) {
92        double usableSpace = plan.GetPackingBinMeasuresForBinNr(i).MultipliedMeasures;
93        var indexes = plan.PackingItemPositions.Select((Value, Index) => new { Value, Index }).Where(s => s.Value.Value.AssignedBin == i).Select(s => s.Index);
94        var packedItemsInThisBin = plan.PackingItemMeasures.Select((Value, Index) => new { Value, Index }).Where(s => indexes.Contains(s.Index));
95        double usedSpaceInThisBin = packedItemsInThisBin.Select(s => s.Value.MultipliedMeasures).Sum();
96        //result += (usedSpaceInThisBin / usableSpace);
97        totalUsableSpace += usableSpace;
98        totalUsedSpace += usedSpaceInThisBin;
99      }
100
101      result = totalUsedSpace / totalUsableSpace;
102      return new DoubleValue(result);
103    }
104  }
105}
Note: See TracBrowser for help on using the repository browser.