[14162] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[15583] | 3 | * Copyright (C) 2002-2018 Joseph Helm and Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[14162] | 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 |
|
---|
[16565] | 23 | using HEAL.Attic;
|
---|
[14162] | 24 | using HeuristicLab.Common;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Data;
|
---|
| 27 | using HeuristicLab.Parameters;
|
---|
| 28 | using HeuristicLab.Problems.BinPacking;
|
---|
| 29 |
|
---|
| 30 | namespace HeuristicLab.Problems.BinPacking2D {
|
---|
| 31 | [Item("PackingItem (2d)", "Represents a rectangular packing-item for bin-packing problems.")]
|
---|
[16565] | 32 | [StorableType("36B693B0-3CD9-4EE2-97EF-B8BEA8E4877A")]
|
---|
[14162] | 33 | public class PackingItem : PackingShape, IPackingItem {
|
---|
| 34 |
|
---|
| 35 | public PackingShape TargetBin {
|
---|
| 36 | get { return ((IValueParameter<PackingShape>)Parameters["TargetBin"]).Value; }
|
---|
| 37 | set { ((IValueParameter<PackingShape>)Parameters["TargetBin"]).Value = value; }
|
---|
| 38 | }
|
---|
| 39 |
|
---|
| 40 | public double Weight {
|
---|
| 41 | get { return ((IFixedValueParameter<DoubleValue>)Parameters["Weight"]).Value.Value; }
|
---|
| 42 | set { ((IFixedValueParameter<DoubleValue>)Parameters["Weight"]).Value.Value = value; }
|
---|
| 43 | }
|
---|
| 44 |
|
---|
| 45 | public int Material {
|
---|
| 46 | get { return ((IFixedValueParameter<IntValue>)Parameters["Material"]).Value.Value; }
|
---|
| 47 | set { ((IFixedValueParameter<IntValue>)Parameters["Material"]).Value.Value = value; }
|
---|
| 48 | }
|
---|
| 49 |
|
---|
| 50 | [StorableConstructor]
|
---|
[16565] | 51 | protected PackingItem(StorableConstructorFlag _) : base(_) { }
|
---|
[14162] | 52 | protected PackingItem(PackingItem original, Cloner cloner)
|
---|
| 53 | : base(original, cloner) {
|
---|
| 54 | }
|
---|
| 55 |
|
---|
| 56 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 57 | return new PackingItem(this, cloner);
|
---|
| 58 | }
|
---|
| 59 |
|
---|
| 60 | public PackingItem()
|
---|
| 61 | : base() {
|
---|
| 62 | Parameters.Add(new ValueParameter<PackingShape>("TargetBin"));
|
---|
| 63 | Parameters.Add(new FixedValueParameter<DoubleValue>("Weight"));
|
---|
| 64 | Parameters.Add(new FixedValueParameter<IntValue>("Material"));
|
---|
| 65 | }
|
---|
| 66 |
|
---|
| 67 | public PackingItem(int width, int height, PackingShape targetBin)
|
---|
| 68 | : this() {
|
---|
| 69 | this.Width = width;
|
---|
| 70 | this.Height = height;
|
---|
| 71 | this.TargetBin = (PackingShape)targetBin.Clone();
|
---|
| 72 | }
|
---|
| 73 |
|
---|
| 74 | public bool SupportsStacking(IPackingItem other) {
|
---|
| 75 | return ((other.Material < this.Material) || (other.Material.Equals(this.Material) && other.Weight <= this.Weight));
|
---|
| 76 | }
|
---|
| 77 | }
|
---|
| 78 | }
|
---|