1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2010 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.Drawing;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Data;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Problems.VehicleRouting {
|
---|
30 | public sealed class VRPUtilities {
|
---|
31 | public static double CalculateDistance(int start, int end, DoubleMatrix coordinates) {
|
---|
32 | double distance = 0.0;
|
---|
33 |
|
---|
34 | distance =
|
---|
35 | Math.Sqrt(
|
---|
36 | Math.Pow(coordinates[start, 0] - coordinates[end, 0], 2) +
|
---|
37 | Math.Pow(coordinates[start, 1] - coordinates[end, 1], 2));
|
---|
38 |
|
---|
39 | return distance;
|
---|
40 | }
|
---|
41 |
|
---|
42 | private static DoubleMatrix CreateDistanceMatrix(DoubleMatrix coordinates) {
|
---|
43 | DoubleMatrix distanceMatrix = new DoubleMatrix(coordinates.Rows, coordinates.Rows);
|
---|
44 |
|
---|
45 | for (int i = 0; i < distanceMatrix.Rows; i++) {
|
---|
46 | for (int j = i; j < distanceMatrix.Columns; j++) {
|
---|
47 | double distance = CalculateDistance(i, j, coordinates);
|
---|
48 |
|
---|
49 | distanceMatrix[i, j] = distance;
|
---|
50 | distanceMatrix[j, i] = distance;
|
---|
51 | }
|
---|
52 | }
|
---|
53 |
|
---|
54 | return distanceMatrix;
|
---|
55 | }
|
---|
56 |
|
---|
57 | public static double GetDistance(int start, int end,
|
---|
58 | DoubleMatrix coordinates, ILookupParameter<DoubleMatrix> distanceMatrix, BoolValue useDistanceMatrix) {
|
---|
59 | double distance = 0.0;
|
---|
60 |
|
---|
61 | if (useDistanceMatrix.Value) {
|
---|
62 | if (distanceMatrix.ActualValue == null) {
|
---|
63 | distanceMatrix.ActualValue = CreateDistanceMatrix(coordinates);
|
---|
64 | }
|
---|
65 |
|
---|
66 | distance = distanceMatrix.ActualValue[start, end];
|
---|
67 | } else {
|
---|
68 | distance = CalculateDistance(start, end, coordinates);
|
---|
69 | }
|
---|
70 |
|
---|
71 | return distance;
|
---|
72 | }
|
---|
73 |
|
---|
74 | public static double GetDistance(int start, int end,
|
---|
75 | DoubleMatrix coordinates, DoubleMatrix distanceMatrix, BoolValue useDistanceMatrix) {
|
---|
76 | double distance = 0.0;
|
---|
77 |
|
---|
78 | if (useDistanceMatrix.Value) {
|
---|
79 | distance = distanceMatrix[start, end];
|
---|
80 | } else {
|
---|
81 | distance = CalculateDistance(start, end, coordinates);
|
---|
82 | }
|
---|
83 |
|
---|
84 | return distance;
|
---|
85 | }
|
---|
86 | }
|
---|
87 | }
|
---|