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

Last change on this file since 15473 was 15473, checked in by rhanghof, 22 months ago

#2817

  • Added unit tests
  • Refactoring of bp 3D
File size: 1.8 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2016 Joseph Helm and 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
23
24namespace HeuristicLab.Problems.BinPacking3D.Instances {
25
26  /// <summary>
27  /// Represents an instance which contains bin packing problem data.
28  /// </summary>
29  public class BPPData {
30    /// <summary>
31    /// The name of the instance
32    /// </summary>
33    public string Name { get; set; }
34
35    /// <summary>
36    /// Optional! The description of the instance
37    /// </summary>
38    public string Description { get; set; }
39
40    /// <summary>
41    /// The number of items.
42    /// </summary>
43    public int NumItems { get { return Items == null ? 0 : Items.Length; } }
44
45    /// <summary>
46    /// Assigned packing shape
47    /// </summary>
48    public PackingShape BinShape { get; set; }
49
50    /// <summary>
51    /// Array with assigned packing items
52    /// </summary>
53    public PackingItem[] Items { get; set; }
54   
55    /// <summary>
56    /// Optional! The quality of the best-known solution.
57    /// </summary>
58    public double? BestKnownQuality { get; set; }
59  }
60}
Note: See TracBrowser for help on using the repository browser.