Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking.2D/3.3/IntegerVectorEncoding/IntegerVectorProblem.cs @ 14153

Last change on this file since 14153 was 14153, checked in by gkronber, 8 years ago

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

File size: 3.8 KB
Line 
1#region License Information
2
3/* HeuristicLab
4 * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
5 *
6 * This file is part of HeuristicLab.
7 *
8 * HeuristicLab is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version.
12 *
13 * HeuristicLab is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
16 * GNU General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License
19 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
20 */
21
22#endregion
23
24using System.Collections.Generic;
25using System.Linq;
26using HeuristicLab.Common;
27using HeuristicLab.Core;
28using HeuristicLab.Encodings.IntegerVectorEncoding;
29using HeuristicLab.Optimization;
30using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
31
32namespace HeuristicLab.Problems.BinPacking2D {
33  [Item("Bin Packing Problem (2D, integer vector encoding) (BPP)", "Represents a two-dimensional bin-packing problem using only bins with identical measures and bins/items with rectangular shapes.")]
34  [StorableClass]
35  [Creatable(Category = CreatableAttribute.Categories.CombinatorialProblems, Priority = 310)]
36  public sealed class IntegerVectorProblem : ProblemBase<IntegerVectorEncoding, IntegerVector> {
37    // persistence
38    [StorableConstructor]
39    private IntegerVectorProblem(bool deserializing) : base(deserializing) { }
40
41    // cloning
42    private IntegerVectorProblem(IntegerVectorProblem original, Cloner cloner)
43      : base(original, cloner) {
44      RegisterEventHandlers();
45    }
46
47    public IntegerVectorProblem()
48      : base() {
49      Decoder = new ExtremePointIntegerVectorDecoder(); // default decoder
50
51      // the int vector contains the target bin number for each item
52      Encoding = new IntegerVectorEncoding(EncodedSolutionName, Items.Count, min: 0, max: LowerBound + 1); // NOTE: assumes that all items can be packed into LowerBound+1 bins
53      AddOperators();
54      RegisterEventHandlers();
55    }
56    public override IDeepCloneable Clone(Cloner cloner) {
57      return new IntegerVectorProblem(this, cloner);
58    }
59
60    [StorableHook(HookType.AfterDeserialization)]
61    private void AfterDeserialization() {
62      RegisterEventHandlers();
63    }
64
65
66    private void AddOperators() {
67
68      // move operators are not yet supported (TODO)
69      Operators.RemoveAll(x => x is SingleObjectiveMoveGenerator);
70      Operators.RemoveAll(x => x is SingleObjectiveMoveMaker);
71      Operators.RemoveAll(x => x is SingleObjectiveMoveEvaluator);
72
73      Encoding.ConfigureOperators(Operators.OfType<IOperator>()); // gkronber: not strictly necessary (only when customer ops are added)
74    }
75
76    private void RegisterEventHandlers() {
77      // update encoding length when number of items is changed
78      ItemsParameter.ValueChanged += (sender, args) => Encoding.Length = Items.Count;
79      LowerBoundParameter.Value.ValueChanged += (sender, args) => {
80        for (int i = 0; i < Encoding.Bounds.Rows; i++) {
81          Encoding.Bounds[i, 1] = LowerBound + 1;
82        }
83      };
84    }
85
86    #region helpers
87
88    public static List<List<int>> GenerateSequenceMatrix(IntegerVector intVec) {
89      List<List<int>> result = new List<List<int>>();
90      int nrOfBins = intVec.Max() + 1;
91      for (int i = 0; i < nrOfBins; i++)
92        result.Add(new List<int>());
93      for (int i = 0; i < intVec.Length; i++) {
94        result[intVec[i]].Add(i);
95      }
96      return result;
97    }
98    #endregion
99  }
100}
Note: See TracBrowser for help on using the repository browser.