1  #region License Information


2  /* HeuristicLab


3  * Copyright (C) 20022015 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 


23  using HeuristicLab.Common;


24  using HeuristicLab.Core;


25  using HeuristicLab.Encodings.PermutationEncoding;


26  using HeuristicLab.Optimization.Operators;


27  using HeuristicLab.Parameters;


28  using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;


29  using HeuristicLab.Problems.BinPacking;


30 


31  namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {


32  [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).")]


33  [StorableClass]


34  public class SequenceTabuMaker : TabuMaker, IPackingSequenceMoveOperator {


35  public ILookupParameter<IPackingMove<Permutation>> PackingMoveParameter {


36  get { return (ILookupParameter<IPackingMove<Permutation>>)Parameters["PackingMove"]; }


37  }


38  public ILookupParameter<Permutation> PackingSequenceParameter {


39  get { return (ILookupParameter<Permutation>)Parameters["PackingSequence"]; }


40  }


41 


42  [StorableConstructor]


43  protected SequenceTabuMaker(bool deserializing) : base(deserializing) { }


44  protected SequenceTabuMaker(SequenceTabuMaker original, Cloner cloner) : base(original, cloner) { }


45  public SequenceTabuMaker()


46  : base() {


47  Parameters.Add(new LookupParameter<IPackingMove<Permutation>>("PackingMove", "The move to evaluate."));


48  Parameters.Add(new LookupParameter<Permutation>("PackingSequence", "The solution to evaluate."));


49  }


50 


51  public override IDeepCloneable Clone(Cloner cloner) {


52  return new SequenceTabuMaker(this, cloner);


53  }


54 


55  protected override IItem GetTabuAttribute(bool maximization, double quality, double moveQuality) {


56  var move = PackingMoveParameter.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  }

