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