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

Last change on this file since 14128 was 14128, checked in by gkronber, 3 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
33
34namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
35  [Item("SequenceMoveSoftTabuCriterion", "<Missing>")]
36  [StorableClass]
37  public class SequenceMoveSoftTabuCriterion : SingleSuccessorOperator, IPackingSequenceMoveOperator, ITabuChecker {
38    public override bool CanChangeName {
39      get { return false; }
40    }
41    public ILookupParameter<IPackingMove<Permutation>> PackingMoveParameter {
42      get { return (ILookupParameter<IPackingMove<Permutation>>)Parameters["PackingMove"]; }
43    }
44    public ILookupParameter<Permutation> PackingSequenceParameter {
45      get { return (ILookupParameter<Permutation>)Parameters["PackingSequence"]; }
46    }
47    public ILookupParameter<ItemList<IItem>> TabuListParameter {
48      get { return (ILookupParameter<ItemList<IItem>>)Parameters["TabuList"]; }
49    }
50    public ILookupParameter<BoolValue> MoveTabuParameter {
51      get { return (ILookupParameter<BoolValue>)Parameters["MoveTabu"]; }
52    }
53    public IValueLookupParameter<BoolValue> MaximizationParameter {
54      get { return (IValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
55    }
56    public ILookupParameter<DoubleValue> MoveQualityParameter {
57      get { return (ILookupParameter<DoubleValue>)Parameters["MoveQuality"]; }
58    }
59    public ValueParameter<BoolValue> UseAspirationCriterionParameter {
60      get { return (ValueParameter<BoolValue>)Parameters["UseAspirationCriterion"]; }
61    }
62
63    [StorableConstructor]
64    protected SequenceMoveSoftTabuCriterion(bool deserializing) : base(deserializing) { }
65    protected SequenceMoveSoftTabuCriterion(SequenceMoveSoftTabuCriterion original, Cloner cloner) : base(original, cloner) { }
66    public SequenceMoveSoftTabuCriterion()
67      : base() {
68      Parameters.Add(new LookupParameter<IPackingMove<Permutation>>("PackingMove", "The move to evaluate."));
69      Parameters.Add(new LookupParameter<Permutation>("PackingSequence", "The solution to evaluate."));
70      Parameters.Add(new LookupParameter<BoolValue>("MoveTabu", "The variable to store if a move was tabu."));
71      Parameters.Add(new LookupParameter<ItemList<IItem>>("TabuList", "The tabu list."));
72      Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, else if it is a minimization problem."));
73      Parameters.Add(new LookupParameter<DoubleValue>("MoveQuality", "The quality of the current move."));
74      Parameters.Add(new ValueParameter<BoolValue>("UseAspirationCriterion", "Whether to use the aspiration criterion or not.", new BoolValue(true)));
75    }
76
77    public override IDeepCloneable Clone(Cloner cloner) {
78      return new SequenceMoveSoftTabuCriterion(this, cloner);
79    }
80
81    public override IOperation Apply() {
82      ItemList<IItem> tabuList = TabuListParameter.ActualValue;
83      SequenceMove move = PackingMoveParameter.ActualValue as SequenceMove;
84      double moveQuality = MoveQualityParameter.ActualValue.Value;
85      bool maximization = MaximizationParameter.ActualValue.Value;
86      bool useAspiration = UseAspirationCriterionParameter.Value.Value;
87      bool isTabu = IsMoveTabu(tabuList, move, 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, double moveQuality, bool maximization, bool useAspiration) {
94      bool isTabu = false;
95      var attributes = tabuList.FindAll(ta => ta.GetType() == 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, false); // only difference to hard tabu criterion
105        }
106        if (isTabu) break;
107      }
108
109      return isTabu;
110    }
111  }
112}
Note: See TracBrowser for help on using the repository browser.