Changeset 14153 for branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking.2D/3.3

Timestamp:

07/21/16 14:33:53 (8 years ago)

Author:

gkronber

Message:

#1966: implemented 3d bin packing problems (using permutation and integer vector encoding) based on the 2d implementations

Location:

branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking.2D/3.3

Files:

• IntegerVectorEncoding/BottomLeftIntegerVectorDecoder.cs (modified) (1 diff)
• IntegerVectorEncoding/ExtremePointIntegerVectorDecoder.cs (modified) (1 diff)
• IntegerVectorEncoding/IntegerVectorDecoderBase.cs (modified) (4 diffs)
• IntegerVectorEncoding/IntegerVectorProblem.cs (modified) (1 diff)
• Interfaces/IDecoder.cs (modified) (1 diff)
• MoveEvaluatorBase.cs (modified) (1 diff)
• PermutationEncoding/BottomLeftPermutationDecoder.cs (modified) (1 diff)
• PermutationEncoding/ExtremePointPermutationDecoder.cs (modified) (1 diff)
• PermutationEncoding/PermutationProblem.cs (modified) (1 diff)
• ProblemBase.cs (modified) (2 diffs)
• Solution.cs (modified) (1 diff)

branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking.2D/3.3/IntegerVectorEncoding/BottomLeftIntegerVectorDecoder.cs

@@ -46 +46 @@
     }
 
