Free cookie consent management tool by TermsFeed Policy Generator

Ignore:
Timestamp:
02/18/10 20:42:37 (14 years ago)
Author:
abeham
Message:

Implemented CyclicCrossover, updated documentation in MaximalPreservativeCrossover and PartiallyMatchedCrossover #889

File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/sources/HeuristicLab.Permutation/3.3/MaximalPreservativeCrossover.cs

    r2823 r2829  
    2929  /// Performs a crossover between two permuation arrays by preserving a large number of edges in both parents.
    3030  /// The operator also maintains the position in the arrays to some extent.
    31   /// It is implemented as described in Mühlenbein, H. Evolution in time and space - the parallel genetic algorithm. FOUNDATIONS OF GENETIC ALGORITHMS, Morgan Kaufmann, 1991, 316-337.
     31  /// It is implemented as described in Mühlenbein, H. 1991. Evolution in time and space - the parallel genetic algorithm. FOUNDATIONS OF GENETIC ALGORITHMS, pp. 316-337. Morgan Kaufmann.
     32  ///
    3233  /// The length of the segment copied from the first parent to the offspring is uniformly distributed in the interval [3, N/3) with N = length of the permutation.
     34  /// This recommendation is mentioned in Pohlheim, H. 1999. Evolutionäre Algorithmen: Verfahren, Operatoren und Hinweise für die Praxis, p. 44, Springer.
     35  /// If the length of the permutation is smaller than 15, the size of the segment is always equal to 3.
    3336  /// </remarks>
    34   [Item("MaximalPreservativeCrossover", "An operator which performs the maximal preservative crossover on two permutations.")]
     37  [Item("MaximalPreservativeCrossover", "An operator which performs the maximal preservative crossover on two permutations as described in Mühlenbein, H. 1991. Evolution in time and space - the parallel genetic algorithm. FOUNDATIONS OF GENETIC ALGORITHMS, pp. 316-337. Morgan Kaufmann.")]
    3538  [EmptyStorableClass]
    3639  [Creatable("Test")]
     
    4043    /// by preserving a large number of edges in both parents.
    4144    /// </summary>
    42     /// <exception cref="InvalidOperationException">Thrown if the numbers in the permutation array are not in the range [0,N) with N = length of the permutation.</exception>
    4345    /// <exception cref="ArgumentException">Thrown when <paramref name="parent1"/> and <paramref name="parent2"/> are not of equal length or when the permutations are shorter than 4 elements.</exception>
     46    /// <exception cref="InvalidOperationException">Thrown if the numbers in the permutation elements are not in the range [0,N) with N = length of the permutation.</exception>
    4447    /// <remarks>
    4548    /// First one segment is copied from the first parent to the offspring in the same position.
     
    6063      int breakPoint1, breakPoint2, subsegmentLength, index;
    6164
    62       subsegmentLength = random.Next(3, Math.Max(length / 3, 4)); // as mentioned in "Pohlheim, H. Evolutionäre Algorithmen: Verfahren, Operatoren und Hinweise für die Praxis, 1999, p.44, Springer.
     65      subsegmentLength = random.Next(3, Math.Max(length / 3, 4)); // as mentioned in Pohlheim, H. Evolutionäre Algorithmen: Verfahren, Operatoren und Hinweise für die Praxis, 1999, p.44, Springer.
    6366      breakPoint1 = random.Next(length);
    6467      breakPoint2 = breakPoint1 + subsegmentLength;
     
    126129
    127130    /// <summary>
    128     /// Checks number of parents and calls <see cref="Apply"/>.
     131    /// Checks number of parents and calls <see cref="Apply(IRandom, Permutation, Permutation)"/>.
    129132    /// </summary>
    130133    /// <exception cref="InvalidOperationException">Thrown if there are not exactly two permutations in <paramref name="parents"/>.</exception>
Note: See TracChangeset for help on using the changeset viewer.