#region License Information /* HeuristicLab * Copyright (C) 2002-2015 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.Common; 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("InversionMoveHardTabuCriterion", @"For relative postion encoded permutations it prevents readding of previously deleted edges as well as deleting previously added edges. For absolute position encoded permutations it prevents moving a number if it was previously moved. If the aspiration condition is activated, a move will not be considered tabu against a move in the tabu list if it leads to a better solution than the quality recorded with the move in the tabu list.")] [StorableClass] public class InversionMoveHardTabuCriterion : 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"]; } } public IValueLookupParameter MaximizationParameter { get { return (IValueLookupParameter)Parameters["Maximization"]; } } public ILookupParameter MoveQualityParameter { get { return (ILookupParameter)Parameters["MoveQuality"]; } } public ValueParameter UseAspirationCriterionParameter { get { return (ValueParameter)Parameters["UseAspirationCriterion"]; } } public BoolValue UseAspirationCriterion { get { return UseAspirationCriterionParameter.Value; } set { UseAspirationCriterionParameter.Value = value; } } [StorableConstructor] protected InversionMoveHardTabuCriterion(bool deserializing) : base(deserializing) { } protected InversionMoveHardTabuCriterion(InversionMoveHardTabuCriterion original, Cloner cloner) : base(original, cloner) { } public InversionMoveHardTabuCriterion() : 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 ValueParameter("UseAspirationCriterion", "Whether to use the aspiration criterion or not.", new BoolValue(true))); Parameters.Add(new ValueLookupParameter("Maximization", "True if the problem is a maximization problem, else if it is a minimization problem.")); Parameters.Add(new LookupParameter("MoveQuality", "The quality of the current move.")); } public override IDeepCloneable Clone(Cloner cloner) { return new InversionMoveHardTabuCriterion(this, cloner); } public override IOperation Apply() { ItemList tabuList = TabuListParameter.ActualValue; InversionMove move = InversionMoveParameter.ActualValue; Permutation permutation = PermutationParameter.ActualValue; int length = permutation.Length; double moveQuality = MoveQualityParameter.ActualValue.Value; bool maximization = MaximizationParameter.ActualValue.Value; bool useAspiration = UseAspirationCriterion.Value; bool isTabu = false; foreach (IItem tabuMove in tabuList) { PermutationMoveAttribute attrib = (tabuMove as PermutationMoveAttribute); if (!useAspiration || maximization && moveQuality <= attrib.MoveQuality || !maximization && moveQuality >= attrib.MoveQuality) { switch (permutation.PermutationType) { case PermutationTypes.RelativeUndirected: { int E1S = permutation.GetCircular(move.Index1 - 1); int E1T = permutation[move.Index1]; int E2S = permutation[move.Index2]; int E2T = permutation.GetCircular(move.Index2 + 1); InversionMoveRelativeAttribute relAttrib = (attrib as InversionMoveRelativeAttribute); if (relAttrib != null) { if (relAttrib.Edge1Source == E1S && relAttrib.Edge2Source == E1T || relAttrib.Edge1Source == E1T && relAttrib.Edge2Source == E1S || relAttrib.Edge1Source == E2S && relAttrib.Edge2Source == E2T || relAttrib.Edge1Source == E2T && relAttrib.Edge2Source == E2S // if previously added Edge1Target-Edge2Target is deleted || relAttrib.Edge1Target == E2S && relAttrib.Edge2Target == E2T || relAttrib.Edge1Target == E2T && relAttrib.Edge2Target == E2S || relAttrib.Edge1Target == E1S && relAttrib.Edge2Target == E1T || relAttrib.Edge1Target == E1T && relAttrib.Edge2Target == E1S) { isTabu = true; } } } break; case PermutationTypes.RelativeDirected: { int E1S = permutation.GetCircular(move.Index1 - 1); int E1T = permutation[move.Index1]; int E2S = permutation[move.Index2]; int E2T = permutation.GetCircular(move.Index2 + 1); InversionMoveRelativeAttribute relAttrib = (attrib as InversionMoveRelativeAttribute); if (relAttrib != null) { if (relAttrib.Edge1Source == E1S && relAttrib.Edge2Source == E1T || relAttrib.Edge1Source == E2S && relAttrib.Edge2Source == E2T // if previously added Edge1Target-Edge2Target is deleted || relAttrib.Edge1Target == E2S && relAttrib.Edge2Target == E2T || relAttrib.Edge1Target == E1S && relAttrib.Edge2Target == E1T) { isTabu = true; } } } break; case PermutationTypes.Absolute: { int i1 = move.Index1; int n1 = permutation[move.Index1]; int i2 = move.Index2; int n2 = permutation[move.Index2]; InversionMoveAbsoluteAttribute absAttrib = (attrib as InversionMoveAbsoluteAttribute); if (absAttrib != null) { if (absAttrib.Number1 == n1 || absAttrib.Number1 == n2 || absAttrib.Number2 == n2 || absAttrib.Number2 == n1) isTabu = true; } } break; default: { throw new InvalidOperationException(Name + ": Unknown permutation type."); } } } if (isTabu) break; } MoveTabuParameter.ActualValue = new BoolValue(isTabu); return base.Apply(); } } }