Free cookie consent management tool by TermsFeed Policy Generator

source: branches/Async/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/ExhaustiveInsertionMoveGenerator.cs @ 13042

Last change on this file since 13042 was 11171, checked in by ascheibe, 10 years ago

#2115 merged r11170 (copyright update) into trunk

File size: 3.1 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2014 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 System.Collections.Generic;
24using System.Linq;
25using HeuristicLab.Common;
26using HeuristicLab.Core;
27using HeuristicLab.Optimization;
28using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
29
30namespace HeuristicLab.Encodings.PermutationEncoding {
31  [Item("ExhaustiveInsertionMoveGenerator", "Generates all possible insertion moves (3-opt) from a given permutation.")]
32  [StorableClass]
33  public class ExhaustiveInsertionMoveGenerator : TranslocationMoveGenerator, IExhaustiveMoveGenerator {
34    [StorableConstructor]
35    protected ExhaustiveInsertionMoveGenerator(bool deserializing) : base(deserializing) { }
36    protected ExhaustiveInsertionMoveGenerator(ExhaustiveInsertionMoveGenerator original, Cloner cloner) : base(original, cloner) { }
37    public ExhaustiveInsertionMoveGenerator() : base() { }
38
39    public override IDeepCloneable Clone(Cloner cloner) {
40      return new ExhaustiveInsertionMoveGenerator(this, cloner);
41    }
42
43    public static IEnumerable<TranslocationMove> Generate(Permutation permutation) {
44      int length = permutation.Length;
45      if (length == 1) throw new ArgumentException("ExhaustiveInsertionMoveGenerator: There cannot be an insertion move given a permutation of length 1.", "permutation");
46
47      if (permutation.PermutationType == PermutationTypes.Absolute) {
48        for (int i = 0; i < length; i++) {
49          for (int j = 1; j <= length - 1; j++) {
50            yield return new TranslocationMove(i, i, (i + j) % length);
51          }
52        }
53      } else {
54        if (length > 2) {
55          for (int i = 0; i < length; i++) {
56            for (int j = 1; j <= length - 1; j++) {
57              if (i == 0 && j == length - 1
58                || i == length - 1 && j == 1) continue;
59              yield return new TranslocationMove(i, i, (i + j) % length);
60            }
61          }
62        } else { // doesn't make sense, but just create a dummy move to not crash the algorithms
63          yield return new TranslocationMove(0, 0, 1);
64        }
65      }
66    }
67
68    public static TranslocationMove[] Apply(Permutation permutation) {
69      return Generate(permutation).ToArray();
70    }
71
72    protected override TranslocationMove[] GenerateMoves(Permutation permutation) {
73      return Apply(permutation);
74    }
75  }
76}
Note: See TracBrowser for help on using the repository browser.