[5558] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[15583] | 3 | * Copyright (C) 2002-2018 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[5558] | 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.Common;
|
---|
| 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
| 26 | using HeuristicLab.Operators;
|
---|
| 27 | using HeuristicLab.Parameters;
|
---|
| 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 29 |
|
---|
| 30 | namespace HeuristicLab.Problems.QuadraticAssignment {
|
---|
| 31 | [StorableClass]
|
---|
[10291] | 32 | public class QAPEvaluator : InstrumentedOperator, IQAPEvaluator {
|
---|
[5558] | 33 |
|
---|
| 34 | public ILookupParameter<Permutation> PermutationParameter {
|
---|
| 35 | get { return (ILookupParameter<Permutation>)Parameters["Permutation"]; }
|
---|
| 36 | }
|
---|
[5838] | 37 | public ILookupParameter<DoubleMatrix> DistancesParameter {
|
---|
| 38 | get { return (ILookupParameter<DoubleMatrix>)Parameters["Distances"]; }
|
---|
[5558] | 39 | }
|
---|
| 40 | public ILookupParameter<DoubleMatrix> WeightsParameter {
|
---|
| 41 | get { return (ILookupParameter<DoubleMatrix>)Parameters["Weights"]; }
|
---|
| 42 | }
|
---|
| 43 | public ILookupParameter<DoubleValue> QualityParameter {
|
---|
| 44 | get { return (ILookupParameter<DoubleValue>)Parameters["Quality"]; }
|
---|
| 45 | }
|
---|
| 46 |
|
---|
| 47 | [StorableConstructor]
|
---|
| 48 | protected QAPEvaluator(bool deserializing) : base(deserializing) { }
|
---|
| 49 | protected QAPEvaluator(QAPEvaluator original, Cloner cloner) : base(original, cloner) { }
|
---|
| 50 | public QAPEvaluator() {
|
---|
| 51 | Parameters.Add(new LookupParameter<Permutation>("Permutation", "The permutation that represents the current solution."));
|
---|
[5838] | 52 | Parameters.Add(new LookupParameter<DoubleMatrix>("Distances", "The distance matrix that contains the distances between the locations."));
|
---|
[5558] | 53 | Parameters.Add(new LookupParameter<DoubleMatrix>("Weights", "The matrix with the weights between the facilities, that is how strongly they're connected to each other."));
|
---|
| 54 | Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The quality value aka fitness value of the solution."));
|
---|
| 55 | }
|
---|
| 56 |
|
---|
[5562] | 57 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 58 | return new QAPEvaluator(this, cloner);
|
---|
| 59 | }
|
---|
| 60 |
|
---|
[5598] | 61 | public static double Apply(Permutation assignment, DoubleMatrix weights, DoubleMatrix distances) {
|
---|
[5562] | 62 | double quality = 0;
|
---|
| 63 | for (int i = 0; i < assignment.Length; i++) {
|
---|
| 64 | for (int j = 0; j < assignment.Length; j++) {
|
---|
[5598] | 65 | quality += weights[i, j] * distances[assignment[i], assignment[j]];
|
---|
[5562] | 66 | }
|
---|
| 67 | }
|
---|
| 68 | return quality;
|
---|
| 69 | }
|
---|
| 70 |
|
---|
[6342] | 71 | public static double Impact(int facility, Permutation assignment, DoubleMatrix weights, DoubleMatrix distances) {
|
---|
| 72 | double impact = 0;
|
---|
| 73 | for (int i = 0; i < assignment.Length; i++) {
|
---|
| 74 | impact += weights[facility, i] * distances[assignment[facility], assignment[i]];
|
---|
| 75 | impact += weights[i, facility] * distances[assignment[i], assignment[facility]];
|
---|
| 76 | }
|
---|
| 77 | return impact;
|
---|
| 78 | }
|
---|
| 79 |
|
---|
[10291] | 80 | public override IOperation InstrumentedApply() {
|
---|
[5558] | 81 | Permutation assignment = PermutationParameter.ActualValue;
|
---|
| 82 | DoubleMatrix weights = WeightsParameter.ActualValue;
|
---|
[5838] | 83 | DoubleMatrix distanceMatrix = DistancesParameter.ActualValue;
|
---|
[5562] | 84 |
|
---|
[5598] | 85 | double quality = Apply(assignment, weights, distanceMatrix);
|
---|
[5558] | 86 | QualityParameter.ActualValue = new DoubleValue(quality);
|
---|
[5562] | 87 |
|
---|
[10291] | 88 | return base.InstrumentedApply();
|
---|
[5558] | 89 | }
|
---|
| 90 | }
|
---|
| 91 | }
|
---|