source: branches/PersistenceOverhaul/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/ConstraintRelaxation/TimeWindowed/TimeWindowRelaxationVRPAnalyzer.cs @ 13368

Last change on this file since 13368 was 13368, checked in by ascheibe, 4 years ago

#2520 added guids to storable classes

File size: 7.0 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 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
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Operators;
26using HeuristicLab.Optimization;
27using HeuristicLab.Parameters;
28using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
29using HeuristicLab.Problems.VehicleRouting.Interfaces;
30using HeuristicLab.Problems.VehicleRouting.Variants;
31
32namespace HeuristicLab.Problems.VehicleRouting {
33  /// <summary>
34  /// An operator for adaptive constraint relaxation.
35  /// </summary>
36  [Item("TimeWindowRelaxationVRPAnalyzer", "An operator for adaptively relaxing the time window constraints.")]
37  [StorableClass("36169161-08EC-4184-A5F9-E62732CAD5FF")]
38  public class TimeWindowRelaxationVRPAnalyzer : SingleSuccessorOperator, IAnalyzer, ITimeWindowedOperator, ISingleObjectiveOperator {
39    public ILookupParameter<IVRPProblemInstance> ProblemInstanceParameter {
40      get { return (ILookupParameter<IVRPProblemInstance>)Parameters["ProblemInstance"]; }
41    }
42    public ScopeTreeLookupParameter<IVRPEncoding> VRPToursParameter {
43      get { return (ScopeTreeLookupParameter<IVRPEncoding>)Parameters["VRPTours"]; }
44    }
45    public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
46      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
47    }
48
49    public ScopeTreeLookupParameter<DoubleValue> TardinessParameter {
50      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Tardiness"]; }
51    }
52
53    public IValueParameter<DoubleValue> SigmaParameter {
54      get { return (IValueParameter<DoubleValue>)Parameters["Sigma"]; }
55    }
56    public IValueParameter<DoubleValue> PhiParameter {
57      get { return (IValueParameter<DoubleValue>)Parameters["Phi"]; }
58    }
59    public IValueParameter<DoubleValue> MinPenaltyFactorParameter {
60      get { return (IValueParameter<DoubleValue>)Parameters["MinPenaltyFactor"]; }
61    }
62    public IValueParameter<DoubleValue> MaxPenaltyFactorParameter {
63      get { return (IValueParameter<DoubleValue>)Parameters["MaxPenaltyFactor"]; }
64    }
65
66    public ValueLookupParameter<ResultCollection> ResultsParameter {
67      get { return (ValueLookupParameter<ResultCollection>)Parameters["Results"]; }
68    }
69
70    public bool EnabledByDefault {
71      get { return false; }
72    }
73
74    [StorableConstructor]
75    protected TimeWindowRelaxationVRPAnalyzer(bool deserializing) : base(deserializing) { }
76
77    public TimeWindowRelaxationVRPAnalyzer()
78      : base() {
79      Parameters.Add(new LookupParameter<IVRPProblemInstance>("ProblemInstance", "The problem instance."));
80      Parameters.Add(new ScopeTreeLookupParameter<IVRPEncoding>("VRPTours", "The VRP tours which should be evaluated."));
81      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the VRP solutions which should be analyzed."));
82
83      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Tardiness", "The tardiness of the VRP solutions which should be analyzed."));
84
85      Parameters.Add(new ValueParameter<DoubleValue>("Sigma", "The sigma applied to the penalty factor.", new DoubleValue(0.5)));
86      Parameters.Add(new ValueParameter<DoubleValue>("Phi", "The phi applied to the penalty factor.", new DoubleValue(0.5)));
87      Parameters.Add(new ValueParameter<DoubleValue>("MinPenaltyFactor", "The minimum penalty factor.", new DoubleValue(0.01)));
88      Parameters.Add(new ValueParameter<DoubleValue>("MaxPenaltyFactor", "The maximum penalty factor.", new DoubleValue(100000)));
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    protected TimeWindowRelaxationVRPAnalyzer(TimeWindowRelaxationVRPAnalyzer original, Cloner cloner)
98      : base(original, cloner) {
99    }
100
101    [StorableHook(HookType.AfterDeserialization)]
102    private void AfterDeserialization() {
103      // BackwardsCompatibility3.3
104      #region Backwards compatible code, remove with 3.4
105      if (!Parameters.ContainsKey("MaxPenaltyFactor")) {
106        Parameters.Add(new ValueParameter<DoubleValue>("MaxPenaltyFactor", "The maximum penalty factor.", new DoubleValue(100000)));
107      }
108      #endregion
109    }
110
111    public override IOperation Apply() {
112      ITimeWindowedProblemInstance vrptw = ProblemInstanceParameter.ActualValue as ITimeWindowedProblemInstance;
113      ResultCollection results = ResultsParameter.ActualValue;
114
115      ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
116      ItemArray<DoubleValue> tardiness = TardinessParameter.ActualValue;
117
118      double sigma = SigmaParameter.Value.Value;
119      double phi = PhiParameter.Value.Value;
120      double minPenalty = MinPenaltyFactorParameter.Value.Value;
121      double maxPenalty = MaxPenaltyFactorParameter.Value.Value;
122
123      for (int j = 0; j < qualities.Length; j++) {
124        qualities[j].Value -= tardiness[j].Value * vrptw.TardinessPenalty.Value;
125      }
126
127      int validCount = 0;
128      for (int j = 0; j < qualities.Length; j++) {
129        if (tardiness[j].Value == 0)
130          validCount++;
131      }
132
133      double factor = 1.0 - ((double)validCount / (double)qualities.Length);
134
135      double min = vrptw.TardinessPenalty.Value / (1 + sigma);
136      double max = vrptw.TardinessPenalty.Value * (1 + phi);
137
138      vrptw.CurrentTardinessPenalty = new DoubleValue(min + (max - min) * factor);
139      if (vrptw.CurrentTardinessPenalty.Value < minPenalty)
140        vrptw.CurrentTardinessPenalty.Value = minPenalty;
141      if (vrptw.CurrentTardinessPenalty.Value > maxPenalty)
142        vrptw.CurrentTardinessPenalty.Value = maxPenalty;
143
144      for (int j = 0; j < qualities.Length; j++) {
145        qualities[j].Value += tardiness[j].Value * vrptw.CurrentTardinessPenalty.Value;
146      }
147
148      if (!results.ContainsKey("Current Tardiness Penalty")) {
149        results.Add(new Result("Current Tardiness Penalty", new DoubleValue(vrptw.CurrentTardinessPenalty.Value)));
150      } else {
151        (results["Current Tardiness Penalty"].Value as DoubleValue).Value = vrptw.CurrentTardinessPenalty.Value;
152      }
153
154      return base.Apply();
155    }
156  }
157}
Note: See TracBrowser for help on using the repository browser.