source: branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingSequence/Moves/Swap2/Swap2MoveGenerator.cs @ 14128

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

#1966: refactoring of bin packing implementation

File size: 3.2 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 HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Encodings.PermutationEncoding;
26using HeuristicLab.Operators;
27using HeuristicLab.Optimization;
28using HeuristicLab.Parameters;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30using HeuristicLab.Problems.BinPacking;
31
32namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
33  [Item("Swap2 Move Generator", "Base class for all Swap Sequence move generators.")]
34  [StorableClass]
35  public abstract class Swap2MoveGenerator : SingleSuccessorOperator, IPackingSequenceMoveOperator, IMoveGenerator {
36    public override bool CanChangeName {
37      get { return false; }
38    }
39    public ILookupParameter<Permutation> PackingSequenceParameter {
40      get { return (ILookupParameter<Permutation>)Parameters["PackingSequence"]; }
41    }
42    public ILookupParameter<IPackingMove<Permutation>> PackingMoveParameter {
43      get { return (LookupParameter<IPackingMove<Permutation>>)Parameters["PackingMove"]; }
44    }
45    protected ScopeParameter CurrentScopeParameter {
46      get { return (ScopeParameter)Parameters["CurrentScope"]; }
47    }
48
49    [StorableConstructor]
50    protected Swap2MoveGenerator(bool deserializing) : base(deserializing) { }
51    protected Swap2MoveGenerator(Swap2MoveGenerator original, Cloner cloner) : base(original, cloner) { }
52    public Swap2MoveGenerator()
53      : base() {
54      Parameters.Add(new LookupParameter<Permutation>("PackingSequence", "The Sequence vector for which moves should be generated."));
55      Parameters.Add(new LookupParameter<IPackingMove<Permutation>>("PackingMove", "The moves that should be generated in subscopes."));
56      Parameters.Add(new ScopeParameter("CurrentScope", "The current scope where the moves should be added as subscopes."));
57    }
58
59    public override IOperation Apply() {
60      Permutation ps = PackingSequenceParameter.ActualValue;
61      Swap2Move[] moves = GenerateMoves(ps);
62      Scope[] moveScopes = new Scope[moves.Length];
63      for (int i = 0; i < moveScopes.Length; i++) {
64        moveScopes[i] = new Scope(i.ToString());
65        moveScopes[i].Variables.Add(new Variable(PackingMoveParameter.ActualName, moves[i]));
66      }
67      CurrentScopeParameter.ActualValue.SubScopes.AddRange(moveScopes);
68      return base.Apply();
69    }
70
71    protected abstract Swap2Move[] GenerateMoves(Permutation packingSequence);
72  }
73}
Note: See TracBrowser for help on using the repository browser.