#region License Information /* HeuristicLab * Copyright (C) 2002-2018 Joseph Helm and Heuristic and Evolutionary Algorithms Laboratory (HEAL) * * This file is part of HeuristicLab. * * HeuristicLab is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * HeuristicLab is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HeuristicLab. If not, see . */ #endregion using HeuristicLab.Core; using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; using HeuristicLab.Common; using System.Collections.Generic; using HeuristicLab.Encodings.PermutationEncoding; namespace HeuristicLab.Problems.BinPacking2D { [Item("Bottom-left Permutation Decoder (2d)", "Decodes the permutation and creates a packing solution candidate")] [StorableClass] public class BottomLeftPermutationDecoder : Item, IDecoder { [StorableConstructor] protected BottomLeftPermutationDecoder(bool deserializing) : base(deserializing) { } protected BottomLeftPermutationDecoder(BottomLeftPermutationDecoder original, Cloner cloner) : base(original, cloner) { } public BottomLeftPermutationDecoder() : base() { } public override IDeepCloneable Clone(Cloner cloner) { return new BottomLeftPermutationDecoder(this, cloner); } public Solution Decode(Permutation permutation, PackingShape binShape, IList items) { Solution result = new Solution(binShape, useExtremePoints: false, stackingConstraints: false); IList remainingIDs = new List(permutation); while (remainingIDs.Count > 0) { var bp = new BinPacking2D(binShape); bp.SlidingBasedPacking(ref remainingIDs, items, stackingConstraints: false); result.Bins.Add(bp); } result.UpdateBinPackings(); return result; } } }