[3074] | 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 HeuristicLab.Core;
|
---|
| 23 | using HeuristicLab.Data;
|
---|
| 24 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
| 25 | using HeuristicLab.Operators;
|
---|
| 26 | using HeuristicLab.Parameters;
|
---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 28 |
|
---|
[3158] | 29 | namespace HeuristicLab.Problems.TravelingSalesman {
|
---|
[3074] | 30 | /// <summary>
|
---|
| 31 | /// A base class for operators which evaluate TSP solutions.
|
---|
| 32 | /// </summary>
|
---|
| 33 | [Item("TSPMoveEvaluator", "A base class for operators which evaluate TSP moves.")]
|
---|
| 34 | [StorableClass]
|
---|
| 35 | public abstract class TSPPathMoveEvaluator : TSPMoveEvaluator, ITSPPathMoveEvaluator {
|
---|
| 36 | public ILookupParameter<Permutation> PermutationParameter {
|
---|
| 37 | get { return (ILookupParameter<Permutation>)Parameters["Permutation"]; }
|
---|
| 38 | }
|
---|
| 39 | public ILookupParameter<DoubleMatrix> CoordinatesParameter {
|
---|
| 40 | get { return (ILookupParameter<DoubleMatrix>)Parameters["Coordinates"]; }
|
---|
| 41 | }
|
---|
| 42 | public ILookupParameter<DoubleMatrix> DistanceMatrixParameter {
|
---|
| 43 | get { return (ILookupParameter<DoubleMatrix>)Parameters["DistanceMatrix"]; }
|
---|
| 44 | }
|
---|
| 45 | public ILookupParameter<BoolValue> UseDistanceMatrixParameter {
|
---|
| 46 | get { return (ILookupParameter<BoolValue>)Parameters["UseDistanceMatrix"]; }
|
---|
| 47 | }
|
---|
| 48 |
|
---|
| 49 | protected TSPPathMoveEvaluator()
|
---|
| 50 | : base() {
|
---|
| 51 | Parameters.Add(new LookupParameter<Permutation>("Permutation", "The solution as permutation."));
|
---|
| 52 | Parameters.Add(new LookupParameter<DoubleMatrix>("Coordinates", "The city's coordinates."));
|
---|
| 53 | Parameters.Add(new LookupParameter<DoubleMatrix>("DistanceMatrix", "The matrix which contains the distances between the cities."));
|
---|
| 54 | Parameters.Add(new LookupParameter<BoolValue>("UseDistanceMatrix", "True if a distance matrix should be calculated (if it does not exist already) and used for evaluation, otherwise false."));
|
---|
| 55 | }
|
---|
| 56 | }
|
---|
| 57 | }
|
---|