Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Encodings.RealVector/3.3/Crossovers/BlendAlphaBetaCrossover.cs @ 2913

Last change on this file since 2913 was 2913, checked in by abeham, 15 years ago

checked and corrected (where necessary) BLX-a, BLX-a-b, as well the SinglePointCrossover
checked the UniformOnePositionManipulator
fixed a copy-paste oversight in RealVectorManipulator
#890

File size: 8.7 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2010 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
22using System;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Parameters;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Encodings.RealVector {
29  /// <summary>
30  /// Blend alpha-beta crossover for real vectors (BLX-a-b). Creates a new offspring by selecting a
31  /// random value from the interval between the two alleles of the parent solutions.
32  /// The interval is increased in both directions as follows: Into the direction of the 'better'
33  /// solution by the factor alpha, into the direction of the 'worse' solution by the factor beta.
34  /// </summary>
35  /// <remarks>
36  /// It is implemented as described in Takahashi, M. and Kita, H. 2001. A crossover operator using independent component analysis for real-coded genetic algorithms Proceedings of the 2001 Congress on Evolutionary Computation, pp. 643-649.<br/>
37  /// The default value for alpha is 0.75, the default value for beta is 0.25.
38  /// </remarks>
39  [Item("BlendAlphaBetaCrossover", "The blend alpha beta crossover (BLX-a-b) for real vectors is similar to the blend alpha crossover (BLX-a), but distinguishes between the better and worse of the parents. The interval from which to choose the new offspring can be extended more around the better parent by specifying a higher alpha value. It is implemented as described in Takahashi, M. and Kita, H. 2001. A crossover operator using independent component analysis for real-coded genetic algorithms Proceedings of the 2001 Congress on Evolutionary Computation, pp. 643-649.")]
40  [EmptyStorableClass]
41  public class BlendAlphaBetaCrossover : RealVectorCrossover {
42    public ValueLookupParameter<BoolData> MaximizationParameter {
43      get { return (ValueLookupParameter<BoolData>)Parameters["Maximization"]; }
44    }
45    public SubScopesLookupParameter<DoubleData> QualityParameter {
46      get { return (SubScopesLookupParameter<DoubleData>)Parameters["Quality"]; }
47    }
48    public ValueLookupParameter<DoubleData> AlphaParameter {
49      get { return (ValueLookupParameter<DoubleData>)Parameters["Alpha"]; }
50    }
51    public ValueLookupParameter<DoubleData> BetaParameter {
52      get { return (ValueLookupParameter<DoubleData>)Parameters["Beta"]; }
53    }
54    /// <summary>
55    /// Initializes a new instance of <see cref="BlendAlphaBetaCrossover"/> with four additional parameters
56    /// (<c>Maximization</c>, <c>Quality</c>, <c>Alpha</c> and <c>Beta</c>).
57    /// </summary>
58    public BlendAlphaBetaCrossover()
59      : base() {
60      Parameters.Add(new ValueLookupParameter<BoolData>("Maximization", "Whether the problem is a maximization problem or not."));
61      Parameters.Add(new SubScopesLookupParameter<DoubleData>("Quality", "The quality values of the parents."));
62      Parameters.Add(new ValueLookupParameter<DoubleData>("Alpha", "The value for alpha.", new DoubleData(0.75)));
63      Parameters.Add(new ValueLookupParameter<DoubleData>("Beta", "The value for beta.", new DoubleData(0.25)));
64    }
65
66    /// <summary>
67    /// Performs the blend alpha beta crossover (BLX-a-b) on two parent vectors.
68    /// </summary>
69    /// <exception cref="ArgumentException">
70    /// Thrown when either:<br/>
71    /// <list type="bullet">
72    /// <item><description>The length of <paramref name="betterParent"/> and <paramref name="worseParent"/> is not equal.</description></item>
73    /// <item><description>The parameter <paramref name="alpha"/> is smaller than 0.</description></item>
74    /// <item><description>The parameter <paramref name="beta"/> is smaller than 0.</description></item>
75    /// </list>
76    /// </exception>
77    /// <param name="random">The random number generator to use.</param>
78    /// <param name="betterParent">The better of the two parents with regard to their fitness.</param>
79    /// <param name="worseParent">The worse of the two parents with regard to their fitness.</param>
80    /// <param name="alpha">The parameter alpha.</param>
81    /// <param name="beta">The parameter beta.</param>
82    /// <returns>The real vector that results from the crossover.</returns>
83    public static DoubleArrayData Apply(IRandom random, DoubleArrayData betterParent, DoubleArrayData worseParent, DoubleData alpha, DoubleData beta) {
84      if (betterParent.Length != worseParent.Length) throw new ArgumentException("BlendAlphaBetaCrossover: The parents' vectors are of different length.", "betterParent");
85      if (alpha.Value < 0) throw new ArgumentException("BlendAlphaBetaCrossover: Parameter alpha must be greater or equal to 0.", "alpha");
86      if (beta.Value < 0) throw new ArgumentException("BlendAlphaBetaCrossover: Parameter beta must be greater or equal to 0.", "beta");
87      int length = betterParent.Length;
88      double min, max, d;
89      DoubleArrayData result = new DoubleArrayData(length);
90
91      for (int i = 0; i < length; i++) {
92        d = Math.Abs(betterParent[i] - worseParent[i]);
93        if (betterParent[i] <= worseParent[i]) {
94          min = betterParent[i] - d * alpha.Value;
95          max = worseParent[i] + d * beta.Value;
96        } else {
97          min = worseParent[i] - d * beta.Value;
98          max = betterParent[i] + d * alpha.Value;
99        }
100        result[i] = min + random.NextDouble() * (max - min);
101      }
102      return result;
103    }
104
105    /// <summary>
106    /// Checks if the number of parents is equal to 2, if all parameters are available and forwards the call to <see cref="Apply(IRandom, DoubleArrayData, DoubleArrayData, DoubleData, DoubleData)"/>.
107    /// </summary>
108    /// <exception cref="ArgumentException">Thrown when the number of parents is not equal to 2.</exception>
109    /// <exception cref="InvalidOperationException">
110    /// Thrown when either:<br/>
111    /// <list type="bullet">
112    /// <item><description>Maximization parameter could not be found.</description></item>
113    /// <item><description>Quality parameter could not be found or the number of quality values is not equal to the number of parents.</description></item>
114    /// <item><description>Alpha parameter could not be found.</description></item>
115    /// <item><description>Beta parameter could not be found.</description></item>
116    /// </list>
117    /// </exception>
118    /// <param name="random">The random number generator to use.</param>
119    /// <param name="parents">The collection of parents (must be of size 2).</param>
120    /// <returns>The real vector that results from the crossover.</returns>
121    protected override DoubleArrayData Cross(IRandom random, ItemArray<DoubleArrayData> parents) {
122      if (parents.Length != 2) throw new ArgumentException("BlendAlphaBetaCrossover: Number of parents is not equal to 2.", "parents");
123      if (MaximizationParameter.ActualValue == null) throw new InvalidOperationException("BlendAlphaBetaCrossover: Parameter " + MaximizationParameter.ActualName + " could not be found.");
124      if (QualityParameter.ActualValue == null || QualityParameter.ActualValue.Length != parents.Length) throw new InvalidOperationException("BlendAlphaBetaCrossover: Parameter " + QualityParameter.ActualName + " could not be found, or not in the same quantity as there are parents.");
125      if (AlphaParameter.ActualValue == null || BetaParameter.ActualValue == null) throw new InvalidOperationException("BlendAlphaBetaCrossover: Parameter " + AlphaParameter.ActualName + " or paramter " + BetaParameter.ActualName + " could not be found.");
126     
127      ItemArray<DoubleData> qualities = QualityParameter.ActualValue;
128      bool maximization = MaximizationParameter.ActualValue.Value;
129      // the better parent
130      if (maximization && qualities[0].Value >= qualities[1].Value || !maximization && qualities[0].Value <= qualities[1].Value)
131        return Apply(random, parents[0], parents[1], AlphaParameter.ActualValue, BetaParameter.ActualValue);
132      else {
133        return Apply(random, parents[1], parents[0], AlphaParameter.ActualValue, BetaParameter.ActualValue);
134      }
135    }
136  }
137}
Note: See TracBrowser for help on using the repository browser.