| [5785] | 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| [9456] | 3 | * Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
|---|
| [5785] | 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 | /// <summary>
|
|---|
| 32 | /// A base class for operators which evaluate QAP solutions.
|
|---|
| 33 | /// </summary>
|
|---|
| 34 | [Item("QAPMoveEvaluator", "A base class for operators which evaluate moves.")]
|
|---|
| 35 | [StorableClass]
|
|---|
| 36 | public abstract class QAPMoveEvaluator : SingleSuccessorOperator, IQAPMoveEvaluator {
|
|---|
| 37 |
|
|---|
| 38 | public override bool CanChangeName {
|
|---|
| 39 | get { return false; }
|
|---|
| 40 | }
|
|---|
| 41 |
|
|---|
| 42 | public ILookupParameter<DoubleValue> QualityParameter {
|
|---|
| 43 | get { return (ILookupParameter<DoubleValue>)Parameters["Quality"]; }
|
|---|
| 44 | }
|
|---|
| 45 | public ILookupParameter<DoubleValue> MoveQualityParameter {
|
|---|
| 46 | get { return (ILookupParameter<DoubleValue>)Parameters["MoveQuality"]; }
|
|---|
| 47 | }
|
|---|
| 48 | public ILookupParameter<Permutation> PermutationParameter {
|
|---|
| 49 | get { return (ILookupParameter<Permutation>)Parameters["Permutation"]; }
|
|---|
| 50 | }
|
|---|
| [5838] | 51 | public ILookupParameter<DoubleMatrix> DistancesParameter {
|
|---|
| 52 | get { return (ILookupParameter<DoubleMatrix>)Parameters["Distances"]; }
|
|---|
| [5785] | 53 | }
|
|---|
| 54 | public ILookupParameter<DoubleMatrix> WeightsParameter {
|
|---|
| 55 | get { return (ILookupParameter<DoubleMatrix>)Parameters["Weights"]; }
|
|---|
| 56 | }
|
|---|
| 57 |
|
|---|
| 58 | [StorableConstructor]
|
|---|
| 59 | protected QAPMoveEvaluator(bool deserializing) : base(deserializing) { }
|
|---|
| 60 | protected QAPMoveEvaluator(QAPMoveEvaluator original, Cloner cloner) : base(original, cloner) { }
|
|---|
| 61 | protected QAPMoveEvaluator()
|
|---|
| 62 | : base() {
|
|---|
| 63 | Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The quality of a QAP solution."));
|
|---|
| 64 | Parameters.Add(new LookupParameter<DoubleValue>("MoveQuality", "The evaluated quality of a move on a QAP solution."));
|
|---|
| 65 | Parameters.Add(new LookupParameter<Permutation>("Permutation", "The solution as permutation."));
|
|---|
| [5838] | 66 | Parameters.Add(new LookupParameter<DoubleMatrix>("Distances", "The matrix which contains the distances between the facilities."));
|
|---|
| [5785] | 67 | Parameters.Add(new LookupParameter<DoubleMatrix>("Weights", "The matrix with the weights between the facilities, that is how strongly they're connected to each other."));
|
|---|
| 68 | }
|
|---|
| 69 | }
|
|---|
| 70 | }
|
|---|
