| 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| 3 | * Copyright (C) 2002-2018 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
|---|
| 4 | *
|
|---|
| 5 | * This file is part of HeuristicLab.
|
|---|
| 6 | *
|
|---|
| 7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
|---|
| 8 | * it under the terms of the GNU General Public License as published by
|
|---|
| 9 | * the Free Software Foundation, either version 3 of the License, or
|
|---|
| 10 | * (at your option) any later version.
|
|---|
| 11 | *
|
|---|
| 12 | * HeuristicLab is distributed in the hope that it will be useful,
|
|---|
| 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|---|
| 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|---|
| 15 | * GNU General Public License for more details.
|
|---|
| 16 | *
|
|---|
| 17 | * You should have received a copy of the GNU General Public License
|
|---|
| 18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
|---|
| 19 | */
|
|---|
| 20 | #endregion
|
|---|
| 21 |
|
|---|
| 22 | using HeuristicLab.Common;
|
|---|
| 23 | using HeuristicLab.Core;
|
|---|
| 24 | using HeuristicLab.Optimization.Operators;
|
|---|
| 25 | using HeuristicLab.Parameters;
|
|---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 27 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
|---|
| 28 |
|
|---|
| 29 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
|
|---|
| 30 | [Item("PotvinCustomerRelocationMoveTabuMaker", "Declares a given customer relocation move as tabu.")]
|
|---|
| 31 | [StorableClass]
|
|---|
| 32 | public class PotvinCustomerRelocationMoveTabuMaker : TabuMaker, IPotvinCustomerRelocationMoveOperator, IPotvinOperator {
|
|---|
| 33 | public ILookupParameter<PotvinCustomerRelocationMove> CustomerRelocationMoveParameter {
|
|---|
| 34 | get { return (ILookupParameter<PotvinCustomerRelocationMove>)Parameters["PotvinCustomerRelocationMove"]; }
|
|---|
| 35 | }
|
|---|
| 36 | public ILookupParameter VRPMoveParameter {
|
|---|
| 37 | get { return CustomerRelocationMoveParameter; }
|
|---|
| 38 | }
|
|---|
| 39 | public ILookupParameter<IVRPEncoding> VRPToursParameter {
|
|---|
| 40 | get { return (ILookupParameter<IVRPEncoding>)Parameters["VRPTours"]; }
|
|---|
| 41 | }
|
|---|
| 42 | public ILookupParameter<IVRPProblemInstance> ProblemInstanceParameter {
|
|---|
| 43 | get { return (LookupParameter<IVRPProblemInstance>)Parameters["ProblemInstance"]; }
|
|---|
| 44 | }
|
|---|
| 45 |
|
|---|
| 46 | [StorableConstructor]
|
|---|
| 47 | protected PotvinCustomerRelocationMoveTabuMaker(bool deserializing) : base(deserializing) { }
|
|---|
| 48 | protected PotvinCustomerRelocationMoveTabuMaker(PotvinCustomerRelocationMoveTabuMaker original, Cloner cloner) : base(original, cloner) { }
|
|---|
| 49 | public PotvinCustomerRelocationMoveTabuMaker()
|
|---|
| 50 | : base() {
|
|---|
| 51 | Parameters.Add(new LookupParameter<PotvinCustomerRelocationMove>("PotvinCustomerRelocationMove", "The moves that should be made."));
|
|---|
| 52 | Parameters.Add(new LookupParameter<IVRPEncoding>("VRPTours", "The VRP tours considered in the move."));
|
|---|
| 53 | Parameters.Add(new LookupParameter<IVRPProblemInstance>("ProblemInstance", "The VRP problem instance"));
|
|---|
| 54 | }
|
|---|
| 55 |
|
|---|
| 56 | public override IDeepCloneable Clone(Cloner cloner) {
|
|---|
| 57 | return new PotvinCustomerRelocationMoveTabuMaker(this, cloner);
|
|---|
| 58 | }
|
|---|
| 59 |
|
|---|
| 60 | protected override IItem GetTabuAttribute(bool maximization, double quality, double moveQuality) {
|
|---|
| 61 | PotvinCustomerRelocationMove move = CustomerRelocationMoveParameter.ActualValue;
|
|---|
| 62 | double baseQuality = moveQuality;
|
|---|
| 63 | //if (quality < moveQuality) baseQuality = quality; // we make an uphill move, the lower bound is the solution quality
|
|---|
| 64 | return new PotvinCustomerRelocationMoveAttribute(baseQuality, move.OldTour, move.City);
|
|---|
| 65 | }
|
|---|
| 66 | }
|
|---|
| 67 | }
|
|---|
