[4374] | 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.Linq;
|
---|
| 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Operators;
|
---|
| 26 | using HeuristicLab.Optimization;
|
---|
| 27 | using HeuristicLab.Parameters;
|
---|
| 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 29 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
| 30 | using HeuristicLab.Problems.VehicleRouting.Variants;
|
---|
[4752] | 31 | using HeuristicLab.Common;
|
---|
[4374] | 32 |
|
---|
| 33 | namespace 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 | }
|
---|
[5202] | 60 | public LookupParameter<VRPSolution> BestValidSolutionParameter {
|
---|
| 61 | get { return (LookupParameter<VRPSolution>)Parameters["BestValidSolution"]; }
|
---|
| 62 | }
|
---|
[4374] | 63 | public ValueLookupParameter<ResultCollection> ResultsParameter {
|
---|
| 64 | get { return (ValueLookupParameter<ResultCollection>)Parameters["Results"]; }
|
---|
| 65 | }
|
---|
| 66 |
|
---|
[4860] | 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 |
|
---|
[7175] | 74 | public bool EnabledByDefault {
|
---|
| 75 | get { return true; }
|
---|
| 76 | }
|
---|
| 77 |
|
---|
[4374] | 78 | [StorableConstructor]
|
---|
| 79 | private BestVRPSolutionAnalyzer(bool deserializing) : base(deserializing) { }
|
---|
| 80 |
|
---|
| 81 | public BestVRPSolutionAnalyzer()
|
---|
| 82 | : base() {
|
---|
| 83 | Parameters.Add(new LookupParameter<IVRPProblemInstance>("ProblemInstance", "The problem instance."));
|
---|
| 84 | Parameters.Add(new ScopeTreeLookupParameter<IVRPEncoding>("VRPTours", "The VRP tours which should be evaluated."));
|
---|
| 85 |
|
---|
[4860] | 86 | Parameters.Add(new LookupParameter<DoubleValue>("BestKnownQuality", "The quality of the best known solution of this VRP instance."));
|
---|
| 87 | Parameters.Add(new LookupParameter<VRPSolution>("BestKnownSolution", "The best known solution of this VRP instance."));
|
---|
| 88 |
|
---|
[4374] | 89 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the VRP solutions which should be analyzed."));
|
---|
| 90 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Distance", "The distances of the VRP solutions which should be analyzed."));
|
---|
| 91 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("VehiclesUtilized", "The utilized vehicles of the VRP solutions which should be analyzed."));
|
---|
| 92 |
|
---|
[5202] | 93 | Parameters.Add(new LookupParameter<VRPSolution>("BestSolution", "The best VRP solution."));
|
---|
| 94 | Parameters.Add(new LookupParameter<VRPSolution>("BestValidSolution", "The best valid VRP solution."));
|
---|
[4374] | 95 | Parameters.Add(new ValueLookupParameter<ResultCollection>("Results", "The result collection where the best VRP solution should be stored."));
|
---|
| 96 | }
|
---|
| 97 |
|
---|
[4752] | 98 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 99 | return new BestVRPSolutionAnalyzer(this, cloner);
|
---|
| 100 | }
|
---|
| 101 |
|
---|
| 102 | private BestVRPSolutionAnalyzer(BestVRPSolutionAnalyzer original, Cloner cloner)
|
---|
| 103 | : base(original, cloner) {
|
---|
| 104 | }
|
---|
| 105 |
|
---|
[4860] | 106 | [StorableHook(HookType.AfterDeserialization)]
|
---|
| 107 | private void AfterDeserializationHook() {
|
---|
| 108 | #region Backwards Compatibility
|
---|
| 109 | if (!Parameters.ContainsKey("BestKnownQuality")) {
|
---|
| 110 | Parameters.Add(new LookupParameter<DoubleValue>("BestKnownQuality", "The quality of the best known solution of this VRP instance."));
|
---|
| 111 | }
|
---|
| 112 | if (!Parameters.ContainsKey("BestKnownSolution")) {
|
---|
| 113 | Parameters.Add(new LookupParameter<VRPSolution>("BestKnownSolution", "The best known solution of this VRP instance."));
|
---|
| 114 | }
|
---|
| 115 | #endregion
|
---|
| 116 | }
|
---|
| 117 |
|
---|
[4374] | 118 | public override IOperation Apply() {
|
---|
| 119 | IVRPProblemInstance problemInstance = ProblemInstanceParameter.ActualValue;
|
---|
| 120 | ItemArray<IVRPEncoding> solutions = VRPToursParameter.ActualValue;
|
---|
| 121 | ResultCollection results = ResultsParameter.ActualValue;
|
---|
| 122 |
|
---|
| 123 | ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
|
---|
| 124 | ItemArray<DoubleValue> distances = DistanceParameter.ActualValue;
|
---|
| 125 | ItemArray<DoubleValue> vehiclesUtilizations = VehiclesUtilizedParameter.ActualValue;
|
---|
| 126 |
|
---|
| 127 | int i = qualities.Select((x, index) => new { index, x.Value }).OrderBy(x => x.Value).First().index;
|
---|
| 128 |
|
---|
[4860] | 129 | DoubleValue bestKnownQuality = BestKnownQualityParameter.ActualValue;
|
---|
| 130 |
|
---|
[4374] | 131 | IVRPEncoding best = solutions[i].Clone() as IVRPEncoding;
|
---|
| 132 | VRPSolution solution = BestSolutionParameter.ActualValue;
|
---|
| 133 | if (solution == null) {
|
---|
| 134 | solution = new VRPSolution(problemInstance, best.Clone() as IVRPEncoding, new DoubleValue(qualities[i].Value));
|
---|
| 135 | BestSolutionParameter.ActualValue = solution;
|
---|
| 136 | results.Add(new Result("Best VRP Solution", solution));
|
---|
| 137 |
|
---|
| 138 | results.Add(new Result("Best VRP Solution Distance", new DoubleValue(distances[i].Value)));
|
---|
| 139 | results.Add(new Result("Best VRP Solution VehicleUtilization", new DoubleValue(vehiclesUtilizations[i].Value)));
|
---|
| 140 | } else {
|
---|
| 141 | if (qualities[i].Value <= solution.Quality.Value) {
|
---|
| 142 | solution.ProblemInstance = problemInstance;
|
---|
| 143 | solution.Solution = best.Clone() as IVRPEncoding;
|
---|
| 144 | solution.Quality.Value = qualities[i].Value;
|
---|
| 145 | (results["Best VRP Solution Distance"].Value as DoubleValue).Value = distances[i].Value;
|
---|
| 146 | (results["Best VRP Solution VehicleUtilization"].Value as DoubleValue).Value = vehiclesUtilizations[i].Value;
|
---|
| 147 | }
|
---|
| 148 | }
|
---|
| 149 |
|
---|
[5202] | 150 | VRPSolution validSolution = BestValidSolutionParameter.ActualValue;
|
---|
| 151 | if (validSolution == null) {
|
---|
| 152 | if (ProblemInstanceParameter.ActualValue.Feasible(best)) {
|
---|
| 153 | validSolution = new VRPSolution(problemInstance, best.Clone() as IVRPEncoding, new DoubleValue(qualities[i].Value));
|
---|
| 154 | BestValidSolutionParameter.ActualValue = validSolution;
|
---|
[5867] | 155 | if (results.ContainsKey("Best valid VRP Solution"))
|
---|
| 156 | results["Best valid VRP Solution"].Value = validSolution;
|
---|
| 157 | else
|
---|
| 158 | results.Add(new Result("Best valid VRP Solution", validSolution));
|
---|
[6607] | 159 |
|
---|
| 160 | results.Add(new Result("Best valid VRP Solution Distance", new DoubleValue(distances[i].Value)));
|
---|
| 161 | results.Add(new Result("Best valid VRP Solution VehicleUtilization", new DoubleValue(vehiclesUtilizations[i].Value)));
|
---|
[5202] | 162 | }
|
---|
| 163 | } else {
|
---|
| 164 | if (qualities[i].Value <= validSolution.Quality.Value) {
|
---|
| 165 | if (ProblemInstanceParameter.ActualValue.Feasible(best)) {
|
---|
| 166 | validSolution.ProblemInstance = problemInstance;
|
---|
| 167 | validSolution.Solution = best.Clone() as IVRPEncoding;
|
---|
| 168 | validSolution.Quality.Value = qualities[i].Value;
|
---|
[6607] | 169 | (results["Best valid VRP Solution Distance"].Value as DoubleValue).Value = distances[i].Value;
|
---|
| 170 | (results["Best valid VRP Solution VehicleUtilization"].Value as DoubleValue).Value = vehiclesUtilizations[i].Value;
|
---|
[5202] | 171 | }
|
---|
| 172 | }
|
---|
| 173 | }
|
---|
| 174 |
|
---|
[4860] | 175 | if (bestKnownQuality == null ||
|
---|
| 176 | qualities[i].Value < bestKnownQuality.Value) {
|
---|
| 177 | BestKnownQualityParameter.ActualValue = new DoubleValue(qualities[i].Value);
|
---|
| 178 | BestKnownSolutionParameter.ActualValue = (VRPSolution)solution.Clone();
|
---|
| 179 | }
|
---|
| 180 |
|
---|
[4374] | 181 | return base.Apply();
|
---|
| 182 | }
|
---|
| 183 | }
|
---|
| 184 | }
|
---|