[12285] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[15584] | 3 | * Copyright (C) 2002-2018 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[12285] | 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.Common;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
[12643] | 26 | using HeuristicLab.Data;
|
---|
| 27 | using HeuristicLab.Parameters;
|
---|
[12285] | 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 29 |
|
---|
[12643] | 30 | namespace HeuristicLab.Encodings.LinearLinkageEncoding {
|
---|
| 31 | [Item("Maxgroups Linear Linkage Creator", "Creates a random linear linkage LLE encoded solution with a given maximum number of groups.")]
|
---|
[12285] | 32 | [StorableClass]
|
---|
[12643] | 33 | public sealed class MaxGroupsLinearLinkageCreator : LinearLinkageCreator {
|
---|
[12285] | 34 |
|
---|
[12643] | 35 | public IValueLookupParameter<IntValue> MaxGroupsParameter {
|
---|
| 36 | get { return (IValueLookupParameter<IntValue>)Parameters["MaxGroups"]; }
|
---|
| 37 | }
|
---|
| 38 |
|
---|
| 39 | public IntValue MaxGroups {
|
---|
| 40 | get { return MaxGroupsParameter.Value; }
|
---|
| 41 | set { MaxGroupsParameter.Value = value; }
|
---|
| 42 | }
|
---|
| 43 |
|
---|
[12285] | 44 | [StorableConstructor]
|
---|
[12643] | 45 | private MaxGroupsLinearLinkageCreator(bool deserializing) : base(deserializing) { }
|
---|
| 46 | private MaxGroupsLinearLinkageCreator(MaxGroupsLinearLinkageCreator original, Cloner cloner) : base(original, cloner) { }
|
---|
[12285] | 47 |
|
---|
[12643] | 48 | public MaxGroupsLinearLinkageCreator() {
|
---|
| 49 | Parameters.Add(new ValueLookupParameter<IntValue>("MaxGroups", "The maximum number of groups to create.", new IntValue(3)));
|
---|
| 50 | }
|
---|
| 51 |
|
---|
[12285] | 52 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[12643] | 53 | return new MaxGroupsLinearLinkageCreator(this, cloner);
|
---|
[12285] | 54 | }
|
---|
| 55 |
|
---|
[12643] | 56 | public static LinearLinkage Apply(IRandom random, int length, int maxGroups) {
|
---|
| 57 | var groups = Enumerable.Range(0, length).Select(x => Tuple.Create(x, random.Next(maxGroups)))
|
---|
[12285] | 58 | .GroupBy(x => x.Item2)
|
---|
| 59 | .Select(x => x.Select(y => y.Item1).ToList());
|
---|
[14475] | 60 | return LinearLinkage.FromGroups(length, groups);
|
---|
[12285] | 61 | }
|
---|
[12643] | 62 |
|
---|
| 63 | protected override LinearLinkage Create(IRandom random, int length) {
|
---|
| 64 | var maxGroups = MaxGroupsParameter.ActualValue.Value;
|
---|
| 65 | return Apply(random, length, maxGroups);
|
---|
| 66 | }
|
---|
[12285] | 67 | }
|
---|
| 68 | }
|
---|