#region License Information
/* HeuristicLab
* Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
*
* This file is part of HeuristicLab.
*
* HeuristicLab is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* HeuristicLab is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with HeuristicLab. If not, see .
*/
#endregion
namespace HeuristicLab.Problems.Instances {
///
/// Describes an instance of the Generalized Quadratic Assignment Problem (GQAP).
///
public class GQAPData {
///
/// The name of the instance.
///
public string Name { get; set; }
///
/// A description of the instance.
///
public string Description { get; set; }
///
/// |E| = The number of equipments are to be assigned in this instance.
///
public int Equipments { get; set; }
///
/// |L| = The number of locations that are available for the equipments.
///
public int Locations { get; set; }
///
/// Vector of length |E| that describes the space demand for the equipments.
///
public double[] Demands { get; set; }
///
/// Vector of length |L| that describes the space capacity for the locations.
///
public double[] Capacities { get; set; }
///
/// |E|x|E| matrix with the weights (flows) between the equipments. These describe the strength of the respective bonding.
///
public double[,] Weights { get; set; }
///
/// |L|x|L| matrix with the distances between the locations.
///
public double[,] Distances { get; set; }
///
/// |E|x|L| matrix that describes the costs of installing equipment x at location y.
///
public double[,] InstallationCosts { get; set; }
///
/// A factor that scales the weights.
///
public double TransportationCosts { get; set; }
///
/// Optional! The best-known assignment is a vector of length |E| with numbers ranging from 0 to |L| - 1
///
public int[] BestKnownAssignment { get; set; }
///
/// Optional! The quality of the best-known assignment.
///
public double? BestKnownQuality { get; set; }
}
}