[3221] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17246] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3221] | 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;
|
---|
[4722] | 23 | using HeuristicLab.Common;
|
---|
[3221] | 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Optimization;
|
---|
| 26 | using HeuristicLab.Parameters;
|
---|
[16662] | 27 | using HEAL.Attic;
|
---|
[3221] | 28 |
|
---|
| 29 | namespace HeuristicLab.Encodings.PermutationEncoding {
|
---|
[3232] | 30 | [Item("StochasticTranslocationSingleMoveGenerator", "Randomly samples one from all possible translocation and insertion moves (3-opt) from a given permutation.")]
|
---|
[16662] | 31 | [StorableType("E084E519-132B-4D01-ABDF-1B5B2976219E")]
|
---|
[3706] | 32 | public class StochasticTranslocationSingleMoveGenerator : TranslocationMoveGenerator, IStochasticOperator, ISingleMoveGenerator {
|
---|
[3221] | 33 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 34 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 35 | }
|
---|
| 36 |
|
---|
[4722] | 37 | [StorableConstructor]
|
---|
[16662] | 38 | protected StochasticTranslocationSingleMoveGenerator(StorableConstructorFlag _) : base(_) { }
|
---|
[4722] | 39 | protected StochasticTranslocationSingleMoveGenerator(StochasticTranslocationSingleMoveGenerator original, Cloner cloner) : base(original, cloner) { }
|
---|
[3706] | 40 | public StochasticTranslocationSingleMoveGenerator()
|
---|
[3221] | 41 | : base() {
|
---|
| 42 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
---|
| 43 | }
|
---|
| 44 |
|
---|
[4722] | 45 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 46 | return new StochasticTranslocationSingleMoveGenerator(this, cloner);
|
---|
| 47 | }
|
---|
| 48 |
|
---|
[3232] | 49 | public static TranslocationMove Apply(Permutation permutation, IRandom random) {
|
---|
[3221] | 50 | int length = permutation.Length;
|
---|
[3706] | 51 | if (length == 1) throw new ArgumentException("StochasticThreeOptSingleMoveGenerator: There cannot be an insertion move given a permutation of length 1.", "permutation");
|
---|
| 52 | if (permutation.PermutationType != PermutationTypes.Absolute && length == 2) return new TranslocationMove(0, 0, 1);
|
---|
[3221] | 53 | int index1, index2, index3;
|
---|
| 54 | do {
|
---|
[3340] | 55 | index1 = random.Next(length);
|
---|
| 56 | do {
|
---|
| 57 | index2 = random.Next(index1, length);
|
---|
| 58 | } while (index2 - index1 >= length - 2);
|
---|
| 59 | do {
|
---|
| 60 | index3 = random.Next(length - index2 + index1);
|
---|
| 61 | } while (index3 == index1);
|
---|
| 62 | } while (permutation.PermutationType != PermutationTypes.Absolute && (index1 == 0 && index3 == length - 1 || index1 == length - 1 && index3 == 0));
|
---|
[3232] | 63 | return new TranslocationMove(index1, index2, index3);
|
---|
[3221] | 64 | }
|
---|
| 65 |
|
---|
[3232] | 66 | protected override TranslocationMove[] GenerateMoves(Permutation permutation) {
|
---|
[3221] | 67 | IRandom random = RandomParameter.ActualValue;
|
---|
[3232] | 68 | return new TranslocationMove[] { Apply(permutation, random) };
|
---|
[3221] | 69 | }
|
---|
| 70 | }
|
---|
| 71 | }
|
---|