[4623] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[12018] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[4623] | 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 | using System;
|
---|
| 23 | using HeuristicLab.Analysis;
|
---|
[4722] | 24 | using HeuristicLab.Common;
|
---|
[4623] | 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Data;
|
---|
| 27 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
| 28 | using HeuristicLab.Parameters;
|
---|
| 29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 30 |
|
---|
| 31 | namespace HeuristicLab.Problems.TravelingSalesman {
|
---|
| 32 | /// <summary>
|
---|
| 33 | /// An operator for analyzing the frequency of alleles in solutions of Traveling Salesman Problems given in path representation.
|
---|
| 34 | /// </summary>
|
---|
| 35 | [Item("TSPAlleleFrequencyAnalyzer", "An operator for analyzing the frequency of alleles in solutions of Traveling Salesman Problems given in path representation.")]
|
---|
| 36 | [StorableClass]
|
---|
| 37 | public sealed class TSPAlleleFrequencyAnalyzer : AlleleFrequencyAnalyzer<Permutation> {
|
---|
| 38 | public LookupParameter<DoubleMatrix> CoordinatesParameter {
|
---|
| 39 | get { return (LookupParameter<DoubleMatrix>)Parameters["Coordinates"]; }
|
---|
| 40 | }
|
---|
[4866] | 41 | public LookupParameter<DistanceMatrix> DistanceMatrixParameter {
|
---|
| 42 | get { return (LookupParameter<DistanceMatrix>)Parameters["DistanceMatrix"]; }
|
---|
| 43 | }
|
---|
[4623] | 44 |
|
---|
[4704] | 45 | [StorableConstructor]
|
---|
| 46 | private TSPAlleleFrequencyAnalyzer(bool deserializing) : base(deserializing) { }
|
---|
[4722] | 47 | private TSPAlleleFrequencyAnalyzer(TSPAlleleFrequencyAnalyzer original, Cloner cloner) : base(original, cloner) { }
|
---|
[4623] | 48 | public TSPAlleleFrequencyAnalyzer()
|
---|
| 49 | : base() {
|
---|
[4849] | 50 | Parameters.Add(new LookupParameter<DoubleMatrix>("Coordinates", "The x- and y-coordinates of the cities."));
|
---|
[4866] | 51 | Parameters.Add(new LookupParameter<DistanceMatrix>("DistanceMatrix", "The matrix which contains the distances between the cities."));
|
---|
[4623] | 52 | }
|
---|
| 53 |
|
---|
[4722] | 54 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 55 | return new TSPAlleleFrequencyAnalyzer(this, cloner);
|
---|
| 56 | }
|
---|
| 57 |
|
---|
[4623] | 58 | protected override Allele[] CalculateAlleles(Permutation solution) {
|
---|
| 59 | Allele[] alleles = new Allele[solution.Length];
|
---|
| 60 | DoubleMatrix coords = CoordinatesParameter.ActualValue;
|
---|
[4866] | 61 | DistanceMatrix dm = DistanceMatrixParameter.ActualValue;
|
---|
[7621] | 62 | if (dm == null && coords == null) throw new InvalidOperationException("Neither a distance matrix nor coordinates were given.");
|
---|
[4866] | 63 | int source, target, h;
|
---|
| 64 | double impact;
|
---|
[4623] | 65 |
|
---|
[4866] | 66 | for (int i = 0; i < solution.Length - 1; i++) {
|
---|
| 67 | source = solution[i];
|
---|
| 68 | target = solution[i + 1];
|
---|
| 69 | if (source > target) { h = source; source = target; target = h; }
|
---|
| 70 | impact = dm != null ? dm[source, target] : CalculateLength(coords[source, 0], coords[source, 1], coords[target, 0], coords[target, 1]);
|
---|
| 71 | alleles[i] = new Allele(source.ToString() + "-" + target.ToString(), impact);
|
---|
| 72 | }
|
---|
| 73 | source = solution[solution.Length - 1];
|
---|
| 74 | target = solution[0];
|
---|
| 75 | if (source > target) { h = source; source = target; target = h; }
|
---|
| 76 | impact = dm != null ? dm[source, target] : CalculateLength(coords[source, 0], coords[source, 1], coords[target, 0], coords[target, 1]);
|
---|
| 77 | alleles[alleles.Length - 1] = new Allele(source.ToString() + "-" + target.ToString(), impact);
|
---|
[4623] | 78 |
|
---|
| 79 | return alleles;
|
---|
| 80 | }
|
---|
| 81 |
|
---|
| 82 | private double CalculateLength(double x1, double y1, double x2, double y2) {
|
---|
| 83 | return Math.Sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
|
---|
| 84 | }
|
---|
| 85 | }
|
---|
| 86 | }
|
---|