Free cookie consent management tool by TermsFeed Policy Generator

source: branches/3.1/sources/HeuristicLab.RealVector/IntermediateMultiCrossover.cs @ 592

Last change on this file since 592 was 111, checked in by abeham, 17 years ago

Renamed Recombination operators to MultCrossover operators and added the necessary base classes (ticket #89)
Created a static Apply method that encapsulates the functionality of the operators (ticket #88)

File size: 1.7 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2008 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 System.Collections.Generic;
24using System.Text;
25using HeuristicLab.Core;
26using HeuristicLab.Data;
27
28namespace HeuristicLab.RealVector {
29  public class IntermediateMultiCrossover : RealVectorMultiCrossoverBase {
30    public override string Description {
31      get {
32        return @"This creates a new offspring by computing the centroid of a number of parents";
33      }
34    }
35
36    public static double[] Apply(IList<double[]> parents) {
37      int length = parents[0].Length;
38      double[] result = new double[length];
39      for (int i = 0; i < length; i++) {
40        double sum = 0.0;
41        for (int j = 0; j < parents.Count; j++)
42          sum += parents[j][i];
43        result[i] = sum / parents.Count;
44      }
45      return result;
46    }
47
48    protected override double[] Cross(IScope scope, IRandom random, IList<double[]> parents) {
49      return Apply(parents);
50    }
51  }
52}
Note: See TracBrowser for help on using the repository browser.