source: branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingSequence/Moves/GroupingMoveHardTabuCriterion.cs @ 13032

Last change on this file since 13032 was 13032, checked in by gkronber, 6 years ago

#1966:

  • removed unused using
  • added/updated license headers
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
22
23using HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Data;
26using HeuristicLab.Operators;
27using HeuristicLab.Optimization;
28using HeuristicLab.Parameters;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30using HeuristicLab.Problems.BinPacking.Interfaces;
31
32namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
33  [Item("SequenceMoveHardTabuCriterion", "<Missing>")]
34  [StorableClass]
35  public class SequenceMoveHardTabuCriterion : SingleSuccessorOperator, IPackingSequenceMoveOperator, ITabuChecker {
36    public override bool CanChangeName {
37      get { return false; }
38    }
39    public ILookupParameter<IPackingMove> PackingMoveParameter {
40      get { return (ILookupParameter<IPackingMove>)Parameters["PackingMove"]; }
41    }
42    public ILookupParameter<PackingSequenceEncoding> PackingSequenceParameter {
43      get { return (ILookupParameter<PackingSequenceEncoding>)Parameters["PackingSequence"]; }
44    }
45    public ILookupParameter<ItemList<IItem>> TabuListParameter {
46      get { return (ILookupParameter<ItemList<IItem>>)Parameters["TabuList"]; }
47    }
48    public ILookupParameter<BoolValue> MoveTabuParameter {
49      get { return (ILookupParameter<BoolValue>)Parameters["MoveTabu"]; }
50    }
51    public IValueLookupParameter<BoolValue> MaximizationParameter {
52      get { return (IValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
53    }
54    public ILookupParameter<DoubleValue> MoveQualityParameter {
55      get { return (ILookupParameter<DoubleValue>)Parameters["MoveQuality"]; }
56    }
57    public ValueParameter<BoolValue> UseAspirationCriterionParameter {
58      get { return (ValueParameter<BoolValue>)Parameters["UseAspirationCriterion"]; }
59    }
60
61    [StorableConstructor]
62    protected SequenceMoveHardTabuCriterion(bool deserializing) : base(deserializing) { }
63    protected SequenceMoveHardTabuCriterion(SequenceMoveHardTabuCriterion original, Cloner cloner) : base(original, cloner) { }
64    public SequenceMoveHardTabuCriterion()
65      : base() {
66      Parameters.Add(new LookupParameter<IPackingMove>("PackingMove", "The move to evaluate."));
67      Parameters.Add(new LookupParameter<PackingSequenceEncoding>("PackingSequence", "The solution to evaluate."));
68      Parameters.Add(new LookupParameter<BoolValue>("MoveTabu", "The variable to store if a move was tabu."));
69      Parameters.Add(new LookupParameter<ItemList<IItem>>("TabuList", "The tabu list."));
70      Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, else if it is a minimization problem."));
71      Parameters.Add(new LookupParameter<DoubleValue>("MoveQuality", "The quality of the current move."));
72      Parameters.Add(new ValueParameter<BoolValue>("UseAspirationCriterion", "Whether to use the aspiration criterion or not.", new BoolValue(true)));
73    }
74
75    public override IDeepCloneable Clone(Cloner cloner) {
76      return new SequenceMoveHardTabuCriterion(this, cloner);
77    }
78
79    public override IOperation Apply() {
80      ItemList<IItem> tabuList = TabuListParameter.ActualValue;
81      SequenceMove move = PackingMoveParameter.ActualValue as SequenceMove;
82      PackingSequenceEncoding PackingSequence = PackingSequenceParameter.ActualValue;
83      int length = PackingSequence.PackingSequence.Length;
84      double moveQuality = MoveQualityParameter.ActualValue.Value;
85      bool maximization = MaximizationParameter.ActualValue.Value;   
86      bool useAspiration = UseAspirationCriterionParameter.Value.Value;
87      bool isTabu = IsMoveTabu(tabuList, move, PackingSequence, moveQuality, maximization, useAspiration);
88
89      MoveTabuParameter.ActualValue = new BoolValue(isTabu);
90      return base.Apply();
91    }
92
93    private bool IsMoveTabu(ItemList<IItem> tabuList, SequenceMove move, PackingSequenceEncoding PackingSequence, double moveQuality, bool maximization, bool useAspiration) {
94      bool isTabu = false;
95      var attributes = tabuList.FindAll(ta => ta.GetType().Equals(move.GetMoveAttributeType()));
96
97      foreach (IItem attr in attributes) {
98        SequenceMoveAttribute gvAttr = attr as SequenceMoveAttribute;
99        if (gvAttr != null
100          && (!useAspiration
101              || maximization && moveQuality <= gvAttr.MoveQuality
102              || !maximization && moveQuality >= gvAttr.MoveQuality)) {
103
104          isTabu = move.BelongsToAttribute(gvAttr, true);
105        }
106        if (isTabu) break;
107      }
108
109      return isTabu;
110    }
111  }
112}
Note: See TracBrowser for help on using the repository browser.