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

Last change on this file since 14128 was 14128, checked in by gkronber, 5 years ago

#1966: refactoring of bin packing implementation

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