1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2016 Joseph Helm and Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
4 | *
|
---|
5 | * This file is part of HeuristicLab.
|
---|
6 | *
|
---|
7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
8 | * it under the terms of the GNU General Public License as published by
|
---|
9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
10 | * (at your option) any later version.
|
---|
11 | *
|
---|
12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
15 | * GNU General Public License for more details.
|
---|
16 | *
|
---|
17 | * You should have received a copy of the GNU General Public License
|
---|
18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
19 | */
|
---|
20 | #endregion
|
---|
21 |
|
---|
22 | using System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using System.Linq;
|
---|
25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
26 | using HeuristicLab.Core;
|
---|
27 | using HeuristicLab.Common;
|
---|
28 | using HeuristicLab.Collections;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Problems.BinPacking {
|
---|
31 | [Item("BinPacking", "Represents a single-bin packing for a bin-packing problem.")]
|
---|
32 | [StorableClass]
|
---|
33 | public abstract class BinPacking<TPos, TBin, TItem> : Item
|
---|
34 | where TPos : class, IPackingPosition
|
---|
35 | where TBin : PackingShape<TPos>
|
---|
36 | where TItem : PackingShape<TPos> {
|
---|
37 | #region Properties
|
---|
38 | [Storable]
|
---|
39 | public ObservableDictionary<int, TPos> Positions { get; private set; }
|
---|
40 |
|
---|
41 | [Storable]
|
---|
42 | public ObservableDictionary<int, TItem> Items { get; private set; }
|
---|
43 |
|
---|
44 | [Storable]
|
---|
45 | public TBin BinShape { get; private set; }
|
---|
46 |
|
---|
47 | [Storable]
|
---|
48 | public SortedSet<TPos> ExtremePoints { get; protected set; }
|
---|
49 |
|
---|
50 | [Storable]
|
---|
51 | protected Dictionary<int, List<int>> OccupationLayers { get; set; }
|
---|
52 |
|
---|
53 | [Storable]
|
---|
54 | public Dictionary<TPos, Tuple<int,int,int>> ResidualSpace { get; protected set; }
|
---|
55 |
|
---|
56 | #endregion Properties
|
---|
57 |
|
---|
58 | public int FreeVolume {
|
---|
59 | get { return BinShape.Volume - Items.Sum(x => x.Value.Volume); }
|
---|
60 | }
|
---|
61 |
|
---|
62 | protected BinPacking(TBin binShape)
|
---|
63 | : base() {
|
---|
64 | Positions = new ObservableDictionary<int, TPos>();
|
---|
65 | Items = new ObservableDictionary<int, TItem>();
|
---|
66 | BinShape = (TBin)binShape.Clone();
|
---|
67 | OccupationLayers = new Dictionary<int, List<int>>();
|
---|
68 | }
|
---|
69 |
|
---|
70 | [StorableConstructor]
|
---|
71 | protected BinPacking(bool deserializing) : base(deserializing) { }
|
---|
72 | protected BinPacking(BinPacking<TPos, TBin, TItem> original, Cloner cloner)
|
---|
73 | : base(original, cloner) {
|
---|
74 | this.Positions = new ObservableDictionary<int, TPos>();
|
---|
75 | foreach (var kvp in original.Positions) {
|
---|
76 | Positions.Add(kvp.Key, cloner.Clone(kvp.Value));
|
---|
77 | }
|
---|
78 | this.Items = new ObservableDictionary<int, TItem>();
|
---|
79 | foreach (var kvp in original.Items) {
|
---|
80 | Items.Add(kvp.Key, cloner.Clone(kvp.Value));
|
---|
81 | }
|
---|
82 | this.BinShape = (TBin)original.BinShape.Clone(cloner);
|
---|
83 | this.OccupationLayers = new Dictionary<int, List<int>>();
|
---|
84 | foreach (var kvp in original.OccupationLayers) {
|
---|
85 | OccupationLayers.Add(kvp.Key, new List<int>(kvp.Value));
|
---|
86 | }
|
---|
87 | }
|
---|
88 |
|
---|
89 | [StorableHook(HookType.AfterDeserialization)]
|
---|
90 | private void AfterDeserialization() {
|
---|
91 | // BackwardsCompatibility3.3
|
---|
92 | #region Backwards compatible code, remove with 3.4
|
---|
93 | if (ResidualSpace == null)
|
---|
94 | ResidualSpace = new Dictionary<TPos, Tuple<int, int, int>>();
|
---|
95 | #endregion
|
---|
96 | }
|
---|
97 |
|
---|
98 | protected abstract void GenerateNewExtremePointsForNewItem(TItem item, TPos position);
|
---|
99 |
|
---|
100 | public abstract TPos FindExtremePointForItem(TItem item, bool rotated, bool stackingConstraints);
|
---|
101 | public abstract TPos FindPositionBySliding(TItem item, bool rotated, bool stackingConstraints);
|
---|
102 |
|
---|
103 | public abstract void SlidingBasedPacking(ref IList<int> sequence, IList<TItem> items, bool stackingConstraints);
|
---|
104 | public abstract void SlidingBasedPacking(ref IList<int> sequence, IList<TItem> items, Dictionary<int, bool> rotationArray, bool stackingConstraints);
|
---|
105 | public abstract void ExtremePointBasedPacking(ref IList<int> sequence, IList<TItem> items, bool stackingConstraints);
|
---|
106 | public abstract void ExtremePointBasedPacking(ref IList<int> sequence, IList<TItem> items, bool stackingConstraints, Dictionary<int, bool> rotationArray);
|
---|
107 |
|
---|
108 | public virtual void PackItem(int itemID, TItem item, TPos position) {
|
---|
109 | Items[itemID] = item;
|
---|
110 | Positions[itemID] = position;
|
---|
111 | ExtremePoints.Remove(position);
|
---|
112 | if (ResidualSpace != null) ResidualSpace.Remove(position);
|
---|
113 | foreach (int id in Items.Select(x => x.Key))
|
---|
114 | GenerateNewExtremePointsForNewItem(Items[id], Positions[id]);
|
---|
115 |
|
---|
116 | AddNewItemToOccupationLayers(itemID, item, position);
|
---|
117 | }
|
---|
118 | public virtual bool PackItemIfFeasible(int itemID, TItem item, TPos position, bool stackingConstraints) {
|
---|
119 | if (IsPositionFeasible(item, position, stackingConstraints)) {
|
---|
120 | PackItem(itemID, item, position);
|
---|
121 | return true;
|
---|
122 | }
|
---|
123 | return false;
|
---|
124 | }
|
---|
125 |
|
---|
126 | public double PackingDensity {
|
---|
127 | get {
|
---|
128 | double result = 0;
|
---|
129 | foreach (var entry in Items)
|
---|
130 | result += entry.Value.Volume;
|
---|
131 | result /= BinShape.Volume;
|
---|
132 | return result;
|
---|
133 | }
|
---|
134 | }
|
---|
135 |
|
---|
136 |
|
---|
137 | public int PointOccupation(TPos position) {
|
---|
138 | foreach (var id in GetLayerItemIDs(position)) {
|
---|
139 | if (Items[id].EnclosesPoint(Positions[id], position))
|
---|
140 | return id;
|
---|
141 | }
|
---|
142 | return -1;
|
---|
143 | }
|
---|
144 |
|
---|
145 | public bool IsPointOccupied(TPos position) {
|
---|
146 | foreach (var id in GetLayerItemIDs(position)) {
|
---|
147 | if (Items[id].EnclosesPoint(Positions[id], position))
|
---|
148 | return true;
|
---|
149 | }
|
---|
150 | return false;
|
---|
151 | }
|
---|
152 | public virtual bool IsPositionFeasible(TItem item, TPos position, bool stackingConstraints) {
|
---|
153 | //In this case feasability is defined as following: 1. the item fits into the bin-borders; 2. the point is supported by something; 3. the item does not collide with another already packed item
|
---|
154 | if (!BinShape.Encloses(position, item))
|
---|
155 | return false;
|
---|
156 |
|
---|
157 | foreach (var id in GetLayerItemIDs(item, position)) {
|
---|
158 | if (Items[id].Overlaps(Positions[id], position, item))
|
---|
159 | return false;
|
---|
160 | }
|
---|
161 |
|
---|
162 | return true;
|
---|
163 | }
|
---|
164 |
|
---|
165 | public abstract int ShortestPossibleSideFromPoint(TPos position);
|
---|
166 | public abstract bool IsStaticStable(TItem measures, TPos position);
|
---|
167 |
|
---|
168 | protected abstract void InitializeOccupationLayers();
|
---|
169 | protected abstract void AddNewItemToOccupationLayers(int itemID, TItem item, TPos position);
|
---|
170 | protected abstract List<int> GetLayerItemIDs(TPos position);
|
---|
171 | protected abstract List<int> GetLayerItemIDs(TItem item, TPos position);
|
---|
172 | }
|
---|
173 | }
|
---|