#region License Information
/* HeuristicLab
* Copyright (C) 2002-2013 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 {
///
/// Describe instances of the Asymmetric Traveling Salesman Problem (ATSP).
///
public class ATSPData {
///
/// The name of the instance
///
public string Name { get; set; }
///
/// Optional! The description of the instance
///
public string Description { get; set; }
///
/// The number of cities.
///
public int Dimension { get; set; }
///
/// The distances are given in form of a distance matrix.
///
public double[,] Distances { get; set; }
///
/// Optional! A a matrix of dimension [N, 2] where each row is one of the cities
/// and the colmns represent x and y coordinates respectively.
///
///
/// The coordinates are for display purposes only.
///
public double[,] Coordinates { get; set; }
///
/// Optional! The best-known tour in path-encoding.
///
public int[] BestKnownTour { get; set; }
///
/// Optional! The quality of the best-known tour.
///
public double? BestKnownQuality { get; set; }
}
}