Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/GroupingVector/Moves/SwapGrouping/ExhaustiveSwapGroupingMoveGenerator.cs @ 9563

Last change on this file since 9563 was 9563, checked in by jhelm, 11 years ago

#1966: Implemented additional Operator-Wrappers for PackingSequence and GroupingVector; Implemented additional problem-class for Rosenbauer-Problemstatement; Added marker-interfaces for decoder-types;

File size: 2.9 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 System.Collections.Generic;
24using HeuristicLab.Common;
25using HeuristicLab.Core;
26using HeuristicLab.Optimization;
27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28
29namespace HeuristicLab.Encodings.PackingEncoding.GroupingVector {
30  [Item("Exhaustive Swap Grouping Move Generator", "Generates all possible Swap grouping moves from a given groupingVector.")]
31  [StorableClass]
32  public class ExhaustiveSwapGroupingMoveGenerator : SwapGroupingMoveGenerator, IExhaustiveMoveGenerator {
33    [StorableConstructor]
34    protected ExhaustiveSwapGroupingMoveGenerator(bool deserializing) : base(deserializing) { }
35    protected ExhaustiveSwapGroupingMoveGenerator(ExhaustiveSwapGroupingMoveGenerator original, Cloner cloner) : base(original, cloner) { }
36    public ExhaustiveSwapGroupingMoveGenerator() : base() { }
37
38    public override IDeepCloneable Clone(Cloner cloner) {
39      return new ExhaustiveSwapGroupingMoveGenerator(this, cloner);
40    }
41    public static IEnumerable<SwapGroupingMove> Generate(GroupingVectorEncoding groupingVector, int nrOfBins) {
42      for (int i = 0; i < groupingVector.GroupingVector.Length - 1; i++)
43        for (int j = i + 1; j < groupingVector.GroupingVector.Length; j++) {
44          if (j != i)
45            yield return new SwapGroupingMove(i, j, groupingVector);
46        }
47    }
48
49    public static SwapGroupingMove[] Apply(GroupingVectorEncoding groupingVector) {
50      int nrOfBins = 0;
51      foreach (int binNr in groupingVector.GroupingVector) {
52        if (binNr > nrOfBins)
53          nrOfBins = binNr;
54      }
55      nrOfBins++;
56
57      int totalMoves = (groupingVector.GroupingVector.Length * (groupingVector.GroupingVector.Length - 1)) / 2;
58      SwapGroupingMove[] moves = new SwapGroupingMove[totalMoves];
59      int count = 0;
60      foreach (SwapGroupingMove move in Generate(groupingVector, nrOfBins)) {
61        moves[count++] = move;
62      }
63      return moves;
64    }
65
66    protected override SwapGroupingMove[] GenerateMoves(GroupingVectorEncoding groupingVector) {
67      return Apply(groupingVector);
68    }
69  }
70}
Note: See TracBrowser for help on using the repository browser.