[3044] | 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 HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[3098] | 25 | using HeuristicLab.Optimization;
|
---|
[3044] | 26 |
|
---|
[3053] | 27 | namespace HeuristicLab.Encodings.PermutationEncoding {
|
---|
[3232] | 28 | [Item("ExhaustiveInversionMoveGenerator", "Generates all possible inversion moves (2-opt) from a given permutation.")]
|
---|
[3044] | 29 | [StorableClass]
|
---|
[3232] | 30 | public class ExhaustiveInversionMoveGenerator : InversionMoveGenerator, IExhaustiveMoveGenerator {
|
---|
| 31 | public static InversionMove[] Apply(Permutation permutation) {
|
---|
[3044] | 32 | int length = permutation.Length;
|
---|
[3340] | 33 | int totalMoves = (length) * (length - 1) / 2;
|
---|
| 34 | InversionMove[] moves = null;
|
---|
[3044] | 35 | int count = 0;
|
---|
[3233] | 36 |
|
---|
| 37 | if (permutation.PermutationType == PermutationTypes.RelativeUndirected) {
|
---|
[3340] | 38 | moves = new InversionMove[totalMoves - 3];
|
---|
[3233] | 39 | for (int i = 0; i < length - 1; i++) {
|
---|
| 40 | for (int j = i + 1; j < length; j++) {
|
---|
| 41 | // doesn't make sense to inverse the whole permutation or the whole but one in case of relative undirected permutations
|
---|
| 42 | if (j - i >= length - 2) continue;
|
---|
| 43 | moves[count++] = new InversionMove(i, j);
|
---|
| 44 | }
|
---|
[3044] | 45 | }
|
---|
[3233] | 46 | } else {
|
---|
[3340] | 47 | moves = new InversionMove[totalMoves];
|
---|
| 48 | for (int i = 0; i < length - 1; i++)
|
---|
| 49 | for (int j = i + 1; j < length; j++) {
|
---|
| 50 | moves[count++] = new InversionMove(i, j);
|
---|
| 51 | }
|
---|
[3233] | 52 | }
|
---|
[3044] | 53 | return moves;
|
---|
| 54 | }
|
---|
| 55 |
|
---|
[3232] | 56 | protected override InversionMove[] GenerateMoves(Permutation permutation) {
|
---|
[3044] | 57 | return Apply(permutation);
|
---|
| 58 | }
|
---|
| 59 | }
|
---|
| 60 | }
|
---|