1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
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;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
26 |
|
---|
27 | namespace HeuristicLab.Problems.TravelingSalesman {
|
---|
28 | /// <summary>
|
---|
29 | /// An operator which evaluates TSP solutions given in path representation using the rounded up Euclidean distance metric.
|
---|
30 | /// </summary>
|
---|
31 | [Item("TSPUpperEuclideanPathEvaluator", "An operator which evaluates TSP solutions given in path representation using the rounded up Euclidean distance metric.")]
|
---|
32 | [StorableType("243A948D-9404-4FD0-B4D5-A23A483C2738")]
|
---|
33 | public sealed class TSPUpperEuclideanPathEvaluator : TSPCoordinatesPathEvaluator {
|
---|
34 | [StorableConstructor]
|
---|
35 | private TSPUpperEuclideanPathEvaluator(bool deserializing) : base(deserializing) { }
|
---|
36 | private TSPUpperEuclideanPathEvaluator(TSPUpperEuclideanPathEvaluator original, Cloner cloner) : base(original, cloner) { }
|
---|
37 | public TSPUpperEuclideanPathEvaluator() : base() { }
|
---|
38 |
|
---|
39 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
40 | return new TSPUpperEuclideanPathEvaluator(this, cloner);
|
---|
41 | }
|
---|
42 |
|
---|
43 | /// <summary>
|
---|
44 | /// Calculates the distance between two points using the rounded up 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.Ceiling(Math.Sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)));
|
---|
53 | }
|
---|
54 | }
|
---|
55 | }
|
---|