[2] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2008 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 System.Collections.Generic;
|
---|
| 24 | using System.Text;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Data;
|
---|
| 27 | using HeuristicLab.Operators;
|
---|
| 28 | using HeuristicLab.Permutation;
|
---|
| 29 |
|
---|
| 30 | namespace HeuristicLab.Routing.TSP {
|
---|
[884] | 31 | /// <summary>
|
---|
| 32 | /// Evaluates the TSP path by using the euclidean distance between two points.
|
---|
| 33 | /// </summary>
|
---|
[2] | 34 | public class RoundedEuclideanPathTSPEvaluator : PathTSPEvaluatorBase {
|
---|
[896] | 35 | /// <inheritdoc select="summary"/>
|
---|
[2] | 36 | public override string Description {
|
---|
| 37 | get { return @"TODO\r\nOperator description still missing ..."; }
|
---|
| 38 | }
|
---|
| 39 |
|
---|
[884] | 40 | /// <summary>
|
---|
| 41 | /// Calculates the distance between two points by using the euclidean distance.
|
---|
| 42 | /// </summary>
|
---|
| 43 | /// <param name="x1">The x coordinate of point 1.</param>
|
---|
| 44 | /// <param name="y1">The y coordinate of point 1.</param>
|
---|
| 45 | /// <param name="x2">The x coordinate of point 2.</param>
|
---|
| 46 | /// <param name="y2">The y coordinate of point 2.</param>
|
---|
| 47 | /// <returns>The euclidean distance between the two points.</returns>
|
---|
[2] | 48 | protected override double CalculateDistance(double x1, double y1, double x2, double y2) {
|
---|
| 49 | return Math.Round(Math.Sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)));
|
---|
| 50 | }
|
---|
| 51 | }
|
---|
| 52 | }
|
---|