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