Changeset 14151 for branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingPlans/PackingPlan.cs

Timestamp:

07/21/16 13:03:42 (8 years ago)

Author:

gkronber

Message:

#1966: added abstract problem and move evaluator classes and implemented 2d bin packing problem based on integer vector encoding

File:

• branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingPlans/PackingPlan.cs (modified) (2 diffs)

branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingPlans/PackingPlan.cs

@@ -27 +27 @@
 using HeuristicLab.Data;
 using HeuristicLab.Collections;
-using HeuristicLab.Problems.BinPacking;
 
-namespace HeuristicLab.Encodings.PackingEncoding {
+namespace HeuristicLab.Problems.BinPacking {
   [Item("PackingPlan", "Represents a concrete solution for a bin-packing problem.")]
   [StorableClass]
@@ -145 +144 @@
     }
     public void Pack(GroupingVectorEncoding solution, ItemList<I> itemMeasures) {
-      var sequenceMatrix = solution.GenerateSequenceMatrix();
-
-      //Fill bins according to grouping vector
-      List<int> remainingIDs = new List<int>();
-      foreach (var sequence in sequenceMatrix) {
-        remainingIDs = remainingIDs.Concat(sequence).ToList();
-        var bp = NewBinPacking();
-        if (!UseExtremePoints)
-          bp.SlidingBasedPacking(ref remainingIDs, itemMeasures);
-        else
-          bp.ExtremePointBasedPacking(ref remainingIDs, itemMeasures, StackingConstraints);
-        BinPackings.Add(bp);
-      }
-      UpdateBinPackings();
-
-      //Try to put remaining items in existing bins
-      var temp = new List<int>(remainingIDs);
-      foreach (int id in temp) {
-        foreach (var bp in BinPackings) {
-          var position = UseExtremePoints ? bp.FindExtremePointForItem(itemMeasures[id], false, StackingConstraints) : bp.FindPositionBySliding(itemMeasures[id], false);
-          if (position != null) {
-            bp.PackItem(id, itemMeasures[id], position);
-            remainingIDs.Remove(id);
-            break;
-          }
-        }
-      }
-
-      //Put still remaining items in new bins
-      while (remainingIDs.Count > 0) {
-        var bp = NewBinPacking();
-        if (!UseExtremePoints)
-          bp.SlidingBasedPacking(ref remainingIDs, itemMeasures);
-        else
-          bp.ExtremePointBasedPacking(ref remainingIDs, itemMeasures, StackingConstraints);
-        BinPackings.Add(bp);
-      }
-      UpdateBinPackings();
-
-      var newSolution = new int[solution.GroupingVector.Length];
-      int binIndex = 0;
-      foreach (var bp in BinPackings) {
-        foreach (var entry in bp.ItemPositions)
-          newSolution[entry.Key] = binIndex;
-        binIndex++;
-      }
-      solution.GroupingVector = new IntegerVector(newSolution);
     }
      * 
      
-    public void Pack(Permutation solution, ItemList<I> itemMeasures) {
-      List<int> remainingIDs = new List<int>(solution);
-      while (remainingIDs.Count > 0) {
-        var bp = NewBinPacking();
-        if (!UseExtremePoints)
-          bp.SlidingBasedPacking(ref remainingIDs, itemMeasures);
-        else
-          bp.ExtremePointBasedPacking(ref remainingIDs, itemMeasures, StackingConstraints);
-        BinPackings.Add(bp);
-      }
-      UpdateBinPackings();
-    }
 
     */