# source:branches/2817-BinPackingSpeedup/HeuristicLab.Problems.BinPacking/3.3/3D/Instances/BPPData.cs@15617

Last change on this file since 15617 was 15617, checked in by rhanghof, 2 years ago
• The items can be rotated and tilted now.
• Added pruning of extreme points in packed bins.
• Added new packer which packs items by positioning them on the point with the minimum of wasted space. He uses rotating and tilting of items.
• Added classes for sorting given items.
File size: 1.8 KB
Line
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
22namespace HeuristicLab.Problems.BinPacking3D.Instances {
23
24  /// <summary>
25  /// Represents an instance which contains bin packing problem data.
26  /// </summary>
27  public class BPPData {
28    /// <summary>
29    /// The name of the instance
30    /// </summary>
31    public string Name { get; set; }
32
33    /// <summary>
34    /// Optional! The description of the instance
35    /// </summary>
36    public string Description { get; set; }
37
38    /// <summary>
39    /// The number of items.
40    /// </summary>
41    public int NumItems { get { return Items == null ? 0 : Items.Length; } }
42
43    /// <summary>
44    /// Assigned packing shape
45    /// </summary>
46    public PackingShape BinShape { get; set; }
47
48    /// <summary>
49    /// Array with assigned packing items
50    /// </summary>
51    public PackingItem[] Items { get; set; }
52
53    /// <summary>
54    /// Optional! The quality of the best-known solution.
55    /// </summary>
56    public double? BestKnownQuality { get; set; }
57  }
58}
Note: See TracBrowser for help on using the repository browser.