[4374] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17180] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[4374] | 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 |
|
---|
[8053] | 22 | using HeuristicLab.Common;
|
---|
[4374] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Operators;
|
---|
| 26 | using HeuristicLab.Parameters;
|
---|
[16565] | 27 | using HEAL.Attic;
|
---|
[4374] | 28 |
|
---|
| 29 | namespace HeuristicLab.Problems.VehicleRouting {
|
---|
| 30 | [Item("BestAverageWorstCapacitatedVRPToursCalculator", "An operator which calculates the current best, average and worst properties of VRP tours in the scope tree.")]
|
---|
[16565] | 31 | [StorableType("CAF65472-0C4E-4564-B750-61F6924AA284")]
|
---|
[4374] | 32 | public sealed class BestAverageWorstCapacitatedVRPToursCalculator : SingleSuccessorOperator {
|
---|
| 33 | public ScopeTreeLookupParameter<DoubleValue> OverloadParameter {
|
---|
| 34 | get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Overload"]; }
|
---|
| 35 | }
|
---|
| 36 | public ValueLookupParameter<DoubleValue> BestOverloadParameter {
|
---|
| 37 | get { return (ValueLookupParameter<DoubleValue>)Parameters["BestOverload"]; }
|
---|
| 38 | }
|
---|
| 39 | public ValueLookupParameter<DoubleValue> AverageOverloadParameter {
|
---|
| 40 | get { return (ValueLookupParameter<DoubleValue>)Parameters["AverageOverload"]; }
|
---|
| 41 | }
|
---|
| 42 | public ValueLookupParameter<DoubleValue> WorstOverloadParameter {
|
---|
| 43 | get { return (ValueLookupParameter<DoubleValue>)Parameters["WorstOverload"]; }
|
---|
| 44 | }
|
---|
| 45 |
|
---|
| 46 | public BestAverageWorstCapacitatedVRPToursCalculator()
|
---|
| 47 | : base() {
|
---|
| 48 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Overload", "The overloads of the VRP solutions which should be analyzed."));
|
---|
| 49 | Parameters.Add(new ValueLookupParameter<DoubleValue>("BestOverload", "The best overload value."));
|
---|
| 50 | Parameters.Add(new ValueLookupParameter<DoubleValue>("AverageOverload", "The average overload value of all solutions."));
|
---|
| 51 | Parameters.Add(new ValueLookupParameter<DoubleValue>("WorstOverload", "The worst overload value of all solutions."));
|
---|
| 52 | }
|
---|
| 53 |
|
---|
[4752] | 54 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 55 | return new BestAverageWorstCapacitatedVRPToursCalculator(this, cloner);
|
---|
| 56 | }
|
---|
| 57 |
|
---|
| 58 | private BestAverageWorstCapacitatedVRPToursCalculator(BestAverageWorstCapacitatedVRPToursCalculator original, Cloner cloner)
|
---|
| 59 | : base(original, cloner) {
|
---|
| 60 | }
|
---|
| 61 |
|
---|
| 62 | [StorableConstructor]
|
---|
[16565] | 63 | private BestAverageWorstCapacitatedVRPToursCalculator(StorableConstructorFlag _) : base(_) { }
|
---|
[4752] | 64 |
|
---|
[4374] | 65 | private void UpdateOverloads() {
|
---|
| 66 | ItemArray<DoubleValue> overloads = OverloadParameter.ActualValue;
|
---|
| 67 | if (overloads.Length > 0) {
|
---|
| 68 | double min = double.MaxValue, max = double.MinValue, sum = 0.0;
|
---|
| 69 | for (int i = 0; i < overloads.Length; i++) {
|
---|
| 70 | if (overloads[i].Value < min) min = overloads[i].Value;
|
---|
| 71 | if (overloads[i].Value > max) max = overloads[i].Value;
|
---|
| 72 | sum += overloads[i].Value;
|
---|
| 73 | }
|
---|
| 74 |
|
---|
| 75 | DoubleValue best = BestOverloadParameter.ActualValue;
|
---|
| 76 | if (best == null) BestOverloadParameter.ActualValue = new DoubleValue(min);
|
---|
| 77 | else best.Value = min;
|
---|
| 78 | DoubleValue average = AverageOverloadParameter.ActualValue;
|
---|
| 79 | if (average == null) AverageOverloadParameter.ActualValue = new DoubleValue(sum / overloads.Length);
|
---|
| 80 | else average.Value = sum / overloads.Length;
|
---|
| 81 | DoubleValue worst = WorstOverloadParameter.ActualValue;
|
---|
| 82 | if (worst == null) WorstOverloadParameter.ActualValue = new DoubleValue(max);
|
---|
| 83 | else worst.Value = max;
|
---|
| 84 | }
|
---|
| 85 | }
|
---|
[8053] | 86 |
|
---|
[4374] | 87 | public override IOperation Apply() {
|
---|
| 88 | UpdateOverloads();
|
---|
[8053] | 89 |
|
---|
[4374] | 90 | return base.Apply();
|
---|
| 91 | }
|
---|
| 92 | }
|
---|
| 93 | }
|
---|