#region License Information /* HeuristicLab * Copyright (C) 2002-2013 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.Linq; using HeuristicLab.Collections; using HeuristicLab.Common; using HeuristicLab.Core; using HeuristicLab.Data; using HeuristicLab.Operators; using HeuristicLab.Optimization; using HeuristicLab.Parameters; using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; using HeuristicLab.PluginInfrastructure; namespace HeuristicLab.Encodings.IntegerVectorEncoding { [Item("MultiIntegerVectorCrossover", "Randomly selects and applies one of its crossovers every time it is called.")] [StorableClass] public class MultiIntegerVectorCrossover : StochasticMultiBranch, IIntegerVectorCrossover, IStochasticOperator, IBoundedIntegerVectorOperator { public override bool CanChangeName { get { return false; } } protected override bool CreateChildOperation { get { return true; } } public IValueLookupParameter BoundsParameter { get { return (IValueLookupParameter)Parameters["Bounds"]; } } public ILookupParameter> ParentsParameter { get { return (ILookupParameter>)Parameters["Parents"]; } } public ILookupParameter ChildParameter { get { return (ILookupParameter)Parameters["Child"]; } } [StorableConstructor] protected MultiIntegerVectorCrossover(bool deserializing) : base(deserializing) { } protected MultiIntegerVectorCrossover(MultiIntegerVectorCrossover original, Cloner cloner) : base(original, cloner) { } public MultiIntegerVectorCrossover() : base() { Parameters.Add(new ValueLookupParameter("Bounds", "The bounds matrix can contain one row for each dimension with three columns specifying minimum (inclusive), maximum (exclusive), and step size. If less rows are given the matrix is cycled.")); Parameters.Add(new ScopeTreeLookupParameter("Parents", "The parent integer vector which should be crossed.")); ParentsParameter.ActualName = "IntegerVector"; Parameters.Add(new LookupParameter("Child", "The child integer vector resulting from the crossover.")); ChildParameter.ActualName = "IntegerVector"; foreach (Type type in ApplicationManager.Manager.GetTypes(typeof(IIntegerVectorCrossover))) { if (!typeof(MultiOperator).IsAssignableFrom(type)) Operators.Add((IIntegerVectorCrossover)Activator.CreateInstance(type), true); } } public override IDeepCloneable Clone(Cloner cloner) { return new MultiIntegerVectorCrossover(this, cloner); } protected override void Operators_ItemsReplaced(object sender, CollectionItemsChangedEventArgs> e) { base.Operators_ItemsReplaced(sender, e); ParameterizeCrossovers(); } protected override void Operators_ItemsAdded(object sender, CollectionItemsChangedEventArgs> e) { base.Operators_ItemsAdded(sender, e); ParameterizeCrossovers(); } private void ParameterizeCrossovers() { foreach (IIntegerVectorCrossover crossover in Operators.OfType()) { crossover.ChildParameter.ActualName = ChildParameter.Name; crossover.ParentsParameter.ActualName = ParentsParameter.Name; } foreach (IStochasticOperator crossover in Operators.OfType()) { crossover.RandomParameter.ActualName = RandomParameter.Name; } foreach (IBoundedIntegerVectorOperator crossover in Operators.OfType()) { crossover.BoundsParameter.ActualName = BoundsParameter.Name; } } public override IOperation Apply() { if (Operators.Count == 0) throw new InvalidOperationException(Name + ": Please add at least one integer vector crossover to choose from."); return base.Apply(); } } }