Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2864_PermutationProblems/HeuristicLab.Problems.Instances/3.3/Types/QAPData.cs @ 16003

Last change on this file since 16003 was 16003, checked in by fholzing, 6 years ago

#2864: Changed Copyright from -2016 to -2018

File size: 2.0 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.Instances {
23  /// <summary>
24  /// Describes instances of the Quadratic Assignment Problem (QAP).
25  /// </summary>
26  public class QAPData {
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 facilities (and also the number of locations)
38    /// </summary>
39    public int Dimension { get; set; }
40    /// <summary>
41    /// An NxN Matrix with N = |Faciliies|
42    /// </summary>
43    public double[,] Distances { get; set; }
44    /// <summary>
45    /// An NxN Matrix with N = |Faciliies|
46    /// </summary>
47    public double[,] Weights { get; set; }
48
49    /// <summary>
50    /// Optional! An array of length N with N = |Facilities|
51    /// </summary>
52    public int[] BestKnownAssignment { get; set; }
53    /// <summary>
54    /// Optional! The quality value of the <see cref="BestKnownAssignment"/>
55    /// </summary>
56    public double? BestKnownQuality { get; set; }
57  }
58}
Note: See TracBrowser for help on using the repository browser.