#region License Information /* HeuristicLab * Copyright (C) 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.Data; using HeuristicLab.Operators; using HeuristicLab.Optimization; using HeuristicLab.Parameters; using HEAL.Attic; using HeuristicLab.Problems.VehicleRouting.Interfaces; using HeuristicLab.Problems.VehicleRouting.Variants; namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin { [Item("PotvinPDShiftTabuCriterion", @"Checks if a certain shift move is tabu.")] [StorableType("1A782EF0-0FC4-4C97-BEB7-5A6855785E5A")] public class PotvinPDShiftTabuCriterion : SingleSuccessorOperator, IPotvinPDShiftMoveOperator, ITabuChecker, IPotvinOperator, IVRPMoveOperator { public override bool CanChangeName { get { return false; } } public ILookupParameter PDShiftMoveParameter { get { return (ILookupParameter)Parameters["PotvinPDShiftMove"]; } } public ILookupParameter VRPMoveParameter { get { return PDShiftMoveParameter; } } public ILookupParameter VRPToursParameter { get { return (ILookupParameter)Parameters["VRPTours"]; } } public ILookupParameter ProblemInstanceParameter { get { return (LookupParameter)Parameters["ProblemInstance"]; } } 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 ILookupParameter MoveDistanceParameter { get { return (ILookupParameter)Parameters["MoveDistance"]; } } public ILookupParameter MoveOverloadParameter { get { return (ILookupParameter)Parameters["MoveOverload"]; } } public ILookupParameter MoveTardinessParameter { get { return (ILookupParameter)Parameters["MoveTardiness"]; } } public BoolValue UseAspirationCriterion { get { return UseAspirationCriterionParameter.Value; } set { UseAspirationCriterionParameter.Value = value; } } [StorableConstructor] protected PotvinPDShiftTabuCriterion(StorableConstructorFlag _) : base(_) { } protected PotvinPDShiftTabuCriterion(PotvinPDShiftTabuCriterion original, Cloner cloner) : base(original, cloner) { } public PotvinPDShiftTabuCriterion() : base() { Parameters.Add(new LookupParameter("PotvinPDShiftMove", "The moves that should be made.")); Parameters.Add(new LookupParameter("VRPTours", "The VRP tours considered in the move.")); Parameters.Add(new LookupParameter("ProblemInstance", "The VRP problem instance")); Parameters.Add(new LookupParameter("MoveTabu", "The variable to store if a move was tabu.")); 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.")); Parameters.Add(new LookupParameter("MoveDistance", "The distance of the move")); Parameters.Add(new LookupParameter("MoveOverload", "The overload of the move")); Parameters.Add(new LookupParameter("MoveTardiness", "The tardiness of the move")); } public override IDeepCloneable Clone(Cloner cloner) { return new PotvinPDShiftTabuCriterion(this, cloner); } public override IOperation Apply() { ItemList tabuList = TabuListParameter.ActualValue; double moveQuality = MoveQualityParameter.ActualValue.Value; bool useAspiration = UseAspirationCriterion.Value; bool isTabu = false; PotvinPDShiftMove move = PDShiftMoveParameter.ActualValue; foreach (IItem tabuMove in tabuList) { PotvinPDRelocateMoveAttribute attribute = tabuMove as PotvinPDRelocateMoveAttribute; if (attribute != null) { double distance = 0; if (MoveDistanceParameter.ActualValue != null) distance = MoveDistanceParameter.ActualValue.Value; double overload = 0; if (MoveOverloadParameter.ActualValue != null) overload = MoveOverloadParameter.ActualValue.Value; double tardiness = 0; if (MoveTardinessParameter.ActualValue != null) tardiness = MoveTardinessParameter.ActualValue.Value; IVRPProblemInstance instance = ProblemInstanceParameter.ActualValue; double quality = attribute.Distance * instance.DistanceFactor.Value; IHomogenousCapacitatedProblemInstance cvrp = instance as IHomogenousCapacitatedProblemInstance; if (cvrp != null) quality += attribute.Overload * cvrp.OverloadPenalty.Value; ITimeWindowedProblemInstance vrptw = instance as ITimeWindowedProblemInstance; if (vrptw != null) quality += attribute.Tardiness * vrptw.TardinessPenalty.Value; IPickupAndDeliveryProblemInstance pdp = instance as IPickupAndDeliveryProblemInstance; if (pdp != null) quality += attribute.PickupViolations * pdp.PickupViolationPenalty.Value; if (!useAspiration || moveQuality >= quality) { if (attribute.City == move.City && attribute.Tour == move.Tour) { isTabu = true; break; } if (attribute.Distance == distance && attribute.Overload == overload && attribute.Tardiness == tardiness) { isTabu = true; break; } } } } MoveTabuParameter.ActualValue = new BoolValue(isTabu); return base.Apply(); } } }