#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 HeuristicLab.Common; using HeuristicLab.Core; using HeuristicLab.Optimization.Operators; using HeuristicLab.Parameters; using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; using HeuristicLab.Problems.VehicleRouting.Interfaces; using System.Collections.Generic; using HeuristicLab.Data; namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin { [Item("PotvinPDRearrangeMoveTabuMaker", "Declares a given rearrange move as tabu.")] [StorableClass] public class PotvinPDRearrangeMoveTabuMaker : TabuMaker, IPotvinPDRearrangeMoveOperator, IPotvinOperator, IVRPMoveOperator { public ILookupParameter PDRearrangeMoveParameter { get { return (ILookupParameter)Parameters["PotvinPDRearrangeMove"]; } } public ILookupParameter VRPMoveParameter { get { return PDRearrangeMoveParameter; } } public ILookupParameter VRPToursParameter { get { return (ILookupParameter)Parameters["VRPTours"]; } } public ILookupParameter ProblemInstanceParameter { get { return (LookupParameter)Parameters["ProblemInstance"]; } } public ILookupParameter DistanceParameter { get { return (ILookupParameter)Parameters["Distance"]; } } public ILookupParameter OverloadParameter { get { return (ILookupParameter)Parameters["Overload"]; } } public ILookupParameter TardinessParameter { get { return (ILookupParameter)Parameters["Tardiness"]; } } [StorableConstructor] protected PotvinPDRearrangeMoveTabuMaker(bool deserializing) : base(deserializing) { } protected PotvinPDRearrangeMoveTabuMaker(PotvinPDRearrangeMoveTabuMaker original, Cloner cloner) : base(original, cloner) { } public PotvinPDRearrangeMoveTabuMaker() : base() { Parameters.Add(new LookupParameter("PotvinPDRearrangeMove", "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("Distance", "The distance of the individual")); Parameters.Add(new LookupParameter("Overload", "The overload of the individual")); Parameters.Add(new LookupParameter("Tardiness", "The tardiness of the individual")); } public override IDeepCloneable Clone(Cloner cloner) { return new PotvinPDRearrangeMoveTabuMaker(this, cloner); } protected override IItem GetTabuAttribute(bool maximization, double quality, double moveQuality) { PotvinPDRearrangeMove move = PDRearrangeMoveParameter.ActualValue; double baseQuality = moveQuality; if (quality < moveQuality) baseQuality = quality; // we make an uphill move, the lower bound is the solution quality double distance = 0; if (DistanceParameter.ActualValue != null) distance = DistanceParameter.ActualValue.Value; double overload = 0; if (OverloadParameter.ActualValue != null) overload = OverloadParameter.ActualValue.Value; double tardiness = 0; if (TardinessParameter.ActualValue != null) tardiness = TardinessParameter.ActualValue.Value; return new PotvinPDRelocateMoveAttribute(baseQuality, move.Tour, move.City, distance, overload, tardiness); } } }