Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2864_PermutationProblems/HeuristicLab.Problems.Instances/3.3/Types/ATSPData.cs

Last change on this file was 16565, checked in by gkronber, 5 years ago

#2520: merged changes from PersistenceOverhaul branch (r16451:16564) into trunk

File size: 2.1 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2019 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
23namespace HeuristicLab.Problems.Instances {
24  /// <summary>
25  /// Describe instances of the Asymmetric Traveling Salesman Problem (ATSP).
26  /// </summary>
27  public class ATSPData {
28    /// <summary>
29    /// The name of the instance
30    /// </summary>
31    public string Name { get; set; }
32    /// <summary>
33    /// Optional! The description of the instance
34    /// </summary>
35    public string Description { get; set; }
36
37    /// <summary>
38    /// The number of cities.
39    /// </summary>
40    public int Dimension { get; set; }
41    /// <summary>
42    /// The distances are given in form of a distance matrix.
43    /// </summary>
44    public double[,] Distances { get; set; }
45    /// <summary>
46    /// Optional! A a matrix of dimension [N, 2] where each row is one of the cities
47    /// and the colmns represent x and y coordinates respectively.
48    /// </summary>
49    /// <remarks>
50    /// The coordinates are for display purposes only.
51    /// </remarks>
52    public double[,] Coordinates { get; set; }
53
54    /// <summary>
55    /// Optional! The best-known tour in path-encoding.
56    /// </summary>
57    public int[] BestKnownTour { get; set; }
58    /// <summary>
59    /// Optional! The quality of the best-known tour.
60    /// </summary>
61    public double? BestKnownQuality { get; set; }
62  }
63}
Note: See TracBrowser for help on using the repository browser.