[3155] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17246] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3155] | 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 System;
|
---|
[4722] | 23 | using HeuristicLab.Common;
|
---|
[3155] | 24 | using HeuristicLab.Core;
|
---|
[16662] | 25 | using HEAL.Attic;
|
---|
[3155] | 26 |
|
---|
[3158] | 27 | namespace HeuristicLab.Problems.TravelingSalesman {
|
---|
[3155] | 28 | /// <summary>
|
---|
| 29 | /// An operator which evaluates TSP solutions given in path representation using the Euclidean distance metric.
|
---|
| 30 | /// </summary>
|
---|
| 31 | [Item("TSPEuclideanPathEvaluator", "An operator which evaluates TSP solutions given in path representation using the Euclidean distance metric.")]
|
---|
[16662] | 32 | [StorableType("583A53B5-2ABD-44C4-A530-3B5395FB5855")]
|
---|
[3155] | 33 | public sealed class TSPEuclideanPathEvaluator : TSPCoordinatesPathEvaluator {
|
---|
[4722] | 34 | [StorableConstructor]
|
---|
[16662] | 35 | private TSPEuclideanPathEvaluator(StorableConstructorFlag _) : base(_) { }
|
---|
[4722] | 36 | private TSPEuclideanPathEvaluator(TSPEuclideanPathEvaluator original, Cloner cloner) : base(original, cloner) { }
|
---|
| 37 | public TSPEuclideanPathEvaluator() : base() { }
|
---|
| 38 |
|
---|
| 39 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 40 | return new TSPEuclideanPathEvaluator(this, cloner);
|
---|
| 41 | }
|
---|
| 42 |
|
---|
[3155] | 43 | /// <summary>
|
---|
| 44 | /// Calculates the distance between two points using the Euclidean distance metric.
|
---|
| 45 | /// </summary>
|
---|
| 46 | /// <param name="x1">The x-coordinate of point 1.</param>
|
---|
| 47 | /// <param name="y1">The y-coordinate of point 1.</param>
|
---|
| 48 | /// <param name="x2">The x-coordinate of point 2.</param>
|
---|
| 49 | /// <param name="y2">The y-coordinate of point 2.</param>
|
---|
| 50 | /// <returns>The calculated distance.</returns>
|
---|
| 51 | protected override double CalculateDistance(double x1, double y1, double x2, double y2) {
|
---|
| 52 | return Math.Sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
|
---|
| 53 | }
|
---|
| 54 | }
|
---|
| 55 | }
|
---|