[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 GEO distance metric (globe coordinates).
|
---|
| 30 | /// </summary>
|
---|
| 31 | [Item("TSPGeoPathEvaluator", "An operator which evaluates TSP solutions given in path representation using the GEO distance metric (globe coordinates).")]
|
---|
[16662] | 32 | [StorableType("A69C2CE3-6A89-4991-9743-4DE8F07149B9")]
|
---|
[3155] | 33 | public sealed class TSPGeoPathEvaluator : TSPCoordinatesPathEvaluator {
|
---|
| 34 | private const double PI = 3.141592;
|
---|
| 35 | private const double RADIUS = 6378.388;
|
---|
| 36 |
|
---|
[4722] | 37 | [StorableConstructor]
|
---|
[16662] | 38 | private TSPGeoPathEvaluator(StorableConstructorFlag _) : base(_) { }
|
---|
[4722] | 39 | private TSPGeoPathEvaluator(TSPGeoPathEvaluator original, Cloner cloner) : base(original, cloner) { }
|
---|
| 40 | public TSPGeoPathEvaluator() : base() { }
|
---|
| 41 |
|
---|
| 42 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 43 | return new TSPGeoPathEvaluator(this, cloner);
|
---|
| 44 | }
|
---|
| 45 |
|
---|
| 46 |
|
---|
[3155] | 47 | /// <summary>
|
---|
| 48 | /// Calculates the distance between two points using the GEO distance metric (globe coordinates).
|
---|
| 49 | /// </summary>
|
---|
| 50 | /// <param name="x1">The x-coordinate of point 1.</param>
|
---|
| 51 | /// <param name="y1">The y-coordinate of point 1.</param>
|
---|
| 52 | /// <param name="x2">The x-coordinate of point 2.</param>
|
---|
| 53 | /// <param name="y2">The y-coordinate of point 2.</param>
|
---|
| 54 | /// <returns>The calculated distance.</returns>
|
---|
| 55 | protected override double CalculateDistance(double x1, double y1, double x2, double y2) {
|
---|
| 56 | double latitude1, longitude1, latitude2, longitude2;
|
---|
| 57 | double q1, q2, q3;
|
---|
| 58 | double length;
|
---|
| 59 |
|
---|
| 60 | latitude1 = ConvertToRadian(x1);
|
---|
| 61 | longitude1 = ConvertToRadian(y1);
|
---|
| 62 | latitude2 = ConvertToRadian(x2);
|
---|
| 63 | longitude2 = ConvertToRadian(y2);
|
---|
| 64 |
|
---|
| 65 | q1 = Math.Cos(longitude1 - longitude2);
|
---|
| 66 | q2 = Math.Cos(latitude1 - latitude2);
|
---|
| 67 | q3 = Math.Cos(latitude1 + latitude2);
|
---|
| 68 |
|
---|
| 69 | length = (int)(RADIUS * Math.Acos(0.5 * ((1.0 + q1) * q2 - (1.0 - q1) * q3)) + 1.0);
|
---|
| 70 | return (length);
|
---|
| 71 | }
|
---|
| 72 |
|
---|
| 73 | private double ConvertToRadian(double x) {
|
---|
| 74 | return PI * (Math.Truncate(x) + 5.0 * (x - Math.Truncate(x)) / 3.0) / 180.0;
|
---|
| 75 | }
|
---|
| 76 | }
|
---|
| 77 | }
|
---|