Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingSequence/Moves/SequenceTabuMaker.cs @ 9563

Last change on this file since 9563 was 9563, checked in by jhelm, 11 years ago

#1966: Implemented additional Operator-Wrappers for PackingSequence and GroupingVector; Implemented additional problem-class for Rosenbauer-Problemstatement; Added marker-interfaces for decoder-types;

File size: 3.1 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 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.Encodings.IntegerVectorEncoding;
25using HeuristicLab.Optimization.Operators;
26using HeuristicLab.Parameters;
27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28using HeuristicLab.Problems.BinPacking.Interfaces;
29
30namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
31  [Item("Sequence tabu maker", "Declares a given Sequence move as tabu, by adding its attributes to the tabu list and also store the solution quality or the move quality (whichever is better).")]
32  [StorableClass]
33  public class SequenceTabuMaker : TabuMaker, IPackingSequenceMoveOperator{
34    public ILookupParameter<IPackingMove> PackingMoveParameter {
35      get { return (ILookupParameter<IPackingMove>)Parameters["PackingMove"]; }
36    }
37    public ILookupParameter<PackingSequenceEncoding> PackingSequenceParameter {
38      get { return (ILookupParameter<PackingSequenceEncoding>)Parameters["PackingSequence"]; }
39    }
40
41    [StorableConstructor]
42    protected SequenceTabuMaker(bool deserializing) : base(deserializing) { }
43    protected SequenceTabuMaker(SequenceTabuMaker original, Cloner cloner) : base(original, cloner) { }
44    public SequenceTabuMaker()
45      : base() {
46        Parameters.Add(new LookupParameter<IPackingMove>("PackingMove", "The move to evaluate."));
47      Parameters.Add(new LookupParameter<PackingSequenceEncoding>("PackingSequence", "The solution to evaluate."));
48    }
49
50    public override IDeepCloneable Clone(Cloner cloner) {
51      return new SequenceTabuMaker(this, cloner);
52    }
53
54    protected override IItem GetTabuAttribute(bool maximization, double quality, double moveQuality) {
55      IPackingMove move = PackingMoveParameter.ActualValue;
56      PackingSequenceEncoding PackingSequence = PackingSequenceParameter.ActualValue;   
57      double baseQuality = moveQuality;
58      if (maximization && quality > moveQuality || !maximization && quality < moveQuality)
59        baseQuality = quality; // we make an uphill move, the lower bound is the solution quality
60
61      var sMove = move as SequenceMove;
62
63      if (sMove != null)
64        return sMove.GetAttribute(baseQuality);
65      else
66        return move.GetSolutionAfterMove();
67    }
68  }
69}
Note: See TracBrowser for help on using the repository browser.