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;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Data;
|
---|
26 | using HeuristicLab.Operators;
|
---|
27 | using HeuristicLab.Optimization;
|
---|
28 | using HeuristicLab.Parameters;
|
---|
29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
30 |
|
---|
31 | namespace HeuristicLab.Encodings.RealVectorEncoding {
|
---|
32 | [Item("AdditiveMoveTabuChecker", "Prevents falling back into ranges that have been moved over before.")]
|
---|
33 | [StorableClass]
|
---|
34 | public class AdditiveMoveTabuChecker : SingleSuccessorOperator, IAdditiveRealVectorMoveOperator, ITabuChecker {
|
---|
35 | public override bool CanChangeName {
|
---|
36 | get { return false; }
|
---|
37 | }
|
---|
38 | public ILookupParameter<AdditiveMove> AdditiveMoveParameter {
|
---|
39 | get { return (LookupParameter<AdditiveMove>)Parameters["AdditiveMove"]; }
|
---|
40 | }
|
---|
41 | public ILookupParameter<RealVector> RealVectorParameter {
|
---|
42 | get { return (LookupParameter<RealVector>)Parameters["RealVector"]; }
|
---|
43 | }
|
---|
44 | public ILookupParameter<ItemList<IItem>> TabuListParameter {
|
---|
45 | get { return (ILookupParameter<ItemList<IItem>>)Parameters["TabuList"]; }
|
---|
46 | }
|
---|
47 | public ILookupParameter<BoolValue> MoveTabuParameter {
|
---|
48 | get { return (ILookupParameter<BoolValue>)Parameters["MoveTabu"]; }
|
---|
49 | }
|
---|
50 | public IValueLookupParameter<BoolValue> MaximizationParameter {
|
---|
51 | get { return (IValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
|
---|
52 | }
|
---|
53 | public ILookupParameter<DoubleValue> MoveQualityParameter {
|
---|
54 | get { return (ILookupParameter<DoubleValue>)Parameters["MoveQuality"]; }
|
---|
55 | }
|
---|
56 | public ValueParameter<BoolValue> UseAspirationCriterionParameter {
|
---|
57 | get { return (ValueParameter<BoolValue>)Parameters["UseAspirationCriterion"]; }
|
---|
58 | }
|
---|
59 |
|
---|
60 | public BoolValue UseAspirationCriterion {
|
---|
61 | get { return UseAspirationCriterionParameter.Value; }
|
---|
62 | set { UseAspirationCriterionParameter.Value = value; }
|
---|
63 | }
|
---|
64 |
|
---|
65 | [StorableConstructor]
|
---|
66 | protected AdditiveMoveTabuChecker(bool deserializing) : base(deserializing) { }
|
---|
67 | protected AdditiveMoveTabuChecker(AdditiveMoveTabuChecker original, Cloner cloner) : base(original, cloner) { }
|
---|
68 | public AdditiveMoveTabuChecker()
|
---|
69 | : base() {
|
---|
70 | Parameters.Add(new LookupParameter<AdditiveMove>("AdditiveMove", "The move to evaluate."));
|
---|
71 | Parameters.Add(new LookupParameter<BoolValue>("MoveTabu", "The variable to store if a move was tabu."));
|
---|
72 | Parameters.Add(new LookupParameter<RealVector>("RealVector", "The solution as real vector."));
|
---|
73 | Parameters.Add(new LookupParameter<ItemList<IItem>>("TabuList", "The tabu list."));
|
---|
74 | Parameters.Add(new ValueParameter<BoolValue>("UseAspirationCriterion", "Whether to use the aspiration criterion or not.", new BoolValue(true)));
|
---|
75 | Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, else if it is a minimization problem."));
|
---|
76 | Parameters.Add(new LookupParameter<DoubleValue>("MoveQuality", "The quality of the current move."));
|
---|
77 | }
|
---|
78 |
|
---|
79 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
80 | return new AdditiveMoveTabuChecker(this, cloner);
|
---|
81 | }
|
---|
82 |
|
---|
83 | public override IOperation Apply() {
|
---|
84 | ItemList<IItem> tabuList = TabuListParameter.ActualValue;
|
---|
85 | AdditiveMove move = AdditiveMoveParameter.ActualValue;
|
---|
86 | RealVector vector = RealVectorParameter.ActualValue;
|
---|
87 | double moveQuality = MoveQualityParameter.ActualValue.Value;
|
---|
88 | bool maximization = MaximizationParameter.ActualValue.Value;
|
---|
89 | bool useAspiration = UseAspirationCriterion.Value;
|
---|
90 | bool isTabu = false;
|
---|
91 | foreach (IItem tabuMove in tabuList) {
|
---|
92 | AdditiveMoveTabuAttribute attribute = (tabuMove as AdditiveMoveTabuAttribute);
|
---|
93 | if (attribute != null && attribute.Dimension == move.Dimension) {
|
---|
94 | if (!useAspiration
|
---|
95 | || maximization && moveQuality <= attribute.MoveQuality
|
---|
96 | || !maximization && moveQuality >= attribute.MoveQuality) {
|
---|
97 |
|
---|
98 | double newPos = vector[move.Dimension] + move.MoveDistance;
|
---|
99 | if (Math.Min(attribute.MovedPosition, attribute.OriginalPosition) < newPos
|
---|
100 | && newPos < Math.Max(attribute.MovedPosition, attribute.OriginalPosition)) {
|
---|
101 | isTabu = true;
|
---|
102 | break;
|
---|
103 | }
|
---|
104 | }
|
---|
105 | }
|
---|
106 | }
|
---|
107 | MoveTabuParameter.ActualValue = new BoolValue(isTabu);
|
---|
108 | return base.Apply();
|
---|
109 | }
|
---|
110 | }
|
---|
111 | }
|
---|