1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2016 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 | using HeuristicLab.Random;
|
---|
30 |
|
---|
31 | namespace HeuristicLab.Encodings.LinearLinkageEncoding {
|
---|
32 | [Item("Exactgroups Linear Linkage Creator", "Creates a random linear linkage LLE encoded solution with a given number of equal-sized groups.")]
|
---|
33 | [StorableClass]
|
---|
34 | public sealed class ExactGroupsLinearLinkageCreator : LinearLinkageCreator {
|
---|
35 |
|
---|
36 | public IValueLookupParameter<IntValue> ExactGroupsParameter {
|
---|
37 | get { return (IValueLookupParameter<IntValue>)Parameters["ExactGroups"]; }
|
---|
38 | }
|
---|
39 |
|
---|
40 | public IntValue ExactGroups {
|
---|
41 | get { return ExactGroupsParameter.Value; }
|
---|
42 | set { ExactGroupsParameter.Value = value; }
|
---|
43 | }
|
---|
44 |
|
---|
45 | [StorableConstructor]
|
---|
46 | private ExactGroupsLinearLinkageCreator(bool deserializing) : base(deserializing) { }
|
---|
47 | private ExactGroupsLinearLinkageCreator(ExactGroupsLinearLinkageCreator original, Cloner cloner) : base(original, cloner) { }
|
---|
48 |
|
---|
49 | public ExactGroupsLinearLinkageCreator() {
|
---|
50 | Parameters.Add(new ValueLookupParameter<IntValue>("ExactGroups", "The exact number of equal-sized groups to create.", new IntValue(3)));
|
---|
51 | }
|
---|
52 |
|
---|
53 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
54 | return new ExactGroupsLinearLinkageCreator(this, cloner);
|
---|
55 | }
|
---|
56 |
|
---|
57 | public static LinearLinkage Apply(IRandom random, int length, int groups) {
|
---|
58 | var solution = new LinearLinkage(length);
|
---|
59 | var groupNumbers = Enumerable.Range(0, length).Select(x => x % groups).Shuffle(random);
|
---|
60 | var grouping = Enumerable.Range(0, groups).Select(x => new List<int>()).ToList();
|
---|
61 | var idx = 0;
|
---|
62 | foreach (var g in groupNumbers)
|
---|
63 | grouping[g].Add(idx++);
|
---|
64 |
|
---|
65 | solution.SetGroups(grouping);
|
---|
66 | return solution;
|
---|
67 | }
|
---|
68 |
|
---|
69 | protected override LinearLinkage Create(IRandom random, int length) {
|
---|
70 | var groups = ExactGroupsParameter.ActualValue.Value;
|
---|
71 | return Apply(random, length, groups);
|
---|
72 | }
|
---|
73 | }
|
---|
74 | }
|
---|