Changeset 14471 for branches/MemPRAlgorithm/HeuristicLab.Problems.Instances

Timestamp:

12/09/16 15:56:22 (8 years ago)

Author:

abeham

Message:

#2701:

• Updated GraphColoringProblem and Problems.Instances
  • Added new fitness function from literature
  • Added DIMACS benchmark instances
• Updated LinearLinkageEncoding
  • Added HammingSimilarityCalculator

Location:

branches/MemPRAlgorithm/HeuristicLab.Problems.Instances/3.3

Files:

• HeuristicLab.Problems.Instances-3.3.csproj (modified) (1 diff)
• Types/GCPData.cs (copied) (copied from branches/MemPRAlgorithm/HeuristicLab.Problems.Instances/3.3/Types/QAPData.cs) (2 diffs)

branches/MemPRAlgorithm/HeuristicLab.Problems.Instances/3.3/HeuristicLab.Problems.Instances-3.3.csproj

@@ -128 +128 @@
     <Compile Include="Types\DistanceHelper.cs" />
     <Compile Include="Types\OPData.cs" />
+    <Compile Include="Types\GCPData.cs" />
     <Compile Include="Types\VRP\MDCVRPTWData.cs" />
     <Compile Include="Types\VRP\MDCVRPData.cs" />

branches/MemPRAlgorithm/HeuristicLab.Problems.Instances/3.3/Types/GCPData.cs

@@ -22 +22 @@
 namespace HeuristicLab.Problems.Instances {
   /// <summary>
-  /// Describes instances of the Quadratic Assignment Problem (QAP).
+  /// Describes instances of the graph coloring problem (GCP).
   /// </summary>
-  public class QAPData {
+  public class GCPData {
     /// <summary>
     /// The name of the instance
@@ -35 +35 @@
 
     /// <summary>
-    /// The number of facilities (and also the number of locations)
+    /// The number of nodes in the graph
     /// </summary>
-    public int Dimension { get; set; }
+    public int Nodes { get; set; }
     /// <summary>
-    /// An NxN Matrix with N = |Faciliies|
+    /// An Nx2 adjacency list with N = Nodes
     /// </summary>
-    public double[,] Distances { get; set; }
-    /// <summary>
-    /// An NxN Matrix with N = |Faciliies|
-    /// </summary>
-    public double[,] Weights { get; set; }
+    public int[,] Adjacencies { get; set; }
 
     /// <summary>
-    /// Optional! An array of length N with N = |Facilities|
+    /// Optional! An array of length N with N = |Nodes|
     /// </summary>
-    public int[] BestKnownAssignment { get; set; }
+    public int[] BestKnownColoring { get; set; }
     /// <summary>
-    /// Optional! The quality value of the <see cref="BestKnownAssignment"/>
+    /// Optional! The quality value of the <see cref="BestKnownColoring"/>
     /// </summary>
-    public double? BestKnownQuality { get; set; }
+    public double? BestKnownColors { get; set; }
   }
 }