1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2012 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 | namespace HeuristicLab.Problems.Instances {
|
---|
23 | /// <summary>
|
---|
24 | /// Describes instances of the Quadratic Assignment Problem (QAP).
|
---|
25 | /// </summary>
|
---|
26 | public interface IQAPInstance {
|
---|
27 | /// <summary>
|
---|
28 | /// The name of the instance
|
---|
29 | /// </summary>
|
---|
30 | string Name { get; }
|
---|
31 | /// <summary>
|
---|
32 | /// Optional! The description of the instance
|
---|
33 | /// </summary>
|
---|
34 | string Description { get; }
|
---|
35 |
|
---|
36 | /// <summary>
|
---|
37 | /// The number of facilities (and also the number of locations)
|
---|
38 | /// </summary>
|
---|
39 | int Dimension { get; }
|
---|
40 | /// <summary>
|
---|
41 | /// An NxN Matrix with N = |Faciliies|
|
---|
42 | /// </summary>
|
---|
43 | double[,] Distances { get; }
|
---|
44 | /// <summary>
|
---|
45 | /// An NxN Matrix with N = |Faciliies|
|
---|
46 | /// </summary>
|
---|
47 | double[,] Weights { get; }
|
---|
48 |
|
---|
49 | /// <summary>
|
---|
50 | /// Optional! An array of length N with N = |Facilities|
|
---|
51 | /// </summary>
|
---|
52 | int[] BestKnownAssignment { get; }
|
---|
53 | /// <summary>
|
---|
54 | /// Optional! The quality value of the <see cref="BestKnownAssignment"/>
|
---|
55 | /// </summary>
|
---|
56 | double? BestKnownQuality { get; }
|
---|
57 | }
|
---|
58 | }
|
---|