#region License Information /* HeuristicLab * Copyright (C) 2002-2016 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 HeuristicLab.Common; using HeuristicLab.Core; using HeuristicLab.Data; using HeuristicLab.Operators; using HeuristicLab.Parameters; using HeuristicLab.Persistence; namespace HeuristicLab.Selection { [Item("OffspringSelector", "Selects among the offspring population those that are designated successful and discards the unsuccessful offspring, except for some lucky losers. It expects the parent scopes to be below the first sub-scope, and offspring scopes to be below the second sub-scope separated again in two sub-scopes, the first with the failed offspring and the second with successful offspring.")] [StorableType("b1b58865-4ae9-4494-afb9-f8de41c74bc6")] public class OffspringSelector : SingleSuccessorOperator { public ValueLookupParameter MaximumSelectionPressureParameter { get { return (ValueLookupParameter)Parameters["MaximumSelectionPressure"]; } } public ValueLookupParameter SuccessRatioParameter { get { return (ValueLookupParameter)Parameters["SuccessRatio"]; } } public LookupParameter SelectionPressureParameter { get { return (ValueLookupParameter)Parameters["SelectionPressure"]; } } public LookupParameter CurrentSuccessRatioParameter { get { return (LookupParameter)Parameters["CurrentSuccessRatio"]; } } public LookupParameter> OffspringPopulationParameter { get { return (LookupParameter>)Parameters["OffspringPopulation"]; } } public LookupParameter OffspringPopulationWinnersParameter { get { return (LookupParameter)Parameters["OffspringPopulationWinners"]; } } public ScopeTreeLookupParameter SuccessfulOffspringParameter { get { return (ScopeTreeLookupParameter)Parameters["SuccessfulOffspring"]; } } public OperatorParameter OffspringCreatorParameter { get { return (OperatorParameter)Parameters["OffspringCreator"]; } } public IValueLookupParameter FillPopulationWithParentsParameter { get { return (IValueLookupParameter)Parameters["FillPopulationWithParents"]; } } public IOperator OffspringCreator { get { return OffspringCreatorParameter.Value; } set { OffspringCreatorParameter.Value = value; } } [StorableConstructor] protected OffspringSelector(StorableConstructorFlag deserializing) : base(deserializing) { } [StorableHook(HookType.AfterDeserialization)] private void AfterDeserialization() { // BackwardsCompatibility3.3 #region Backwards compatible code, remove with 3.4 if (Parameters.ContainsKey("FillPopulationWithParents") && Parameters["FillPopulationWithParents"] is FixedValueParameter) Parameters.Remove("FillPopulationWithParents"); if (!Parameters.ContainsKey("FillPopulationWithParents")) Parameters.Add(new ValueLookupParameter("FillPopulationWithParents", "True if the population should be filled with parent individuals instead of lucky losers.")); #endregion } protected OffspringSelector(OffspringSelector original, Cloner cloner) : base(original, cloner) { } public override IDeepCloneable Clone(Cloner cloner) { return new OffspringSelector(this, cloner); } public OffspringSelector() : base() { Parameters.Add(new ValueLookupParameter("MaximumSelectionPressure", "The maximum selection pressure which prematurely terminates the offspring selection step.")); Parameters.Add(new ValueLookupParameter("SuccessRatio", "The ratio of successful offspring that has to be produced.")); Parameters.Add(new ValueLookupParameter("SelectionPressure", "The amount of selection pressure currently necessary to fulfill the success ratio.")); Parameters.Add(new ValueLookupParameter("CurrentSuccessRatio", "The current success ratio indicates how much of the successful offspring have already been generated.")); Parameters.Add(new LookupParameter>("OffspringPopulation", "Temporary store of the offspring population.")); Parameters.Add(new LookupParameter("OffspringPopulationWinners", "Temporary store the number of successful offspring in the offspring population.")); Parameters.Add(new ScopeTreeLookupParameter("SuccessfulOffspring", "True if the offspring was more successful than its parents.", 2)); Parameters.Add(new OperatorParameter("OffspringCreator", "The operator used to create new offspring.")); Parameters.Add(new ValueLookupParameter("FillPopulationWithParents", "True if the population should be filled with parent individual or false if worse children should be used when the maximum selection pressure is exceeded.")); } public override IOperation Apply() { double maxSelPress = MaximumSelectionPressureParameter.ActualValue.Value; double successRatio = SuccessRatioParameter.ActualValue.Value; bool fillPopulationWithParents = false; if (FillPopulationWithParentsParameter.ActualValue != null) fillPopulationWithParents = FillPopulationWithParentsParameter.ActualValue.Value; IScope scope = ExecutionContext.Scope; IScope parents = scope.SubScopes[0]; IScope offspring = scope.SubScopes[1]; int populationSize = parents.SubScopes.Count; // retrieve actual selection pressure and success ratio DoubleValue selectionPressure = SelectionPressureParameter.ActualValue; if (selectionPressure == null) { selectionPressure = new DoubleValue(0); SelectionPressureParameter.ActualValue = selectionPressure; } DoubleValue currentSuccessRatio = CurrentSuccessRatioParameter.ActualValue; if (currentSuccessRatio == null) { currentSuccessRatio = new DoubleValue(0); CurrentSuccessRatioParameter.ActualValue = currentSuccessRatio; } // retrieve next population ItemList population = OffspringPopulationParameter.ActualValue; IntValue successfulOffspring; if (population == null) { population = new ItemList(); OffspringPopulationParameter.ActualValue = population; selectionPressure.Value = 0; // initialize selection pressure for this round currentSuccessRatio.Value = 0; // initialize current success ratio for this round successfulOffspring = new IntValue(0); OffspringPopulationWinnersParameter.ActualValue = successfulOffspring; } else successfulOffspring = OffspringPopulationWinnersParameter.ActualValue; int worseOffspringNeeded = (int)((1 - successRatio) * populationSize) - (population.Count - successfulOffspring.Value); int successfulOffspringAdded = 0; // implement the ActualValue fetch here - otherwise the parent scope would also be included, given that there may be 1000 or more parents, this is quite unnecessary string tname = SuccessfulOffspringParameter.TranslatedName; double tmpSelPress = selectionPressure.Value, tmpSelPressInc = 1.0 / populationSize; for (int i = 0; i < offspring.SubScopes.Count; i++) { // fetch value IVariable tmpVar; if (!offspring.SubScopes[i].Variables.TryGetValue(tname, out tmpVar)) throw new InvalidOperationException(Name + ": Could not determine if an offspring was successful or not."); BoolValue tmp = (tmpVar.Value as BoolValue); if (tmp == null) throw new InvalidOperationException(Name + ": The variable that indicates whether an offspring is successful or not must contain a BoolValue."); // add to population if (tmp.Value) { IScope currentOffspring = offspring.SubScopes[i]; offspring.SubScopes.Remove(currentOffspring); i--; population.Add(currentOffspring); successfulOffspringAdded++; } else if (worseOffspringNeeded > 0 || tmpSelPress >= maxSelPress) { IScope currentOffspring; if (!fillPopulationWithParents || worseOffspringNeeded > 0) { currentOffspring = offspring.SubScopes[i]; offspring.SubScopes.Remove(currentOffspring); i--; worseOffspringNeeded--; } else { currentOffspring = parents.SubScopes[i]; } population.Add(currentOffspring); } tmpSelPress += tmpSelPressInc; if (population.Count == populationSize) break; } successfulOffspring.Value += successfulOffspringAdded; // calculate actual selection pressure and success ratio selectionPressure.Value = tmpSelPress; currentSuccessRatio.Value = successfulOffspring.Value / ((double)populationSize); // check if enough children have been generated if (((selectionPressure.Value < maxSelPress) && (currentSuccessRatio.Value < successRatio)) || (population.Count < populationSize)) { // more children required -> reduce left and start children generation again scope.SubScopes.Remove(parents); scope.SubScopes.Remove(offspring); while (parents.SubScopes.Count > 0) { IScope parent = parents.SubScopes[0]; parents.SubScopes.RemoveAt(0); scope.SubScopes.Add(parent); } IOperator moreOffspring = OffspringCreatorParameter.ActualValue as IOperator; if (moreOffspring == null) throw new InvalidOperationException(Name + ": More offspring are required, but no operator specified for creating them."); return ExecutionContext.CreateOperation(moreOffspring); } else { // enough children generated offspring.SubScopes.Clear(); offspring.SubScopes.AddRange(population); scope.Variables.Remove(OffspringPopulationParameter.TranslatedName); scope.Variables.Remove(OffspringPopulationWinnersParameter.TranslatedName); return base.Apply(); } } } }