1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2018 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 |
|
---|
22 | using System;
|
---|
23 | using System.Linq;
|
---|
24 | using HeuristicLab.Collections;
|
---|
25 | using HeuristicLab.Common;
|
---|
26 | using HeuristicLab.Core;
|
---|
27 | using HeuristicLab.Data;
|
---|
28 | using HeuristicLab.Operators;
|
---|
29 | using HeuristicLab.Optimization;
|
---|
30 | using HeuristicLab.Parameters;
|
---|
31 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
32 | using HeuristicLab.PluginInfrastructure;
|
---|
33 |
|
---|
34 | namespace HeuristicLab.Encodings.IntegerVectorEncoding {
|
---|
35 | [Item("MultiIntegerVectorCrossover", "Randomly selects and applies one of its crossovers every time it is called.")]
|
---|
36 | [StorableClass]
|
---|
37 | public class MultiIntegerVectorCrossover : StochasticMultiBranch<IIntegerVectorCrossover>, IIntegerVectorCrossover, IStochasticOperator, IBoundedIntegerVectorOperator {
|
---|
38 | public override bool CanChangeName {
|
---|
39 | get { return false; }
|
---|
40 | }
|
---|
41 | protected override bool CreateChildOperation {
|
---|
42 | get { return true; }
|
---|
43 | }
|
---|
44 |
|
---|
45 | public IValueLookupParameter<IntMatrix> BoundsParameter {
|
---|
46 | get { return (IValueLookupParameter<IntMatrix>)Parameters["Bounds"]; }
|
---|
47 | }
|
---|
48 |
|
---|
49 | public ILookupParameter<ItemArray<IntegerVector>> ParentsParameter {
|
---|
50 | get { return (ILookupParameter<ItemArray<IntegerVector>>)Parameters["Parents"]; }
|
---|
51 | }
|
---|
52 |
|
---|
53 | public ILookupParameter<IntegerVector> ChildParameter {
|
---|
54 | get { return (ILookupParameter<IntegerVector>)Parameters["Child"]; }
|
---|
55 | }
|
---|
56 |
|
---|
57 | [StorableConstructor]
|
---|
58 | protected MultiIntegerVectorCrossover(bool deserializing) : base(deserializing) { }
|
---|
59 | protected MultiIntegerVectorCrossover(MultiIntegerVectorCrossover original, Cloner cloner) : base(original, cloner) { }
|
---|
60 | public MultiIntegerVectorCrossover()
|
---|
61 | : base() {
|
---|
62 | Parameters.Add(new ValueLookupParameter<IntMatrix>("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."));
|
---|
63 | Parameters.Add(new ScopeTreeLookupParameter<IntegerVector>("Parents", "The parent integer vector which should be crossed."));
|
---|
64 | ParentsParameter.ActualName = "IntegerVector";
|
---|
65 | Parameters.Add(new LookupParameter<IntegerVector>("Child", "The child integer vector resulting from the crossover."));
|
---|
66 | ChildParameter.ActualName = "IntegerVector";
|
---|
67 |
|
---|
68 | foreach (Type type in ApplicationManager.Manager.GetTypes(typeof(IIntegerVectorCrossover))) {
|
---|
69 | if (!typeof(MultiOperator<IIntegerVectorCrossover>).IsAssignableFrom(type))
|
---|
70 | Operators.Add((IIntegerVectorCrossover)Activator.CreateInstance(type), true);
|
---|
71 | }
|
---|
72 |
|
---|
73 | SelectedOperatorParameter.ActualName = "SelectedCrossoverOperator";
|
---|
74 | }
|
---|
75 |
|
---|
76 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
77 | return new MultiIntegerVectorCrossover(this, cloner);
|
---|
78 | }
|
---|
79 |
|
---|
80 | protected override void Operators_ItemsReplaced(object sender, CollectionItemsChangedEventArgs<IndexedItem<IIntegerVectorCrossover>> e) {
|
---|
81 | base.Operators_ItemsReplaced(sender, e);
|
---|
82 | ParameterizeCrossovers();
|
---|
83 | }
|
---|
84 |
|
---|
85 | protected override void Operators_ItemsAdded(object sender, CollectionItemsChangedEventArgs<IndexedItem<IIntegerVectorCrossover>> e) {
|
---|
86 | base.Operators_ItemsAdded(sender, e);
|
---|
87 | ParameterizeCrossovers();
|
---|
88 | }
|
---|
89 |
|
---|
90 | private void ParameterizeCrossovers() {
|
---|
91 | foreach (IIntegerVectorCrossover crossover in Operators.OfType<IIntegerVectorCrossover>()) {
|
---|
92 | crossover.ChildParameter.ActualName = ChildParameter.Name;
|
---|
93 | crossover.ParentsParameter.ActualName = ParentsParameter.Name;
|
---|
94 | }
|
---|
95 | foreach (IStochasticOperator crossover in Operators.OfType<IStochasticOperator>()) {
|
---|
96 | crossover.RandomParameter.ActualName = RandomParameter.Name;
|
---|
97 | }
|
---|
98 | foreach (IBoundedIntegerVectorOperator crossover in Operators.OfType<IBoundedIntegerVectorOperator>()) {
|
---|
99 | crossover.BoundsParameter.ActualName = BoundsParameter.Name;
|
---|
100 | }
|
---|
101 | }
|
---|
102 |
|
---|
103 | public override IOperation InstrumentedApply() {
|
---|
104 | if (Operators.Count == 0) throw new InvalidOperationException(Name + ": Please add at least one integer vector crossover to choose from.");
|
---|
105 | return base.InstrumentedApply();
|
---|
106 | }
|
---|
107 | }
|
---|
108 | }
|
---|