#region License Information /* HeuristicLab * Copyright (C) 2002-2018 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.Persistence.Default.CompositeSerializers.Storable; namespace HeuristicLab.Problems.TravelingSalesman { /// /// An operator to evaluate 2-opt moves. /// [Item("TSPInversionMoveEuclideanPathEvaluator", "Operator for evaluating an inversion move (2-opt) based on euclidean distances.")] [StorableClass] public class TSPInversionMoveEuclideanPathEvaluator : TSPInversionMovePathEvaluator { [StorableConstructor] protected TSPInversionMoveEuclideanPathEvaluator(bool deserializing) : base(deserializing) { } protected TSPInversionMoveEuclideanPathEvaluator(TSPInversionMoveEuclideanPathEvaluator original, Cloner cloner) : base(original, cloner) { } public TSPInversionMoveEuclideanPathEvaluator() : base() { } public override IDeepCloneable Clone(Cloner cloner) { return new TSPInversionMoveEuclideanPathEvaluator(this, cloner); } public override Type EvaluatorType { get { return typeof(TSPEuclideanPathEvaluator); } } protected override double CalculateDistance(double x1, double y1, double x2, double y2) { return Math.Sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); } } }