source: trunk/sources/HeuristicLab.Problems.TravelingSalesman/3.3/MoveEvaluators/TwoOpt/TSPInversionMovePathEvaluator.cs @ 7259

Last change on this file since 7259 was 7259, checked in by swagner, 9 years ago

Updated year of copyrights to 2012 (#1716)

File size: 4.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 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
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Encodings.PermutationEncoding;
26using HeuristicLab.Parameters;
27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28
29namespace HeuristicLab.Problems.TravelingSalesman {
30  /// <summary>
31  /// An operator to evaluate inversion moves (2-opt).
32  /// </summary>
33  [Item("TSPInversionMovePathEvaluator", "Evaluates an inversion move (2-opt) by summing up the length of all added edges and subtracting the length of all deleted edges.")]
34  [StorableClass]
35  public abstract class TSPInversionMovePathEvaluator : TSPPathMoveEvaluator, IPermutationInversionMoveOperator {
36    public ILookupParameter<InversionMove> InversionMoveParameter {
37      get { return (ILookupParameter<InversionMove>)Parameters["InversionMove"]; }
38    }
39
40    [StorableConstructor]
41    protected TSPInversionMovePathEvaluator(bool deserializing) : base(deserializing) { }
42    protected TSPInversionMovePathEvaluator(TSPInversionMovePathEvaluator original, Cloner cloner) : base(original, cloner) { }
43    public TSPInversionMovePathEvaluator()
44      : base() {
45      Parameters.Add(new LookupParameter<InversionMove>("InversionMove", "The move to evaluate."));
46    }
47
48    protected override double EvaluateByCoordinates(Permutation permutation, DoubleMatrix coordinates) {
49      InversionMove move = InversionMoveParameter.ActualValue;
50      int edge1source = permutation.GetCircular(move.Index1 - 1);
51      int edge1target = permutation[move.Index1];
52      int edge2source = permutation[move.Index2];
53      int edge2target = permutation.GetCircular(move.Index2 + 1);
54      if (move.Index2 - move.Index1 >= permutation.Length - 2) return 0;
55      double moveQuality = 0;
56      // remove two edges
57      moveQuality -= CalculateDistance(coordinates[edge1source, 0], coordinates[edge1source, 1],
58            coordinates[edge1target, 0], coordinates[edge1target, 1]);
59      moveQuality -= CalculateDistance(coordinates[edge2source, 0], coordinates[edge2source, 1],
60        coordinates[edge2target, 0], coordinates[edge2target, 1]);
61      // add two edges
62      moveQuality += CalculateDistance(coordinates[edge1source, 0], coordinates[edge1source, 1],
63        coordinates[edge2source, 0], coordinates[edge2source, 1]);
64      moveQuality += CalculateDistance(coordinates[edge1target, 0], coordinates[edge1target, 1],
65        coordinates[edge2target, 0], coordinates[edge2target, 1]);
66      return moveQuality;
67    }
68
69    protected override double EvaluateByDistanceMatrix(Permutation permutation, DistanceMatrix distanceMatrix) {
70      InversionMove move = InversionMoveParameter.ActualValue;
71      int edge1source = permutation.GetCircular(move.Index1 - 1);
72      int edge1target = permutation[move.Index1];
73      int edge2source = permutation[move.Index2];
74      int edge2target = permutation.GetCircular(move.Index2 + 1);
75      if (move.Index2 - move.Index1 >= permutation.Length - 2) return 0;
76      double moveQuality = 0;
77      // remove two edges
78      moveQuality -= distanceMatrix[edge1source, edge1target];
79      moveQuality -= distanceMatrix[edge2source, edge2target];
80      // add two edges
81      moveQuality += distanceMatrix[edge1source, edge2source];
82      moveQuality += distanceMatrix[edge1target, edge2target];
83      return moveQuality;
84    }
85  }
86}
Note: See TracBrowser for help on using the repository browser.