1  #region License Information


2  /* HeuristicLab


3  * Copyright (C) 20022019 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.Persistence.Default.CompositeSerializers.Storable;


25 


26  namespace HeuristicLab.Encodings.PermutationEncoding {


27  /// <summary>


28  /// Manipulates a permutation array by moving randomly one element to another position in the array.


29  /// </summary>


30  /// <remarks>


31  /// It is implemented as described in Fogel, D.B. (1988). An Evolutionary Approach to the Traveling Salesman Problem, Biological Cybernetics, 60, pp. 139144.


32  /// </remarks>


33  [Item("InsertionManipulator", "An operator which moves randomly one element to another position in the permutation (Insertion is a special case of Translocation). It is implemented as described in Fogel, D.B. (1988). An Evolutionary Approach to the Traveling Salesman Problem, Biological Cybernetics, 60, pp. 139144.")]


34  [StorableClass]


35  public class InsertionManipulator : PermutationManipulator {


36  [StorableConstructor]


37  protected InsertionManipulator(bool deserializing) : base(deserializing) { }


38  protected InsertionManipulator(InsertionManipulator original, Cloner cloner) : base(original, cloner) { }


39  public InsertionManipulator() : base() { }


40 


41  public override IDeepCloneable Clone(Cloner cloner) {


42  return new InsertionManipulator(this, cloner);


43  }


44 


45  /// <summary>


46  /// Moves an randomly chosen element in the specified <paramref name="permutation"/> array


47  /// to another randomly generated position.


48  /// </summary>


49  /// <param name="random">The random number generator.</param>


50  /// <param name="permutation">The permutation to manipulate.</param>


51  public static void Apply(IRandom random, Permutation permutation) {


52  var cutIndex = random.Next(permutation.Length);


53  var insertIndex = random.Next(permutation.Length);


54 


55  if (cutIndex == insertIndex) return;


56 


57  permutation.Move(cutIndex, cutIndex, insertIndex);


58  }


59 


60  /// <summary>


61  /// Moves an randomly chosen element in the specified <paramref name="permutation"/> array


62  /// to another randomly generated position.


63  /// </summary>


64  /// <remarks>Calls <see cref="Apply"/>.</remarks>


65  /// <param name="random">A random number generator.</param>


66  /// <param name="permutation">The permutation to manipulate.</param>


67  protected override void Manipulate(IRandom random, Permutation permutation) {


68  Apply(random, permutation);


69  }


70  }


71  }

