1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2012 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 System.Text;
|
---|
26 | using HeuristicLab.Problems.BinPacking.Interfaces;
|
---|
27 | using HeuristicLab.Problems.BinPacking.PackingItem;
|
---|
28 | using HeuristicLab.Problems.BinPacking.Shapes;
|
---|
29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
30 | using HeuristicLab.Core;
|
---|
31 | using HeuristicLab.Common;
|
---|
32 | using HeuristicLab.Data;
|
---|
33 |
|
---|
34 | namespace HeuristicLab.Encodings.PackingEncoding.PackingPlan {
|
---|
35 | //RegularPackingPlan defines that the packingItems have to be parallel to the packingBin in every moment
|
---|
36 | //SimpleRotation defines that the items may be rotated
|
---|
37 | // only in one dimension,
|
---|
38 | // only once and
|
---|
39 | // only by 90degree
|
---|
40 | // so that parallelism to the correlating bin is ensured
|
---|
41 | //This definition implies that the floor of the (3D) objects never changes (what may be a wanted constraint in most cases..)
|
---|
42 | [Item("RegularSimpleRotationPackingPlan", "Represents a concrete solution for a bin-packing problem using simple rotation (90degrees-steps) and regular shapes (e.g. rectangle)")]
|
---|
43 | [StorableClass]
|
---|
44 | public class RegularSimpleRotationPackingPlan<D, B, I> : PackingPlan<D, B, I>
|
---|
45 | where D : class, IPackingDimensions
|
---|
46 | where B : PackingShape<D>, IRegularPackingShape, IPackingBin
|
---|
47 | where I : PackingShape<D>, IRegularPackingShape, IPackingItem {
|
---|
48 |
|
---|
49 | #region Properties
|
---|
50 | public ItemList<BoolValue> PackingItemsRotated { get; set; }
|
---|
51 | #endregion
|
---|
52 |
|
---|
53 | public RegularSimpleRotationPackingPlan(B binMeasures, ItemList<I> itemMeasures) : base(binMeasures, itemMeasures) {
|
---|
54 |
|
---|
55 | }
|
---|
56 |
|
---|
57 | [StorableConstructor]
|
---|
58 | protected RegularSimpleRotationPackingPlan(bool deserializing) : base(deserializing) { }
|
---|
59 | protected RegularSimpleRotationPackingPlan(RegularSimpleRotationPackingPlan<D,B,I> original, Cloner cloner)
|
---|
60 | : base(original, cloner) {
|
---|
61 | PackingItemsRotated = cloner.Clone(original.PackingItemsRotated);
|
---|
62 | }
|
---|
63 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
64 | return new RegularSimpleRotationPackingPlan<D,B,I>(this, cloner);
|
---|
65 | }
|
---|
66 |
|
---|
67 | }
|
---|
68 | }
|
---|