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