public static Permutation CutAndCrossfillCrossover(Permutation p1, Permutation p2, TRandom random)
{
if (p1.Count != p2.Count)
{
throw new ArgumentException("The element count differs.", nameof(p2));
}
if (p1.IsCircular != p2.IsCircular)
{
throw new ArgumentException("The circularity differs.", nameof(p2));
}
var min = (p1.IsCircular ? 1 : 0) + 1;
var max = p1.Count - 1;
if (max < min)
{
throw new InvalidOperationException("The permutation is to short for this operation.");
}
var position = (max == min)
? min
: random.Next(min, max);
var array = new int[p1.Count];
SpanExtensions.CutAndCrossfillCrossover(p1, p2, position, array);
return(new Permutation(array, p1.IsCircular));
}
public static Permutation CycleCrossover(Permutation p1, Permutation p2)
{
if (p1.Count != p2.Count)
{
throw new ArgumentException("The element count differs.", nameof(p2));
}
if (p1.IsCircular != p2.IsCircular)
{
throw new ArgumentException("The circularity differs.", nameof(p2));
}
var array = new int[p1.Count];
SpanExtensions.CycleCrossover(p1, p2, array);
return(new Permutation(array, p1.IsCircular));
}
/*
* Recombinations
*/
public static Permutation PartiallyMappedCrossover(Permutation p1, Permutation p2, TRandom random)
{
if (p1.Count != p2.Count)
{
throw new ArgumentException("The element count differs.", nameof(p2));
}
if (p1.IsCircular != p2.IsCircular)
{
throw new ArgumentException("The circularity differs.", nameof(p2));
}
var array = new int[p1.Count];
p1.GetRandomIndexPair(random, out var a, out var b);
SpanExtensions.PartiallyMappedCrossover(p1, p2, a, b - a, array);
return(new Permutation(array, p1.IsCircular));
}
