1  #region License Information


2  /* HeuristicLab


3  * Copyright (C) 20022019 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 an instance of the Generalized Quadratic Assignment Problem (GQAP).


25  /// </summary>


26  public class GQAPData {


27  /// <summary>


28  /// The name of the instance.


29  /// </summary>


30  public string Name { get; set; }


31  /// <summary>


32  /// A description of the instance.


33  /// </summary>


34  public string Description { get; set; }


35 


36  /// <summary>


37  /// E = The number of equipments are to be assigned in this instance.


38  /// </summary>


39  public int Equipments { get; set; }


40  /// <summary>


41  /// L = The number of locations that are available for the equipments.


42  /// </summary>


43  public int Locations { get; set; }


44  /// <summary>


45  /// Vector of length E that describes the space demand for the equipments.


46  /// </summary>


47  public double[] Demands { get; set; }


48  /// <summary>


49  /// Vector of length L that describes the space capacity for the locations.


50  /// </summary>


51  public double[] Capacities { get; set; }


52  /// <summary>


53  /// ExE matrix with the weights (flows) between the equipments. These describe the strength of the respective bonding.


54  /// </summary>


55  public double[,] Weights { get; set; }


56  /// <summary>


57  /// LxL matrix with the distances between the locations.


58  /// </summary>


59  public double[,] Distances { get; set; }


60  /// <summary>


61  /// ExL matrix that describes the costs of installing equipment x at location y.


62  /// </summary>


63  public double[,] InstallationCosts { get; set; }


64  /// <summary>


65  /// A factor that scales the weights.


66  /// </summary>


67  public double TransportationCosts { get; set; }


68 


69  /// <summary>


70  /// Optional! The bestknown assignment is a vector of length E with numbers ranging from 0 to L  1


71  /// </summary>


72  public int[] BestKnownAssignment { get; set; }


73  /// <summary>


74  /// Optional! The quality of the bestknown assignment.


75  /// </summary>


76  public double? BestKnownQuality { get; set; }


77  }


78  }

