Free cookie consent management tool by TermsFeed Policy Generator

source: branches/PersistenceReintegration/HeuristicLab.Problems.Orienteering/3.3/DistanceMatrix.cs @ 15018

Last change on this file since 15018 was 15018, checked in by gkronber, 7 years ago

#2520 introduced StorableConstructorFlag type for StorableConstructors

File size: 4.0 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2016 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
22using System;
23using System.Collections.Generic;
24using HeuristicLab.Common;
25using HeuristicLab.Core;
26using HeuristicLab.Data;
27using HeuristicLab.Persistence;
28
29namespace HeuristicLab.Problems.Orienteering {
30  /// <summary>
31  /// Represents a distance matrix of a Orienteering Salesman Problem.
32  /// </summary>
33  [Item("DistanceMatrix", "Represents a distance matrix of a Orienteering Problem.")]
34  [StorableType("780698fd-86b7-4983-8b9b-f35a55aa7e35")]
35  public sealed class DistanceMatrix : DoubleMatrix {
36    [StorableConstructor]
37    private DistanceMatrix(StorableConstructorFlag deserializing) : base(deserializing) { }
38    private DistanceMatrix(DistanceMatrix original, Cloner cloner) {
39      throw new NotSupportedException("Distance matrices cannot be cloned.");
40    }
41    public DistanceMatrix() : base() { }
42    public DistanceMatrix(int rows, int columns) : base(rows, columns) { }
43    public DistanceMatrix(int rows, int columns, IEnumerable<string> columnNames) : base(rows, columns, columnNames) { }
44    public DistanceMatrix(int rows, int columns, IEnumerable<string> columnNames, IEnumerable<string> rowNames) : base(rows, columns, columnNames, rowNames) { }
45    public DistanceMatrix(double[,] elements) : base(elements) { }
46    public DistanceMatrix(double[,] elements, IEnumerable<string> columnNames) : base(elements, columnNames) { }
47    public DistanceMatrix(double[,] elements, IEnumerable<string> columnNames, IEnumerable<string> rowNames) : base(elements, columnNames, rowNames) { }
48
49    public override IDeepCloneable Clone(Cloner cloner) {
50      // distance matrices are not cloned for performance reasons
51      cloner.RegisterClonedObject(this, this);
52      return this;
53    }
54
55    public double CalculateTourLength(IList<int> path, double pointVisitingCosts) {
56      double length = 0.0;
57      for (int i = 1; i < path.Count; i++)
58        length += this[path[i - 1], path[i]];
59      // Add the fixed penalty for every vertex except for the starting and ending vertex
60      length += (path.Count - 2) * pointVisitingCosts;
61      return length;
62    }
63    public double CalculateInsertionCosts(IList<int> path, int insertPosition, int point, double pointVisitingCosts) {
64      double detour = this[path[insertPosition - 1], point] + this[point, path[insertPosition]];
65      detour += pointVisitingCosts;
66      detour -= this[path[insertPosition - 1], path[insertPosition]];
67      return detour;
68    }
69    public double CalculateReplacementCosts(List<int> path, int replacePosition, int point) {
70      double detour = this[path[replacePosition - 1], point] + this[point, path[replacePosition + 1]];
71      detour -= this[path[replacePosition - 1], path[replacePosition]] + this[path[replacePosition], path[replacePosition + 1]];
72      return detour;
73    }
74    public double CalculateRemovementSaving(List<int> path, int removePosition, double pointVisitingCosts) {
75      double saving = this[path[removePosition - 1], path[removePosition]];
76      saving += this[path[removePosition], path[removePosition + 1]];
77      saving -= this[path[removePosition - 1], path[removePosition + 1]];
78      saving += pointVisitingCosts;
79      return saving;
80    }
81  }
82}
Note: See TracBrowser for help on using the repository browser.