[3418] | 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 |
|
---|
[3527] | 22 | using System;
|
---|
[3425] | 23 | using System.Linq;
|
---|
[3418] | 24 | using HeuristicLab.Collections;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Operators;
|
---|
| 27 | using HeuristicLab.Optimization;
|
---|
| 28 | using HeuristicLab.Parameters;
|
---|
| 29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[3674] | 30 | using HeuristicLab.PluginInfrastructure;
|
---|
[3418] | 31 |
|
---|
[3425] | 32 | namespace HeuristicLab.Encodings.PermutationEncoding {
|
---|
[3419] | 33 | [Item("MultiPermutationCrossover", "Randomly selects and applies one of its crossovers every time it is called.")]
|
---|
| 34 | [StorableClass]
|
---|
[3593] | 35 | public class MultiPermutationCrossover : StochasticMultiBranch<IPermutationCrossover>, IPermutationCrossover, IStochasticOperator {
|
---|
[3418] | 36 | public override bool CanChangeName {
|
---|
| 37 | get { return false; }
|
---|
| 38 | }
|
---|
[3425] | 39 | protected override bool CreateChildOperation {
|
---|
| 40 | get { return true; }
|
---|
| 41 | }
|
---|
| 42 |
|
---|
[3418] | 43 | public ILookupParameter<ItemArray<Permutation>> ParentsParameter {
|
---|
| 44 | get { return (ILookupParameter<ItemArray<Permutation>>)Parameters["Parents"]; }
|
---|
| 45 | }
|
---|
| 46 |
|
---|
| 47 | public ILookupParameter<Permutation> ChildParameter {
|
---|
| 48 | get { return (ILookupParameter<Permutation>)Parameters["Child"]; }
|
---|
| 49 | }
|
---|
| 50 |
|
---|
| 51 | [StorableConstructor]
|
---|
[3419] | 52 | private MultiPermutationCrossover(bool deserializing) : base(deserializing) { }
|
---|
| 53 | public MultiPermutationCrossover()
|
---|
[3418] | 54 | : base() {
|
---|
[3659] | 55 | Parameters.Add(new ScopeTreeLookupParameter<Permutation>("Parents", "The parent permutations which should be crossed."));
|
---|
[3418] | 56 | ParentsParameter.ActualName = "Permutation";
|
---|
| 57 | Parameters.Add(new LookupParameter<Permutation>("Child", "The child permutation resulting from the crossover."));
|
---|
| 58 | ChildParameter.ActualName = "Permutation";
|
---|
[3674] | 59 |
|
---|
| 60 | foreach (Type type in ApplicationManager.Manager.GetTypes(typeof(IPermutationCrossover))) {
|
---|
| 61 | if (!typeof(MultiOperator<IPermutationCrossover>).IsAssignableFrom(type))
|
---|
| 62 | Operators.Add((IPermutationCrossover)Activator.CreateInstance(type), true);
|
---|
| 63 | }
|
---|
[3418] | 64 | }
|
---|
| 65 |
|
---|
[3445] | 66 | protected override void Operators_ItemsReplaced(object sender, CollectionItemsChangedEventArgs<IndexedItem<IPermutationCrossover>> e) {
|
---|
| 67 | base.Operators_ItemsReplaced(sender, e);
|
---|
[3425] | 68 | ParameterizeCrossovers();
|
---|
| 69 | }
|
---|
| 70 |
|
---|
[3445] | 71 | protected override void Operators_ItemsAdded(object sender, CollectionItemsChangedEventArgs<IndexedItem<IPermutationCrossover>> e) {
|
---|
| 72 | base.Operators_ItemsAdded(sender, e);
|
---|
[3418] | 73 | ParameterizeCrossovers();
|
---|
| 74 | }
|
---|
| 75 |
|
---|
| 76 | private void ParameterizeCrossovers() {
|
---|
[3425] | 77 | foreach (IPermutationCrossover crossover in Operators.OfType<IPermutationCrossover>()) {
|
---|
[3418] | 78 | crossover.ChildParameter.ActualName = ChildParameter.Name;
|
---|
| 79 | crossover.ParentsParameter.ActualName = ParentsParameter.Name;
|
---|
| 80 | }
|
---|
[3425] | 81 | foreach (IStochasticOperator crossover in Operators.OfType<IStochasticOperator>()) {
|
---|
[3418] | 82 | crossover.RandomParameter.ActualName = RandomParameter.Name;
|
---|
| 83 | }
|
---|
| 84 | }
|
---|
[3527] | 85 |
|
---|
| 86 | public override IOperation Apply() {
|
---|
| 87 | if (Operators.Count == 0) throw new InvalidOperationException(Name + ": Please add at least one permutation crossover to choose from.");
|
---|
| 88 | return base.Apply();
|
---|
| 89 | }
|
---|
[3418] | 90 | }
|
---|
| 91 | }
|
---|