[12285] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[14185] | 3 | * Copyright (C) 2002-2016 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;
|
---|
[14927] | 26 | using HeuristicLab.Persistence;
|
---|
[12285] | 27 |
|
---|
[12643] | 28 | namespace HeuristicLab.Encodings.LinearLinkageEncoding {
|
---|
| 29 | [Item("Random Linear Linkage Creator", "Creates a random linear linkage LLE encoded solution (similar to MaxGroups set to N).")]
|
---|
[14927] | 30 | [StorableType("e0be8f3b-2c1a-407d-b19c-988fd9634ed7")]
|
---|
[12285] | 31 | public sealed class RandomLinearLinkageCreator : LinearLinkageCreator {
|
---|
| 32 |
|
---|
| 33 | [StorableConstructor]
|
---|
[15018] | 34 | private RandomLinearLinkageCreator(StorableConstructorFlag deserializing) : base(deserializing) { }
|
---|
[12285] | 35 | private RandomLinearLinkageCreator(RandomLinearLinkageCreator original, Cloner cloner) : base(original, cloner) { }
|
---|
| 36 | public RandomLinearLinkageCreator() { }
|
---|
| 37 |
|
---|
| 38 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 39 | return new RandomLinearLinkageCreator(this, cloner);
|
---|
| 40 | }
|
---|
| 41 |
|
---|
[12643] | 42 | public static LinearLinkage Apply(IRandom random, int length) {
|
---|
[12285] | 43 | var groups = Enumerable.Range(0, length).Select(x => Tuple.Create(x, random.Next(length)))
|
---|
| 44 | .GroupBy(x => x.Item2)
|
---|
| 45 | .Select(x => x.Select(y => y.Item1).ToList());
|
---|
[14475] | 46 | return LinearLinkage.FromGroups(length, groups);
|
---|
[12285] | 47 | }
|
---|
[12643] | 48 |
|
---|
| 49 | protected override LinearLinkage Create(IRandom random, int length) {
|
---|
| 50 | return Apply(random, length);
|
---|
| 51 | }
|
---|
[12285] | 52 | }
|
---|
| 53 | }
|
---|