[6711] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2010 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 System;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Linq;
|
---|
| 25 | using System.Text;
|
---|
| 26 | using HeuristicLab.Core;
|
---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 28 | using HeuristicLab.Operators;
|
---|
| 29 | using HeuristicLab.Optimization;
|
---|
| 30 | using HeuristicLab.Problems.VehicleRouting.Variants;
|
---|
| 31 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
| 32 | using HeuristicLab.Parameters;
|
---|
| 33 | using HeuristicLab.Data;
|
---|
| 34 | using HeuristicLab.Common;
|
---|
| 35 |
|
---|
| 36 | namespace HeuristicLab.Problems.VehicleRouting {
|
---|
| 37 | /// <summary>
|
---|
| 38 | /// An operator for adaptive constraint relaxation.
|
---|
| 39 | /// </summary>
|
---|
| 40 | [Item("TimeWindowRelaxationVRPAnalyzer", "An operator for adaptively relaxing the time window constraints.")]
|
---|
| 41 | [StorableClass]
|
---|
| 42 | public class TimeWindowRelaxationVRPAnalyzer: SingleSuccessorOperator, IAnalyzer, ITimeWindowedOperator {
|
---|
| 43 | public ILookupParameter<IVRPProblemInstance> ProblemInstanceParameter {
|
---|
| 44 | get { return (ILookupParameter<IVRPProblemInstance>)Parameters["ProblemInstance"]; }
|
---|
| 45 | }
|
---|
| 46 | public ScopeTreeLookupParameter<IVRPEncoding> VRPToursParameter {
|
---|
| 47 | get { return (ScopeTreeLookupParameter<IVRPEncoding>)Parameters["VRPTours"]; }
|
---|
| 48 | }
|
---|
| 49 | public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
|
---|
| 50 | get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
|
---|
| 51 | }
|
---|
| 52 |
|
---|
| 53 | public ScopeTreeLookupParameter<DoubleValue> TardinessParameter {
|
---|
| 54 | get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Tardiness"]; }
|
---|
| 55 | }
|
---|
| 56 |
|
---|
| 57 | public IValueParameter<DoubleValue> SigmaParameter {
|
---|
| 58 | get { return (IValueParameter<DoubleValue>)Parameters["Sigma"]; }
|
---|
| 59 | }
|
---|
| 60 | public IValueParameter<DoubleValue> PhiParameter {
|
---|
| 61 | get { return (IValueParameter<DoubleValue>)Parameters["Phi"]; }
|
---|
| 62 | }
|
---|
| 63 | public IValueParameter<DoubleValue> MinPenaltyFactorParameter {
|
---|
| 64 | get { return (IValueParameter<DoubleValue>)Parameters["MinPenaltyFactor"]; }
|
---|
| 65 | }
|
---|
| 66 |
|
---|
| 67 | public ValueLookupParameter<ResultCollection> ResultsParameter {
|
---|
| 68 | get { return (ValueLookupParameter<ResultCollection>)Parameters["Results"]; }
|
---|
| 69 | }
|
---|
| 70 |
|
---|
[7175] | 71 | public bool EnabledByDefault {
|
---|
| 72 | get { return false; }
|
---|
| 73 | }
|
---|
| 74 |
|
---|
[6711] | 75 | [StorableConstructor]
|
---|
| 76 | private TimeWindowRelaxationVRPAnalyzer(bool deserializing) : base(deserializing) { }
|
---|
| 77 |
|
---|
| 78 | public TimeWindowRelaxationVRPAnalyzer()
|
---|
| 79 | : base() {
|
---|
| 80 | Parameters.Add(new LookupParameter<IVRPProblemInstance>("ProblemInstance", "The problem instance."));
|
---|
| 81 | Parameters.Add(new ScopeTreeLookupParameter<IVRPEncoding>("VRPTours", "The VRP tours which should be evaluated."));
|
---|
| 82 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the VRP solutions which should be analyzed."));
|
---|
| 83 |
|
---|
| 84 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Tardiness", "The tardiness of the VRP solutions which should be analyzed."));
|
---|
| 85 |
|
---|
| 86 | Parameters.Add(new ValueParameter<DoubleValue>("Sigma", "The sigma applied to the penalty factor.", new DoubleValue(0.04)));
|
---|
| 87 | Parameters.Add(new ValueParameter<DoubleValue>("Phi", "The phi applied to the penalty factor.", new DoubleValue(0.01)));
|
---|
| 88 | Parameters.Add(new ValueParameter<DoubleValue>("MinPenaltyFactor", "The minimum penalty factor.", new DoubleValue(0.01)));
|
---|
| 89 |
|
---|
| 90 | Parameters.Add(new ValueLookupParameter<ResultCollection>("Results", "The result collection where the best VRP solution should be stored."));
|
---|
| 91 | }
|
---|
| 92 |
|
---|
| 93 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 94 | return new TimeWindowRelaxationVRPAnalyzer(this, cloner);
|
---|
| 95 | }
|
---|
| 96 |
|
---|
| 97 | private TimeWindowRelaxationVRPAnalyzer(TimeWindowRelaxationVRPAnalyzer original, Cloner cloner)
|
---|
| 98 | : base(original, cloner) {
|
---|
| 99 | }
|
---|
| 100 |
|
---|
| 101 | public override IOperation Apply() {
|
---|
| 102 | ITimeWindowedProblemInstance vrptw = ProblemInstanceParameter.ActualValue as ITimeWindowedProblemInstance;
|
---|
| 103 | ResultCollection results = ResultsParameter.ActualValue;
|
---|
| 104 |
|
---|
| 105 | ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
|
---|
| 106 | ItemArray<DoubleValue> tardiness = TardinessParameter.ActualValue;
|
---|
| 107 |
|
---|
| 108 | double sigma = SigmaParameter.Value.Value;
|
---|
| 109 | double phi = PhiParameter.Value.Value;
|
---|
| 110 | double minPenalty = MinPenaltyFactorParameter.Value.Value;
|
---|
| 111 |
|
---|
| 112 | for (int j = 0; j < qualities.Length; j++) {
|
---|
| 113 | qualities[j].Value -= tardiness[j].Value * vrptw.TardinessPenalty.Value;
|
---|
| 114 | }
|
---|
| 115 |
|
---|
| 116 | int validCount = 0;
|
---|
| 117 | for (int j = 0; j < qualities.Length; j++) {
|
---|
| 118 | if (tardiness[j].Value == 0)
|
---|
| 119 | validCount++;
|
---|
| 120 | }
|
---|
| 121 |
|
---|
| 122 | double factor = 1.0 - ((double)validCount / (double)qualities.Length);
|
---|
| 123 |
|
---|
| 124 | double min = vrptw.TardinessPenalty.Value / (1 + sigma);
|
---|
| 125 | double max = vrptw.TardinessPenalty.Value * (1 + phi);
|
---|
| 126 |
|
---|
| 127 | vrptw.TardinessPenalty = new DoubleValue(min + (max - min) * factor);
|
---|
| 128 | if (vrptw.TardinessPenalty.Value < minPenalty)
|
---|
| 129 | vrptw.TardinessPenalty.Value = minPenalty;
|
---|
| 130 |
|
---|
| 131 | for (int j = 0; j < qualities.Length; j++) {
|
---|
| 132 | qualities[j].Value += tardiness[j].Value * vrptw.TardinessPenalty.Value;
|
---|
| 133 | }
|
---|
| 134 |
|
---|
| 135 | if (!results.ContainsKey("Current Tardiness Penalty")) {
|
---|
| 136 | results.Add(new Result("Current Tardiness Penalty", new DoubleValue(vrptw.TardinessPenalty.Value)));
|
---|
| 137 | } else {
|
---|
| 138 | (results["Current Tardiness Penalty"].Value as DoubleValue).Value = vrptw.TardinessPenalty.Value;
|
---|
| 139 | }
|
---|
| 140 |
|
---|
| 141 | return base.Apply();
|
---|
| 142 | }
|
---|
| 143 | }
|
---|
| 144 | }
|
---|