Last change
on this file since 15428 was
14162,
checked in by gkronber, 8 years ago
|
#2641: first import of bin packing problem (TODO: persistence and sample)
|
File size:
1.6 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 |
|
---|
24 | namespace HeuristicLab.Problems.BinPacking2D {
|
---|
25 |
|
---|
26 | public class BPPData {
|
---|
27 | /// <summary>
|
---|
28 | /// The name of the instance
|
---|
29 | /// </summary>
|
---|
30 | public string Name { get; set; }
|
---|
31 | /// <summary>
|
---|
32 | /// Optional! The description of the instance
|
---|
33 | /// </summary>
|
---|
34 | public string Description { get; set; }
|
---|
35 |
|
---|
36 | /// <summary>
|
---|
37 | /// The number of items.
|
---|
38 | /// </summary>
|
---|
39 | public int NumItems { get { return Items == null ? 0 : Items.Length; } }
|
---|
40 | public PackingShape BinShape { get; set; }
|
---|
41 | public PackingItem[] Items { get; set; }
|
---|
42 | /// <summary>
|
---|
43 | /// Optional! The quality of the best-known solution.
|
---|
44 | /// </summary>
|
---|
45 | public double? BestKnownQuality { get; set; }
|
---|
46 | }
|
---|
47 | }
|
---|
Note: See
TracBrowser
for help on using the repository browser.