#region License Information
/* HeuristicLab
* Copyright (C) 2002-2018 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.Optimization.Operators;
using HeuristicLab.Parameters;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
using HeuristicLab.Problems.VehicleRouting.Interfaces;
namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
[Item("PotvinPDShiftMoveTabuMaker", "Declares a given shift move as tabu.")]
[StorableClass]
public class PotvinPDShiftMoveTabuMaker : TabuMaker, IPotvinPDShiftMoveOperator, IPotvinOperator, IVRPMoveOperator {
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 DistanceParameter {
get { return (ILookupParameter)Parameters["Distance"]; }
}
public ILookupParameter OverloadParameter {
get { return (ILookupParameter)Parameters["Overload"]; }
}
public ILookupParameter TardinessParameter {
get { return (ILookupParameter)Parameters["Tardiness"]; }
}
public ILookupParameter PickupViolationsParameter {
get { return (ILookupParameter)Parameters["PickupViolations"]; }
}
[StorableConstructor]
protected PotvinPDShiftMoveTabuMaker(bool deserializing) : base(deserializing) { }
protected PotvinPDShiftMoveTabuMaker(PotvinPDShiftMoveTabuMaker original, Cloner cloner) : base(original, cloner) { }
public PotvinPDShiftMoveTabuMaker()
: 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("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"));
Parameters.Add(new LookupParameter("PickupViolations", "The number of pickup violations."));
}
public override IDeepCloneable Clone(Cloner cloner) {
return new PotvinPDShiftMoveTabuMaker(this, cloner);
}
protected override IItem GetTabuAttribute(bool maximization, double quality, double moveQuality) {
PotvinPDShiftMove move = PDShiftMoveParameter.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;
int pickupViolations = 0;
if (PickupViolationsParameter.ActualValue != null)
pickupViolations = PickupViolationsParameter.ActualValue.Value;
return new PotvinPDRelocateMoveAttribute(baseQuality, move.OldTour, move.City, distance, overload, tardiness, pickupViolations);
}
}
}