#region License Information /* HeuristicLab * Copyright (C) 2002-2010 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 System; using HeuristicLab.Core; using HeuristicLab.Data; using HeuristicLab.Operators; using HeuristicLab.Optimization; using HeuristicLab.Parameters; using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; namespace HeuristicLab.Encodings.PermutationEncoding { [Item("PreventReaddInversionMoveTabuChecker", "Prevents readding of previously deleted edges, but allows deleting previously added edges.")] [StorableClass] public class PreventReaddInversionMoveTabuChecker : SingleSuccessorOperator, IPermutationInversionMoveOperator, ITabuChecker { public override bool CanChangeName { get { return false; } } public ILookupParameter InversionMoveParameter { get { return (LookupParameter)Parameters["InversionMove"]; } } public ILookupParameter PermutationParameter { get { return (LookupParameter)Parameters["Permutation"]; } } public ILookupParameter> TabuListParameter { get { return (ILookupParameter>)Parameters["TabuList"]; } } public ILookupParameter MoveTabuParameter { get { return (ILookupParameter)Parameters["MoveTabu"]; } } private ScopeParameter CurrentScopeParameter { get { return (ScopeParameter)Parameters["CurrentScope"]; } } public PreventReaddInversionMoveTabuChecker() : base() { Parameters.Add(new LookupParameter("InversionMove", "The move to evaluate.")); Parameters.Add(new LookupParameter("MoveTabu", "The variable to store if a move was tabu.")); Parameters.Add(new LookupParameter("Permutation", "The solution as permutation.")); Parameters.Add(new LookupParameter>("TabuList", "The tabu list.")); Parameters.Add(new ScopeParameter("CurrentScope", "The current scope.")); } public override IOperation Apply() { ItemList tabuList = TabuListParameter.ActualValue; InversionMove move = InversionMoveParameter.ActualValue; Permutation permutation = PermutationParameter.ActualValue; int length = permutation.Length; int E1S = permutation.GetCircular(move.Index1 - 1); int E1T = permutation[move.Index1]; int E2S = permutation[move.Index2]; int E2T = permutation.GetCircular(move.Index2 + 1); bool isTabu = (move.Index2 - move.Index1 >= length - 2); // doesn't change the solution; if (!isTabu) { foreach (IItem tabuMove in tabuList) { InversionMoveAttribute attribute = (tabuMove as InversionMoveAttribute); if (attribute != null) { // if previously deleted Edge1Source-Target is readded if (attribute.Edge1Source == E1S && attribute.Edge1Target == E2S || attribute.Edge1Source == E2S && attribute.Edge1Target == E1S || attribute.Edge1Source == E1T && attribute.Edge1Target == E2T || attribute.Edge1Source == E2T && attribute.Edge1Target == E1T // if previously deleted Edge2Source-Target is readded || attribute.Edge2Source == E1T && attribute.Edge2Target == E2T || attribute.Edge2Source == E2T && attribute.Edge2Target == E1T || attribute.Edge2Source == E1S && attribute.Edge2Target == E2S || attribute.Edge2Source == E2S && attribute.Edge2Target == E1S) { isTabu = true; break; } } } } MoveTabuParameter.ActualValue = new BoolValue(isTabu); return base.Apply(); } } }