Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Moves/TwoOpt/ExhaustiveTwoOptMoveGenerator.cs @ 3044

Last change on this file since 3044 was 3044, checked in by abeham, 14 years ago

updated tabu search #840

File size: 1.9 KB
Line 
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
22using System;
23using HeuristicLab.Core;
24using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
25
26namespace HeuristicLab.Encodings.Permutation {
27  [Item("ExhaustiveTwoOptMoveGenerator", "Generates all possible 2-opt moves from a given permutation.")]
28  [StorableClass]
29  public class ExhaustiveTwoOptMoveGenerator : TwoOptMoveGenerator {
30    public static TwoOptMove[] Apply(Permutation permutation) {
31      int length = permutation.Length;
32      int totalMoves = (length) * (length - 1) / 2 - 3;
33      TwoOptMove[] moves = new TwoOptMove[totalMoves];
34      int count = 0;
35      for (int i = 0; i < length - 1; i++)
36        for (int j = i + 1; j < length; j++) {
37          // doesn't make sense to inverse the whole permutation or the whole but one
38          if (i == 0 && j >= length - 2) continue;
39          else if (i == 1 && j >= length - 1) continue;
40          moves[count++] = new TwoOptMove(i, j);
41        }
42      return moves;
43    }
44
45    protected override TwoOptMove[] GenerateMoves(Permutation permutation) {
46      return Apply(permutation);
47    }
48  }
49}
Note: See TracBrowser for help on using the repository browser.