#region License Information
/* HeuristicLab
* Copyright (C) 2002-2012 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 HeuristicLab.Analysis;
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Data;
using HeuristicLab.Encodings.PermutationEncoding;
using HeuristicLab.Parameters;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
namespace HeuristicLab.Problems.TravelingSalesman {
///
/// An operator for analyzing the frequency of alleles in solutions of Traveling Salesman Problems given in path representation.
///
[Item("TSPAlleleFrequencyAnalyzer", "An operator for analyzing the frequency of alleles in solutions of Traveling Salesman Problems given in path representation.")]
[StorableClass]
public sealed class TSPAlleleFrequencyAnalyzer : AlleleFrequencyAnalyzer {
public LookupParameter CoordinatesParameter {
get { return (LookupParameter)Parameters["Coordinates"]; }
}
public LookupParameter DistanceMatrixParameter {
get { return (LookupParameter)Parameters["DistanceMatrix"]; }
}
[StorableConstructor]
private TSPAlleleFrequencyAnalyzer(bool deserializing) : base(deserializing) { }
private TSPAlleleFrequencyAnalyzer(TSPAlleleFrequencyAnalyzer original, Cloner cloner) : base(original, cloner) { }
public TSPAlleleFrequencyAnalyzer()
: base() {
Parameters.Add(new LookupParameter("Coordinates", "The x- and y-coordinates of the cities."));
Parameters.Add(new LookupParameter("DistanceMatrix", "The matrix which contains the distances between the cities."));
}
public override IDeepCloneable Clone(Cloner cloner) {
return new TSPAlleleFrequencyAnalyzer(this, cloner);
}
protected override Allele[] CalculateAlleles(Permutation solution) {
Allele[] alleles = new Allele[solution.Length];
DoubleMatrix coords = CoordinatesParameter.ActualValue;
DistanceMatrix dm = DistanceMatrixParameter.ActualValue;
int source, target, h;
double impact;
for (int i = 0; i < solution.Length - 1; i++) {
source = solution[i];
target = solution[i + 1];
if (source > target) { h = source; source = target; target = h; }
impact = dm != null ? dm[source, target] : CalculateLength(coords[source, 0], coords[source, 1], coords[target, 0], coords[target, 1]);
alleles[i] = new Allele(source.ToString() + "-" + target.ToString(), impact);
}
source = solution[solution.Length - 1];
target = solution[0];
if (source > target) { h = source; source = target; target = h; }
impact = dm != null ? dm[source, target] : CalculateLength(coords[source, 0], coords[source, 1], coords[target, 0], coords[target, 1]);
alleles[alleles.Length - 1] = new Allele(source.ToString() + "-" + target.ToString(), impact);
return alleles;
}
private double CalculateLength(double x1, double y1, double x2, double y2) {
return Math.Sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
}
}