#region License Information /* HeuristicLab * Copyright (C) 2002-2014 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 which evaluates TSP solutions given in path representation using the rounded up Euclidean distance metric. /// [Item("TSPUpperEuclideanPathEvaluator", "An operator which evaluates TSP solutions given in path representation using the rounded up Euclidean distance metric.")] [StorableClass] public sealed class TSPUpperEuclideanPathEvaluator : TSPCoordinatesPathEvaluator { [StorableConstructor] private TSPUpperEuclideanPathEvaluator(bool deserializing) : base(deserializing) { } private TSPUpperEuclideanPathEvaluator(TSPUpperEuclideanPathEvaluator original, Cloner cloner) : base(original, cloner) { } public TSPUpperEuclideanPathEvaluator() : base() { } public override IDeepCloneable Clone(Cloner cloner) { return new TSPUpperEuclideanPathEvaluator(this, cloner); } /// /// Calculates the distance between two points using the rounded up Euclidean distance metric. /// /// The x-coordinate of point 1. /// The y-coordinate of point 1. /// The x-coordinate of point 2. /// The y-coordinate of point 2. /// The calculated distance. protected override double CalculateDistance(double x1, double y1, double x2, double y2) { return Math.Ceiling(Math.Sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2))); } } }