#region License Information
/* HeuristicLab
* Copyright (C) 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.Operators;
using HeuristicLab.Optimization;
using HeuristicLab.Parameters;
using HEAL.Attic;
using HeuristicLab.PluginInfrastructure;
namespace HeuristicLab.Encodings.PermutationEncoding {
[Item("MultiPermutationCrossover", "Randomly selects and applies one of its crossovers every time it is called.")]
[StorableType("C4F47F2E-FAF5-4AC6-B8AB-42F8A11D8703")]
public class MultiPermutationCrossover : StochasticMultiBranch, IPermutationCrossover, IStochasticOperator {
public override bool CanChangeName {
get { return false; }
}
protected override bool CreateChildOperation {
get { return true; }
}
public ILookupParameter> ParentsParameter {
get { return (ILookupParameter>)Parameters["Parents"]; }
}
public ILookupParameter ChildParameter {
get { return (ILookupParameter)Parameters["Child"]; }
}
[StorableConstructor]
protected MultiPermutationCrossover(StorableConstructorFlag _) : base(_) { }
protected MultiPermutationCrossover(MultiPermutationCrossover original, Cloner cloner) : base(original, cloner) { }
public MultiPermutationCrossover()
: base() {
Parameters.Add(new ScopeTreeLookupParameter("Parents", "The parent permutations which should be crossed."));
ParentsParameter.ActualName = "Permutation";
Parameters.Add(new LookupParameter("Child", "The child permutation resulting from the crossover."));
ChildParameter.ActualName = "Permutation";
foreach (Type type in ApplicationManager.Manager.GetTypes(typeof(IPermutationCrossover))) {
if (!typeof(MultiOperator).IsAssignableFrom(type))
Operators.Add((IPermutationCrossover)Activator.CreateInstance(type), true);
}
SelectedOperatorParameter.ActualName = "SelectedCrossoverOperator";
}
public override IDeepCloneable Clone(Cloner cloner) {
return new MultiPermutationCrossover(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 (IPermutationCrossover 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;
}
}
public override IOperation InstrumentedApply() {
if (Operators.Count == 0) throw new InvalidOperationException(Name + ": Please add at least one permutation crossover to choose from.");
return base.InstrumentedApply();
}
}
}