Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestSolution/PickupAndDelivery/BestPickupAndDeliveryVRPSolutionAnalyzer.cs @ 8053

Last change on this file since 8053 was 8053, checked in by ascheibe, 10 years ago

#1722 fixed more licensing information and source formatting

File size: 5.0 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 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.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Data;
26using HeuristicLab.Operators;
27using HeuristicLab.Optimization;
28using HeuristicLab.Parameters;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30using HeuristicLab.Problems.VehicleRouting.Interfaces;
31using HeuristicLab.Problems.VehicleRouting.Variants;
32
33namespace HeuristicLab.Problems.VehicleRouting {
34  /// <summary>
35  /// An operator for analyzing the best solution of Vehicle Routing Problems.
36  /// </summary>
37  [Item("BestPickupAndDeliveryVRPSolutionAnalyzer", "An operator for analyzing the best solution of Pickup and Delivery Routing Problems.")]
38  [StorableClass]
39  public sealed class BestPickupAndDeliveryVRPSolutionAnalyzer : SingleSuccessorOperator, IAnalyzer, IPickupAndDeliveryOperator {
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    public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
47      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
48    }
49
50    public ScopeTreeLookupParameter<IntValue> PickupViolationsParameter {
51      get { return (ScopeTreeLookupParameter<IntValue>)Parameters["PickupViolations"]; }
52    }
53
54    public LookupParameter<VRPSolution> BestSolutionParameter {
55      get { return (LookupParameter<VRPSolution>)Parameters["BestSolution"]; }
56    }
57    public ValueLookupParameter<ResultCollection> ResultsParameter {
58      get { return (ValueLookupParameter<ResultCollection>)Parameters["Results"]; }
59    }
60
61    public bool EnabledByDefault {
62      get { return true; }
63    }
64
65    [StorableConstructor]
66    private BestPickupAndDeliveryVRPSolutionAnalyzer(bool deserializing) : base(deserializing) { }
67
68    public BestPickupAndDeliveryVRPSolutionAnalyzer()
69      : base() {
70      Parameters.Add(new LookupParameter<IVRPProblemInstance>("ProblemInstance", "The problem instance."));
71      Parameters.Add(new ScopeTreeLookupParameter<IVRPEncoding>("VRPTours", "The VRP tours which should be evaluated."));
72      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the VRP solutions which should be analyzed."));
73
74      Parameters.Add(new ScopeTreeLookupParameter<IntValue>("PickupViolations", "The pickup violation of the VRP solutions which should be analyzed."));
75
76      Parameters.Add(new LookupParameter<VRPSolution>("BestSolution", "The best VRP solution."));
77      Parameters.Add(new ValueLookupParameter<ResultCollection>("Results", "The result collection where the best VRP solution should be stored."));
78    }
79
80    public override IDeepCloneable Clone(Cloner cloner) {
81      return new BestPickupAndDeliveryVRPSolutionAnalyzer(this, cloner);
82    }
83
84    private BestPickupAndDeliveryVRPSolutionAnalyzer(BestPickupAndDeliveryVRPSolutionAnalyzer original, Cloner cloner)
85      : base(original, cloner) {
86    }
87
88    public override IOperation Apply() {
89      ItemArray<IVRPEncoding> solutions = VRPToursParameter.ActualValue;
90      ResultCollection results = ResultsParameter.ActualValue;
91
92      ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
93      ItemArray<IntValue> pickupViolations = PickupViolationsParameter.ActualValue;
94
95      int i = qualities.Select((x, index) => new { index, x.Value }).OrderBy(x => x.Value).First().index;
96
97      IVRPEncoding best = solutions[i] as IVRPEncoding;
98      VRPSolution solution = BestSolutionParameter.ActualValue;
99      if (solution != null) {
100        if (!results.ContainsKey("Best VRP Solution PickupViolations")) {
101          results.Add(new Result("Best VRP Solution PickupViolations", new DoubleValue(pickupViolations[i].Value)));
102        } else {
103          if (qualities[i].Value <= solution.Quality.Value) {
104            (results["Best VRP Solution PickupViolations"].Value as DoubleValue).Value = pickupViolations[i].Value;
105          }
106        }
107      }
108
109      return base.Apply();
110    }
111  }
112}
Note: See TracBrowser for help on using the repository browser.