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 |
|
---|
22 | using System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using System.Linq;
|
---|
25 | using HeuristicLab.Collections;
|
---|
26 | using HeuristicLab.Core;
|
---|
27 | using HeuristicLab.Data;
|
---|
28 | using HeuristicLab.Parameters;
|
---|
29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
30 | using HeuristicLab.PluginInfrastructure;
|
---|
31 |
|
---|
32 | namespace HeuristicLab.Operators {
|
---|
33 | /// <summary>
|
---|
34 | /// Selects one of its branches (if there are any) given a list of relative probabilities.
|
---|
35 | /// </summary>
|
---|
36 | [Item("StochasticMultiBranch<T>", "Selects one of its branches (if there are any) given a list of relative probabilities.")]
|
---|
37 | [StorableClass]
|
---|
38 | public abstract class StochasticMultiBranch<T> : CheckedMultiOperator<T> where T : class, IOperator {
|
---|
39 | /// <summary>
|
---|
40 | /// Should return true if the StochasticMultiOperator should create a new child operation with the selected successor
|
---|
41 | /// or if it should create a new operation. If you need to shield the parameters of the successor you should return true here.
|
---|
42 | /// </summary>
|
---|
43 | protected abstract bool CreateChildOperation { get; }
|
---|
44 |
|
---|
45 | public ValueLookupParameter<DoubleArray> ProbabilitiesParameter {
|
---|
46 | get { return (ValueLookupParameter<DoubleArray>)Parameters["Probabilities"]; }
|
---|
47 | }
|
---|
48 | public ILookupParameter<IRandom> RandomParameter {
|
---|
49 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
50 | }
|
---|
51 |
|
---|
52 | public DoubleArray Probabilities {
|
---|
53 | get { return ProbabilitiesParameter.Value; }
|
---|
54 | set { ProbabilitiesParameter.Value = value; }
|
---|
55 | }
|
---|
56 |
|
---|
57 | [StorableConstructor]
|
---|
58 | protected StochasticMultiBranch(bool deserializing) : base(deserializing) { }
|
---|
59 | /// <summary>
|
---|
60 | /// Initializes a new instance of <see cref="StochasticMultiOperator"/> with two parameters
|
---|
61 | /// (<c>Probabilities</c> and <c>Random</c>).
|
---|
62 | /// </summary>
|
---|
63 | public StochasticMultiBranch()
|
---|
64 | : base() {
|
---|
65 | Parameters.Add(new ValueLookupParameter<DoubleArray>("Probabilities", "The array of relative probabilities for each operator.", new DoubleArray()));
|
---|
66 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator to use."));
|
---|
67 | }
|
---|
68 |
|
---|
69 | protected override void Operators_ItemsRemoved(object sender, CollectionItemsChangedEventArgs<IndexedItem<T>> e) {
|
---|
70 | base.Operators_ItemsRemoved(sender, e);
|
---|
71 | if (Probabilities != null && Probabilities.Length > Operators.Count) {
|
---|
72 | List<double> probs = new List<double>(Probabilities.Cast<double>());
|
---|
73 | var sorted = e.Items.OrderByDescending(x => x.Index);
|
---|
74 | foreach (IndexedItem<T> item in sorted)
|
---|
75 | if (probs.Count > item.Index) probs.RemoveAt(item.Index);
|
---|
76 | Probabilities = new DoubleArray(probs.ToArray());
|
---|
77 | }
|
---|
78 | }
|
---|
79 |
|
---|
80 | protected override void Operators_ItemsAdded(object sender, HeuristicLab.Collections.CollectionItemsChangedEventArgs<IndexedItem<T>> e) {
|
---|
81 | base.Operators_ItemsAdded(sender, e);
|
---|
82 | if (Probabilities != null && Probabilities.Length < Operators.Count) {
|
---|
83 | double avg = (Probabilities.Where(x => x > 0).Count() > 0) ? (Probabilities.Where(x => x > 0).Average()) : (1);
|
---|
84 | // add the average of all probabilities in the respective places (the new operators)
|
---|
85 | var added = e.Items.OrderBy(x => x.Index).ToList();
|
---|
86 | int insertCount = 0;
|
---|
87 | DoubleArray probs = new DoubleArray(Operators.Count);
|
---|
88 | for (int i = 0; i < Operators.Count; i++) {
|
---|
89 | if (insertCount < added.Count && i == added[insertCount].Index) {
|
---|
90 | probs[i] = avg;
|
---|
91 | insertCount++;
|
---|
92 | } else if (i - insertCount < Probabilities.Length) {
|
---|
93 | probs[i] = Probabilities[i - insertCount];
|
---|
94 | } else probs[i] = avg;
|
---|
95 | }
|
---|
96 | Probabilities = probs;
|
---|
97 | }
|
---|
98 | }
|
---|
99 |
|
---|
100 | /// <summary>
|
---|
101 | /// Applies an operator of the branches to the current scope with a
|
---|
102 | /// specific probability.
|
---|
103 | /// </summary>
|
---|
104 | /// <exception cref="InvalidOperationException">Thrown when the list of probabilites does not
|
---|
105 | /// match the number of operators, the list of selected operators is empty,
|
---|
106 | /// or all selected operators have zero probabitlity.</exception>
|
---|
107 | /// <returns>A new operation with the operator that was selected followed by the current operator's successor.</returns>
|
---|
108 | public override IOperation Apply() {
|
---|
109 | IRandom random = RandomParameter.ActualValue;
|
---|
110 | DoubleArray probabilities = ProbabilitiesParameter.ActualValue;
|
---|
111 | if (probabilities.Length != Operators.Count) {
|
---|
112 | throw new InvalidOperationException(Name + ": The list of probabilities has to match the number of operators");
|
---|
113 | }
|
---|
114 | IOperator successor = null;
|
---|
115 | var checkedOperators = Operators.CheckedItems;
|
---|
116 | if (checkedOperators.Count() > 0) {
|
---|
117 | // select a random operator from the checked operators
|
---|
118 | double sum = (from indexedItem in checkedOperators select probabilities[indexedItem.Index]).Sum();
|
---|
119 | if (sum == 0) throw new InvalidOperationException(Name + ": All selected operators have zero probability.");
|
---|
120 | double r = random.NextDouble() * sum;
|
---|
121 | sum = 0;
|
---|
122 | foreach (var indexedItem in checkedOperators) {
|
---|
123 | sum += probabilities[indexedItem.Index];
|
---|
124 | if (sum > r) {
|
---|
125 | successor = indexedItem.Value;
|
---|
126 | break;
|
---|
127 | }
|
---|
128 | }
|
---|
129 | }
|
---|
130 | OperationCollection next = new OperationCollection(base.Apply());
|
---|
131 | if (successor != null) {
|
---|
132 | if (CreateChildOperation)
|
---|
133 | next.Insert(0, ExecutionContext.CreateChildOperation(successor));
|
---|
134 | else next.Insert(0, ExecutionContext.CreateOperation(successor));
|
---|
135 | }
|
---|
136 | return next;
|
---|
137 | }
|
---|
138 | }
|
---|
139 | }
|
---|