Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.TimeSeries/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/ExhaustiveInversionMoveGenerator.cs @ 7268

Last change on this file since 7268 was 7268, checked in by gkronber, 12 years ago

#1081: merged r7214:7266 from trunk into time series branch.

File size: 3.3 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 System;
23using HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Optimization;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Encodings.PermutationEncoding {
29  [Item("ExhaustiveInversionMoveGenerator", "Generates all possible inversion moves (2-opt) from a given permutation.")]
30  [StorableClass]
31  public class ExhaustiveInversionMoveGenerator : InversionMoveGenerator, IExhaustiveMoveGenerator {
32    [StorableConstructor]
33    protected ExhaustiveInversionMoveGenerator(bool deserializing) : base(deserializing) { }
34    protected ExhaustiveInversionMoveGenerator(ExhaustiveInversionMoveGenerator original, Cloner cloner) : base(original, cloner) { }
35    public ExhaustiveInversionMoveGenerator() : base() { }
36
37    public override IDeepCloneable Clone(Cloner cloner) {
38      return new ExhaustiveInversionMoveGenerator(this, cloner);
39    }
40
41    public static InversionMove[] Apply(Permutation permutation) {
42      int length = permutation.Length;
43      if (length == 1) throw new ArgumentException("ExhaustiveInversionMoveGenerator: There cannot be an inversion move given a permutation of length 1.", "permutation");
44      int totalMoves = (length) * (length - 1) / 2;
45      InversionMove[] moves = null;
46      int count = 0;
47
48      if (permutation.PermutationType == PermutationTypes.RelativeUndirected) {
49        if (totalMoves - 3 > 0) {
50          moves = new InversionMove[totalMoves - 3];
51          for (int i = 0; i < length - 1; i++) {
52            for (int j = i + 1; j < length; j++) {
53              // doesn't make sense to inverse the whole permutation or the whole but one in case of relative undirected permutations
54              if (j - i >= length - 2) continue;
55              moves[count++] = new InversionMove(i, j);
56            }
57          }
58        } else { // when length is 3 or less, there's actually no difference, but for the sake of not crashing the algorithm create a dummy move
59          moves = new InversionMove[1];
60          moves[0] = new InversionMove(0, 1);
61        }
62      } else {
63        moves = new InversionMove[totalMoves];
64        for (int i = 0; i < length - 1; i++)
65          for (int j = i + 1; j < length; j++) {
66            moves[count++] = new InversionMove(i, j);
67          }
68      }
69      return moves;
70    }
71
72    protected override InversionMove[] GenerateMoves(Permutation permutation) {
73      return Apply(permutation);
74    }
75  }
76}
Note: See TracBrowser for help on using the repository browser.