Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.BinPacking/old files/GroupingVector/Moves/GroupingMoveHardTabuCriterion.cs @ 14498

Last change on this file since 14498 was 14046, checked in by gkronber, 8 years ago

#1966: unified namespaces

File size: 5.3 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 Joseph Helm and 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
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Operators;
26using HeuristicLab.Optimization;
27using HeuristicLab.Parameters;
28using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
29using HeuristicLab.Problems.BinPacking;
30
31namespace HeuristicLab.Encodings.PackingEncoding.GroupingVector {
32  [Item("GroupingMoveHardTabuCriterion", "<Missing>")]
33  [StorableClass]
34  public class GroupingMoveHardTabuCriterion : SingleSuccessorOperator, IGroupingVectorMoveOperator, ITabuChecker {
35    public override bool CanChangeName {
36      get { return false; }
37    }
38    public ILookupParameter<IPackingMove> PackingMoveParameter {
39      get { return (ILookupParameter<IPackingMove>)Parameters["PackingMove"]; }
40    }
41    public ILookupParameter<GroupingVectorEncoding> GroupingVectorParameter {
42      get { return (ILookupParameter<GroupingVectorEncoding>)Parameters["GroupingVector"]; }
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    [StorableConstructor]
61    protected GroupingMoveHardTabuCriterion(bool deserializing) : base(deserializing) { }
62    protected GroupingMoveHardTabuCriterion(GroupingMoveHardTabuCriterion original, Cloner cloner) : base(original, cloner) { }
63    public GroupingMoveHardTabuCriterion()
64      : base() {
65      Parameters.Add(new LookupParameter<IPackingMove>("PackingMove", "The move to evaluate."));
66      Parameters.Add(new LookupParameter<GroupingVectorEncoding>("GroupingVector", "The solution to evaluate."));
67      Parameters.Add(new LookupParameter<BoolValue>("MoveTabu", "The variable to store if a move was tabu."));
68      Parameters.Add(new LookupParameter<ItemList<IItem>>("TabuList", "The tabu list."));
69      Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, else if it is a minimization problem."));
70      Parameters.Add(new LookupParameter<DoubleValue>("MoveQuality", "The quality of the current move."));
71      Parameters.Add(new ValueParameter<BoolValue>("UseAspirationCriterion", "Whether to use the aspiration criterion or not.", new BoolValue(true)));
72    }
73
74    public override IDeepCloneable Clone(Cloner cloner) {
75      return new GroupingMoveHardTabuCriterion(this, cloner);
76    }
77
78    public override IOperation Apply() {
79      ItemList<IItem> tabuList = TabuListParameter.ActualValue;
80      GroupingMove move = PackingMoveParameter.ActualValue as GroupingMove;
81      GroupingVectorEncoding groupingVector = GroupingVectorParameter.ActualValue;
82      int length = groupingVector.GroupingVector.Length;
83      double moveQuality = MoveQualityParameter.ActualValue.Value;
84      bool maximization = MaximizationParameter.ActualValue.Value;   
85      bool useAspiration = UseAspirationCriterionParameter.Value.Value;
86      bool isTabu = IsMoveTabu(tabuList, move, groupingVector, moveQuality, maximization, useAspiration);
87
88      MoveTabuParameter.ActualValue = new BoolValue(isTabu);
89      return base.Apply();
90    }
91
92    private bool IsMoveTabu(ItemList<IItem> tabuList, GroupingMove move, GroupingVectorEncoding groupingVector, double moveQuality, bool maximization, bool useAspiration) {
93      bool isTabu = false;
94      var attributes = tabuList.FindAll(ta => ta.GetType().Equals(move.GetMoveAttributeType()));
95
96      foreach (IItem attr in attributes) {
97        GroupingMoveAttribute gvAttr = attr as GroupingMoveAttribute;
98        if (gvAttr != null
99          && (!useAspiration
100              || maximization && moveQuality <= gvAttr.MoveQuality
101              || !maximization && moveQuality >= gvAttr.MoveQuality)) {
102
103          isTabu = move.BelongsToAttribute(gvAttr, true);
104        }
105        if (isTabu) break;
106      }
107
108      return isTabu;
109    }
110  }
111}
Note: See TracBrowser for help on using the repository browser.