Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HL-3.2-MonoMigration/HeuristicLab.SimOpt/SimOptDiscreteMultiCrossover.cs @ 3508

Last change on this file since 3508 was 637, checked in by abeham, 16 years ago

[trunk] Redesigned and simplified SimOpt according to ticket #291

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