1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2010 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 | using System;
|
---|
23 | using HeuristicLab.Analysis;
|
---|
24 | using HeuristicLab.Common;
|
---|
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 | }
|
---|
41 |
|
---|
42 | [StorableConstructor]
|
---|
43 | private TSPAlleleFrequencyAnalyzer(bool deserializing) : base(deserializing) { }
|
---|
44 | private TSPAlleleFrequencyAnalyzer(TSPAlleleFrequencyAnalyzer original, Cloner cloner) : base(original, cloner) { }
|
---|
45 | public TSPAlleleFrequencyAnalyzer()
|
---|
46 | : base() {
|
---|
47 | Parameters.Add(new LookupParameter<DoubleMatrix>("Coordinates", "The x- and y-coordinates of the cities."));
|
---|
48 | }
|
---|
49 |
|
---|
50 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
51 | return new TSPAlleleFrequencyAnalyzer(this, cloner);
|
---|
52 | }
|
---|
53 |
|
---|
54 | protected override Allele[] CalculateAlleles(Permutation solution) {
|
---|
55 | Allele[] alleles = new Allele[solution.Length];
|
---|
56 | DoubleMatrix coords = CoordinatesParameter.ActualValue;
|
---|
57 |
|
---|
58 | for (int i = 0; i < solution.Length - 1; i++)
|
---|
59 | alleles[i] = CreateAllele(solution[i], solution[i + 1], coords);
|
---|
60 | alleles[alleles.Length - 1] = CreateAllele(solution[solution.Length - 1], solution[0], coords);
|
---|
61 |
|
---|
62 | return alleles;
|
---|
63 | }
|
---|
64 |
|
---|
65 | private Allele CreateAllele(int source, int target, DoubleMatrix coords) {
|
---|
66 | if (source > target) {
|
---|
67 | int h = source;
|
---|
68 | source = target;
|
---|
69 | target = h;
|
---|
70 | }
|
---|
71 |
|
---|
72 | return new Allele(source.ToString() + "-" + target.ToString(),
|
---|
73 | CalculateLength(coords[source, 0], coords[source, 1], coords[target, 0], coords[target, 1]));
|
---|
74 | }
|
---|
75 |
|
---|
76 | private double CalculateLength(double x1, double y1, double x2, double y2) {
|
---|
77 | return Math.Sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
|
---|
78 | }
|
---|
79 | }
|
---|
80 | }
|
---|