Free cookie consent management tool by TermsFeed Policy Generator

source: branches/VRP/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestAverageWorstTours/TimeWindowed/BestAverageWorstTimeWindowedVRPToursCalculator.cs @ 4374

Last change on this file since 4374 was 4374, checked in by svonolfe, 14 years ago

Added analyzers and views (#1177)

File size: 6.0 KB
Line 
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
22using HeuristicLab.Core;
23using HeuristicLab.Data;
24using HeuristicLab.Operators;
25using HeuristicLab.Parameters;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Problems.VehicleRouting {
29  [Item("BestAverageWorstTimeWindowedVRPToursCalculator", "An operator which calculates the current best, average and worst properties of VRP tours in the scope tree.")]
30  [StorableClass]
31  public sealed class BestAverageWorstTimeWindowedVRPToursCalculator : SingleSuccessorOperator {
32    public ScopeTreeLookupParameter<DoubleValue> TardinessParameter {
33      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Tardiness"]; }
34    }
35    public ValueLookupParameter<DoubleValue> BestTardinessParameter {
36      get { return (ValueLookupParameter<DoubleValue>)Parameters["BestTardiness"]; }
37    }
38    public ValueLookupParameter<DoubleValue> AverageTardinessParameter {
39      get { return (ValueLookupParameter<DoubleValue>)Parameters["AverageTardiness"]; }
40    }
41    public ValueLookupParameter<DoubleValue> WorstTardinessParameter {
42      get { return (ValueLookupParameter<DoubleValue>)Parameters["WorstTardiness"]; }
43    }
44
45    public ScopeTreeLookupParameter<DoubleValue> TravelTimeParameter {
46      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["TravelTime"]; }
47    }
48    public ValueLookupParameter<DoubleValue> BestTravelTimeParameter {
49      get { return (ValueLookupParameter<DoubleValue>)Parameters["BestTravelTime"]; }
50    }
51    public ValueLookupParameter<DoubleValue> AverageTravelTimeParameter {
52      get { return (ValueLookupParameter<DoubleValue>)Parameters["AverageTravelTime"]; }
53    }
54    public ValueLookupParameter<DoubleValue> WorstTravelTimeParameter {
55      get { return (ValueLookupParameter<DoubleValue>)Parameters["WorstTravelTime"]; }
56    }
57
58    public BestAverageWorstTimeWindowedVRPToursCalculator()
59      : base() {
60      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Tardiness", "The tardiness of the VRP solutions which should be analyzed."));
61      Parameters.Add(new ValueLookupParameter<DoubleValue>("BestTardiness", "The best tardiness value."));
62      Parameters.Add(new ValueLookupParameter<DoubleValue>("AverageTardiness", "The average tardiness value of all solutions."));
63      Parameters.Add(new ValueLookupParameter<DoubleValue>("WorstTardiness", "The worst tardiness value of all solutions."));
64
65      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("TravelTime", "The travel times of the VRP solutions which should be analyzed."));
66      Parameters.Add(new ValueLookupParameter<DoubleValue>("BestTravelTime", "The best travel time value."));
67      Parameters.Add(new ValueLookupParameter<DoubleValue>("AverageTravelTime", "The average travel time value of all solutions."));
68      Parameters.Add(new ValueLookupParameter<DoubleValue>("WorstTravelTime", "The worst travel time value of all solutions."));
69    }
70
71    private void UpdateTardiness() {
72      ItemArray<DoubleValue> tardiness = TardinessParameter.ActualValue;
73      if (tardiness.Length > 0) {
74        double min = double.MaxValue, max = double.MinValue, sum = 0.0;
75        for (int i = 0; i < tardiness.Length; i++) {
76          if (tardiness[i].Value < min) min = tardiness[i].Value;
77          if (tardiness[i].Value > max) max = tardiness[i].Value;
78          sum += tardiness[i].Value;
79        }
80
81        DoubleValue best = BestTardinessParameter.ActualValue;
82        if (best == null) BestTardinessParameter.ActualValue = new DoubleValue(min);
83        else best.Value = min;
84        DoubleValue average = AverageTardinessParameter.ActualValue;
85        if (average == null) AverageTardinessParameter.ActualValue = new DoubleValue(sum / tardiness.Length);
86        else average.Value = sum / tardiness.Length;
87        DoubleValue worst = WorstTardinessParameter.ActualValue;
88        if (worst == null) WorstTardinessParameter.ActualValue = new DoubleValue(max);
89        else worst.Value = max;
90      }
91    }
92
93    private void UpdateTravelTimes() {
94      ItemArray<DoubleValue> travelTimes = TravelTimeParameter.ActualValue;
95      if (travelTimes.Length > 0) {
96        double min = double.MaxValue, max = double.MinValue, sum = 0.0;
97        for (int i = 0; i < travelTimes.Length; i++) {
98          if (travelTimes[i].Value < min) min = travelTimes[i].Value;
99          if (travelTimes[i].Value > max) max = travelTimes[i].Value;
100          sum += travelTimes[i].Value;
101        }
102
103        DoubleValue best = BestTravelTimeParameter.ActualValue;
104        if (best == null) BestTravelTimeParameter.ActualValue = new DoubleValue(min);
105        else best.Value = min;
106        DoubleValue average = AverageTravelTimeParameter.ActualValue;
107        if (average == null) AverageTravelTimeParameter.ActualValue = new DoubleValue(sum / travelTimes.Length);
108        else average.Value = sum / travelTimes.Length;
109        DoubleValue worst = WorstTravelTimeParameter.ActualValue;
110        if (worst == null) WorstTravelTimeParameter.ActualValue = new DoubleValue(max);
111        else worst.Value = max;
112      }
113    }
114
115    public override IOperation Apply() {
116      UpdateTardiness();
117      UpdateTravelTimes();
118
119      return base.Apply();
120    }
121  }
122}
Note: See TracBrowser for help on using the repository browser.