| [5838] | 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| [12012] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
|---|
| [5838] | 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 |
|
|---|
| 29 | namespace HeuristicLab.Encodings.PermutationEncoding {
|
|---|
| 30 | [Item("Swap2MoveGenerator", "Base class for all swap-2 move generators.")]
|
|---|
| 31 | [StorableClass]
|
|---|
| 32 | public abstract class Swap2MoveGenerator : SingleSuccessorOperator, IPermutationSwap2MoveOperator, IMoveGenerator {
|
|---|
| 33 | public override bool CanChangeName {
|
|---|
| 34 | get { return false; }
|
|---|
| 35 | }
|
|---|
| 36 | public ILookupParameter<Permutation> PermutationParameter {
|
|---|
| 37 | get { return (ILookupParameter<Permutation>)Parameters["Permutation"]; }
|
|---|
| 38 | }
|
|---|
| 39 | public ILookupParameter<Swap2Move> Swap2MoveParameter {
|
|---|
| 40 | get { return (LookupParameter<Swap2Move>)Parameters["Swap2Move"]; }
|
|---|
| 41 | }
|
|---|
| 42 | protected ScopeParameter CurrentScopeParameter {
|
|---|
| 43 | get { return (ScopeParameter)Parameters["CurrentScope"]; }
|
|---|
| 44 | }
|
|---|
| 45 |
|
|---|
| 46 | [StorableConstructor]
|
|---|
| 47 | protected Swap2MoveGenerator(bool deserializing) : base(deserializing) { }
|
|---|
| 48 | protected Swap2MoveGenerator(Swap2MoveGenerator original, Cloner cloner) : base(original, cloner) { }
|
|---|
| 49 | public Swap2MoveGenerator()
|
|---|
| 50 | : base() {
|
|---|
| 51 | Parameters.Add(new LookupParameter<Permutation>("Permutation", "The permutation for which moves should be generated."));
|
|---|
| 52 | Parameters.Add(new LookupParameter<Swap2Move>("Swap2Move", "The moves that should be generated in subscopes."));
|
|---|
| 53 | Parameters.Add(new ScopeParameter("CurrentScope", "The current scope where the moves should be added as subscopes."));
|
|---|
| 54 | }
|
|---|
| 55 |
|
|---|
| 56 | public override IOperation Apply() {
|
|---|
| 57 | Permutation p = PermutationParameter.ActualValue;
|
|---|
| 58 | Swap2Move[] moves = GenerateMoves(p);
|
|---|
| 59 | Scope[] moveScopes = new Scope[moves.Length];
|
|---|
| 60 | for (int i = 0; i < moveScopes.Length; i++) {
|
|---|
| 61 | moveScopes[i] = new Scope(i.ToString());
|
|---|
| 62 | moveScopes[i].Variables.Add(new Variable(Swap2MoveParameter.ActualName, moves[i]));
|
|---|
| 63 | }
|
|---|
| 64 | CurrentScopeParameter.ActualValue.SubScopes.AddRange(moveScopes);
|
|---|
| 65 | return base.Apply();
|
|---|
| 66 | }
|
|---|
| 67 |
|
|---|
| 68 | protected abstract Swap2Move[] GenerateMoves(Permutation permutation);
|
|---|
| 69 | }
|
|---|
| 70 | }
|
|---|
