-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathUniformCrossoverManager.cs
42 lines (37 loc) · 1.68 KB
/
UniformCrossoverManager.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
using GeneticAlgorithm.Components.Chromosomes;
using GeneticAlgorithm.Components.CrossoverManagers.Utilities;
using GeneticAlgorithm.Components.Interfaces;
using GeneticAlgorithm.Interfaces;
namespace GeneticAlgorithm.Components.CrossoverManagers
{
/// <summary>
/// In uniform crossover, each bit is chosen from either parent with equal probability.
/// Works on chromosomes of type VectorChromosome<T>.
/// </summary>
public class UniformCrossoverManager<T> : ICrossoverManager
{
private readonly IMutationManager<T> mutationManager;
private readonly IEvaluator evaluator;
public UniformCrossoverManager(IMutationManager<T> mutationManager, IEvaluator evaluator)
{
this.mutationManager = mutationManager;
this.evaluator = evaluator;
}
public IChromosome Crossover(IChromosome chromosome1, IChromosome chromosome2)
{
(var shortVectorChromosome, var longVectorChromosome) =
Utils.OrderChromosomes<T>(chromosome1, chromosome2);
var newVector = new T[longVectorChromosome.GetVector().Length];
var index = 0;
for (; index < shortVectorChromosome.GetVector().Length; index++)
{
newVector[index] = ProbabilityUtils.P(0.5)
? shortVectorChromosome.GetVector()[index]
: longVectorChromosome.GetVector()[index];
}
for (; index < longVectorChromosome.GetVector().Length; index++)
newVector[index] = longVectorChromosome.GetVector()[index];
return new VectorChromosome<T>(newVector, mutationManager, evaluator);
}
}
}