Changeset 7523 for branches/GeneralizedQAP/HeuristicLab.Problems.Instances/3.3/Instances/IGQAPInstance.cs
- Timestamp:
- 02/24/12 23:27:06 (12 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/GeneralizedQAP/HeuristicLab.Problems.Instances/3.3/Instances/IGQAPInstance.cs
r7505 r7523 20 20 #endregion 21 21 22 namespace HeuristicLab.Problems.Instances{ 22 namespace HeuristicLab.Problems.Instances { 23 /// <summary> 24 /// Describes an instance of the Generalized Quadratic Assignment Problem (GQAP). 25 /// </summary> 23 26 public interface IGQAPInstance { 24 27 /// <summary> 28 /// The name of the instance. 29 /// </summary> 25 30 string Name { get; } 31 /// <summary> 32 /// A description of the instance. 33 /// </summary> 26 34 string Description { get; } 27 35 36 /// <summary> 37 /// |E| = The number of equipments are to be assigned in this instance. 38 /// </summary> 28 39 int Equipments { get; } 40 /// <summary> 41 /// |L| = The number of locations that are available for the equipments. 42 /// </summary> 29 43 int Locations { get; } 44 /// <summary> 45 /// Vector of length |E| that describes the space demand for the equipments. 46 /// </summary> 30 47 double[] Demands { get; } 48 /// <summary> 49 /// Vector of length |L| that describes the space capacity for the locations. 50 /// </summary> 31 51 double[] Capacities { get; } 52 /// <summary> 53 /// |E|x|E| matrix with the weights (flows) between the equipments. These describe the strength of the respective bonding. 54 /// </summary> 32 55 double[,] Weights { get; } 56 /// <summary> 57 /// |L|x|L| matrix with the distances between the locations. 58 /// </summary> 33 59 double[,] Distances { get; } 60 /// <summary> 61 /// |E|x|L| matrix that describes the costs of installing equipment x at location y. 62 /// </summary> 34 63 double[,] InstallationCosts { get; } 64 /// <summary> 65 /// A factor that scales the weights. 66 /// </summary> 67 double TransportationCosts { get; } 35 68 36 double TransportationCosts { get; } 69 /// <summary> 70 /// Optional! The best-known assignment is a vector of length |E| with numbers ranging from 0 to |L| - 1 71 /// </summary> 72 int[] BestKnownAssignment { get; } 73 /// <summary> 74 /// Optional! The quality of the best-known assignment. 75 /// </summary> 76 double? BestKnownQuality { get; } 37 77 } 38 78 }
Note: See TracChangeset
for help on using the changeset viewer.