1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2012 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.Collections.Generic;
|
---|
23 | using System.Linq;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Data;
|
---|
27 | using HeuristicLab.Parameters;
|
---|
28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Optimization.Operators.LCS.DefaultRule {
|
---|
31 | [Item("MinorDefaultRule", "Description missing")]
|
---|
32 | [StorableClass]
|
---|
33 | public class MinorDefaultRule : DefaultRuleOperator, IStochasticOperator {
|
---|
34 |
|
---|
35 | #region Parameter Properties
|
---|
36 | public ILookupParameter<ItemCollection<IntValue>> ClassCountParameter {
|
---|
37 | get { return (ILookupParameter<ItemCollection<IntValue>>)Parameters["ClassCount"]; }
|
---|
38 | }
|
---|
39 | public ILookupParameter<IRandom> RandomParameter {
|
---|
40 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
41 | }
|
---|
42 | #endregion
|
---|
43 |
|
---|
44 | [StorableConstructor]
|
---|
45 | protected MinorDefaultRule(bool deserializing) : base(deserializing) { }
|
---|
46 | protected MinorDefaultRule(MinorDefaultRule original, Cloner cloner)
|
---|
47 | : base(original, cloner) {
|
---|
48 | }
|
---|
49 | public MinorDefaultRule()
|
---|
50 | : base() {
|
---|
51 | Parameters.Add(new LookupParameter<ItemCollection<IntValue>>("ClassCount"));
|
---|
52 | Parameters.Add(new LookupParameter<IRandom>("Random"));
|
---|
53 | }
|
---|
54 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
55 | return new MinorDefaultRule(this, cloner);
|
---|
56 | }
|
---|
57 |
|
---|
58 | public override IOperation Apply() {
|
---|
59 | if (NichingParameter.ActualValue == null) {
|
---|
60 | NichingParameter.ActualValue = new BoolValue(false);
|
---|
61 | NichesParameter.ActualValue = new IntValue(1);
|
---|
62 | var min = ClassCountParameter.ActualValue.MinItems(x => x.Value).First().Value;
|
---|
63 | var indices = new List<int>();
|
---|
64 | int i = 0;
|
---|
65 | foreach (var classCount in ClassCountParameter.ActualValue) {
|
---|
66 | if (classCount.Value == min) {
|
---|
67 | indices.Add(i);
|
---|
68 | }
|
---|
69 | i++;
|
---|
70 | }
|
---|
71 | int index;
|
---|
72 | // if there are more than one minor classes
|
---|
73 | if (indices.Count > 1) {
|
---|
74 | int help = RandomParameter.ActualValue.Next(0, indices.Count);
|
---|
75 | index = indices[help];
|
---|
76 | } else {
|
---|
77 | index = indices[0];
|
---|
78 | }
|
---|
79 | DefaultClassParameter.ActualValue = PossibleDefaultClassesParameter.ActualValue.ElementAt(index);
|
---|
80 | }
|
---|
81 | return base.Apply();
|
---|
82 | }
|
---|
83 | }
|
---|
84 | }
|
---|