[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;
|
---|
| 31 |
|
---|
| 32 | namespace HeuristicLab.Problems.VehicleRouting {
|
---|
| 33 | /// <summary>
|
---|
| 34 | /// An operator for analyzing the best solution of Vehicle Routing Problems.
|
---|
| 35 | /// </summary>
|
---|
| 36 | [Item("BestCapacitatedVRPSolutionAnalyzer", "An operator for analyzing the best solution of capacitated Vehicle Routing Problems.")]
|
---|
| 37 | [StorableClass]
|
---|
| 38 | public sealed class BestCapacitatedVRPSolutionAnalyzer : SingleSuccessorOperator, IAnalyzer, ICapacitatedOperator {
|
---|
| 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> OverloadParameter {
|
---|
| 50 | get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Overload"]; }
|
---|
| 51 | }
|
---|
| 52 |
|
---|
| 53 | public LookupParameter<VRPSolution> BestSolutionParameter {
|
---|
| 54 | get { return (LookupParameter<VRPSolution>)Parameters["BestSolution"]; }
|
---|
| 55 | }
|
---|
| 56 | public ValueLookupParameter<ResultCollection> ResultsParameter {
|
---|
| 57 | get { return (ValueLookupParameter<ResultCollection>)Parameters["Results"]; }
|
---|
| 58 | }
|
---|
| 59 |
|
---|
| 60 | [StorableConstructor]
|
---|
| 61 | private BestCapacitatedVRPSolutionAnalyzer(bool deserializing) : base(deserializing) { }
|
---|
| 62 |
|
---|
| 63 | public BestCapacitatedVRPSolutionAnalyzer()
|
---|
| 64 | : base() {
|
---|
| 65 | Parameters.Add(new LookupParameter<IVRPProblemInstance>("ProblemInstance", "The problem instance."));
|
---|
| 66 | Parameters.Add(new ScopeTreeLookupParameter<IVRPEncoding>("VRPTours", "The VRP tours which should be evaluated."));
|
---|
| 67 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the VRP solutions which should be analyzed."));
|
---|
| 68 |
|
---|
| 69 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Overload", "The overloads of the VRP solutions which should be analyzed."));
|
---|
| 70 |
|
---|
| 71 | Parameters.Add(new LookupParameter<VRPSolution>("BestSolution", "The best TSP solution."));
|
---|
| 72 | Parameters.Add(new ValueLookupParameter<ResultCollection>("Results", "The result collection where the best VRP solution should be stored."));
|
---|
| 73 | }
|
---|
| 74 |
|
---|
| 75 | public override IOperation Apply() {
|
---|
| 76 | ItemArray<IVRPEncoding> solutions = VRPToursParameter.ActualValue;
|
---|
| 77 | ResultCollection results = ResultsParameter.ActualValue;
|
---|
| 78 |
|
---|
| 79 | ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
|
---|
| 80 | ItemArray<DoubleValue> overloads = OverloadParameter.ActualValue;
|
---|
| 81 |
|
---|
| 82 | int i = qualities.Select((x, index) => new { index, x.Value }).OrderBy(x => x.Value).First().index;
|
---|
| 83 |
|
---|
| 84 | IVRPEncoding best = solutions[i] as IVRPEncoding;
|
---|
| 85 | VRPSolution solution = BestSolutionParameter.ActualValue;
|
---|
[4454] | 86 | if (!results.ContainsKey("Best VRP Solution Overload")) {
|
---|
[4374] | 87 | results.Add(new Result("Best VRP Solution Overload", new DoubleValue(overloads[i].Value)));
|
---|
| 88 | } else {
|
---|
| 89 | if (qualities[i].Value <= solution.Quality.Value) {
|
---|
| 90 | (results["Best VRP Solution Overload"].Value as DoubleValue).Value = overloads[i].Value;
|
---|
| 91 | }
|
---|
| 92 | }
|
---|
| 93 |
|
---|
| 94 | return base.Apply();
|
---|
| 95 | }
|
---|
| 96 | }
|
---|
| 97 | }
|
---|