#region License Information
/* HeuristicLab
* Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
*
* This file is part of HeuristicLab.
*
* HeuristicLab is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* HeuristicLab is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with HeuristicLab. If not, see .
*/
#endregion
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
namespace HeuristicLab.Encodings.PermutationEncoding {
///
/// Manipulates a permutation array by swapping to randomly chosen elements.
///
/// ///
/// It is implemented as described in Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg.
///
[Item("Swap2Manipulator", "An operator which manipulates a permutation array by swapping to randomly chosen elements. It is implemented as described in Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg.")]
[StorableClass]
public class Swap2Manipulator : PermutationManipulator {
[StorableConstructor]
protected Swap2Manipulator(bool deserializing) : base(deserializing) { }
protected Swap2Manipulator(Swap2Manipulator original, Cloner cloner) : base(original, cloner) { }
public Swap2Manipulator() : base() { }
public override IDeepCloneable Clone(Cloner cloner) {
return new Swap2Manipulator(this, cloner);
}
///
/// Swaps two randomly chosen elements in the given permutation.
///
/// The random number generator.
/// The permutation to manipulate.
public static void Apply(IRandom random, Permutation permutation) {
int index1, index2, temp;
index1 = random.Next(permutation.Length);
index2 = random.Next(permutation.Length);
temp = permutation[index1];
permutation[index1] = permutation[index2];
permutation[index2] = temp;
}
///
/// Swaps two randomly chosen elements in the given array.
///
/// Calls .
/// A random number generator.
/// The permutation to manipulate.
protected override void Manipulate(IRandom random, Permutation permutation) {
Apply(random, permutation);
}
}
}