Free cookie consent management tool by TermsFeed Policy Generator

source: branches/VRP/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestSolution/BestVRPSolutionAnalyzer.cs @ 6607

Last change on this file since 6607 was 6607, checked in by svonolfe, 13 years ago

Merged changes from trunk (#1561) into branch (#1177)

File size: 9.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 System.Linq;
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;
31using HeuristicLab.Common;
32
33namespace HeuristicLab.Problems.VehicleRouting {
34  /// <summary>
35  /// An operator for analyzing the best solution of Vehicle Routing Problems.
36  /// </summary>
37  [Item("BestVRPSolutionAnalyzer", "An operator for analyzing the best solution of Vehicle Routing Problems.")]
38  [StorableClass]
39  public sealed class BestVRPSolutionAnalyzer : SingleSuccessorOperator, IAnalyzer, IGeneralVRPOperator {
40    public ILookupParameter<IVRPProblemInstance> ProblemInstanceParameter {
41      get { return (ILookupParameter<IVRPProblemInstance>)Parameters["ProblemInstance"]; }
42    }
43    public ScopeTreeLookupParameter<IVRPEncoding> VRPToursParameter {
44      get { return (ScopeTreeLookupParameter<IVRPEncoding>)Parameters["VRPTours"]; }
45    }
46
47    public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
48      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
49    }
50    public ScopeTreeLookupParameter<DoubleValue> DistanceParameter {
51      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Distance"]; }
52    }
53    public ScopeTreeLookupParameter<DoubleValue> VehiclesUtilizedParameter {
54      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["VehiclesUtilized"]; }
55    }
56
57    public LookupParameter<VRPSolution> BestSolutionParameter {
58      get { return (LookupParameter<VRPSolution>)Parameters["BestSolution"]; }
59    }
60    public LookupParameter<VRPSolution> BestValidSolutionParameter {
61      get { return (LookupParameter<VRPSolution>)Parameters["BestValidSolution"]; }
62    }
63    public ValueLookupParameter<ResultCollection> ResultsParameter {
64      get { return (ValueLookupParameter<ResultCollection>)Parameters["Results"]; }
65    }
66
67    public LookupParameter<DoubleValue> BestKnownQualityParameter {
68      get { return (LookupParameter<DoubleValue>)Parameters["BestKnownQuality"]; }
69    }
70    public LookupParameter<VRPSolution> BestKnownSolutionParameter {
71      get { return (LookupParameter<VRPSolution>)Parameters["BestKnownSolution"]; }
72    }
73
74    [StorableConstructor]
75    private BestVRPSolutionAnalyzer(bool deserializing) : base(deserializing) { }
76
77    public BestVRPSolutionAnalyzer()
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
82        Parameters.Add(new LookupParameter<DoubleValue>("BestKnownQuality", "The quality of the best known solution of this VRP instance."));
83        Parameters.Add(new LookupParameter<VRPSolution>("BestKnownSolution", "The best known solution of this VRP instance."));
84
85        Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the VRP solutions which should be analyzed."));
86        Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Distance", "The distances of the VRP solutions which should be analyzed."));
87        Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("VehiclesUtilized", "The utilized vehicles of the VRP solutions which should be analyzed."));
88
89        Parameters.Add(new LookupParameter<VRPSolution>("BestSolution", "The best VRP solution."));
90        Parameters.Add(new LookupParameter<VRPSolution>("BestValidSolution", "The best valid VRP solution."));
91        Parameters.Add(new ValueLookupParameter<ResultCollection>("Results", "The result collection where the best VRP solution should be stored."));
92    }
93
94    public override IDeepCloneable Clone(Cloner cloner) {
95      return new BestVRPSolutionAnalyzer(this, cloner);
96    }
97
98    private BestVRPSolutionAnalyzer(BestVRPSolutionAnalyzer original, Cloner cloner)
99      : base(original, cloner) {
100    }
101
102    [StorableHook(HookType.AfterDeserialization)]
103    private void AfterDeserializationHook() {
104      #region Backwards Compatibility
105      if (!Parameters.ContainsKey("BestKnownQuality")) {
106        Parameters.Add(new LookupParameter<DoubleValue>("BestKnownQuality", "The quality of the best known solution of this VRP instance."));
107      }
108      if (!Parameters.ContainsKey("BestKnownSolution")) {
109        Parameters.Add(new LookupParameter<VRPSolution>("BestKnownSolution", "The best known solution of this VRP instance."));
110      }
111      #endregion
112    }
113
114    public override IOperation Apply() {
115      IVRPProblemInstance problemInstance = ProblemInstanceParameter.ActualValue;
116      ItemArray<IVRPEncoding> solutions = VRPToursParameter.ActualValue;
117      ResultCollection results = ResultsParameter.ActualValue;
118
119      ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
120      ItemArray<DoubleValue> distances = DistanceParameter.ActualValue;
121      ItemArray<DoubleValue> vehiclesUtilizations = VehiclesUtilizedParameter.ActualValue;
122
123      int i = qualities.Select((x, index) => new { index, x.Value }).OrderBy(x => x.Value).First().index;
124
125      DoubleValue bestKnownQuality = BestKnownQualityParameter.ActualValue;
126
127      IVRPEncoding best = solutions[i].Clone() as IVRPEncoding;
128      VRPSolution solution = BestSolutionParameter.ActualValue;
129      if (solution == null) {
130        solution = new VRPSolution(problemInstance, best.Clone() as IVRPEncoding, new DoubleValue(qualities[i].Value));
131        BestSolutionParameter.ActualValue = solution;
132        results.Add(new Result("Best VRP Solution", solution));
133
134        results.Add(new Result("Best VRP Solution Distance", new DoubleValue(distances[i].Value)));
135        results.Add(new Result("Best VRP Solution VehicleUtilization", new DoubleValue(vehiclesUtilizations[i].Value)));
136      } else {
137        if (qualities[i].Value <= solution.Quality.Value) {
138          solution.ProblemInstance = problemInstance;
139          solution.Solution = best.Clone() as IVRPEncoding;
140          solution.Quality.Value = qualities[i].Value;
141          (results["Best VRP Solution Distance"].Value as DoubleValue).Value = distances[i].Value;
142          (results["Best VRP Solution VehicleUtilization"].Value as DoubleValue).Value = vehiclesUtilizations[i].Value;
143        }
144      }
145
146      VRPSolution validSolution = BestValidSolutionParameter.ActualValue;
147      if (validSolution == null) {
148        if (ProblemInstanceParameter.ActualValue.Feasible(best)) {
149          validSolution = new VRPSolution(problemInstance, best.Clone() as IVRPEncoding, new DoubleValue(qualities[i].Value));
150          BestValidSolutionParameter.ActualValue = validSolution;
151          if (results.ContainsKey("Best valid VRP Solution"))
152            results["Best valid VRP Solution"].Value = validSolution;
153          else
154            results.Add(new Result("Best valid VRP Solution", validSolution));
155
156          results.Add(new Result("Best valid VRP Solution Distance", new DoubleValue(distances[i].Value)));
157          results.Add(new Result("Best valid VRP Solution VehicleUtilization", new DoubleValue(vehiclesUtilizations[i].Value)));
158        }
159      } else {
160        if (qualities[i].Value <= validSolution.Quality.Value) {
161          if (ProblemInstanceParameter.ActualValue.Feasible(best)) {
162            validSolution.ProblemInstance = problemInstance;
163            validSolution.Solution = best.Clone() as IVRPEncoding;
164            validSolution.Quality.Value = qualities[i].Value;
165            (results["Best valid VRP Solution Distance"].Value as DoubleValue).Value = distances[i].Value;
166            (results["Best valid VRP Solution VehicleUtilization"].Value as DoubleValue).Value = vehiclesUtilizations[i].Value;
167          }
168        }
169      }
170
171      if (bestKnownQuality == null ||
172          qualities[i].Value < bestKnownQuality.Value) {
173        BestKnownQualityParameter.ActualValue = new DoubleValue(qualities[i].Value);
174        BestKnownSolutionParameter.ActualValue = (VRPSolution)solution.Clone();
175      }
176
177      return base.Apply();
178    }
179  }
180}
Note: See TracBrowser for help on using the repository browser.