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.Collections.Generic;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Optimization.Operators;
|
---|
26 | using HeuristicLab.Parameters;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding {
|
---|
30 | [Item("ReplaceBranchMoveTabuMaker", "")]
|
---|
31 | [StorableClass]
|
---|
32 | public class ReplaceBranchMoveTabuMaker : TabuMaker, ISymbolicExpressionTreeMoveOperator {
|
---|
33 | public ILookupParameter<ISymbolicExpressionTree> SymbolicExpressionTreeParameter {
|
---|
34 | get { return (ILookupParameter<ISymbolicExpressionTree>)Parameters["SymbolicExpressionTree"]; }
|
---|
35 | }
|
---|
36 | public ILookupParameter<ReplaceBranchMove> ReplaceBranchMoveParameter {
|
---|
37 | get { return (LookupParameter<ReplaceBranchMove>)Parameters["ReplaceBranchMove"]; }
|
---|
38 | }
|
---|
39 |
|
---|
40 | [StorableConstructor]
|
---|
41 | protected ReplaceBranchMoveTabuMaker(bool deserializing) : base(deserializing) { }
|
---|
42 | protected ReplaceBranchMoveTabuMaker(ReplaceBranchMoveTabuMaker original, Cloner cloner) : base(original, cloner) { }
|
---|
43 | public ReplaceBranchMoveTabuMaker()
|
---|
44 | : base() {
|
---|
45 | Parameters.Add(new LookupParameter<ReplaceBranchMove>("ReplaceBranchMove", "The move that was made."));
|
---|
46 | Parameters.Add(new LookupParameter<ISymbolicExpressionTree>("SymbolicExpressionTree", "The solution as symbolic expression tree."));
|
---|
47 | }
|
---|
48 |
|
---|
49 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
50 | return new ReplaceBranchMoveTabuMaker(this, cloner);
|
---|
51 | }
|
---|
52 |
|
---|
53 | protected override IItem GetTabuAttribute(bool maximization, double quality, double moveQuality) {
|
---|
54 | var move = ReplaceBranchMoveParameter.ActualValue;
|
---|
55 | var tree = SymbolicExpressionTreeParameter.ActualValue;
|
---|
56 | double baseQuality = moveQuality;
|
---|
57 | if (maximization && quality > moveQuality || !maximization && quality < moveQuality) baseQuality = quality; // we make an uphill move, the lower bound is the solution quality
|
---|
58 |
|
---|
59 | List<int> path = new List<int>();
|
---|
60 | path.Add(move.SubtreeIndex);
|
---|
61 | var parent = move.Parent.Parent;
|
---|
62 | var child = move.Parent;
|
---|
63 | while (parent != null) {
|
---|
64 | path.Add(parent.IndexOfSubtree(child));
|
---|
65 | child = parent;
|
---|
66 | parent = parent.Parent;
|
---|
67 | }
|
---|
68 | path.Reverse();
|
---|
69 | return new ChangeNodeTypeMoveAbsoluteAttribute(path.ToArray(), baseQuality);
|
---|
70 | }
|
---|
71 | }
|
---|
72 | }
|
---|