#region License Information /* HeuristicLab * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL) * * This file is part of HeuristicLab. * * HeuristicLab is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * HeuristicLab is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HeuristicLab. If not, see . */ #endregion using HeuristicLab.Common; using HeuristicLab.Core; using HeuristicLab.Operators; using HeuristicLab.Optimization; using HeuristicLab.Parameters; using HeuristicLab.Persistence; namespace HeuristicLab.Encodings.LinearLinkageEncoding { [Item("Swap2MoveGenerator", "Base class for all swap-2 move generators.")] [StorableType("0dea8321-6172-4c1c-8339-1f7153adf5e7")] public abstract class Swap2MoveGenerator : SingleSuccessorOperator, ILinearLinkageSwap2MoveOperator, IMoveGenerator { public override bool CanChangeName { get { return false; } } public ILookupParameter LLEParameter { get { return (ILookupParameter)Parameters["LLE"]; } } public ILookupParameter Swap2MoveParameter { get { return (LookupParameter)Parameters["Swap2Move"]; } } [StorableConstructor] protected Swap2MoveGenerator(StorableConstructorFlag deserializing) : base(deserializing) { } protected Swap2MoveGenerator(Swap2MoveGenerator original, Cloner cloner) : base(original, cloner) { } public Swap2MoveGenerator() : base() { Parameters.Add(new LookupParameter("LLE", "The LLE solution for which moves should be generated.")); Parameters.Add(new LookupParameter("Swap2Move", "The moves that should be generated in subscopes.")); } public override IOperation Apply() { var lle = LLEParameter.ActualValue; var moves = GenerateMoves(lle); var moveScopes = new Scope[moves.Length]; for (var i = 0; i < moveScopes.Length; i++) { moveScopes[i] = new Scope(i.ToString()); moveScopes[i].Variables.Add(new Variable(Swap2MoveParameter.ActualName, moves[i])); } ExecutionContext.Scope.SubScopes.AddRange(moveScopes); return base.Apply(); } protected abstract Swap2Move[] GenerateMoves(LinearLinkage lle); } }