Free cookie consent management tool by TermsFeed Policy Generator

source: branches/FitnessLandscapeAnalysis/HeuristicLab.Problems.NKNew/InteractionInitializers/SortedRandomInteractionsInitializer.cs @ 12483

Last change on this file since 12483 was 12483, checked in by ascheibe, 9 years ago

#2306 added a new project for NK landscapes and ported it to BasicProblem

File size: 3.1 KB
Line 
1using System.Linq;
2using HeuristicLab.Common;
3using HeuristicLab.Core;
4using HeuristicLab.Data;
5using HeuristicLab.Encodings.BinaryVectorEncoding;
6using HeuristicLab.Parameters;
7using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
8using HeuristicLab.PluginInfrastructure;
9
10namespace HeuristicLab.Problems.NK {
11
12  [Item("SortedRandomInteractionsInitializer", "Randomly assigned interactions across all bits and sorts components according to bit affinity.")]
13  [StorableClass]
14  public class SortedRandomInteractionsInitializer : ParameterizedNamedItem, IInteractionInitializer {
15
16    public IConstrainedValueParameter<IBinaryVectorComparer> ComparerParameter {
17      get { return (IConstrainedValueParameter<IBinaryVectorComparer>)Parameters["Comparer"]; }
18    }
19
20    public IBinaryVectorComparer Comparer {
21      get { return ComparerParameter.Value; }
22    }
23
24    [StorableConstructor]
25    protected SortedRandomInteractionsInitializer(bool serializing) : base(serializing) { }
26    protected SortedRandomInteractionsInitializer(SortedRandomInteractionsInitializer original, Cloner cloner) : base(original, cloner) { }
27    public SortedRandomInteractionsInitializer() {
28      AddComparerParameter();
29    }
30
31    private void AddComparerParameter() {
32      Parameters.Add(new ConstrainedValueParameter<IBinaryVectorComparer>("Comparer", "Comparison for sorting of component functions"));
33      foreach (var comparer in ApplicationManager.Manager.GetInstances<IBinaryVectorComparer>())
34        ComparerParameter.ValidValues.Add(comparer);
35      ComparerParameter.Value = ComparerParameter.ValidValues.First(v => v is AverageBitBinaryVectorComparer);
36    }
37
38    public override IDeepCloneable Clone(Cloner cloner) {
39      return new SortedRandomInteractionsInitializer(this, cloner);
40    }
41
42    [StorableHook(HookType.AfterDeserialization)]
43    private void AfterDeserialization() {
44      try {
45        IBinaryVectorComparer comparer = Comparer;
46      }
47      catch {
48        Parameters.Remove("Comparer");
49        AddComparerParameter();
50      }
51    }
52
53    #region IInteractionInitializer Members
54    public BoolMatrix InitializeInterations(int length, int nComponents, int nInteractions, IRandom random) {
55      BinaryVector[] components = Enumerable.Range(0, nComponents).Select(i => new BinaryVector(length)).ToArray();
56      for (int c = 0; c < components.Length; c++) {
57        var indices = Enumerable.Range(0, length).ToList();
58        if (indices.Count > c) {
59          indices.RemoveAt(c);
60          components[c][c] = true;
61        }
62        while (indices.Count > nInteractions) {
63          indices.RemoveAt(random.Next(indices.Count));
64        }
65        foreach (var i in indices) {
66          components[c][i] = true;
67        }
68      }
69      BoolMatrix m = new BoolMatrix(length, nComponents);
70      foreach (var c in components.OrderBy(v => v, Comparer).Select((v, j) => new { v, j })) {
71        for (int i = 0; i < c.v.Length; i++) {
72          m[i, c.j] = c.v[i];
73        }
74      }
75      return m;
76    }
77    #endregion
78  }
79}
Note: See TracBrowser for help on using the repository browser.