#region License Information
/* HeuristicLab
* Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
*
* This file is part of HeuristicLab.
*
* HeuristicLab is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* HeuristicLab is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with HeuristicLab. If not, see .
*/
#endregion
using System;
using System.Collections.Generic;
using System.Linq;
using HeuristicLab.Collections;
using HeuristicLab.Core;
using HeuristicLab.Data;
using HeuristicLab.Parameters;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
namespace HeuristicLab.Operators {
///
/// Selects one of its branches (if there are any) given a list of relative probabilities.
///
[Item("StochasticMultiBranch", "Selects one of its branches (if there are any) given a list of relative probabilities.")]
[StorableClass]
public abstract class StochasticMultiBranch : CheckedMultiOperator where T : class, IOperator {
///
/// Should return true if the StochasticMultiOperator should create a new child operation with the selected successor
/// or if it should create a new operation. If you need to shield the parameters of the successor you should return true here.
///
protected abstract bool CreateChildOperation { get; }
public ValueLookupParameter ProbabilitiesParameter {
get { return (ValueLookupParameter)Parameters["Probabilities"]; }
}
public ILookupParameter RandomParameter {
get { return (ILookupParameter)Parameters["Random"]; }
}
public DoubleArray Probabilities {
get { return ProbabilitiesParameter.Value; }
set { ProbabilitiesParameter.Value = value; }
}
[StorableConstructor]
protected StochasticMultiBranch(bool deserializing) : base(deserializing) { }
///
/// Initializes a new instance of with two parameters
/// (Probabilities and Random).
///
public StochasticMultiBranch()
: base() {
Parameters.Add(new ValueLookupParameter("Probabilities", "The array of relative probabilities for each operator.", new DoubleArray()));
Parameters.Add(new LookupParameter("Random", "The random number generator to use."));
}
protected override void Operators_ItemsRemoved(object sender, CollectionItemsChangedEventArgs> e) {
base.Operators_ItemsRemoved(sender, e);
if (Probabilities != null && Probabilities.Length > Operators.Count) {
List probs = new List(Probabilities.Cast());
var sorted = e.Items.OrderByDescending(x => x.Index);
foreach (IndexedItem item in sorted)
if (probs.Count > item.Index) probs.RemoveAt(item.Index);
Probabilities = new DoubleArray(probs.ToArray());
}
}
protected override void Operators_ItemsAdded(object sender, HeuristicLab.Collections.CollectionItemsChangedEventArgs> e) {
base.Operators_ItemsAdded(sender, e);
if (Probabilities != null && Probabilities.Length < Operators.Count) {
double avg = (Probabilities.Where(x => x > 0).Count() > 0) ? (Probabilities.Where(x => x > 0).Average()) : (1);
// add the average of all probabilities in the respective places (the new operators)
var added = e.Items.OrderBy(x => x.Index).ToList();
int insertCount = 0;
DoubleArray probs = new DoubleArray(Operators.Count);
for (int i = 0; i < Operators.Count; i++) {
if (insertCount < added.Count && i == added[insertCount].Index) {
probs[i] = avg;
insertCount++;
} else if (i - insertCount < Probabilities.Length) {
probs[i] = Probabilities[i - insertCount];
} else probs[i] = avg;
}
Probabilities = probs;
}
}
///
/// Applies an operator of the branches to the current scope with a
/// specific probability.
///
/// Thrown when the list of probabilites does not
/// match the number of operators, the list of selected operators is empty,
/// or all selected operators have zero probabitlity.
/// A new operation with the operator that was selected followed by the current operator's successor.
public override IOperation Apply() {
IRandom random = RandomParameter.ActualValue;
DoubleArray probabilities = ProbabilitiesParameter.ActualValue;
if (probabilities.Length != Operators.Count) {
throw new InvalidOperationException(Name + ": The list of probabilities has to match the number of operators");
}
IOperator successor = null;
var checkedOperators = Operators.CheckedItems;
if (checkedOperators.Count() > 0) {
// select a random operator from the checked operators
double sum = (from indexedItem in checkedOperators select probabilities[indexedItem.Index]).Sum();
if (sum == 0) throw new InvalidOperationException(Name + ": All selected operators have zero probability.");
double r = random.NextDouble() * sum;
sum = 0;
foreach (var indexedItem in checkedOperators) {
sum += probabilities[indexedItem.Index];
if (sum > r) {
successor = indexedItem.Value;
break;
}
}
}
OperationCollection next = new OperationCollection(base.Apply());
if (successor != null) {
if (CreateChildOperation)
next.Insert(0, ExecutionContext.CreateChildOperation(successor));
else next.Insert(0, ExecutionContext.CreateOperation(successor));
}
return next;
}
}
///
/// Selects one of its branches (if there are any) given a list of relative probabilities.
///
[Item("StochasticMultiBranch", "Selects one of its branches (if there are any) given a list of relative probabilities.")]
[StorableClass]
public class StochasticMultiBranch : StochasticMultiBranch {
protected override bool CreateChildOperation {
get { return false; }
}
}
}