1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2018 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 HeuristicLab.Common;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Data;
|
---|
25 | using HeuristicLab.Parameters;
|
---|
26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
27 |
|
---|
28 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
|
---|
29 | [Item("PotvinPDRearrangeMoveEvaluator", "Evaluates a rearrange move for a PDP representation. ")]
|
---|
30 | [StorableClass]
|
---|
31 | public sealed class PotvinPDRearrangeMoveEvaluator : PotvinMoveEvaluator, IPotvinPDRearrangeMoveOperator {
|
---|
32 | public ILookupParameter<PotvinPDRearrangeMove> PDRearrangeMoveParameter {
|
---|
33 | get { return (ILookupParameter<PotvinPDRearrangeMove>)Parameters["PotvinPDRearrangeMove"]; }
|
---|
34 | }
|
---|
35 |
|
---|
36 | public override ILookupParameter VRPMoveParameter {
|
---|
37 | get { return PDRearrangeMoveParameter; }
|
---|
38 | }
|
---|
39 |
|
---|
40 | public ILookupParameter<VariableCollection> MemoriesParameter {
|
---|
41 | get { return (ILookupParameter<VariableCollection>)Parameters["Memories"]; }
|
---|
42 | }
|
---|
43 |
|
---|
44 | public IValueParameter<StringValue> AdditionFrequencyMemoryKeyParameter {
|
---|
45 | get { return (IValueParameter<StringValue>)Parameters["AdditionFrequencyMemoryKey"]; }
|
---|
46 | }
|
---|
47 |
|
---|
48 | public IValueParameter<DoubleValue> LambdaParameter {
|
---|
49 | get { return (IValueParameter<DoubleValue>)Parameters["Lambda"]; }
|
---|
50 | }
|
---|
51 |
|
---|
52 | [StorableConstructor]
|
---|
53 | private PotvinPDRearrangeMoveEvaluator(bool deserializing) : base(deserializing) { }
|
---|
54 |
|
---|
55 | public PotvinPDRearrangeMoveEvaluator()
|
---|
56 | : base() {
|
---|
57 | Parameters.Add(new LookupParameter<PotvinPDRearrangeMove>("PotvinPDRearrangeMove", "The move that should be evaluated."));
|
---|
58 |
|
---|
59 | Parameters.Add(new LookupParameter<VariableCollection>("Memories", "The TS memory collection."));
|
---|
60 | Parameters.Add(new ValueParameter<StringValue>("AdditionFrequencyMemoryKey", "The key that is used for the addition frequency in the TS memory.", new StringValue("AdditionFrequency")));
|
---|
61 | Parameters.Add(new ValueParameter<DoubleValue>("Lambda", "The lambda parameter.", new DoubleValue(0.015)));
|
---|
62 | }
|
---|
63 |
|
---|
64 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
65 | return new PotvinPDRearrangeMoveEvaluator(this, cloner);
|
---|
66 | }
|
---|
67 |
|
---|
68 | private PotvinPDRearrangeMoveEvaluator(PotvinPDRearrangeMoveEvaluator original, Cloner cloner)
|
---|
69 | : base(original, cloner) {
|
---|
70 | }
|
---|
71 |
|
---|
72 | protected override void EvaluateMove() {
|
---|
73 | PotvinPDRearrangeMove move = PDRearrangeMoveParameter.ActualValue;
|
---|
74 |
|
---|
75 | PotvinEncoding newSolution = PDRearrangeMoveParameter.ActualValue.Individual.Clone() as PotvinEncoding;
|
---|
76 | PotvinPDRearrangeMoveMaker.Apply(newSolution, move, ProblemInstance);
|
---|
77 |
|
---|
78 | UpdateEvaluation(newSolution);
|
---|
79 | }
|
---|
80 | }
|
---|
81 | }
|
---|