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