1  #region License Information


2  /* HeuristicLab


3  * Copyright (C) 20022015 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  using HeuristicLab.Common;


23  using HeuristicLab.Core;


24  using HeuristicLab.Optimization.Operators;


25  using HeuristicLab.Parameters;


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


27 


28  namespace HeuristicLab.Encodings.PermutationEncoding {


29  [Item("TranslocationMoveTabuMaker", "Declares a given translocation or insertion move (3opt) as tabu, by adding its attributes to the tabu list.")]


30  [StorableClass]


31  public class TranslocationMoveTabuMaker : TabuMaker, IPermutationTranslocationMoveQualityOperator {


32  public ILookupParameter<Permutation> PermutationParameter {


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


34  }


35  public ILookupParameter<TranslocationMove> TranslocationMoveParameter {


36  get { return (LookupParameter<TranslocationMove>)Parameters["TranslocationMove"]; }


37  }


38 


39  [StorableConstructor]


40  protected TranslocationMoveTabuMaker(bool deserializing) : base(deserializing) { }


41  protected TranslocationMoveTabuMaker(TranslocationMoveTabuMaker original, Cloner cloner) : base(original, cloner) { }


42  public TranslocationMoveTabuMaker()


43  : base() {


44  Parameters.Add(new LookupParameter<TranslocationMove>("TranslocationMove", "The move that was made."));


45  Parameters.Add(new LookupParameter<Permutation>("Permutation", "The solution as permutation."));


46  }


47 


48  public override IDeepCloneable Clone(Cloner cloner) {


49  return new TranslocationMoveTabuMaker(this, cloner);


50  }


51 


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


53  TranslocationMove move = TranslocationMoveParameter.ActualValue;


54  Permutation permutation = PermutationParameter.ActualValue;


55  double baseQuality = moveQuality;


56  if (maximization && quality > moveQuality  !maximization && quality < moveQuality) baseQuality = quality; // we make an uphill move, the lower bound is the solution quality


57  if (permutation.PermutationType == PermutationTypes.Absolute) {


58  int[] numbers = new int[move.Index2  move.Index1 + 1];


59  for (int i = 0; i < numbers.Length; i++) {


60  numbers[i] = permutation[i + move.Index1];


61  }


62  return new TranslocationMoveAbsoluteAttribute(numbers, move.Index1, move.Index3, baseQuality); ;


63  } else {


64  if (move.Index3 > move.Index1)


65  return new TranslocationMoveRelativeAttribute(permutation.GetCircular(move.Index1  1),


66  permutation[move.Index1],


67  permutation[move.Index2],


68  permutation.GetCircular(move.Index2 + 1),


69  permutation.GetCircular(move.Index3 + move.Index2  move.Index1),


70  permutation.GetCircular(move.Index3 + move.Index2  move.Index1 + 1),


71  baseQuality);


72  else


73  return new TranslocationMoveRelativeAttribute(permutation.GetCircular(move.Index1  1),


74  permutation[move.Index1],


75  permutation[move.Index2],


76  permutation.GetCircular(move.Index2 + 1),


77  permutation.GetCircular(move.Index3  1),


78  permutation.GetCircular(move.Index3),


79  baseQuality);


80  }


81  }


82  }


83  }

