[3209] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[15583] | 3 | * Copyright (C) 2002-2018 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3209] | 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 |
|
---|
[4722] | 22 | using HeuristicLab.Common;
|
---|
[3209] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Optimization;
|
---|
| 26 | using HeuristicLab.Parameters;
|
---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Encodings.PermutationEncoding {
|
---|
[3232] | 30 | [Item("StochasticTranslocationMultiMoveGenerator", "Randomly samples n from all possible translocation and insertion moves (3-opt) from a given permutation.")]
|
---|
[3209] | 31 | [StorableClass]
|
---|
[3232] | 32 | public class StochasticTranslocationMultiMoveGenerator : TranslocationMoveGenerator, IStochasticOperator, IMultiMoveGenerator {
|
---|
[3209] | 33 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 34 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 35 | }
|
---|
| 36 | public IValueLookupParameter<IntValue> SampleSizeParameter {
|
---|
| 37 | get { return (IValueLookupParameter<IntValue>)Parameters["SampleSize"]; }
|
---|
| 38 | }
|
---|
| 39 |
|
---|
| 40 | public IntValue SampleSize {
|
---|
| 41 | get { return SampleSizeParameter.Value; }
|
---|
| 42 | set { SampleSizeParameter.Value = value; }
|
---|
| 43 | }
|
---|
| 44 |
|
---|
[4722] | 45 | [StorableConstructor]
|
---|
| 46 | protected StochasticTranslocationMultiMoveGenerator(bool deserializing) : base(deserializing) { }
|
---|
| 47 | protected StochasticTranslocationMultiMoveGenerator(StochasticTranslocationMultiMoveGenerator original, Cloner cloner) : base(original, cloner) { }
|
---|
| 48 | public StochasticTranslocationMultiMoveGenerator() : base() {
|
---|
[3209] | 49 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
---|
| 50 | Parameters.Add(new ValueLookupParameter<IntValue>("SampleSize", "The number of moves to generate."));
|
---|
| 51 | }
|
---|
| 52 |
|
---|
[4722] | 53 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 54 | return new StochasticTranslocationMultiMoveGenerator(this, cloner);
|
---|
| 55 | }
|
---|
| 56 |
|
---|
[3232] | 57 | public static TranslocationMove[] Apply(Permutation permutation, IRandom random, int sampleSize) {
|
---|
[3209] | 58 | int length = permutation.Length;
|
---|
[3232] | 59 | TranslocationMove[] moves = new TranslocationMove[sampleSize];
|
---|
[3209] | 60 | for (int i = 0; i < sampleSize; i++) {
|
---|
[3706] | 61 | moves[i] = StochasticTranslocationSingleMoveGenerator.Apply(permutation, random);
|
---|
[3209] | 62 | }
|
---|
| 63 | return moves;
|
---|
| 64 | }
|
---|
| 65 |
|
---|
[3232] | 66 | protected override TranslocationMove[] GenerateMoves(Permutation permutation) {
|
---|
[3209] | 67 | IRandom random = RandomParameter.ActualValue;
|
---|
| 68 | return Apply(permutation, random, SampleSizeParameter.ActualValue.Value);
|
---|
| 69 | }
|
---|
| 70 | }
|
---|
| 71 | }
|
---|