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 HeuristicLab.Core;


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


24  using HeuristicLab.Common;


25  using System.Collections.Generic;


26  using HeuristicLab.Encodings.PermutationEncoding;


27 


28  namespace HeuristicLab.Problems.BinPacking2D {


29  [Item("Bottomleft Permutation Decoder (2d)", "Decodes the permutation and creates a packing solution candidate")]


30  [StorableClass]


31  public class BottomLeftPermutationDecoder : Item, IDecoder<Permutation> {


32 


33  [StorableConstructor]


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


35  protected BottomLeftPermutationDecoder(BottomLeftPermutationDecoder original, Cloner cloner)


36  : base(original, cloner) {


37  }


38  public BottomLeftPermutationDecoder() : base() { }


39  public override IDeepCloneable Clone(Cloner cloner) {


40  return new BottomLeftPermutationDecoder(this, cloner);


41  }


42 


43  public Solution Decode(Permutation permutation, PackingShape binShape, IList<PackingItem> items) {


44  Solution result = new Solution(binShape, useExtremePoints: false, stackingConstraints: false);


45  IList<int> remainingIDs = new List<int>(permutation);


46  while (remainingIDs.Count > 0) {


47  var bp = result.NewBinPacking();


48  bp.SlidingBasedPacking(ref remainingIDs, items);


49  result.BinPackings.Add(bp);


50  }


51  result.UpdateBinPackings();


52  return result;


53  }


54  }


55  }

