1  #region License Information


2  /* HeuristicLab


3  * Copyright (C) 20022015 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 


22  using System;


23  using System.Linq;


24  using HeuristicLab.Core;


25  using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;


26  using HeuristicLab.Common;


27 


28  namespace HeuristicLab.Problems.BinPacking2D {


29  [Item("BinUtilization Evaluator (2d)", "Calculates the overall utilization of bin space.")]


30  [StorableClass]


31  public class BinUtilizationEvaluator : Item, IEvaluator {


32 


33  [StorableConstructor]


34  protected BinUtilizationEvaluator(bool deserializing) : base(deserializing) { }


35  protected BinUtilizationEvaluator(BinUtilizationEvaluator original, Cloner cloner)


36  : base(original, cloner) {


37  }


38  public BinUtilizationEvaluator() : base() { }


39  public override IDeepCloneable Clone(Cloner cloner) {


40  return new BinUtilizationEvaluator(this, cloner);


41  }


42 


43  #region IEvaluator Members


44  public double Evaluate(Solution solution) {


45  return CalculateBinUtilization(solution);


46  }


47 


48 


49  public static double CalculateBinUtilization(Solution solution) {


50  int nrOfBins = solution.NrOfBins;


51  double totalUsedSpace = 0;


52  double totalUsableSpace = 0;


53 


54  for (int i = 0; i < nrOfBins; i++) {


55  totalUsableSpace += solution.BinPackings[i].BinMeasures.Volume;


56  totalUsedSpace += solution.BinPackings[i].ItemMeasures.Sum(kvp => kvp.Value.Volume);


57  }


58 


59  return totalUsedSpace / totalUsableSpace;


60  }


61 


62  #endregion


63  }


64  }