-    protected override PackingPosition FindPositionForItem(BinPacking.BinPacking<PackingPosition, PackingShape, PackingItem> bp, PackingItem item) {
+    protected override PackingPosition FindPositionForItem(BinPacking2D bp, PackingItem item) {
       return bp.FindPositionBySliding(item, rotated: false);
     }
 
-    protected override BinPacking.BinPacking<PackingPosition, PackingShape, PackingItem> CreatePacking(
+    protected override BinPacking2D CreatePacking(
       Solution partialSolution,
       ref IList<int> remainingIDs, IList<PackingItem> items) {
-      var bp = partialSolution.NewBinPacking();
+      var bp = new BinPacking2D(partialSolution.BinMeasures);
       bp.SlidingBasedPacking(ref remainingIDs, items);
       return bp;

branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking.2D/3.3/IntegerVectorEncoding/ExtremePointIntegerVectorDecoder.cs

@@ -46 +46 @@
     }
 
-    protected override PackingPosition FindPositionForItem(BinPacking.BinPacking<PackingPosition, PackingShape, PackingItem> bp, PackingItem item) {
+    protected override PackingPosition FindPositionForItem(BinPacking2D bp, PackingItem item) {
       return bp.FindExtremePointForItem(item, false, stackingConstraints: false);
     }
 
-    protected override BinPacking.BinPacking<PackingPosition, PackingShape, PackingItem> CreatePacking(
+    protected override BinPacking2D CreatePacking(
       Solution partialSolution,
       ref IList<int> remainingIDs, IList<PackingItem> items) {
-      var bp = partialSolution.NewBinPacking();
+      var bp = new BinPacking2D(partialSolution.BinMeasures);
       bp.ExtremePointBasedPacking(ref remainingIDs, items, stackingConstraints: false);
       return bp;

branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking.2D/3.3/IntegerVectorEncoding/IntegerVectorDecoderBase.cs

@@ -39 +39 @@
 
 
-    public Solution Decode(IntegerVector intVec, PackingShape binShape, IList<PackingItem> items) {
+    public virtual Solution Decode(IntegerVector intVec, PackingShape binShape, IList<PackingItem> items) {
       var sequenceMatrix = IntegerVectorProblem.GenerateSequenceMatrix(intVec);
       Solution result = CreateSolution(binShape);
@@ -54 +54 @@
       var temp = new List<int>(remainingIDs);
       foreach (int id in temp) {
-        foreach (var bp in result.BinPackings) {
+        foreach (BinPacking2D bp in result.BinPackings) {
           var position = FindPositionForItem(bp, items[id]);
           if (position != null) {
@@ -70 +70 @@
       result.UpdateBinPackings();
 
-      // gkronber: original implementation also updates the encoded solution
+      // gkronber: original implementation by Helm also updates the encoded solution (TODO)
       // var newSolution = new int[intVec.Length];
       // int binIndex = 0;
@@ -84 +84 @@
 
     protected abstract Solution CreateSolution(PackingShape binShape);
-    protected abstract PackingPosition FindPositionForItem(BinPacking.BinPacking<PackingPosition, PackingShape, PackingItem> bp, PackingItem item);
-    protected abstract BinPacking.BinPacking<PackingPosition, PackingShape, PackingItem> CreatePacking(Solution partialSolution, ref IList<int> remainingIDs, IList<PackingItem> items);
+    protected abstract PackingPosition FindPositionForItem(BinPacking2D bp, PackingItem item);
+    protected abstract BinPacking2D CreatePacking(Solution partialSolution, ref IList<int> remainingIDs, IList<PackingItem> items);
   }
 }

branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking.2D/3.3/IntegerVectorEncoding/IntegerVectorProblem.cs

@@ -66 +66 @@
     private void AddOperators() {
 
-      // move operators are not yet supported
+      // move operators are not yet supported (TODO)
       Operators.RemoveAll(x => x is SingleObjectiveMoveGenerator);
       Operators.RemoveAll(x => x is SingleObjectiveMoveMaker);
       Operators.RemoveAll(x => x is SingleObjectiveMoveEvaluator);
 
-      Encoding.ConfigureOperators(Operators.OfType<IOperator>());
+      Encoding.ConfigureOperators(Operators.OfType<IOperator>()); // gkronber: not strictly necessary (only when customer ops are added)
     }
 

branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking.2D/3.3/Interfaces/IDecoder.cs

@@ -20 +20 @@
 #endregion
 
-using System.Collections;
 using System.Collections.Generic;
 using HeuristicLab.Core;
-using HeuristicLab.Encodings.PermutationEncoding;
-using HeuristicLab.Problems.BinPacking;
 
 namespace HeuristicLab.Problems.BinPacking2D {

branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking.2D/3.3/MoveEvaluatorBase.cs

@@ -23 +23 @@
 using HeuristicLab.Core;
 using HeuristicLab.Data;
-using HeuristicLab.Encodings.PermutationEncoding;
 using HeuristicLab.Operators;
 using HeuristicLab.Optimization;

branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking.2D/3.3/PermutationEncoding/BottomLeftPermutationDecoder.cs

@@ -45 +45 @@
       IList<int> remainingIDs = new List<int>(permutation);
       while (remainingIDs.Count > 0) {
-        var bp = result.NewBinPacking();
+        var bp = new BinPacking2D(binShape);
         bp.SlidingBasedPacking(ref remainingIDs, items);
         result.BinPackings.Add(bp);

branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking.2D/3.3/PermutationEncoding/ExtremePointPermutationDecoder.cs

@@ -45 +45 @@
       IList<int> remainingIDs = new List<int>(permutation);
       while (remainingIDs.Count > 0) {
-        var bp = result.NewBinPacking();
+        var bp = new BinPacking2D(binShape);
         bp.ExtremePointBasedPacking(ref remainingIDs, items, stackingConstraints: false);
         result.BinPackings.Add(bp);

branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking.2D/3.3/PermutationEncoding/PermutationProblem.cs

@@ -71 +71 @@
 
       Encoding.ConfigureOperators(Operators.OfType<IOperator>());
+
+      // TODO: configure the move evaluators (add interface for my move evaluators)
     }
 

branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking.2D/3.3/ProblemBase.cs

@@ -37 +37 @@
     where TEnc : class, IEncoding
     where TSol : class, IItem {
-    private readonly string SolutionEvaluatorParameterName = "SolutionEvaluator";
+    protected readonly string SolutionEvaluatorParameterName = "SolutionEvaluator";
     public readonly string EncodedSolutionName = "EncodedSolution";
     #region Default Instance
-    private static readonly BPPData DefaultInstance = new BPPData() {
+    private readonly BPPData defaultInstance = new BPPData() {
       Name = "2D BPP Default Instance",
       Description = "The default instance for 2D Bin Packing.",
@@ -155 +155 @@
       Parameters.Add(new FixedValueParameter<IntValue>("LowerBound", "A lower bound for the number of bins that is necessary to pack all items"));
 
-      Load(DefaultInstance);
+      Load(defaultInstance);
     }
 

branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking.2D/3.3/Solution.cs

@@ -39 +39 @@
       return new Solution(this, cloner);
     }
-    public override BinPacking<PackingPosition, PackingShape, PackingItem> NewBinPacking() {
-      return new BinPacking2D(BinMeasures);
-    }
   }
 }