- Timestamp:
- 11/14/17 15:31:22 (7 years ago)
- Location:
- branches/2817-BinPackingSpeedup/HeuristicLab.Problems.BinPacking/3.3/3D/Packer
- Files:
-
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/2817-BinPackingSpeedup/HeuristicLab.Problems.BinPacking/3.3/3D/Packer/BinPacker.cs
r15462 r15471 44 44 /// <param name="items">A list of packing items which should be assigned to a bin</param> 45 45 /// <param name="useStackingConstraints">Flag for using stacking constraints</param> 46 /// <returns> </returns>46 /// <returns>Returns a collection of bin packing 3d objects. Each object represents a bin and the packed items</returns> 47 47 public abstract IList<BinPacking3D> PackItems(Permutation sortedItems, PackingShape binShape, IList<PackingItem> items, bool useStackingConstraints); 48 49 48 50 51 49 /// <summary> 52 50 /// Pack a given item into a given bin and updates the residual space and the extreme points … … 78 76 packingItem.TargetBin, packingItem.Weight, packingItem.Material); 79 77 80 // The extremepoints are sortet by Z, X, Y 81 78 // The extremepoints are sortet by Y / Z / X 82 79 return packingBin.ExtremePoints.Where(x => packingBin.IsPositionFeasible(newItem, x, useStackingConstraints)).FirstOrDefault(); 83 80 } -
branches/2817-BinPackingSpeedup/HeuristicLab.Problems.BinPacking/3.3/3D/Packer/BinPackerFactory.cs
r15463 r15471 16 16 /// </summary> 17 17 /// <param name="fittingMethod"></param> 18 /// <returns> </returns>18 /// <returns>Returns a new BinPacker depending on the given fitting method</returns> 19 19 public static BinPacker CreateBinPacker(FittingMethod fittingMethod) { 20 20 BinPacker binPacker = null; -
branches/2817-BinPackingSpeedup/HeuristicLab.Problems.BinPacking/3.3/3D/Packer/BinPackerFirstFit.cs
r15462 r15471 38 38 39 39 /// <summary> 40 /// Packs the items of the object by using a first fit algorithm into an amount of bins and returns them 40 /// Packs the items of the object by using a first fit algorithm into an amount of bins and returns them. 41 41 /// </summary> 42 42 /// <returns>Returns a collection of bin packing 3d objects. Each object represents a bin and the packed items</returns> -
branches/2817-BinPackingSpeedup/HeuristicLab.Problems.BinPacking/3.3/3D/Packer/BinPackerFreeVolumeBestFit.cs
r15462 r15471 36 36 public BinPackerFreeVolumeBestFit() : base() { } 37 37 38 /// <summary> 39 /// Packs all items by using a free volume best fit strategy. 40 /// If there is no bin packing item, a new one will be created an the current item will be packed into it. 41 /// If there exists at least on bin packing item in the packing list they are being sortet by their free volume ascending. 42 /// The current item will be packed into the bin packing with the fewest free volume and enought space for placing it. 43 /// If an item could not be placed in any bin packing, a new one will be created for the item. 44 /// </summary> 45 /// <param name="sortedItems"></param> 46 /// <param name="binShape"></param> 47 /// <param name="items"></param> 48 /// <param name="useStackingConstraints"></param> 49 /// <returns>Returns a collection of bin packing 3d objects. Each object represents a bin and the packed items</returns> 38 50 public override IList<BinPacking3D> PackItems(Permutation sortedItems, PackingShape binShape, IList<PackingItem> items, bool useStackingConstraints) { 39 51 IList<BinPacking3D> packingList = new List<BinPacking3D>(); 40 52 IList<int> remainingIds = new List<int>(sortedItems); 41 42 53 43 54 foreach (int remainingId in remainingIds) { -
branches/2817-BinPackingSpeedup/HeuristicLab.Problems.BinPacking/3.3/3D/Packer/BinPackerResidualSpaceBestFit.cs
r15462 r15471 34 34 public class BinPackerResidualSpaceBestFit : BinPacker { 35 35 36 public BinPackerResidualSpaceBestFit() : base() { }/* 37 public BinPackerResidualSpaceBestFit(Permutation permutation, PackingShape binShape, IList<PackingItem> items, bool useStackingConstraints) 38 : base(permutation, binShape, items, useStackingConstraints) { } 39 */ 36 public BinPackerResidualSpaceBestFit() : base() { } 37 40 38 /// <summary> 41 39 /// Packs the items into the bins by using a best fit residual space algorithm. … … 43 41 /// Each residual space belongs to an extreme point. 44 42 /// </summary> 45 /// <returns> </returns>43 /// <returns>Returns a collection of bin packing 3d objects. Each object represents a bin and the packed items</returns> 46 44 public override IList<BinPacking3D> PackItems(Permutation sortedItems, PackingShape binShape, IList<PackingItem> items, bool useStackingConstraints) { 47 45 IList<BinPacking3D> packingList = new List<BinPacking3D>();
Note: See TracChangeset
for help on using the changeset viewer.