Free cookie consent management tool by TermsFeed Policy Generator

source: branches/3.1/sources/HeuristicLab.SimOpt/SimOptDiscreteMultiCrossover.cs @ 755

Last change on this file since 755 was 592, checked in by abeham, 16 years ago

Put the GPL license in the files from the communication framework and simulation optimization project (branch 3.1)

File size: 2.6 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;
27using HeuristicLab.Operators;
28using HeuristicLab.Random;
29using HeuristicLab.Evolutionary;
30
31namespace HeuristicLab.SimOpt {
32  public class SimOptDiscreteMultiCrossover : MultiCrossoverBase {
33
34    public override string Description {
35      get { return @"This operator applies a discrete recombination on the variables defined"; }
36    }
37
38    public SimOptDiscreteMultiCrossover()
39      : base() {
40      AddVariableInfo(new VariableInfo("Item", "The item list to be recombined", typeof(ConstrainedItemList), VariableKind.In));
41    }
42
43    protected override void Cross(IScope scope, IRandom random, IScope[] parents, IScope child) {
44      ICollection<IConstraint> violated;
45
46      ConstrainedItemList[] p = new ConstrainedItemList[parents.Length];
47      for (int i = 0; i < p.Length; i++) {
48        p[i] = parents[i].GetVariableValue<ConstrainedItemList>("Item", false);
49        if (i > 0 && p[i].Count != p[i-1].Count) throw new InvalidOperationException("ERROR: the lists do not contain the same number of items");
50      }
51
52      ConstrainedItemList childList = (ConstrainedItemList)p[0].Clone();
53      if (childList.Count > 1) {
54        int iter = 0;
55        do {
56          childList.BeginCombinedOperation();
57          for (int i = 0; i < childList.Count; i++) {
58            int nextParent = random.Next(0, parents.Length);
59            if (nextParent > 0) childList.TrySetAt(i, (IItem)p[nextParent].Clone(), out violated);
60          }
61        } while (!childList.EndCombinedOperation(out violated) && ++iter < 100);
62        if (violated.Count == 0) {
63          child.AddVariable(new Variable(parents[0].TranslateName("Item"), childList));
64        }
65      }
66    }
67  }
68}
Note: See TracBrowser for help on using the repository browser.