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 |
|
---|
22 | using System.Linq;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Data;
|
---|
26 | using HeuristicLab.Operators;
|
---|
27 | using HeuristicLab.Parameters;
|
---|
28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Problems.VehicleRouting {
|
---|
31 | [Item("BestVRPToursMemorizer", "An operator that updates the best VRP tour found so far in the scope three.")]
|
---|
32 | [StorableClass]
|
---|
33 | public class BestVRPToursMemorizer : SingleSuccessorOperator {
|
---|
34 | public ScopeTreeLookupParameter<DoubleValue> DistanceParameter {
|
---|
35 | get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Distance"]; }
|
---|
36 | }
|
---|
37 | public ScopeTreeLookupParameter<DoubleValue> VehiclesUtilizedParameter {
|
---|
38 | get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["VehiclesUtilized"]; }
|
---|
39 | }
|
---|
40 |
|
---|
41 | public ValueLookupParameter<DoubleValue> BestDistanceParameter {
|
---|
42 | get { return (ValueLookupParameter<DoubleValue>)Parameters["BestDistance"]; }
|
---|
43 | }
|
---|
44 | public ValueLookupParameter<DoubleValue> BestVehiclesUtilizedParameter {
|
---|
45 | get { return (ValueLookupParameter<DoubleValue>)Parameters["BestVehiclesUtilized"]; }
|
---|
46 | }
|
---|
47 |
|
---|
48 | public BestVRPToursMemorizer()
|
---|
49 | : base() {
|
---|
50 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Distance", "The distances of the VRP solutions which should be analyzed."));
|
---|
51 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("VehiclesUtilized", "The utilized vehicles of the VRP solutions which should be analyzed."));
|
---|
52 |
|
---|
53 | Parameters.Add(new ValueLookupParameter<DoubleValue>("BestDistance", "The best distance found so far."));
|
---|
54 | Parameters.Add(new ValueLookupParameter<DoubleValue>("BestVehiclesUtilized", "The best vehicles utilized found so far."));
|
---|
55 |
|
---|
56 | }
|
---|
57 |
|
---|
58 | [StorableConstructor]
|
---|
59 | protected BestVRPToursMemorizer(bool deserializing) : base(deserializing) { }
|
---|
60 |
|
---|
61 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
62 | return new BestVRPToursMemorizer(this, cloner);
|
---|
63 | }
|
---|
64 |
|
---|
65 | protected BestVRPToursMemorizer(BestVRPToursMemorizer original, Cloner cloner)
|
---|
66 | : base(original, cloner) {
|
---|
67 | }
|
---|
68 |
|
---|
69 | public override IOperation Apply() {
|
---|
70 | int i = DistanceParameter.ActualValue.Select((x, index) => new { index, x.Value }).OrderBy(x => x.Value).First().index;
|
---|
71 | if (BestDistanceParameter.ActualValue == null)
|
---|
72 | BestDistanceParameter.ActualValue = new DoubleValue(DistanceParameter.ActualValue[i].Value);
|
---|
73 | else if (DistanceParameter.ActualValue[i].Value <= BestDistanceParameter.ActualValue.Value)
|
---|
74 | BestDistanceParameter.ActualValue.Value = DistanceParameter.ActualValue[i].Value;
|
---|
75 |
|
---|
76 | i = VehiclesUtilizedParameter.ActualValue.Select((x, index) => new { index, x.Value }).OrderBy(x => x.Value).First().index;
|
---|
77 | if (BestVehiclesUtilizedParameter.ActualValue == null)
|
---|
78 | BestVehiclesUtilizedParameter.ActualValue = new DoubleValue(VehiclesUtilizedParameter.ActualValue[i].Value);
|
---|
79 | else if (VehiclesUtilizedParameter.ActualValue[i].Value <= BestVehiclesUtilizedParameter.ActualValue.Value)
|
---|
80 | BestVehiclesUtilizedParameter.ActualValue.Value = VehiclesUtilizedParameter.ActualValue[i].Value;
|
---|
81 |
|
---|
82 | return base.Apply();
|
---|
83 | }
|
---|
84 | }
|
---|
85 | }
|
---|