1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2018 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 HeuristicLab.Encodings.PermutationEncoding;
|
---|
23 | using System;
|
---|
24 | using System.Collections.Generic;
|
---|
25 | using System.Linq;
|
---|
26 | using System.Text;
|
---|
27 | using System.Threading.Tasks;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Problems.BinPacking3D.Packer {
|
---|
30 | public interface IBinPacker {
|
---|
31 | /// <summary>
|
---|
32 | /// Packs all items of the bin packer and returns a collection of BinPacking3D objects
|
---|
33 | /// </summary>
|
---|
34 | /// <param name="sortedItems">Permutation of items sorted by a sorting method. The value of each permutation index references to the index of the items list</param>
|
---|
35 | /// <param name="binShape">Bin for storing the items</param>
|
---|
36 | /// <param name="items">A list of packing items which should be assigned to a bin</param>
|
---|
37 | /// <param name="useStackingConstraints">Flag for using stacking constraints</param>
|
---|
38 | /// <returns>Returns a collection of bin packing 3d objects. Each object represents a bin and the packed items</returns>
|
---|
39 | IList<BinPacking3D> PackItems(Permutation sortedItems, PackingShape binShape, IList<PackingItem> items, ExtremePointCreationMethod epCreationMethod, ExtremePointPruningMethod epPruningMethod, bool useStackingConstraints);
|
---|
40 |
|
---|
41 |
|
---|
42 | /// <summary>
|
---|
43 | /// Packs all items of the bin packer into a collection of BinPacking3D objects
|
---|
44 | /// </summary>
|
---|
45 | /// <param name="packingList">Packing list which will be filled by the packer.</param>
|
---|
46 | /// <param name="sortedItems">Permutation of items sorted by a sorting method. The value of each permutation index references to the index of the items list</param>
|
---|
47 | /// <param name="binShape">Bin for storing the items</param>
|
---|
48 | /// <param name="items">A list of packing items which should be assigned to a bin</param>
|
---|
49 | /// <param name="useStackingConstraints">Flag for using stacking constraints</param>
|
---|
50 | /// <param name="epPruningMethod"></param>
|
---|
51 | void PackItemsToPackingList(IList<BinPacking3D> packingList ,Permutation sortedItems, PackingShape binShape, IList<PackingItem> items, ExtremePointCreationMethod epCreationMethod, ExtremePointPruningMethod epPruningMethod, bool useStackingConstraints);
|
---|
52 |
|
---|
53 |
|
---|
54 |
|
---|
55 | }
|
---|
56 | }
|
---|