[14162] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17181] | 3 | * Copyright (C) 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 | using HeuristicLab.Core;
|
---|
[17097] | 23 | using HEAL.Attic;
|
---|
[14162] | 24 | using HeuristicLab.Common;
|
---|
| 25 | using System.Collections.Generic;
|
---|
| 26 |
|
---|
| 27 | namespace HeuristicLab.Problems.BinPacking2D {
|
---|
| 28 | [Item("Extreme-point IntegerVector Decoder (2d)", "Decodes the integer vector and creates a packing solution candidate")]
|
---|
[17097] | 29 | [StorableType("D40DEE7A-4AAC-47DA-9FA8-12D3C09177A7")]
|
---|
[14162] | 30 | public class ExtremePointIntegerVectorDecoder : IntegerVectorDecoderBase {
|
---|
| 31 |
|
---|
| 32 | [StorableConstructor]
|
---|
[17097] | 33 | protected ExtremePointIntegerVectorDecoder(StorableConstructorFlag _) : base(_) { }
|
---|
[14162] | 34 | protected ExtremePointIntegerVectorDecoder(ExtremePointIntegerVectorDecoder original, Cloner cloner)
|
---|
| 35 | : base(original, cloner) {
|
---|
| 36 | }
|
---|
| 37 | public ExtremePointIntegerVectorDecoder() : base() { }
|
---|
| 38 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 39 | return new ExtremePointIntegerVectorDecoder(this, cloner);
|
---|
| 40 | }
|
---|
| 41 |
|
---|
| 42 | protected override Solution CreateSolution(PackingShape binShape) {
|
---|
| 43 | return new Solution(binShape, useExtremePoints: true, stackingConstraints: false);
|
---|
| 44 | }
|
---|
| 45 |
|
---|
| 46 | protected override PackingPosition FindPositionForItem(BinPacking2D bp, PackingItem item) {
|
---|
| 47 | return bp.FindExtremePointForItem(item, false, stackingConstraints: false);
|
---|
| 48 | }
|
---|
| 49 |
|
---|
| 50 | protected override BinPacking2D CreatePacking(
|
---|
| 51 | Solution partialSolution,
|
---|
| 52 | ref IList<int> remainingIDs, IList<PackingItem> items) {
|
---|
[14170] | 53 | var bp = new BinPacking2D(partialSolution.BinShape);
|
---|
[14162] | 54 | bp.ExtremePointBasedPacking(ref remainingIDs, items, stackingConstraints: false);
|
---|
| 55 | return bp;
|
---|
| 56 | }
|
---|
| 57 | }
|
---|
| 58 | }
|
---|