1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2011 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 HeuristicLab.Analysis;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Data;
|
---|
26 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
27 | using HeuristicLab.Parameters;
|
---|
28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Problems.QuadraticAssignment {
|
---|
31 | /// <summary>
|
---|
32 | /// An operator for analyzing the frequency of alleles in solutions of Quadratic Assignment Problems.
|
---|
33 | /// </summary>
|
---|
34 | [Item("QAPAlleleFrequencyAnalyzer", "An operator for analyzing the frequency of alleles in solutions of Quadratic Assignment Problems.")]
|
---|
35 | [StorableClass]
|
---|
36 | public sealed class QAPAlleleFrequencyAnalyzer : AlleleFrequencyAnalyzer<Permutation> {
|
---|
37 | public LookupParameter<DoubleMatrix> WeightsParameter {
|
---|
38 | get { return (LookupParameter<DoubleMatrix>)Parameters["Weights"]; }
|
---|
39 | }
|
---|
40 | public LookupParameter<DoubleMatrix> DistancesParameter {
|
---|
41 | get { return (LookupParameter<DoubleMatrix>)Parameters["Distances"]; }
|
---|
42 | }
|
---|
43 |
|
---|
44 | [StorableConstructor]
|
---|
45 | private QAPAlleleFrequencyAnalyzer(bool deserializing) : base(deserializing) { }
|
---|
46 | private QAPAlleleFrequencyAnalyzer(QAPAlleleFrequencyAnalyzer original, Cloner cloner) : base(original, cloner) { }
|
---|
47 | public QAPAlleleFrequencyAnalyzer()
|
---|
48 | : base() {
|
---|
49 | Parameters.Add(new LookupParameter<DoubleMatrix>("Weights", "The matrix contains the weights between the facilities."));
|
---|
50 | Parameters.Add(new LookupParameter<DoubleMatrix>("Distances", "The matrix which contains the distances between the locations."));
|
---|
51 | }
|
---|
52 |
|
---|
53 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
54 | return new QAPAlleleFrequencyAnalyzer(this, cloner);
|
---|
55 | }
|
---|
56 |
|
---|
57 | protected override Allele[] CalculateAlleles(Permutation solution) {
|
---|
58 | Allele[] alleles = new Allele[solution.Length];
|
---|
59 | DoubleMatrix weights = WeightsParameter.ActualValue;
|
---|
60 | DoubleMatrix distances = DistancesParameter.ActualValue;
|
---|
61 | int source, target;
|
---|
62 | double impact;
|
---|
63 |
|
---|
64 | for (int i = 0; i < solution.Length; i++) {
|
---|
65 | source = i;
|
---|
66 | target = solution[i];
|
---|
67 | impact = 0;
|
---|
68 | for (int j = 0; j < solution.Length; j++)
|
---|
69 | impact += weights[source, j] * distances[target, solution[j]];
|
---|
70 | alleles[i] = new Allele(source.ToString() + "->" + target.ToString(), impact);
|
---|
71 | }
|
---|
72 |
|
---|
73 | return alleles;
|
---|
74 | }
|
---|
75 | }
|
---|
76 | }
|
---|