#region License Information /* HeuristicLab * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL) * * This file is part of HeuristicLab. * * HeuristicLab is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * HeuristicLab is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HeuristicLab. If not, see . */ #endregion using System; using HeuristicLab.Common; using HeuristicLab.Core; using HeuristicLab.Data; using HeuristicLab.Encodings.PermutationEncoding; using HeuristicLab.Operators; using HeuristicLab.Parameters; using HEAL.Attic; namespace HeuristicLab.Problems.PTSP { [Item("EstimatedPTSPMoveEvaluator", "A base class for operators which evaluate PTSP moves.")] [StorableType("F2F7F857-F2CD-4AB2-8656-5158BD04EFDD")] public abstract class EstimatedPTSPMoveEvaluator : SingleSuccessorOperator, IEstimatedPTSPMoveEvaluator { public override bool CanChangeName { get { return false; } } public ILookupParameter PermutationParameter { get { return (ILookupParameter)Parameters["Permutation"]; } } public ILookupParameter CoordinatesParameter { get { return (ILookupParameter)Parameters["Coordinates"]; } } public ILookupParameter DistanceMatrixParameter { get { return (ILookupParameter)Parameters["DistanceMatrix"]; } } public ILookupParameter UseDistanceMatrixParameter { get { return (ILookupParameter)Parameters["UseDistanceMatrix"]; } } public ILookupParameter> RealizationsParameter { get { return (ILookupParameter>)Parameters["Realizations"]; } } public ILookupParameter QualityParameter { get { return (ILookupParameter)Parameters["Quality"]; } } public ILookupParameter MoveQualityParameter { get { return (ILookupParameter)Parameters["MoveQuality"]; } } public ILookupParameter DistanceCalculatorParameter { get { return (ILookupParameter)Parameters["DistanceCalculator"]; } } [StorableConstructor] protected EstimatedPTSPMoveEvaluator(StorableConstructorFlag _) : base(_) { } protected EstimatedPTSPMoveEvaluator(EstimatedPTSPMoveEvaluator original, Cloner cloner) : base(original, cloner) { } protected EstimatedPTSPMoveEvaluator() : base() { Parameters.Add(new LookupParameter("Permutation", "The solution as permutation.")); Parameters.Add(new LookupParameter("Coordinates", "The city's coordinates.")); Parameters.Add(new LookupParameter("DistanceMatrix", "The matrix which contains the distances between the cities.")); Parameters.Add(new LookupParameter("UseDistanceMatrix", "True if a distance matrix should be calculated (if it does not exist already) and used for evaluation, otherwise false.")); Parameters.Add(new LookupParameter>("Realizations", "The list of samples drawn from all possible stochastic instances.")); Parameters.Add(new LookupParameter("Quality", "The quality of a TSP solution.")); Parameters.Add(new LookupParameter("MoveQuality", "The evaluated quality of a move on a TSP solution.")); Parameters.Add(new LookupParameter("DistanceCalculator", "The class that can compute distances between coordinates.")); } public override IOperation Apply() { var permutation = PermutationParameter.ActualValue; var coordinates = CoordinatesParameter.ActualValue; var realizations = RealizationsParameter.ActualValue; Func distance = null; if (UseDistanceMatrixParameter.ActualValue.Value) { var distanceMatrix = DistanceMatrixParameter.ActualValue; if (distanceMatrix == null) throw new InvalidOperationException("The distance matrix has not been calculated."); distance = (a, b) => distanceMatrix[a, b]; } else { if (coordinates == null) throw new InvalidOperationException("No coordinates were given."); var distanceCalculator = DistanceCalculatorParameter.ActualValue; if (distanceCalculator == null) throw new InvalidOperationException("Distance calculator is null!"); distance = (a, b) => distanceCalculator.Calculate(a, b, coordinates); } var relativeQualityDifference = EvaluateMove(permutation, distance, realizations); var moveQuality = MoveQualityParameter.ActualValue; if (moveQuality == null) MoveQualityParameter.ActualValue = new DoubleValue(QualityParameter.ActualValue.Value + relativeQualityDifference); else moveQuality.Value = QualityParameter.ActualValue.Value + relativeQualityDifference; return base.Apply(); } protected abstract double EvaluateMove(Permutation permutation, Func distance, ItemList realizations); } }