source: branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingSequence/Moves/Swap2/ExhaustiveSwap2MoveGenerator.cs @ 13032

Last change on this file since 13032 was 13032, checked in by gkronber, 5 years ago

#1966:

  • removed unused using
  • added/updated license headers
File size: 2.8 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 Joseph Helm and 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
23using System.Collections.Generic;
24using HeuristicLab.Common;
25using HeuristicLab.Core;
26using HeuristicLab.Optimization;
27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28
29namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
30  [Item("Exhaustive Swap2 Move Generator", "Generates all possible Swap Sequence moves from a given PackingSequence.")]
31  [StorableClass]
32  public class ExhaustiveSwap2MoveGenerator : Swap2MoveGenerator, IExhaustiveMoveGenerator {
33    [StorableConstructor]
34    protected ExhaustiveSwap2MoveGenerator(bool deserializing) : base(deserializing) { }
35    protected ExhaustiveSwap2MoveGenerator(ExhaustiveSwap2MoveGenerator original, Cloner cloner) : base(original, cloner) { }
36    public ExhaustiveSwap2MoveGenerator() : base() { }
37
38    public override IDeepCloneable Clone(Cloner cloner) {
39      return new ExhaustiveSwap2MoveGenerator(this, cloner);
40    }
41    public static IEnumerable<Swap2Move> Generate(PackingSequenceEncoding PackingSequence, int nrOfBins) {
42      for (int i = 0; i < PackingSequence.PackingSequence.Length - 1; i++)
43        for (int j = i + 1; j < PackingSequence.PackingSequence.Length; j++) {
44          if (j != i)
45            yield return new Swap2Move(i, j, PackingSequence);
46        }
47    }
48
49    public static Swap2Move[] Apply(PackingSequenceEncoding PackingSequence) {
50      int nrOfBins = 0;
51      foreach (int binNr in PackingSequence.PackingSequence) {
52        if (binNr > nrOfBins)
53          nrOfBins = binNr;
54      }
55      nrOfBins++;
56
57      int totalMoves = (PackingSequence.PackingSequence.Length * (PackingSequence.PackingSequence.Length - 1)) / 2;
58      Swap2Move[] moves = new Swap2Move[totalMoves];
59      int count = 0;
60      foreach (Swap2Move move in Generate(PackingSequence, nrOfBins)) {
61        moves[count++] = move;
62      }
63      return moves;
64    }
65
66    protected override Swap2Move[] GenerateMoves(PackingSequenceEncoding PackingSequence) {
67      return Apply(PackingSequence);
68    }
69  }
70}
Note: See TracBrowser for help on using the repository browser.