#region License Information
/* HeuristicLab
* Copyright (C) 2002-2019 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
using System;
using System.Collections.Generic;
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Data;
using HEAL.Fossil;
namespace HeuristicLab.Problems.Orienteering {
///
/// Represents a distance matrix of a Orienteering Salesman Problem.
///
[Item("DistanceMatrix", "Represents a distance matrix of a Orienteering Problem.")]
[StorableType("8318D250-3F2D-4A4D-9833-AB4EA453A3A4")]
public sealed class DistanceMatrix : DoubleMatrix {
[StorableConstructor]
private DistanceMatrix(StorableConstructorFlag _) : base(_) { }
private DistanceMatrix(DistanceMatrix original, Cloner cloner) {
throw new NotSupportedException("Distance matrices cannot be cloned.");
}
public DistanceMatrix() : base() { }
public DistanceMatrix(int rows, int columns) : base(rows, columns) { }
public DistanceMatrix(int rows, int columns, IEnumerable columnNames) : base(rows, columns, columnNames) { }
public DistanceMatrix(int rows, int columns, IEnumerable columnNames, IEnumerable rowNames) : base(rows, columns, columnNames, rowNames) { }
public DistanceMatrix(double[,] elements) : base(elements) { }
public DistanceMatrix(double[,] elements, IEnumerable columnNames) : base(elements, columnNames) { }
public DistanceMatrix(double[,] elements, IEnumerable columnNames, IEnumerable rowNames) : base(elements, columnNames, rowNames) { }
public override IDeepCloneable Clone(Cloner cloner) {
// distance matrices are not cloned for performance reasons
cloner.RegisterClonedObject(this, this);
return this;
}
public double CalculateTourLength(IList path, double pointVisitingCosts) {
double length = 0.0;
for (int i = 1; i < path.Count; i++)
length += this[path[i - 1], path[i]];
// Add the fixed penalty for every vertex except for the starting and ending vertex
length += (path.Count - 2) * pointVisitingCosts;
return length;
}
public double CalculateInsertionCosts(IList path, int insertPosition, int point, double pointVisitingCosts) {
double detour = this[path[insertPosition - 1], point] + this[point, path[insertPosition]];
detour += pointVisitingCosts;
detour -= this[path[insertPosition - 1], path[insertPosition]];
return detour;
}
public double CalculateReplacementCosts(List path, int replacePosition, int point) {
double detour = this[path[replacePosition - 1], point] + this[point, path[replacePosition + 1]];
detour -= this[path[replacePosition - 1], path[replacePosition]] + this[path[replacePosition], path[replacePosition + 1]];
return detour;
}
public double CalculateRemovementSaving(List path, int removePosition, double pointVisitingCosts) {
double saving = this[path[removePosition - 1], path[removePosition]];
saving += this[path[removePosition], path[removePosition + 1]];
saving -= this[path[removePosition - 1], path[removePosition + 1]];
saving += pointVisitingCosts;
return saving;
}
}
}